Constraint Databases, Data Structures and Efficient Query Evaluation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3074, Issue , 2004, Pages 1-24

  Heintz, Joos ^a,b   Kuijpers, Bart ^c,d  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b Consejo Nacional de Investigaciones Científicas y Tecnoĺgicas ^*  (Argentina)

^c UNIVERSITY OF CANTABRIA   (Spain)

^d HASSELT UNIVERSITY   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DATA VISUALIZATION; FORMAL LOGIC; QUERY LANGUAGES;

BOOLEAN COMBINATIONS; CONSTRAINT DATABASES; DATA EXPLORATION; EFFICIENT QUERY EVALUATION; EXPRESSIVE POWER; FIRST ORDER LOGIC; POLYNOMIAL INEQUALITIES; QUANTIFIER ELIMINATION;

QUERY PROCESSING;

EID: 35048857577     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25954-1_1     Document Type: Article

References (36)

1. M. F. Atiyah and I. G. Macdonald. Introduction to commutative algebra. AddisonWesley, 1969.
2. B. Bank, M. Giusti, J. Heintz, and G. M. Mbakop. 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.
3. B. Bank, M. Giusti, J. Heintz, and G. M. Mbakop. Polar varieties and efficient real elimination. Mathematische Zeitschrift, 238:115-144, 2001.
4. B. Bank, M. Giusti, J. Heintz, and L. M. Pardo. Generalized polar varieties and an efficient real elimination procedure. Submitted to Kibernetika, 2003.
5. B. Bank, J. Guddat, D. Klatte, B. Kummer, and K. Tammer. Non - Linear Parametric Optimization. Birkhauser Verlag, Basel, 1983.
6. S. Basu, R. Pollack, and M.-F. Roy. On the combinatorial and algebraic complexity of quantifier elimination. Journal of the ACM, 43:1002-1045, 1996.
7. S. Berkowitz. On computing the determinant in small parallel time using a small number of processors. Information Processing Letters, 18:147-150, 1984.
8. L. Blum, F. Cucker, M. Shub, and S. Smale. Complexity and real computation. Springer-Verlag, New York, 1998.
9. J. Bochnak, M. Coste, and M.-F. Roy. Real Algebraic Geometry, volume 36 of Ergebenisse der Mathematik und ihrer Grenzgebiete. Folge 3. Springer - Verlag, 1998.
10. P. Bürgisser, M. Clausen, and M. A. Shokrollahi. Algebraic Complexity Theory. Springer - Verlag, 1997.
11. D. Castro, M. Giusti, J. Heintz, G. Matera, and L. M. Pardo. The hardness of polynomial solving. Foundations of Computational Mathematics, 3:347-420, 2003.
12. G. E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Automata Theory and Formal Languages, volume 33 of Lecture Notes in Computer Science, pages 134-183. Springer - Verlag, 1975.
13. M. Giusti, K. Hägele, J. Heintz, J. E. Morais, J. L. Montaña, and L. M. Pardo. Lower bounds for diophantine approximation. Journal of Pure and Applied Algebra, 117&118:277-317, 1997.
14. M. Giusti and J. Heintz. Kronecker's smart, little black boxes. In R. DeVore, Iserles A., and E. Suli, editors, Foundations of Computational Mathematics, pages 69-104, Cambridge, 2001. Cambridge University Press.
15. M. Giusti, J. Heintz, J. E. Morais, J. Morgenstern, and L. M. Pardo. Straight - line programs in geometric elimination theory. Journal of Pure and Applied Algebra, 124:101-146, 1998.
16. M. Giusti, J. Heintz, J. E. Morais, and L. M. Pardo. 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.
17. M. Giusti, G. Lecerf, and B. Salvy. A Gröbner free alternative for polynomial system solving. Journal of Complexity, 17(1):154-211, 2001.
18. D. Grigor'ev and N. N. (jr.) Vorobjov. Solving systems of polynomial inequalities in subexponential time. Journal of Symbolic Computation, 5:37-64, 1988.
19. M. Gyssens, J. Van den Bussche, and D. Van Gucht. 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'97).
20. J. Heintz, T. Krick, S. Puddu, J. Sabia, and A. Waissbein. Deformation techniques for efficient polynomial equation solving. Journal of Complexity, 16:70-109, 2000.
21. J. Heintz, G. Matera, and A. Weissbein. On the time-space complexity of geometric elimination procedures. Applicable Algebra in Engineering, Communication and Computing, ll(4):239-296, 2001.
22. J. Heintz and J. Morgenstern. On the intrinsic complexity of elimination theory. Journal of Complexity, 9:471-498, 1993.
23. J. Heintz, M.-F. Roy, and P. Solernó. Sur la complexité du principe de TarskiSeidenberg. Bulletin de la Société Mathématique de France, 118:101-126, 1990.
24. G. Jeronimo, T. Krick, J. Sabia, and M. Sombra. The computational complexity of the Chow form. Foundations of Computational Mathematics, 4:41-117, 2004.
25. G. Jeronimo and J. Sabia. On the number of sets definable by polynomials. Journal Algebra, 227(2) :633-644, 2000.
26. P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz. Constraint query languages. Journal of Computer and System Science, 51(l):26-52, 1995. A preliminary report appeared in the Proceedings 9th ACM Symposium on Principles of Database Systems (PODS'90).
27. T. Krick, L. M. Pardo, and M. Sombra. Sharp estimates for the arithmetic Nullstellensatz. Duke Mathematical Journal, 109(3):521-598, 2001.
28. G. M. Kuper, J. Paredaens, and L. Libkin. Constraint databases. Springer-Verlag, 2000.
29. S. Lang. Algebra. Addison-Wesley Publishing Company, Reading, Massachusetts, 1969.
30. G. Lecerf. Quadratic Newton iterations for systems with multiplicity. Foundations of Computational Mathematics, 2:247-293, 2002.
31. J. Paredaens, J. Van den Bussche, and D. Van Gucht. Towards a theory of spatial database queries. In Proceedings of the 13th ACM Symposium on Principles of Database Systems (PODS'94), Pages 279-288, New York, 1994. ACM Press.
32. J. Renegar. 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.
33. P. Revesz. Introduction to Constraint Databases. Springer - Verlag, 2002.
34. E. Schost. Computing parametric geometric resolutions. Applicable Algebra in Engineering, Communication and Computing, 13(5):349-393, 2003.
35. I. R. Shavarevich. Basic Algebraic Geometry : Varieties in Projective Space. Springer - Verlag, 1994.
36. J. von zur Gathen. Parallel linear algebra. In J. Reif, editor, Synthesis of parallel algorithmns, pages 573-617. Morgan - Kaufmann, 1993.