Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Time Responsive External Data Structures for Moving Points
 

Summary: Time Responsive External Data Structures
for Moving Points
Pankaj K. Agarwal 1? , Lars Arge 1?? , and Jan Vahrenhold 2? ? ?
1 Center for Geometric Computing, Department of Computer Science, Duke
University, Durham, NC 27708, USA. EMail: fpankaj,largeg@cs.duke.edu.
2 Westf¨alische Wilhelms­Universit¨at M¨unster, Institut f¨ur Informatik, 48149
M¨unster, Germany. EMail: jan@math.uni­muenster.de.
Abstract. We develop external data structures for storing points in one
or two dimensions, each moving along a linear trajectory, so that a range
query at a given time tq can be answered efficiently. The novel feature
of our data structures is that the number of I/Os required to answer a
query depends not only on the size of the data set and on the number
of points in the answer but also on the difference between tq and the
current time; queries close to the current time are answered fast, while
queries that are far away in the future or in the past may take more time.
1 Introduction
I/O­communication, and not internal memory computation time, is often the
bottleneck in a computation when working with datasets larger than the avail­
able main memory. Recently, external geometric data structures have received
considerable attention because massive geometric datasets arise naturally in

  

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

 

Collections: Computer Technologies and Information Sciences