Time Responsive External Data Structures for Moving Points

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]  Rakesh M. Verma,et al.  An Efficient Multiversion Access STructure , 1997, IEEE Trans. Knowl. Data Eng..

[2]  Géza Tóth,et al.  Point Sets with Many k-Sets , 2000, SCG '00.

[3]  Tamal K. Dey,et al.  Improved Bounds for Planar k -Sets and Related Problems , 1998, Discret. Comput. Geom..

[4]  R. Pollack,et al.  Advances in Discrete and Computational Geometry , 1999 .

[5]  P. Agarwal,et al.  Eecient Searching with Linear Constraints , 1997 .

[6]  S JensenChristian,et al.  Indexing the positions of continuously moving objects , 2000 .

[7]  Pankaj K. Agarwal,et al.  cient Searching with Linear Constraints , 2022 .

[8]  Jeffrey Scott Vitter,et al.  Online Data Structures in External Memory , 1999, WADS.

[9]  Jeffrey Scott Vitter,et al.  On two-dimensional indexability and optimal range search indexing , 1999, PODS '99.

[10]  Dimitrios Gunopulos,et al.  On indexing mobile objects , 1999, PODS '99.

[11]  Jirí Matousek,et al.  Randomized Optimal Algorithm for Slope Selection , 1991, Inf. Process. Lett..

[12]  Leonidas J. Guibas,et al.  Data structures for mobile data , 1997, SODA '97.

[13]  Jirí Matousek,et al.  Efficient partition trees , 1991, SCG '91.

[14]  Dieter Pfoser,et al.  Novel Approaches to the Indexing of Moving Object Trajectories , 2000, VLDB.

[15]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[16]  Jeffrey Scott Vitter,et al.  Efficient searching with linear constraints , 1998, J. Comput. Syst. Sci..

[17]  Alok Aggarwal,et al.  The input/output complexity of sorting and related problems , 1988, CACM.

[18]  Pankaj K. Agarwal,et al.  Indexing moving points (extended abstract) , 2000, PODS '00.

[19]  Lars Arge.  External memory data structures , 2002 .

[20]  Herbert Edelsbrunner,et al.  Constructing Belts in Two-Dimensional Arrangements with Applications , 1986, SIAM J. Comput..

[21]  Leonidas J. Guibas,et al.  Kinetic data structures: a state of the art report , 1998 .

[22]  Bernhard Seeger,et al.  An asymptotically optimal multiversion B-tree , 1996, The VLDB Journal.

[23]  Dieter Pfoser,et al.  Novel Approaches in Query Processing for Moving Object Trajectories , 2000, VLDB 2000.