Bulk loading the m-tree to enhance query performance

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3112, Issue , 2004, Pages 190-202

  Sexton, Alan P ^a   Swinbank, Richard ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; TREES (MATHEMATICS);

DESIGN FEATURES; METRIC ACCESS METHODS; MINIMISATION; NON UNIFORM DATA; QUERY PERFORMANCE; SPATIAL ACCESS METHODS; SPATIAL REGIONS; STRUCTURAL BASIS;

LOADING;

EID: 33749011101     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27811-5_18     Document Type: Article

References (6)

1. P. Ciaccia and M. Patella. Bulk loading the M-tree. In Proceedings of the 9th Australasian Database Conference (ADC'98), pages 15-26, Perth, Australia, 1998.
2. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In Proceedings of the 23rd VLDB Conference, pages 426-435, Athens, Greece, 1997.
3. A. Guttman. R-trees: A dynamic index structure for spatial searching. SIGMOD Record, 14(2):47-57, June 1984.
4. C. Traina Jr., A. Traina, C. Faloutsos, and B. Seeger. Fast indexing and visualization of metric data sets using Slim-trees. IEEE Transactions on Knowledge and Data Engineering, 14(2):244-260, March/April 2002.
5. Alan P. Sexton and Richard Swinbank. Symmetric M-tree. Technical Report CSR04-2, University of Birmingham, UK, 2004. Available at URL www.cs.bham.ac.uk/~rjs/research.
6. J. K. Uhlmann. Satisfying general proximity/similarity queries with metric trees. Information Processing Letters, 40(4):175-179, November 1991.