Skip to main content

Implementing index data structures using constraint logic programming

  • Conference paper
  • First Online:
Book cover Constraint Databases and Applications (CDB 1997)

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

Included in the following conference series:

Abstract

In this position paper we discuss the use and advantages of Constraint Logic Programming (CLP) for implementing index data structures. We illustrate our discussion with an implementation of the B-Tree in the CLP platform ECLiPSe.

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. Ait-Kaci and R. Nasr. LOGIN: a Logic Programming Language with Built-in Inheritance. J. Logic Programming, (3), 1986.

    Google Scholar 

  2. R. Bayer and E.M. McCreight. Organization and Maintainance of Large Ordered Indices. Acta Informatica, 1(3), 1972.

    Google Scholar 

  3. J.L. Bentley. Multidimensional Binary Search Trees Used for Associative Searching. Communication of the ACM, 18(9), 1975.

    Google Scholar 

  4. Ph. Bonnet, S. Bressan, and B. Granveaud. A Geographical Search Engine for the Internet. In EDBT demos and posters, 1996.

    Google Scholar 

  5. S. Bressan. Database Query Optimisation and Evaluation as Constraints Satisfaction Problem Solving. In Post-ILPS Workshop on Constraints and Databases, 1994.

    Google Scholar 

  6. S. Bressan, T. Le Provost, and M. Wallace. Towards the Application of Generalised Propagation to Database Query Processing. CHIC Esprit project CORE-94-1, ECRC, January 1994.

    Google Scholar 

  7. A. Brodsky and Y. Kornatzky. The LyriC Language: Querying Constraint Objects. In Post-ILPS Woskshop on Constraints and Databases, 1994.

    Google Scholar 

  8. S. Das and M. Wallace. Some Experiments with Constraints for Database Query Evaluation. Presented at the 5th Contessa Workshop, Corsica, May 1996.

    Google Scholar 

  9. ECLIPSE. ECLiPSe user manual ECRC, 1995.

    Google Scholar 

  10. V. Gaede and O. Günther. Multidimensional Access Methods. to be published.

    Google Scholar 

  11. J. Goldstein, R. Ramakrishnan, U. Shaft, and J.-B. Yu. Using Constraints to Query R*-Trees. In CP'96, Workshop on Constraints and Databases, 1996.

    Google Scholar 

  12. R. Gross and R. Marti. Compile Time Constraint Solving in a Constraint Database System. In Post-ILPS Workshop on Constraints and Databases, 1994.

    Google Scholar 

  13. A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. In Proc. ACM-SIGMOD Int. Conf. on Data Management, 1984.

    Google Scholar 

  14. C. Holzbauer. OFAI clp(q,r) Manual. Technical Report TR-95-09, Austrian Research Institute for AI, Vienna, 1995.

    Google Scholar 

  15. J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In Proceedings of the Fourteenth ACM Symposium on Principles of Programming Languages (POPL '87) Munich, FRG, January 1987.

    Google Scholar 

  16. P. Kanellakis, G. Kuper, and P. Revesz. Constraint Query Languages. In Proceedings of the International Symposium on Principles Of Database Systems, 1990.

    Google Scholar 

  17. T. Kolbe, L. Pluemer, and A. Bremers. Using Constraints for the Identification of Buildings in Aerial Images. In Practical Applications of Constraint Technology, 1996.

    Google Scholar 

  18. T. Le Provost and M. Wallace. Domain Independent Propagation. In Proceedings of the International Conference on Fifth Generation Computer Systems, 1992.

    Google Scholar 

  19. J. Nievergelt, H. Hinterberger, and K.C. Sevcik. The Grid File: an Adaptable Symmetric Multikey File Structure. ACM Transaction on Database Systems, 9(1), 1984.

    Google Scholar 

  20. H. Samet. The Design and Analysis of Spatial data Structures. Addison Wesley, 1994.

    Google Scholar 

  21. A. Semenov. Solving Problems with UniCalc. Novosibirsk Division, Russian Research Institute of AI, 1995.

    Google Scholar 

  22. A.P. Sexton. Querying of Indexed Relations. Technical report, University of Birmingham, School of Computer Science, Edgbaston, Birmingham B15 2TT, England, 1996.

    Google Scholar 

  23. J. Ullman. Principles of Database and Knowledge-Base Systems. Computer Science Press, 1989.

    Google Scholar 

  24. P. Valduriez and H. Boral. Evaluation of Recursive Queries Using Join Indices. In Proc. First Intl. Conference on Expert Database Systems, 1986.

    Google Scholar 

  25. M. Wallace, S. Bressan, and T. Le Provost. Magic Checking: Constraint Checking for Database Query Optimisation. In Contessa Workshop on Constraints and Databases, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Volker Gaede Alexander Brodsky Oliver Günther Divesh Srivastava Victor Vianu Mark Wallace

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bressan, S., Sexton, A., Wallace, M. (1996). Implementing index data structures using constraint logic programming. In: Gaede, V., Brodsky, A., Günther, O., Srivastava, D., Vianu, V., Wallace, M. (eds) Constraint Databases and Applications. CDB 1997. Lecture Notes in Computer Science, vol 1191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62501-1_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-62501-1_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62501-8

  • Online ISBN: 978-3-540-68049-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics