Skip Navigation


The Computer Journal Advance Access originally published online on September 16, 2005
The Computer Journal 2006 49(1):62-81; doi:10.1093/comjnl/bxh136
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
49/1/62    most recent
bxh136v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Lorentzos, N. A.
Right arrow Articles by Viqueira, J. R. R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2005. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Relational Formalism for the Management of Spatial Data

Nikos A. Lorentzos and Jose R. R. Viqueira 1

Laboratory of Informatics, Department of Science, Agricultural University of Athens, Athens, Greece

Email: lorentzos{at}aua.gr, joserios{at}usc.es

Operations on spatial objects have great individuality. As a consequence, the spatial data modelling approaches, which have been proposed, have to consider either data types of the form set of spatial objects or non-1NF data structures or a limited spatial functionality of the operations. The model formalized in this paper overcomes these limitations. In particular, spatial quanta are defined and, based on them, spatial data types are formalized including point, line and surface. All the types consist of connected spatial objects that can be involved in all the spatial operations, which are defined. A relational formalism is developed for the management of spatial data. It considers non-nested relational data structures. The relational algebra consists of a kernel set of operations, the ordinary relational operations and two more. All others are defined in terms of those in the kernel. It is shown that the management of spatial data actually reduces to the management of relational data. The model achieves, and generalizes further, commonly accepted spatial operations. Although the formalism restricts to the management of 2D spatial data, its extension to n-D is straightforward. In conjunction with previous research, the algebraic operations are closed and enable the uniform management of any type of data, i.e. spatial, spatio-temporal, interval and conventional.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.