Linear-Constraint Databases

  • Marc Gyssens
  • Luc Vandeurzen
  • Dirk Van Gucht
Chapter

Abstract

As discussed in the previous chapter, linear constraints are an appropriate model for many sorts of real geographic data. They play an important role from an implementational point of view, mainly because of the existence of numerous efficient algorithms for geometrical operations. We therefore study the special case of the linear constraint model.

Keywords

Stratification Hull Nite Decid 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographic Notes

  1. [Gün88]
    O. Günther. Efficient Structures for Geometric Data Management, volume 337 of Lecture Notes in Computer Science. Springer-Verlag, 1988.Google Scholar
  2. [PS86]
    L. K. Putnam and P. A. Subrahmanyam. Boolean operations on n-dimensional objects. IEEE Computer Graphics and Applications, 6 (6): 43–51, 1986.CrossRefGoogle Scholar
  3. [KKR95]
    P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz. Constraint query languages. Journal of Computer and System Sciences, 51 (1): 26–52, 1995.MathSciNetCrossRefGoogle Scholar
  4. [ACGK94]
    F. N. Afrati, S. S. Cosmadakis, S. Grumbach, and G. M. Kuper. Linear vs polynomial constraints in database query languages. In Proceedings of the 2nd International Workshop on Principles and Practice of Constraint Programming (PPCP’94), volume 874 of Lecture Notes in Computer Science, pages 181–192. Springer-Verlag, 1994.Google Scholar
  5. [GK96]
    D. Goldin and P. C. Kanellakis. Constraint query algebras. Constraints, 1 (1/2): 45–83, 1996.MathSciNetCrossRefGoogle Scholar
  6. [GS95b]
    S. Grumbach and J. Su. First-order definability over constraint databases. In Proceedings of the 1st International Conference on Principles and Practice of Constraint Programming (CP’95), volume 976 of Lecture Notes in Computer Science, pages 121–136. Springer-Verlag, 1995.Google Scholar
  7. [GS97b]
    S. Grumbach and J. Su. Queries with arithmetical constraints. The oretical Computer Science (TCS), 173 (1): 151–181, 1997.MathSciNetMATHCrossRefGoogle Scholar
  8. [GST95]
    S. Grumbach, J. Su, and C. Tollu. Linear constraint query languages: Expressive power and complexity. In D. Leivant, editor, International Workshop on Logic and Computational Complexity (LCC’94), volume 960 of Lecture Notes in Computer Science, pages 426–446.Google Scholar
  9. [GL95]
    S. Grumbach and Z. Lacroix. Computing queries on linear constraint databases. In Proceedings of the 5th International Workshop on Database Programming Languages (DBPL’95), Electronic Workshops in Computing, page 11. Springer-Verlag, 1995.Google Scholar
  10. [VGV95]
    L. Vandeurzen, M. Gyssens, and D. Van Gucht. On the desirability and limitations of linear spatial query languages. In 4th Symposium on Large Spatial Databases (SSD’95), volume 951 of Lecture Notes in Computer Science, pages 14–28. Springer-Verlag, 1995.Google Scholar
  11. [VGV96]
    L. Vandeurzen, M. Gyssens, and D. Van Gucht. On query languages for linear queries definable with polynomial constraints. In Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming (CP’96), volume 1118 of Lecture Notes in Computer Science, pages 468–481. Springer-Verlag, 1996.Google Scholar
  12. [BCR98]
    J. Bochnak, M. Coste, and M.-F. Roy. Real Algebraic Geometry, volume 36 of Ergebnisse der Mathematik und ihrer Grenzgebiete 3. Folge. Springer-Verlag, 1998.Google Scholar
  13. [DGVV97]
    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 Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’97), pages 68–77. ACM Press, 1997.Google Scholar
  14. [VGV95]
    L. Vandeurzen, M. Gyssens, and D. Van Gucht. On the desirability and limitations of linear spatial query languages. In 4th Symposium on Large Spatial Databases (SSD’95), volume 951 of Lecture Notes in Computer Science, pages 14–28. Springer-Verlag, 1995.Google Scholar
  15. [VGV96]
    L. Vandeurzen, M. Gyssens, and D. Van Gucht. On query languages for linear queries definable with polynomial constraints. In Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming (CP’96), volume 1118 of Lecture Notes in Computer Science, pages 468–481. Springer-Verlag, 1996.Google Scholar
  16. [DGVV97]
    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 Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’97), pages 68–77. ACM Press, 1997.Google Scholar
  17. [ACGK94]
    F. N. Afrati, S. S. Cosmadakis, S. Grumbach, and G. M. Kuper. Linear vs polynomial constraints in database query languages. In Proceedings of the 2nd International Workshop on Principles and Practice of Constraint Programming (PPCP’94), volume 874 of Lecture Notes in Computer Science, pages 181–192. Springer-Verlag, 1994.Google Scholar
  18. [VGV96]
    L. Vandeurzen, M. Gyssens, and D. Van Gucht. On query languages for linear queries definable with polynomial constraints. In Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming (CP’96), volume 1118 of Lecture Notes in Computer Science, pages 468–481. Springer-Verlag, 1996.Google Scholar
  19. [AAK95]
    F. N. Afrati, T. Andronikos, and T. G. Kavalieros. On the expressiveness of first-order constraint languages. In Proceedings of the 1st Workshop on Constraint Databases and Applications (CDB’95), volume 1034 of Lecture Notes in Computer Science, pages 22–39. Springer-Verlag, 1995.Google Scholar
  20. [VGV95]
    L. Vandeurzen, M. Gyssens, and D. Van Gucht. On the desirability and limitations of linear spatial query languages. In 4th Symposium on Large Spatial Databases (SSD’95), volume 951 of Lecture Notes in Computer Science, pages 14–28. Springer-Verlag, 1995.Google Scholar
  21. [ACGK94]
    F. N. Afrati, S. S. Cosmadakis, S. Grumbach, and G. M. Kuper. Linear vs polynomial constraints in database query languages. In Proceedings of the 2nd International Workshop on Principles and Practice of Constraint Programming (PPCP’94), volume 874 of Lecture Notes in Computer Science, pages 181–192. Springer-Verlag, 1994.Google Scholar
  22. [VGV96]
    L. Vandeurzen, M. Gyssens, and D. Van Gucht. On query languages for linear queries definable with polynomial constraints. In Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming (CP’96), volume 1118 of Lecture Notes in Computer Science, pages 468–481. Springer-Verlag, 1996.Google Scholar
  23. [VGV98]
    L. Vandeurzen, M. Gyssens, and D. Van Gucht. An expressive language for linear spatial database queries. In Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’98), pages 109–118. ACM Press, 1998.Google Scholar
  24. [VGV99]
    L. Vandeurzen, M. Gyssens, and D. Van Gucht. On the expressiveness of linear-constraint query languages for spatial databases, 1999.Google Scholar
  25. [BCR98]
    J. Bochnak, M. Coste, and M.-F. Roy. Real Algebraic Geometry, volume 36 of Ergebnisse der Mathematik und ihrer Grenzgebiete 3. Folge. Springer-Verlag, 1998.Google Scholar
  26. [DGVV97]
    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 Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’97), pages 68–77. ACM Press, 1997.Google Scholar
  27. [VGV98]
    L. Vandeurzen, M. Gyssens, and D. Van Gucht. An expressive language for linear spatial database queries. In Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’98), pages 109–118. ACM Press, 1998.Google Scholar
  28. [PKKV97]
    J. Paredaens, B. Kuijpers, G. M. Kuper, and Luc Vandeurzen. Euclid, Tarski and Engeler encompassed. In Proceedings of the 6th International Workshop on Database Programming Languages (DBPL’97), volume 1369 of Lecture Notes in Computer Science, pages 1–24. Springer-Verlag, 1997.Google Scholar
  29. [BL98]
    M. Benedikt and L. Libkin. Safe constraint queries. In Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’98), pages 99–108. ACM Press, 1998. Full version to appear in SIAM Journal on Computing.Google Scholar
  30. [BDLW98]
    M. Benedikt, G. Dong, L. Libkin, and L. Wong. Relational expressive power of constraint query languages. Journal of the ACM, 45 (1): 134, 1998.MathSciNetCrossRefGoogle Scholar
  31. [BL98]
    M. Benedikt and L. Libkin. Safe constraint queries. In Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’98), pages 99–108. ACM Press, 1998. Full version to appear in SIAM Journal on Computing.Google Scholar
  32. [DGVV97]
    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 Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’97), pages 68–77. ACM Press, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Marc Gyssens
  • Luc Vandeurzen
  • Dirk Van Gucht

There are no affiliations available

Personalised recommendations