Implementing index data structures using constraint logic programming

  • Stéphane Bressan
  • Alan Sexton
  • Mark Wallace
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1191)


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.


Index Structure Constraint Logic Program Constraint Domain Grid File Constraint Logic Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    H. Ait-Kaci and R. Nasr. LOGIN: a Logic Programming Language with Built-in Inheritance. J. Logic Programming, (3), 1986.Google Scholar
  2. 2.
    R. Bayer and E.M. McCreight. Organization and Maintainance of Large Ordered Indices. Acta Informatica, 1(3), 1972.Google Scholar
  3. 3.
    J.L. Bentley. Multidimensional Binary Search Trees Used for Associative Searching. Communication of the ACM, 18(9), 1975.Google Scholar
  4. 4.
    Ph. Bonnet, S. Bressan, and B. Granveaud. A Geographical Search Engine for the Internet. In EDBT demos and posters, 1996.Google Scholar
  5. 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. 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. 7.
    A. Brodsky and Y. Kornatzky. The LyriC Language: Querying Constraint Objects. In Post-ILPS Woskshop on Constraints and Databases, 1994.Google Scholar
  8. 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. 9.
    ECLIPSE. ECLiPSe user manual ECRC, 1995.Google Scholar
  10. 10.
    V. Gaede and O. Günther. Multidimensional Access Methods. to be published.Google Scholar
  11. 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. 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. 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. 14.
    C. Holzbauer. OFAI clp(q,r) Manual. Technical Report TR-95-09, Austrian Research Institute for AI, Vienna, 1995.Google Scholar
  15. 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. 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. 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. 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. 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. 20.
    H. Samet. The Design and Analysis of Spatial data Structures. Addison Wesley, 1994.Google Scholar
  21. 21.
    A. Semenov. Solving Problems with UniCalc. Novosibirsk Division, Russian Research Institute of AI, 1995.Google Scholar
  22. 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. 23.
    J. Ullman. Principles of Database and Knowledge-Base Systems. Computer Science Press, 1989.Google Scholar
  24. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Stéphane Bressan
    • 1
  • Alan Sexton
    • 2
  • Mark Wallace
    • 3
  1. 1.MIT Sloan School of Management, E53-320CambridgeUSA
  2. 2.University of BirminghamUK
  3. 3.IC-ParcUSA

Personalised recommendations