Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
OPTIMAL EXTERNAL MEMORY INTERVAL MANAGEMENT LARS ARGE AND JEFFREY SCOTT VITTER
 

Summary: OPTIMAL EXTERNAL MEMORY INTERVAL MANAGEMENT
LARS ARGE AND JEFFREY SCOTT VITTER
SIAM J. COMPUT. c 2003 Society for Industrial and Applied Mathematics
Vol. 32, No. 6, pp. 14881508
Abstract. 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 program-
ming. 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.
Key words. interval management, stabbing queries, I/O efficient, data structures
AMS subject classifications. 68P05, 68P10, 68P15
DOI. 10.1137/S009753970240481X
1. Introduction. In recent years external memory data structures have been
developed for a wide range of applications, including spatial, temporal, and object-
oriented databases and geographic information systems. Often the amount of data
manipulated in such applications is too large to fit in main memory, and the data must
reside on disk. In such cases the input/output (I/O) communication between main
memory and disk can become a bottleneck. In this paper we develop an I/O-optimal

  

Source: Arge, Lars - Department of Computer Science, Aarhus Universitet

 

Collections: Computer Technologies and Information Sciences