Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Constraint Databases and Applications

CDB 2004: Constraint Databases pp 1–24Cite as

Constraint Databases, Data Structures and Efficient Query Evaluation

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3074))

Abstract

Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the expressive power of first-order logic over the reals, as a constraint database query language, has been studied extensively. The difficulty of the effective evaluation of first-order queries, usually involving some form of quantifier elimination, has been largely neglected.

The contribution of this paper is a discussion of various aspects that influence the efficiency of the evaluation of queries expressible in first-order logic over the reals. We emphasize the importance of data structures and their effect on the complexity of quantifier-elimination. We also propose a novel data model that supports data exploration and visualization as well as efficient query evaluation. In this context, we introduce the concept of sample point query. Finally, we show that a particular kind of sample point query cannot be evaluated in polynomial sequential time by means of branching-parsimonious procedures.

Research partially supported by the following Argentinian, Belgian, German and Spanish grants: UBACyT X198, PIP CONICET 2461, FW/PA/02–EIII/007, ALA 01–E3/02 and DGCyT BFM 2000–0349.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Atiyah, M.F., Macdonald, I.G.: Introduction to commutative algebra. Addison-Wesley, Reading (1969)

    MATH  Google Scholar 

  2. Bank, B., Giusti, M., Heintz, J., Mbakop, G.M.: Polar varieties, real equation solving and data structures: The hypersurface case. Journal of Complexity 13, 5–27 (1997); Best Paper Award Journal of Complexity (1997)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bank, B., Giusti, M., Heintz, J., Mbakop, G.M.: Polar varieties and efficient real elimination. Mathematische Zeitschrift 238, 115–144 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bank, B., Giusti, M., Heintz, J., Pardo, L.M.: Generalized polar varieties and an efficient real elimination procedure (2003) (submitted to Kibernetika)

    Google Scholar 

  5. Bank, B., Guddat, J., Klatte, D., Kummer, B., Tammer, K.: Non-Linear Parametric Optimization. Birkhauser Verlag, Basel (1983)

    MATH  Google Scholar 

  6. Basu, S., Pollack, R., Roy, M.-F.: On the combinatorial and algebraic complexity of quantifier elimination. Journal of the ACM 43, 1002–1045 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  7. Berkowitz, S.: On computing the determinant in small parallel time using a small number of processors. Information Processing Letters 18, 147–150 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  8. Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and real computation. Springer, New York (1998)

    Google Scholar 

  9. Bochnak, J., Coste, M., Roy, M.-F.: Real Algebraic Geometry. Ergebenisse der Mathematik und ihrer Grenzgebiete. Folge 3, vol. 36. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  10. Bürgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  11. Castro, D., Giusti, M., Heintz, J., Matera, G., Pardo, L.M.: The hardness of polynomial solving. Foundations of Computational Mathematics 3, 347–420 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  12. Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 134–183. Springer, Heidelberg (1975)

    Google Scholar 

  13. Giusti, M., Hägele, K., Heintz, J., Morais, J.E., Montaña, J.L., Pardo, L.M.: Lower bounds for diophantine approximation. Journal of Pure and Applied Algebra 117&118, 277–317 (1997)

    Article  Google Scholar 

  14. Giusti, M., Heintz, J.: Kronecker’s smart, little black boxes. In: DeVore, R., Iserles, A., Suli, E. (eds.) Foundations of Computational Mathematics, pp. 69–104. Cambridge University Press, Cambridge (2001)

    Google Scholar 

  15. Giusti, M., Heintz, J., Morais, J.E., Morgenstern, J., Pardo, L.M.: Straight–line programs in geometric elimination theory. Journal of Pure and Applied Algebra 124, 101–146 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  16. Giusti, M., Heintz, J., Morais, J.E., Pardo, L.M.: Le rôle des structures des données dans les problèmes d’élimination. Comptes Rendues de l’Académie des Sciences 325(Série I), 1223–1228 (1997)

    MATH  MathSciNet  Google Scholar 

  17. Giusti, M., Lecerf, G., Salvy, B.: A Gröbner free alternative for polynomial system solving. Journal of Complexity 17(1), 154–211 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  18. Grigor’ev, D., Vorobjov Jr., N.N.: Solving systems of polynomial inequalities in subexponential time. Journal of Symbolic Computation 5, 37–64 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  19. Gyssens, M., Van den Bussche, J., Van Gucht, D.: Complete geometrical query languages. Journal of Computer and System Sciences 58(3), 483–511 (1999); A preliminary report appeared in the Proceedings 16th ACM Symposium on Principles of Database Systems (PODS 1997)

    Article  MATH  MathSciNet  Google Scholar 

  20. Heintz, J., Krick, T., Puddu, S., Sabia, J., Waissbein, A.: Deformation techniques for efficient polynomial equation solving. Journal of Complexity 16, 70–109 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  21. Heintz, J., Matera, G., Weissbein, A.: On the time–space complexity of geometric elimination procedures. Applicable Algebra in Engineering, Communication and Computing 11(4), 239–296 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  22. Heintz, J., Morgenstern, J.: On the intrinsic complexity of elimination theory. Journal of Complexity 9, 471–498 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  23. Heintz, J., Roy, M.-F., Solernó, P.: Sur la complexité du principe de Tarski- Seidenberg. Bulletin de la Société Mathématique de France 118, 101–126 (1990)

    MATH  Google Scholar 

  24. Jeronimo, G., Krick, T., Sabia, J., Sombra, M.: The computational complexity of the Chow form. Foundations of Computational Mathematics 4, 41–117 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  25. Jeronimo, G., Sabia, J.: On the number of sets definable by polynomials. Journal Algebra 227(2), 633–644 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  26. Kanellakis, P.C., Kuper, G.M., Revesz, P.Z.: Constraint query languages. Journal of Computer and System Science 51(1), 26–52 (1995); A preliminary report appeared in the Proceedings 9th ACM Symposium on Principles of Database Systems (PODS 1990)

    Article  MathSciNet  Google Scholar 

  27. Krick, T., Pardo, L.M., Sombra, M.: Sharp estimates for the arithmetic Nullstellensatz. Duke Mathematical Journal 109(3), 521–598 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  28. Kuper, G.M., Paredaens, J., Libkin, L.: Constraint databases. Springer, Heidelberg (2000)

    MATH  Google Scholar 

  29. Lang, S.: Algebra. Addison-Wesley Publishing Company, Reading (1969)

    Google Scholar 

  30. Lecerf, G.: Quadratic Newton iterations for systems with multiplicity. Foundations of Computational Mathematics 2, 247–293 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  31. Paredaens, J., Van den Bussche, J., Van Gucht, D.: Towards a theory of spatial database queries. In: Proceedings of the 13th ACM Symposium on Principles of Database Systems (PODS 1994), pp. 279–288. ACM Press, New York (1994)

    Chapter  Google Scholar 

  32. Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals I, II, III. Jornal of Symbolic Computation 13, 255–352 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  33. Revesz, P.: Introduction to Constraint Databases. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  34. Schost, E.: Computing parametric geometric resolutions. Applicable Algebra in Engineering. Communication and Computing 13(5), 349–393 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  35. Shavarevich, R.: Basic Algebraic Geometry : Varieties in Projective Space. Springer, Heidelberg (1994)

    Google Scholar 

  36. von zur Gathen, J.: Parallel linear algebra. In: Reif, J. (ed.) Synthesis of parallel algorithmns, pp. 573–617. Morgan-Kaufmann, San Francisco (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Computación, Universitad de Buenos Aires, Ciudad Universitaria, Pabellón I, 1428, Buenos Aires, Argentina

    Joos Heintz

  2. Consejo Nacional de Investigaciones, Científicas y Tecnológicas (CONICET), Argentina

    Joos Heintz

  3. Facultad de Ciencias, Departamento de Matemáticas, Estadística y Comptación, Universidad de Cantabria, Avda. de los Castros s/n, E-39005, Santander, Spain

    Joos Heintz

  4. Department WNI, Limburgs Universitair Centrum, Universitaire Campus, 3590, Diepenbeek, Belgium

    Bart Kuijpers

Authors
  1. Joos Heintz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bart Kuijpers
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Theoretical Computer Science Group, Hasselt University & Transnational University of Limburg, Belgium

    Bart Kuijpers

  2. University of Nebraska - Lincoln, NE 68588, Lincoln, USA

    Peter Revesz

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heintz, J., Kuijpers, B. (2004). Constraint Databases, Data Structures and Efficient Query Evaluation. In: Kuijpers, B., Revesz, P. (eds) Constraint Databases. CDB 2004. Lecture Notes in Computer Science, vol 3074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25954-1_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25954-1_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22126-5

  • Online ISBN: 978-3-540-25954-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation