Tractable recursion over geometric data

Extended Abstract
  • Stéphane Grumbachs
  • Gabriel Kuper
Session 7a
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1330)


We study the issue of adding a recursion operator to constraint query languages for linear spatial databases. We introduce a language with a bounded inflationary fixpoint operator which is closed and captures the set of polynomial time computable queries over linear constraint databases. This is the first logical characterization of the class of PTIME queries in this context. To prove the result, we develop original techniques to perform arithmetical and geometric operations with constraints.


Geographic Information System Distinguished Point Active Domain Linear Constraint Turing Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AHV94]
    S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1994.Google Scholar
  2. [DGVG97]
    F. Dumortier, M. Gyssens, L. Vandeurzen, and D. Van Gucht. On the decidability of semi-linearity for semi-algebraic sets and its implications for spatial databases. In Proc. ACM Symp. on Principles of Database Systems, 1997.Google Scholar
  3. [GS97]
    S. Grumbach and J. Su. Queries with arithmetical constraints. Theoretical Computer Science, 173(1):151–181, 1997.Google Scholar
  4. [GST94]
    S. Grumbach, J. Su, and C. Tollu. Linear constraint query languages: Expressive power and complexity. In D. Leivant, editor, Logic and Computational Complexity, Indianapolis, 1994. Springer Verlag. LNCS 960.Google Scholar
  5. [Gue94]
    R. Gueting. An Introduction to Spatial Database Systems. The VLDB Journal, 3(4), 1994.Google Scholar
  6. [Gur88]
    Y. Gurevich. Current Trends in Theoretical Computer Science, E. Borger Ed., chapter Logic and the Challenge of Computer Science, pages 1–57. Computer Science Press, 1988.Google Scholar
  7. [Imm86]
    N. Immerman. Relational queries computable in polynomial time. Inf. and Control, 68:86–104, 1986.Google Scholar
  8. [KKR90]
    P. Kanellakis, G Kuper, and P. Revesz. Constraint query languages. In Proc. 9th ACM Symp. on Principles of Database Systems, pages 299–313, Nashville, 1990.Google Scholar
  9. [PVV95]
    J. Paredaens, J. Van den Bussche, and D. Van Gucht. First-order queries on finite structures over the reals. In Proceedings 10th IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1995.Google Scholar
  10. [Var82]
    M. Vardi. The complexity of relational query languages. In Proc. 14th ACM Symp. on Theory of Computing, pages 137–146, 1982.Google Scholar
  11. [VGV95]
    L. Vandeurzen, M. Gyssens, and D. Van Gucht. On the desirability and limitations of linear spatial database models. In Advances in Spatial Databases, 4th Int. Symp., SSD'95, pages 14–28. Springer, 1995.Google Scholar
  12. [Whi57]
    H. Whitney. Elementary structure of real algebraic varieties. Annals of Mathematics, 66:545–556, 1957.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Stéphane Grumbachs
    • 1
  • Gabriel Kuper
    • 2
  1. 1.I.N.R.I.A.Le ChesnayFrance
  2. 2.U. Libre de Bruxelles InformatiqueBrusselsBelgium

Personalised recommendations