Safe Datalog queries with linear constraints

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

Volumn 1520, Issue , 1998, Pages 355-369

  Revesz, Peter Z ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY;

BOTTOM UP; CLOSED FORM; DATALOG; LINEAR CONSTRAINTS; LOWER BOUNDS; UPPER AND LOWER BOUNDS; UPPER BOUND;

COMPUTER PROGRAMMING;

EID: 84957369394     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49481-2_26     Document Type: Conference Paper

References (30)

1. S. Abiteboul, R. Hull and V. Vianu. Foundations of Databases. Addison- Wesley, 1995.
2. M. Benedikt, G. Dong, L. Libkin, L. Wong. Relational Expressive Power of Constraint Query Languages. Journal of the ACM, vol. 45, 1-34, 1998.
3. A. Brodsky, J. Jaffar, M.J. Maher. Toward Practical Query Evaluation for Constraint Databases. Constraints, vol. 2, no. 3&4, 279-304, 1997.
4. A Brodsky, V.E. Segal, J. Chen, P.A. Exarkhopoulo. The CCUBE Con- straint Object-Oriented Database System. Constraints, vol. 2., no. 3&4, 245-278, 1997.
5. J. Byon, P.Z. Revesz, DISCO: A Constraint Database System with Sets, Proc. Workshop on Constraint Databases and Applications, Springer-Verlag LNCS 1034, 68-83, 1995.
6. A.K. Chandra, D. Harel. Structure and Complexity of Relational Queries. Journal of Computer and System Sciences, vol. 25, 99-128, 1982.
7. J. Chomicki, T. Imielinski. Finite Representation of Infinite Query Answers. ACM Transactions of Database Systems, vol. 18, no. 2, 181-223, 1993.
8. J. Cox, K. McAloon. Decision Procedures for Constraint Based Extensions of Datalog. In: F. Benhamou, A. Colmerauer, eds., Constraint Logic Pro- gramming, MIT Press, 1993.
9. R. Dechter, I. Meiri, J. Pearl. Temporal Constraint Networks. Artificial Intelligence, vol. 49, 61-95, 1991.
10. L. Fribourg, H. Olsfien. A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with Z-Counters. Constraints, vol. 2, no. 3&4, 305-336, 1997.
11. D. Goldin, P.C. Kanellakis. Constraint Query Algebras. Constraints, vol. 1, no. 1&2, 54-83, 1996.
12. S. Grumbach, G. M. Kuper. Tractable Recursion over Geometric Data. Proc. Third International Conference on Principles and Practice of Constraint Programming, Springer-Verlag LNCS 1330, 450-462, 1997.
13. S. Grumbach, P. Rigaux, L. Segoufin. The DEDALE System for Complex Spatial Queries. Proc. ACM SIGMOD International Conference on Man- agement of Data, ACM Press, 213-224, 1998.
14. S. Grumbach, J Su, C. Tollu. Linear Constraint Query Languages: Expres- sive Power and Complexity. Proc. Logic and Computational Complexity, Springer-Verlag LNCS 960, 1994.
15. M. Gyssens, J. Van den Bussche, D. Van Gucht. Complete Geometrical Query Languages. Proc. 16th ACM Symposium on Principles of Database Systems, 62-67, 1997.
16. J. Jafiar, J.L. Lassez. Constraint Logic Programming. Proc. 14th ACM Sym- posium on Principles of Programming Languages, 111-119, 1987.
17. J. Jafiar, M.J. Maher. Constraint Logic Programming: A Survey. Journal of Logic Programming, vol. 19 & 20, 503-581, 1994.
18. P. C. Kanellakis, G. M. Kuper, P. Z. Revesz. Constraint Query Languages. Journal of Computer and System Sciences, vol. 51, no. 1, 26-52, 1995.
19. M. Koubarakis. Database Models for Infinite and Indefinite Temporal In- formation. Information Systems, vol. 19, no. 2, 141-173, 1994.
20. M. Koubarakis. The Complexity of Query Evaluation in Indefinite Temporal Constraint Databases. Theoretical Computer Science, vol. 171, no. 1&2, 25-60, 1997.
21. S. R. Kosaraju. Decidability of Reachability in Vector Addition Systems. Prof. 14th ACM Symposium on Theory of Computing, 267-281, 1982.
22. B. Kuijpers, J. Paredaens, M. Smits, J. Van den Bussche. Termination Prop- erties of Spatial Datalog Programs. In: D. Pedreschi and C. Zaniolo, eds., Logic in Databases, Springer-Verlag LNCS 1154, 101-116, 1997.
23. J. Paredaens, J.V.D. Bussche, D.V. Gucht. First-Order Queries on Finite Structures over the Reals. Proc. Symp. on Logic in Computer Science, 1995.
24. P. Z. Revesz. A Closed Form Evaluation for Datalog Queries with Integer (Gap)-Order Constraints. Theoretical Computer Science, vol. 116, no. 1, 117-149, 1993.
25. P. Z. Revesz. Safe Query Languages for Constraint Databases. ACM Trans- actions on Database Systems. vol. 23, no. 1, 1-43, 1998.
26. P. Z. Revesz. Constraint Databases: A Survey. In: L. Libkin and B. Thal- heim, eds., Semantics in Databases, Springer-Verlag LNCS 1358, 209-246, 1998.
27. P. Z. Revesz, Y. Li. MLPQ: A Linear Constraint Database System with Aggregate Operators. Proc. International Database Engineering and Appli- cations Symposium, IEEE Press, 132-137, 1997.
28. H. Schneider, G. P. Barker. Matrices and Linear Algebra. 2nd ed., Holt, Rinehart and Winston, 1973.
29. J.D. Ullman. Principles of Database and Knowledge-Base Systems, vols 1& 2. Computer Science Press, 1989.
30. M. Vardi. The Complexity of Relational Query Languages. Proc. 14th ACM Symposium on the Theory of Computing, 137-145, 1982.