Efficient Object-Realtional Interval Management and Beyond

Recently, the object-relational access method paradigm—the idea of designing index structures that can be built on top of the SQL layer of any relational database server—was proposed as a way to design easy to implement indexes while obtaining strong robustness, performance, and integration into transaction management for free. In this paper, we describe an object-relational index for the 3-sided range indexing problem. Previously an object-relational index was only known for the interval management problem, which is a special case of the 3-sided range indexing problem. Our new index is efficient in the worst-case, and it can be used to answer all general interval relationship queries efficiently. The previously known index were only able to answer 7 out of 13 possible relationship queries efficiently. We also describe a (limited) experimental study of a simplified version of our structure.

[1]  Malcolm P. Atkinson,et al.  Issues Raised by Three Years of Developing PJama: An Orthogonally Persistent Platform for Java , 1999, ICDT.

[2]  Edward M. Reingold,et al.  Binary Search Trees of Bounded Balance , 1973, SIAM J. Comput..

[3]  Hans-Peter Kriegel,et al.  Object-Relational Indexing for General Interval Relationships , 2001, SSTD.

[4]  Donald E. Knuth,et al.  Sorting and Searching , 1973 .

[5]  Jeffrey Scott Vitter,et al.  On two-dimensional indexability and optimal range search indexing , 1999, PODS '99.

[6]  Panos M. Pardalos,et al.  Handbook of Massive Data Sets , 2002, Massive Computing.

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

[8]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[9]  Alok Aggarwal,et al.  The input/output complexity of sorting and related problems , 1988, CACM.

[10]  Oliver Günther,et al.  Multidimensional access methods , 1998, CSUR.

[11]  Lars Arge.  External memory data structures , 2002 .

[12]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

[13]  Mark H. Overmars,et al.  The Design of Dynamic Data Structures , 1987, Lecture Notes in Computer Science.

[14]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[15]  H. Edelsbrunner.  A new approach to rectangle intersections part I , 1983 .

[16]  Rudolf Bayer,et al.  Organization and maintenance of large ordered indexes , 1972, Acta Informatica.

[17]  Hans-Peter Kriegel,et al.  Interval Sequences: An Object-Relational Approach to Manage Spatial Data , 2001, SSTD.

[18]  Hans-Peter Kriegel,et al.  Managing Intervals Efficiently in Object-Relational Databases , 2000, VLDB.

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

[20]  Edward M. McCreight,et al.  Priority Search Trees , 1985, SIAM J. Comput..

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

[22]  Ambuj K. Singh,et al.  Optimal Dynamic Range Searching in Non-replicating Index Structures , 1999, ICDT.