ACM Home Page
Please provide us with feedback. Feedback
Towards a theory of spatial database queries (extended abstract)
Full text PdfPdf (931 KB)
Source Symposium on Principles of Database Systems archive
Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems table of contents
Minneapolis, Minnesota, United States
Pages: 279 - 288  
Year of Publication: 1994
ISBN:0-89791-642-5
Authors
Jan Paredaens  University of Antwerp and Dept. Math. & Computer Sci., University of Antwerp (UIA), Universiteitsplein 1, B-2610 Antwerp, Belgium
Jan Van den Bussche  University of Antwerp
Dirk Van Gucht  Computer Sci. Dept., Indiana University, Bloomington, IN
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 38,   Citation Count: 44
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/182591.182640
What is a DOI?

ABSTRACT

A general model for spatial databases is considered, which extends the relational model by allowing as tuple components not only atomic values but also geometrical figures. The model, which is inspired by the work of Kanellakis, Kuper and Revesz on constraint query languages, includes a calculus and an algebra which are equivalent. Given this framework, the concept of spatial database query is investigated. Thereto, Chandra and Harel's well-known consistency criterion for classical relational queries is adapted. Various adaptations are proposed, depending on the kinds of geometry in which the spatial information in the database is to be interpreted. The consistency problem for calculus queries is studied. Expressiveness issues are examined. The main purpose of the paper is to open up new grounds for theoretical research in the area of spatial database systems. Consequently, many open problems are indicated.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
AO93
 
Arn88
 
ASU79
A.V. Aho, Y. Sagiv, and J.D. Ullman. Equivalences among relational expressions. SIAM Journal on Computing, 8(2):218-246, 1979.
AU79
 
BCR87
J. Bochnak, M. Coste, and M.-F. Roy. Ggomgtrie alggbrique rgelle. Springer- Verlag, 1987.
 
Buc89
 
CH80
A. Chandra and D. Harel. Computable queries for relational database systems. Journal of Computer and System Sciences, 21(2):156-178, 1980.
 
Col75
 
EF91
M.J. Egenhofer and R.D. Franzosa. Point-set topological spatial relations. Int. J. Geographical Information Systems, 5(2):161-174, 1991.
 
Eng93
E. Engeler. Foundations of Mathematics. Springer-Verl#g, 1993.
GS
 
GS91
 
HRR91
J. Heintz, T. Recio, and M.-F. Roy. Algorithms in re#l algebraic geometry and applications to computational geometry. In W. Steiger J. Goodman, R. Pollack, editor, Discrete and computational geometry, volume 6 of DIMA CS Series in Discrete Mathematics and Theoretical Computer Science. AMS-ACM, 1991.
HY84
 
KKR90
 
Ren92
 
Sch79
W. Schwabh~user. Addendum. Fund. Math., 103:101, 1979.
 
T+93
 
Tar51
A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, 1951.
 
Tar86
A. Tarski. Wh# #re logicM no#ions? History and Philosophy of Logic, 7:143- 154, 1986. Edited by J. Corcoran.

CITED BY  44

Collaborative Colleagues:
Jan Paredaens: colleagues
Jan Van den Bussche: colleagues
Dirk Van Gucht: colleagues