Abstract. 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 worstcase, 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
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.