Improving the Performance of Multi-Dimensional Access Structures Based on k-d-Trees.

@inproceedings{DBLP:conf/icde/Henrich96,
  author    = {Andreas Henrich},
  editor    = {Stanley Y. W. Su},
  title     = {Improving the Performance of Multi-Dimensional Access Structures
               Based on k-d-Trees},
  booktitle = {Proceedings of the Twelfth International Conference on Data Engineering,
               February 26 - March  1, 1996, New Orleans, Louisiana},
  publisher = {IEEE Computer Society},
  year      = {1996},
  isbn      = {0-8186-7240-4},
  pages     = {68-75},
  ee        = {db/conf/icde/Henrich96.html},
  crossref  = {DBLP:conf/icde/96},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1996 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An2-7 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

Printed Edition

References

[1]

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 BibTeX

[2]

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

[3]

Andreas Henrich: Adapting the Transformation Technique to Maintain Multi-Dimensional Non-Point Objects in k-d-Tree Based Access Structures. ACM-GIS 1995: 37-44 BibTeX

[4]

Andreas Henrich, Jens Möller: Extending a Spatial Access Structure to Support Additional Standard Attributes. SSD 1995: 132-151 BibTeX

[5]

Andreas Henrich, Hans-Werner Six, Peter Widmayer: The LSD tree: Spatial Access to Multidimensional Point and Nonpoint Objects. VLDB 1989: 45-53 BibTeX

[6]

...

[7]

Andreas Hutflesz, Hans-Werner Six, Peter Widmayer: Twin Grid Files: Space Optimizing Access Schemes. SIGMOD Conference 1988: 183-190 BibTeX

[8]

Marc J. van Kreveld, Mark H. Overmars: Divided k-d Trees. Algorithmica 6(6): 840-858(1991) BibTeX

[9]

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

[10]

...

[11]

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

[12]

Bernhard Seeger, Hans-Peter Kriegel: Techniques for Design and Implementation of Efficient Spatial Access Methods. VLDB 1988: 360-371 BibTeX

Referenced by

1. Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter: Efficient Searching with Linear Constraints. PODS 1998: 169-178
2. Andreas Henrich: The LSD^h-Tree: An Access Structure for Feature Vectors. ICDE 1998: 362-369
3. Banu Özden, Rajeev Rastogi, Abraham Silberschatz: Multimedia Support for Databases. PODS 1997: 1-11