Abstract
Essentially, the constraint programming paradigm attempts to find solutions to problems by finding those points or regions within the data space which satisfy all the constraints of the problem. The art of constraint programming is to find ways of narrowing down the search space as much as possible with as little computational effort as possible. In databases, this is what indexes are for. And yet surprisingly little effort has so far been devoted to developing efficient constraint database indexing. In this paper we show how recent advances in multi-dimensional indexing techniques can be applied to constraint indexing, and give some results for the complexity of access and update operations using these techniques.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
N. Beckmann, H-P. Kriegel, R. Schneider, B. Seeger. The R*-tree: An Efficient and Robust Access Method For Points and Rectangles. Proc. ACM SIGMOD Conf., Atlantic City, New Jersey, May 1990.
R. Bayer, E. McCreight. Organisation and maintenance of large ordered indexes. Acta Informatica, Vol.1, No.3, 1972.
M. Freeston. A General Solution of the N-dimensional B-tree Problem. Proc. ACM SIGMOD Conf., San Jose, California, May 1995.
M. Freeston. A General Solution of the N-dimensional B-tree Problem. ECRC Technical Report No. ECRC-94-40.
M. Freeston. A well-behaved file structure for the storage of spatial objects. Symposium on the Design and Implementation of Large Spatial Databases, Santa Barbara, California, July 1989. Lecture Notes in Computer Science No. 409, Springer-Verlag, 1989.
M. Freeston. Advances in the Design of the BANG File. 3rd International Conference on Foundations of Data Organisation and Algorithms (FODO), Paris, June 1989. Lecture Notes in Computer Science No. 367, Springer-Verlag, 1989.
M. Freeston. The BANG file: a new kind of grid file. Proc. ACM SIGMOD Conf., San Francisco, California, May 1987.
A. Guttman. R-trees: a dynamic index structure for spatial searching. Proc. ACM SIGMOD Conf., Boston Ma.,May 1984.
K. Hinrichs. The Grid file system: implementation and case studies of applications. Doctoral Thesis Nr. 7734, ETH ZUrich, 1985.
P. Kanellakis, G. Kuper, P. Revesz. Constraint Query Languages. Proc. 9th ACM PODS Symp., 1990.
P. Kanellakis, S. Ramaswamy, D. Vengroff, J. Vitter. Indexing for Data Models with Constraints and Classes. To be published.
H-P. Kriegel, M. Schiwietz, R. Schneider, B. Seeger. A Performance Comparison of Multidimensional Point and Spatial Access Methods. Proc. 1st Symp.on the Design of Large Spatial Databases, Santa Barbara, California, July 1989. Lecture Notes in Computer Science No. 409, Springer-Verlag, 1989.
D. Lomet. Grow and Post Index Trees: Role, Techniques and Future Potential. 2nd Symposium on Large Spatial Databases, Zurich, Switzerland, August 1991. Lecture Notes in Computer Science No. 525, Springer-Verlag, 1991.
D. Lomet, B. Salzberg The hB-tree: a Robust Multi-Attribute Indexing Method. ACM Trans. on Database Systems, Vol. 15, No. 4, 1989.
J. Orenstein. Spatial Query Processing in an Object-Oriented Database System. Proc. ACM SIGMOD Conf., Washington D.C., May 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Freeston, M. (1996). The application of multi-dimensional indexing methods to constraints. 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_16
Download citation
DOI: https://doi.org/10.1007/3-540-60794-3_16
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