Towards Optimal Two-Dimensional Indexing for Constraint Databases

We address the problem of indexing conjunctions of linear constraints with two variables. We show how containment and intersection selection problems for constraint databases can be reduced to the point location problem by using a dual transformation. The proposed representation is then used to develop an efficient secondary storage solution for one important particular indexing case.

[1]  Jeffrey Scott Vitter,et al.  Optimal dynamic interval management in external memory , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[2]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[3]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[4]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[5]  Jeffrey D. Ullman,et al.  Principles of Database Systems , 1980 .

[6]  Sridhar Ramaswamy.  Efficient Indexing for Constraint and Temporal Databases , 1997, ICDT.

[7]  Sridhar Ramaswamy,et al.  Indexing for Data Models with Constraints and Classes , 1996, J. Comput. Syst. Sci..

[8]  Gabriel M. Kuper,et al.  Constraint Query Languages , 1995, J. Comput. Syst. Sci..

[9]  Catherine Lassez,et al.  Separability of Polyhedra and a New Approach to Spatial Storage (Extended Abstract) , 1993, PPCP.