Spatio-Temporal Data Management for Moving Objects Using the PMD-Tree.

@inproceedings{DBLP:conf/er/NakamuraDF98,
  author    = {Yasuaki Nakamura and
               Hiroyuki Dekihara and
               Ryo Furukawa},
  editor    = {Yahiko Kambayashi and
               Dik Lun Lee and
               Ee-Peng Lim and
               Mukesh K. Mohania and
               Yoshifumi Masunaga},
  title     = {Spatio-Temporal Data Management for Moving Objects Using the
               PMD-Tree},
  booktitle = {Advances in Database Technologies, ER '98 Workshops on Data Warehousing
               and Data Mining, Mobile Data Access, and Collaborative Work Support
               and Spatio-Temporal Data Management, Singapore, November 19-20,
               1998, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1552},
  year      = {1998},
  isbn      = {3-540-65690-1},
  pages     = {496-507},
  ee        = {db/conf/er/NakamuraDF98.html},
  crossref  = {DBLP:conf/er/98w},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

References

[1]

Raphael A. Finkel, Jon Louis Bentley: Quad Trees: A Data Structure for Retrieval on Composite Keys. Acta Inf. 4: 1-9(1974)

[2]

Jon Louis Bentley: Multidimensional Binary Search Trees Used for Associative Searching. Commun. ACM 18(9): 509-517(1975)

[3]

Jon Louis Bentley, Jerome H. Friedman: Data Structures for Range Searching. ACM Comput. Surv. 11(4): 397-409(1979)

[4]

John T. Robinson: The K-D-B-Tree: A Search Structure For Large Multidimensional Dynamic Indexes. SIGMOD Conference 1981: 10-18

[5]

Yutaka Ohsawa, Masao Sakauchi: The BD-Tree - A New N-Dimensional Data Structure with Highly Efficient Dynamic Characteristics. IFIP Congress 1983: 539-544

[6]

Jürg Nievergelt, Hans Hinterberger, Kenneth C. Sevcik: The Grid File: An Adaptable, Symmetric Multikey File Structure. ACM Trans. Database Syst. 9(1): 38-71(1984)

[7]

Timos K. Sellis, Nick Roussopoulos, Christos Faloutsos: The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. VLDB 1987: 507-518

[8]

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

[9]

Oliver Günther: The Design of the Cell Tree: An Object-Oriented Index Structure for Geometric Databases. ICDE 1989: 598-605

[10]

David B. Lomet, Betty Salzberg: A Robust Multi-Attribute Search Structure. ICDE 1989: 296-304

[11]

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

[12]

Yasuaki Nakamura, Shigeru Abe, Yutaka Ohsawa, Masao Sakauchi: A Balanced Hierarchical Data Structure for Multidimensional Data with Highly Efficient Dynamic Characteristics. IEEE Trans. Knowl. Data Eng. 5(4): 682-694(1993)

[13]

James R. Driscoll, Neil Sarnak, Daniel Dominic Sleator, Robert Endre Tarjan: Making Data Structures Persistent. J. Comput. Syst. Sci. 38(1): 86-124(1989)

[14]

Neil Sarnak, Robert Endre Tarjan: Planar Point Location Using Persistent Search Trees. Commun. ACM 29(7): 669-679(1986)

[15]

Peter J. Varman, Rakesh M. Verma: An Efficient Multiversion Access STructure. IEEE Trans. Knowl. Data Eng. 9(3): 391-409(1997)

[16]

...

[17]

Douglas Comer: The Ubiquitous B-Tree. ACM Comput. Surv. 11(2): 121-137(1979)

[18]

...

[19]

...

Last update Thu May 24 04:17:08 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page