Skip to main content
SpringerLink
Log in

Safe Datalog Queries with Linear Constraints

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming — CP98 (CP 1998)

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

Abstract

In this paper we consider Datalog queries with linear constraints. We identify several syntactical subcases of Datalog queries with linear constraints, called safe queries, and show that the least model of safe Datalog queries with linear constraints can be evaluated bottomup in closed-form. These subcases include Datalog with only positive and upper-bound or only negative and lower bound constraints or only half-addition, upper and lower bound constraints. We also study other subcases where the recognition problem is decidable

This work was supported in part by NSF grants IRI-9625055 and IRI-9632871.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul, R. Hull and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.

    Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  3. A. Brodsky, J. Jaffar, M.J. Maher. Toward Practical Query Evaluation for Constraint Databases. Constraints, vol. 2, no. 3&4, 279–304, 1997.

    Article  MATH  Google Scholar 

  4. A. Brodsky, V.E. Segal, J. Chen, P.A. Exarkhopoulo. The CCUBE Constraint Object-Oriented Database System. Constraints, vol. 2., no. 3&4, 245–278, 1997.

    Article  MATH  Google Scholar 

  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.

    Google Scholar 

  6. A.K. Chandra, D. Harel. Structure and Complexity of Relational Queries. Journal of Computer and System Sciences, vol. 25, 99–128, 1982.

    Article  MATH  Google Scholar 

  7. J. Chomicki, T. Imielinski. Finite Representation of Infinite Query Answers. ACM Transactions of Database Systems, vol. 18, no. 2, 181–223, 1993.

    Article  Google Scholar 

  8. J. Cox, K. McAloon. Decision Procedures for Constraint Based Extensions of Datalog. In: F. Benhamou, A. Colmerauer, eds., Constraint Logic Programming, MIT Press, 1993.

    Google Scholar 

  9. R. Dechter, I. Meiri, J. Pearl. Temporal Constraint Networks. Artificial Intelligence, vol. 49, 61–95, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  10. L. Fribourg, H. Olsén. A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with Z-Counters. Constraints, vol. 2, no. 3&4, 305–336, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  11. D. Goldin, P.C. Kanellakis. Constraint Query Algebras. Constraints, vol. 1, no. 1&2, 54–83, 1996.

    MathSciNet  Google Scholar 

  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.

    Chapter  Google Scholar 

  13. S. Grumbach, P. Rigaux, L. Segoufin. The DEDALE System for Complex Spatial Queries. Proc. ACM SIGMOD International Conference on Management of Data, ACM Press, 213–224, 1998.

    Google Scholar 

  14. S. Grumbach, J Su, C. Tollu. Linear Constraint Query Languages: Expressive Power and Complexity. Proc. Logic and Computational Complexity, Springer-Verlag LNCS 960, 1994.

    Google Scholar 

  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.

    Google Scholar 

  16. J. Jaffar, J.L. Lassez. Constraint Logic Programming. Proc. 14th ACM Symposium on Principles of Programming Languages, 111–119, 1987.

    Google Scholar 

  17. J. Jaffar, M.J. Maher. Constraint Logic Programming: A Survey. Journal of Logic Programming, vol. 19 & 20, 503–581, 1994.

    Article  MathSciNet  Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

  19. M. Koubarakis. Database Models for Infinite and Indefinite Temporal Information. Information Systems, vol. 19, no. 2, 141–173, 1994.

    Article  Google Scholar 

  20. M. Koubarakis. The Complexity of Query Evaluation in Indefinite Temporal Constraint Databases. Theoretical Computer Science, vol. 171, no. 1&2, 25–60, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  21. S. R. Kosaraju. Decidability of Reachability in Vector Addition Systems. Prof. 14th ACM Symposium on Theory of Computing, 267–281, 1982.

    Google Scholar 

  22. B. Kuijpers, J. Paredaens, M. Smits, J. Van den Bussche. Termination Properties of Spatial Datalog Programs. In: D. Pedreschi and C. Zaniolo, eds., Logic in Databases, Springer-Verlag LNCS 1154, 101–116, 1997.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  25. P. Z. Revesz. Safe Query Languages for Constraint Databases. ACM Transactions on Database Systems. vol. 23, no. 1, 1–43, 1998.

    Article  Google Scholar 

  26. P. Z. Revesz. Constraint Databases: A Survey. In: L. Libkin and B. Thalheim, eds., Semantics in Databases, Springer-Verlag LNCS 1358, 209–246, 1998.

    Chapter  Google Scholar 

  27. P. Z. Revesz, Y. Li. MLPQ: A Linear Constraint Database System with Aggregate Operators. Proc. International Database Engineering and Applications Symposium, IEEE Press, 132–137, 1997.

    Google Scholar 

  28. H. Schneider, G. P. Barker. Matrices and Linear Algebra. 2nd ed., Holt, Rinehart and Winston, 1973.

    Google Scholar 

  29. J.D. Ullman. Principles of Database and Knowledge-Base Systems, vols 1&2. Computer Science Press, 1989.

    Google Scholar 

  30. M. Vardi. The Complexity of Relational Query Languages. Proc. 14th ACM Symposium on the Theory of Computing, 137–145, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, NE, 68588, USA

    Peter Z. Revesz

Authors
  1. Peter Z. Revesz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing and Information Technology, Griffith University, Nathan, Queensland, 4111, Australia

    Michael Maher

  2. ILOG S.A., 9, rue de Verdun, BP 85, F-94253, Gentilly Cedex, France

    Jean-Francois Puget

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Revesz, P.Z. (1998). Safe Datalog Queries with Linear Constraints. In: Maher, M., Puget, JF. (eds) Principles and Practice of Constraint Programming — CP98. CP 1998. Lecture Notes in Computer Science, vol 1520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49481-2_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-49481-2_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65224-3

  • Online ISBN: 978-3-540-49481-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation