dblp.uni-trier.de www.dagstuhl.de www.uni-trier.de

Towards a Theory of Spatial Database Queries.

Jan Paredaens, Jan Van den Bussche, Dirk Van Gucht: Towards a Theory of Spatial Database Queries. PODS 1994: 279-288
@inproceedings{DBLP:conf/pods/ParedaensBG94,
  author    = {Jan Paredaens and
               Jan Van den Bussche and
               Dirk Van Gucht},
  editor    = {Victor Vianu},
  title     = {Towards a Theory of Spatial Database Queries},
  booktitle = {Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium
               on Principles of Database Systems, May 24-26, 1994, Minneapolis,
               Minnesota, USA},
  publisher = {ACM Press},
  year      = {1994},
  isbn      = {0-89791-642-5},
  pages     = {279-288},
  ee        = {http://doi.acm.org/10.1145/182591.182640, db/conf/pods/pods94-279.html},
  crossref  = {DBLP:conf/pods/94},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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.

Copyright © 1994 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.


Load The ACM SIGMOD Anthology, CDROM Edition, Volume 1-3, PODS '82-'98. and ... Load The ACM SIGMOD Anthology, Silver Edition, DVD 1, Proceedings. and ...

Printed Edition

Victor Vianu (Ed.): Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 24-26, 1994, Minneapolis, Minnesota, USA. ACM Press 1994, ISBN 0-89791-642-5
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

Online Edition: ACM Digital Library

[Abstract and Index Terms]
[Full Text in PDF Format, 909 KB]

References

[AO93]
...
[Arn88]
Dennis S. Arnon: Geometric Reasoning with Logic and Algebra. Artif. Intell. 37(1-3): 37-60(1988) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[ASU79]
Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman: Equivalences Among Relational Expressions. SIAM J. Comput. 8(2): 218-246(1979) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[AU79]
Alfred V. Aho, Jeffrey D. Ullman: The Universality of Data Retrieval Languages. POPL 1979: 110-120 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[BCR87]
...
[Buc89]
...
[CH80]
Ashok K. Chandra, David Harel: Computable Queries for Relational Data Bases. J. Comput. Syst. Sci. 21(2): 156-178(1980) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Col75]
...
[EF91]
...
[Eng93]
...
[GS]
Stéphane Grumbach, Jianwen Su: Finitely Representable Databases. PODS 1994: 289-300 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[GS91]
...
[HRR91]
...
[HY84]
Richard Hull, Chee-Keng Yap: The Format Model: A Theory of database Organization. J. ACM 31(3): 518-544(1984) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[KKR90]
Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz: Constraint Query Languages. J. Comput. Syst. Sci. 51(1): 26-52(1995) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Ren92]
James Renegar: On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I: Introduction. Preliminaries. The Geometry of Semi-Algebraic Sets. The Decision Problem for the Existential Theory of the Reals. J. Symb. Comput. 13(3): 255-300(1992) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Ren92a]
James Renegar: On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part II: The General Decision Problem. Preliminaries for Quantifier Elimination. J. Symb. Comput. 13(3): 301-328(1992) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Ren92b]
James Renegar: On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part III: Quantifier Elimination. J. Symb. Comput. 13(3): 329-352(1992) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Sch79]
...
[T+93]
Abdullah Uz Tansel, James Clifford, Shashi K. Gadia, Sushil Jajodia, Arie Segev, Richard T. Snodgrass (Eds.): Temporal Databases: Theory, Design, and Implementation. Benjamin/Cummings 1993, ISBN 0-8053-2413-5
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Tar51]
...
[Tar86]
...

Last update Fri Sep 14 17:28:33 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page