Skip to main content

DISCO: A constraint database system with sets

  • Conference paper
  • First Online:
Constraint Databases and Application (CDB 1995)

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

Included in the following conference series:

Abstract

This paper describes the implementation of a constraint database system with integer and set of integers data types. The system called DISCO allows Datalog queries and input databases with both integer gap-order [30] and set order constraints [31]. The DISCO query language can easily express many complex problems involving sets. The paper also presents efficient running times for several sample queries.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. AÏt-Kaci, A. Podelski. Towards a Meaning of LIFE. Journal of Logic Programming, 16, 195–234, 1993.

    Google Scholar 

  2. A. Aiken. Set Constraints: Results, Applications and Future Directions. Proc. 2nd Workshop on Principles and Practice of Constraint Programming, 171–179, 1994.

    Google Scholar 

  3. F. Afrati, S.S. Cosmadakis, S. Grumbach, G.M. Kuper. Linear vs. Polynomial Constraints in Database Query Languages. Proc. 2nd Workshop on Principles and Practice of Constraint Programming, 152–160, 1994.

    Google Scholar 

  4. A. Brodsky, J. Jaffar, M. J. Maher. Toward Practical Constraint Databases, Proc. VLDB, 567–580, 1993.

    Google Scholar 

  5. A. Brodsky, Y. Kornatzky. The L yri C Language: Querying Constraint Objects. Proc. SIGMOD, 1995.

    Google Scholar 

  6. A. Brodsky, C. Lassez, J-L. Lassez, M. J. Maher. Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data, Proc. ACM PODS, 54–65, 1995.

    Google Scholar 

  7. A.K. Chandra, D. Harel. Computable Queries for Relational Data Bases. Journal of Computer and System Sciences, 21:156–178, 1980.

    Article  Google Scholar 

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

    Google Scholar 

  9. J. Chomicki, G. Kuper. Measuring Infinite Relations, Proc. 14th ACM PODS, 78–85, 1995.

    Google Scholar 

  10. A. Colmerauer. An Introduction to Prolog III. CACM, 28(4):412–418, 1990.

    Google Scholar 

  11. J. Cox, K. McAloon. Decision Procedures for Constraint Based Extensions of Datalog. In: Constraint Logic Programming, MIT Press, 1993.

    Google Scholar 

  12. M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier. The Constraint Logic Programming Language CHIP. Proc. Fifth Generation Computer Systems, 1988.

    Google Scholar 

  13. A. Dovier, G. Rossi. Embedding extensional finite sets in CLP. International Logic Programming Symposium, 1993.

    Google Scholar 

  14. ECLIPSE. Eclipse user manual. Technical report. ECRC, 1994.

    Google Scholar 

  15. C. Gervet. Conjunto: Constraint Logic Programming with Finite Set Domains. Proc. International Logic Programming Symposium, 339–358, 1994.

    Google Scholar 

  16. R. Gross, R Marti. Compile-time Constraint Solving in a Constraint Database System. Proc. Post-ILPS'94 Workshop on Constraints and Databases, 13–25, 1994.

    Google Scholar 

  17. S. Grumbach, J Su. Finitely Representable Databases. Proc. 14th ACM PODS, 66–77, 1995.

    Google Scholar 

  18. J. Jaffar, J.L. Lassez. Constraint Logic Programming. Proc. 14th ACM POPL, 111–119, 1987.

    Google Scholar 

  19. J. Jaffar, S. Michaylov, P.J. Stuckey, R.H. Yap. The CLP(R) Language and System. ACM Transactions on Programming Languages and Systems, 14:3, 339–395, 1992.

    Google Scholar 

  20. B. Jayaraman, A. Nair. Subset-Logic Programming: Applications and Implementation. Univ. North Carolina Tech. Report TR-88-011, 1988.

    Google Scholar 

  21. F. Kabanza, J-M. Stevenne, P. Wolper. Handling Infinite Temporal Data. Proc. 9th ACM PODS, 392–403, 1990.

    Google Scholar 

  22. P.C. Kanellakis, D.Q. Goldin. Constraint Programming and Database Query Languages. Proc. 2nd TACS, 1994.

    Google Scholar 

  23. P. C. Kanellakis, G. M. Kuper, P. Z. Revesz. Constraint Query Languages. Journal of Computer and System Sciences, vol. 51, 26–52, 1995.

    Google Scholar 

  24. P.C. Kanellakis, S. Ramaswamy, D.E. Vengroff, J.S. Vitter. Indexing for Data Models with Constraints and Classes Proc. 12th ACM PODS, 1993.

    Google Scholar 

  25. M. Koubarakis. Representing and Querying in Temporal Databases: the Power of Temporal Constraints. Proc. Ninth International Conference on Data Engineering, 1993.

    Google Scholar 

  26. G. M. Kuper. Logic Programming with Sets. Journal of Computer and System Sciences, 41, 44–64, 1990.

    Google Scholar 

  27. B. Legeard, E. Legros. Short overview of the CLPS System. Proc. PLILP, 1991.

    Google Scholar 

  28. J. Paradeans, J. Van den Bussche, D. Van Gucht. Towards a Theory of Spatial Database Queries. Proc. 13th ACM PODS, 279–288, 1994.

    Google Scholar 

  29. R. Ramakrishnan, D. Srivastava, S. Sudarshan. CORAL: Control, Relations and Logic. Proc. VLDB, 1992.

    Google Scholar 

  30. 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.

    Google Scholar 

  31. P. Z. Revesz. Datalog Queries of Set Constraint Databases, Fifth International Conference on Database Theory, Springer-Verlag LNCS 893, pp. 425–438, Prague, Czech Republic, January, 1995.

    Google Scholar 

  32. P. Z. Revesz. Safe Stratified Datalog with Integer Order Programs, First International Conference on Principles and Practice of Constraint Programming, Springer-Verlag LNCS 976, pp. 154–169, Cassis, September, 1995.

    Google Scholar 

  33. P. Z. Revesz. Set Constraint Databases and Query Languages, Pre-PODS'95 Workshop on Theory of Constraint Databases, San Jose, California, 1995.

    Google Scholar 

  34. D. Srivastava, R. Ramakrishnan, P.Z. Revesz. Constraint Objects. Proc. 2nd Workshop on Principles and Practice of Constraint Programming, 274–284, 1994.

    Google Scholar 

  35. D. Toman, J. Chomicki, D.S. Rogers. Datalog with Integer Periodicity Constraints. Proc. ILPS, 1994.

    Google Scholar 

  36. S. Tsur and C. Zaniolo. LDL: A Logic-Based Data-Language. Proc. VLDB, pp 33–41, 1986.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  39. P. Voda. Types of Trilogy. Proc. 5th International Conference on Logic Programming, 580–589, 1988.

    Google Scholar 

  40. C. Walinsky. CLP(σ*): Constraint logic programming with regular sets. Proc. 6th International Conference on Logic Programming, 181–190, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Gabriel Kuper Mark Wallace

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Byon, JH., Revesz, P.Z. (1996). DISCO: A constraint database system with sets. In: Kuper, G., Wallace, M. (eds) Constraint Databases and Application. CDB 1995. Lecture Notes in Computer Science, vol 1034. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60794-3_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-60794-3_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60794-6

  • Online ISBN: 978-3-540-49456-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics