Indexing the Positions of Continuously Moving Objects.

@inproceedings{DBLP:conf/sigmod/SaltenisJLL00,
  author    = {Simonas Saltenis and
               Christian S. Jensen and
               Scott T. Leutenegger and
               Mario A. Lopez},
  editor    = {Weidong Chen and
               Jeffrey F. Naughton and
               Philip A. Bernstein},
  title     = {Indexing the Positions of Continuously Moving Objects},
  booktitle = {Proceedings of the 2000 ACM SIGMOD International Conference on
               Management of Data, May 16-18, 2000, Dallas, Texas, USA},
  publisher = {ACM},
  year      = {2000},
  isbn      = {1-58113-218-2},
  pages     = {331-342},
  ee        = {http://doi.acm.org/10.1145/342009.335427, db/conf/sigmod/SaltenisJLL00.html},
  crossref  = {DBLP:conf/sigmod/2000},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 2000 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

Online Edition

References

[1]

Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter: Efficient Searching with Linear Constraints. PODS 1998: 169-178

[2]

Pankaj K. Agarwal, Lars Arge, Jeff Erickson: Indexing Moving Points. PODS 2000: 175-186

[3]

Lars Arge, Vasilis Samoladas, Jeffrey Scott Vitter: On Two-Dimensional Indexability and Optimal Range Search Indexing. PODS 1999: 346-357

[4]

Julien Basch, Leonidas J. Guibas, John Hershberger: Data Structures for Mobile Data. SODA 1997: 747-756

[5]

Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. SIGMOD Conference 1990: 322-331

[6]

Bruno Becker, Stephan Gschwind, Thomas Ohler, Bernhard Seeger, Peter Widmayer: An Asymptotically Optimal Multiversion B-Tree. VLDB J. 5(4): 264-275(1996)

[7]

Rasa Bliujute, Christian S. Jensen, Simonas Saltenis, Giedrius Slivinskas: R-Tree Based Indexing of Now-Relative Bitemporal Data. VLDB 1998: 345-356

[8]

Jonathan Goldstein, Raghu Ramakrishnan, Uri Shaft, Jie-Bing Yu: Processing Queries By Linear Constraints. PODS 1997: 257-267

[9]

Oliver Günther, Eugene Wong: A Dual Approach to Detect Polyhedral Intersections in Arbitrary Demensions. BIT 31(1): 3-14(1991)

[10]

Joseph M. Hellerstein, Jeffrey F. Naughton, Avi Pfeffer: Generalized Search Trees for Database Systems. VLDB 1995: 562-573

[11]

Ibrahim Kamel, Christos Faloutsos: On Packing R-trees. CIKM 1993: 490-499

[12]

...

[13]

George Kollios, Dimitrios Gunopulos, Vassilis J. Tsotras: On Indexing Mobile Objects. PODS 1999: 261-272

[14]

...

[15]

Anil Kumar, Vassilis J. Tsotras, Christos Faloutsos: Designing Access Methods for Bitemporal Databases. IEEE Trans. Knowl. Data Eng. 10(1): 1-20(1998)

[16]

Scott T. Leutenegger, Mario A. Lopez: The Effect of Buffering on the Performance of R-Trees. ICDE 1998: 164-171

[17]

...

[18]

Bernd-Uwe Pagel, Hans-Werner Six, Heinrich Toben, Peter Widmayer: Towards an Analysis of Range Query Performance in Spatial Data Structures. PODS 1993: 214-221

[19]

...

[20]

Dieter Pfoser, Christian S. Jensen: Capturing the Uncertainty of Moving-Object Representations. SSD 1999: 111-132

[21]

...

[22]

Hanan Samet: The Design and Analysis of Spatial Data Structures. Addison-Wesley 1990

[23]

...

[24]

...

[25]

...

[26]

Jamel Tayeb, Özgür Ulusoy, Ouri Wolfson: A Quadtree-Based Dynamic Attribute Indexing Method. Comput. J. 41(3): 185-200(1998)

[27]

Ouri Wolfson, Bo Xu, Sam Chamberlain, Liqin Jiang: Moving Objects Databases: Issues and Solutions. SSDBM 1998: 111-122

[28]

Ouri Wolfson, A. Prasad Sistla, Sam Chamberlain, Yelena Yesha: Updating and Querying Databases that Track Mobile Units. Distributed and Parallel Databases 7(3): 257-387(1999)