Optimal External Memory Interval Management
View/ Open
Issue Date
2012-02-17Author
Arge, Lars
Vitter, Jeffrey Scott
Publisher
Society for Industrial and Applied Mathematics
Type
Article
Article Version
Scholarly/refereed, publisher version
Metadata
Show full item recordAbstract
In this paper we present the external interval tree, an optimal external memory data structure for answering stabbing queries on a set of dynamically maintained intervals. The external interval tree can be used in an optimal solution to the dynamic interval management problem, which is a central problem for object-oriented and temporal databases and for constraint logic programming. Part of the structure uses a weight-balancing technique for efficient worst-case manipulation of balanced trees, which is of independent interest. The external interval tree, as well as our new balancing technique, have recently been used to develop several efficient external data structures.
Description
This is the published version. Copyright © 2003 Society for Industrial and Applied Mathematics
Collections
Citation
Arge, Lars, and Jeffrey Scott Vitter. "Optimal External Memory Interval Management." SIAM J. Comput. SIAM Journal on Computing 32.6 (2003): 1488-508. DOI:10.1137/S009753970240481X
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
We want to hear from you! Please share your stories about how Open Access to this item benefits YOU.