Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations.

@inproceedings{DBLP:conf/edbt/BerchtoldBK98,
  author    = {Stefan Berchtold and
               Christian B{\"o}hm and
               Hans-Peter Kriegel},
  editor    = {Hans-J{\"o}rg Schek and
               F{\`e}lix Saltor and
               Isidro Ramos and
               Gustavo Alonso},
  title     = {Improving the Query Performance of High-Dimensional Index Structures
               by Bulk-Load Operations},
  booktitle = {Advances in Database Technology - EDBT'98, 6th International
               Conference on Extending Database Technology, Valencia, Spain,
               March 23-27, 1998, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1377},
  year      = {1998},
  isbn      = {3-540-64264-1},
  pages     = {216-230},
  ee        = {http://dx.doi.org/10.1007/BFb0100972, http://link.springer.de/link/service/series/0558/bibs/1377/13770216.htm},
  crossref  = {DBLP:conf/edbt/98},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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/An5-2 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

Online Edition

References

[1]

Stefan Berchtold, Christian Böhm, Bernhard Braunmüller, Daniel A. Keim, Hans-Peter Kriegel: Fast Parallel Similarity Search in Multimedia Databases. SIGMOD Conference 1997: 1-12

[2]

Stefan Berchtold, Christian Böhm, Daniel A. Keim, Hans-Peter Kriegel: A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space. PODS 1997: 78-86

[3]

Stefan Berchtold, Hans-Peter Kriegel: S3: Similarity Search in CAD Database Systems. SIGMOD Conference 1997: 564-567

[4]

Stefan Berchtold, Daniel A. Keim, Hans-Peter Kriegel: The X-tree : An Index Structure for High-Dimensional Data. VLDB 1996: 28-39

[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]

Jochen Van den Bercken, Bernhard Seeger, Peter Widmayer: A Generic Approach to Bulk Loading Multidimensional Index Structures. VLDB 1997: 406-415

[7]

Christos Faloutsos, Ron Barber, Myron Flickner, Jim Hafner, Wayne Niblack, Dragutin Petkovic, William Equitz: Efficient and Effective Querying by Image Content. J. Intell. Inf. Syst. 3(3/4): 231-262(1994)

[8]

Jerome H. Friedman, Jon Louis Bentley, Raphael A. Finkel: An Algorithm for Finding Best Matches in Logarithmic Expected Time. ACM Trans. Math. Softw. 3(3): 209-226(1977)

[9]

C. A. R. Hoare: Quicksort. Comput. J. 5(1): 10-15(1962)

[10]

H. V. Jagadish: A Retrieval Technique for Similar Shapes. SIGMOD Conference 1991: 208-217

[11]

David A. White, Ramesh Jain: Similarity Indexing: Algorithms and Performance. Storage and Retrieval for Image and Video Databases (SPIE) 1996: 62-73

[12]

Ibrahim Kamel, Christos Faloutsos: Hilbert R-tree: An Improved R-tree using Fractals. VLDB 1994: 500-509

[13]

Norio Katayama, Shin'ichi Satoh: The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries. SIGMOD Conference 1997: 369-380

[14]

King-Ip Lin, H. V. Jagadish, Christos Faloutsos: The TV-Tree: An Index Structure for High-Dimensional Data. VLDB J. 3(4): 517-542(1994)

[15]

Rajiv Mehrotra, James E. Gary: Feature-Based Retrieval of Similar Shapes. ICDE 1993: 108-115

[16]

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

[17]

...

[18]

Thomas Seidl, Hans-Peter Kriegel: Efficient User-Adaptable Similarity Search in Large Multimedia Databases. VLDB 1997: 506-515

[19]

David A. White, Ramesh Jain: Similarity Indexing with the SS-tree. ICDE 1996: 516-523