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 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.
This work was supported in part by the National Science Foundation through ESS grant EIA-9870734, RI grant EIA-9972879, CAREER grant CCR-9984099, and ITR grant EIA-0112849.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aggarwal, A., Vitter, J.S.: The Input/Output complexity of sorting and related problems. Communications of the ACM 31(9), 1116–1127 (1988)
Allen, J.: Maintaining knowledge about temporal intervals. Communications of the ACM 26(11), 832–843 (1983)
Arge, L.: External memory data structures. In: Abello, J., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Massive Data Sets, pp. 313–358. Kluwer Academic Publishers, Dordrecht (2002)
Arge, L., Samoladas, V., Vitter, J.S.: On two-dimensional indexability and optimal range search indexing. In: Proc. ACM Symposium on Principles of Database Systems, pp. 346–357 (1999)
Arge, L., Vitter, J.S.: Optimal dynamic interval management in external memory. In: Proc. IEEE Symposium on Foundations of Computer Science, pp. 560–569 (1996)
Bayer, R., McCreight, E.: Organization and maintenance of large ordered indexes. Acta Informatica 1, 173–189 (1972)
Comer, D.: The ubiquitous B-tree. ACM Computing Surveys 11(2), 121–137 (1979)
Edelsbrunner, H.: A new approach to rectangle intersections, part I. Int. J. Computer Mathematics 13, 209–219 (1983)
Gaede, V., Günther, O.: Multidimensional access methods. ACM Computing Surveys 30(2), 170–231 (1998)
Kanellakis, P.C., Ramaswamy, S., Vengroff, D.E., Vitter, J.S.: Indexing for data models with constraints and classes. Journal of Computer and System Sciences 52(3), 589–612 (1996)
Kanth, K.V.R., Singh, A.K.: Optimal dynamic range searching in non replicating index structures. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 257–276. Springer, Heidelberg (1998)
Knuth, D.E.: Sorting and Searching. In: The Art of Computer Programming, 2nd edn., vol. 3. Addison-Wesley, Reading (1998)
Kriegel, H.-P., Pötke, M., Seidl, T.: Managing intervals efficiently in object relational databases. In: Proc. International Conference on Very Large Databases, pp. 407–418 (2000)
Kriegel, H.-P., Pötke, M., Seidl, T.: Interval sequences: An object-relational approach to manage spatial data. In: Proc. International Symposium on Spatial and Temporal Databases, pp. 481–501 (2001)
Kriegel, H.-P., Pötke, M., Seidl, T.: Object-relational indexing for general interval relationships. In: Proc. International Symposium on Spatial and Temporal Databases, pp. 522–542 (2001)
McCreight, E.: Priority search trees. SIAM Journal on Computing 14(2), 257–276 (1985)
Nievergelt, J., Reingold, E.M.: Binary search tree of bounded balance. SIAM Journal on Computing 2(1), 33–43 (1973)
Overmars, M.H.: The Design of Dynamic Data Structures. LNCS, vol. 156. Springer, Heidelberg (1983)
TIGER/LineTM Files, 1997 Technical Documentation. Washington, DC (September 1998), http://www.census.gov/geo/tiger/TIGER97D.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arge, L., Chatham, A. (2003). Efficient Object-Relational Interval Management and Beyond. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J., Theodoridis, Y. (eds) Advances in Spatial and Temporal Databases. SSTD 2003. Lecture Notes in Computer Science, vol 2750. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45072-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-45072-6_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40535-1
Online ISBN: 978-3-540-45072-6
eBook Packages: Springer Book Archive