Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Optimal Dynamic Interval Management in External Memory (extended abstract)
 

Summary: Optimal Dynamic Interval Management in External Memory
(extended abstract)
Lars Arge
Jeffrey Scott Vitter
Department of Computer Science
Duke University
Durham, NC 277080129
Abstract
We present a space- and I/O-optimal external-memory
data structure for answering stabbing queries on a set of
dynamically maintained intervals. Our data structure set-
tles an open problem in databases and I/O algorithms by
providing the first optimal external-memory solution to the
dynamic interval management problem, which is a special
case of 2-dimensional range searching and a central prob-
lem for object-oriented and temporal databases and for
constraint logic programming. Our data structure simulta-
neously uses optimal linear space (that is, O(N/B) blocks
of disk space) and achieves the optimal O(logB N + T/B)
I/O query bound and O(logB N) I/O update bound, where

  

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

 

Collections: Computer Technologies and Information Sciences