Skip to main content

The DISCO System

  • Chapter
Constraint Databases

Abstract

DISCO, short for Datalog with Integer Set COnstraints, is a constraint database system that implements Datalog with Boolean constraints (see Chapter 7) on set variables that range over finite and infinite sets of integers. In this chapter we provide a short introduction to the DISCO system.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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.

Bibliographic Notes

  1. J.-H. Byon and P. Revesz. DISCO: A constraint database system with sets. In Proceedings of the 1st Workshop on Constraint Databases and Applications (CDB’95), volume 1034 of Lecture Notes in Computer Science, pages 68–83. Springer-Verlag, 1995.

    Google Scholar 

  2. D. Srivastava, R. Ramakrishnan, and P. Z. Revesz. Constraint objects. In Proceedings of the 2nd International Workshop on Principles and Practice of Constraint Programming (PPCP’94), volume 874 of Lecture Notes in Computer Science, pages 218–228. Springer-Verlag, 1994.

    Google Scholar 

  3. P. Z. Revesz. Datalog queries of set constraint databases. In 5th International Conference on Database Theory (ICDT’95), volume 893 of Lecture Notes in Computer Science, pages 425–438. Springer-Verlag, 1995.

    Google Scholar 

  4. P. Z. Revesz. Safe query languages for constraint databases. ACM Transactions on Databases Systems (TODS), 23 (1): 58–99, 1998.

    Article  Google Scholar 

  5. P. Z. Revesz. Problem solving in the DISCO constraint database system. In Proceedings of the 2nd Workshop on Constraint Databases and Applications (CDB’97), volume 1191 of Lecture Notes in Computer Science, pages 302–315. Springer-Verlag, 1997.

    Google Scholar 

  6. P. Z. Revesz. Refining restriction enzyme genome maps. Constraints, 2 (3/4): 361–375, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  7. P. Z. Revesz. The evaluation and the computational complexity of Datalog queries of Boolean constraint databases. International Journal of Algebra and Computation, 8 (5): 472–498, 1998.

    Article  MathSciNet  Google Scholar 

  8. R. Helm, K. Marriott, and M. Odersky. Spatial query optimization: From Boolean constraints to range queries. Journal of Computer and System Sciences (JCSS), 51 (2): 197–210, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  9. K. Marriott and M. Odersky. Negative Boolean constraints. Theoretical Computer Science (TCS), 160 (1/2): 365–380, 1996.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Revesz, P. (2000). The DISCO System. In: Kuper, G., Libkin, L., Paredaens, J. (eds) Constraint Databases. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04031-7_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-04031-7_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-08542-0

  • Online ISBN: 978-3-662-04031-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics