The nd-tree: A dynamic indexing technique for multidimensional non-ordered discrete data spaces

Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003

Volumn , Issue , 2003, Pages 620-631

  Qian, Gang ^a   Zhu, Qiang ^b   Xue, Qiang ^a   Pramanik, Sakti ^a  

^a Michigan State University   (United States)

^b Department of Electrical and Computer Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; FORESTRY; GENES; INDEXING (OF INFORMATION);

DATA DISTRIBUTION; GENOMIC-SEQUENCE DATA; GEOMETRIC CONCEPTS; INDEXING TECHNIQUES; MINIMUM BOUNDING REGIONS; RETRIEVAL PERFORMANCE; SIMILARITY SEARCH; TREE CONSTRUCTION;

TREES (MATHEMATICS);

EID: 85012186736     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. R. Bayer and K. Unterauer. Prefix B-trees. In ACM TODS, 2(1):11-26, 1977.
2. S. Berchtold, D. A. Keim and H.-P. Kriegel. The X-tree: an index structure for high-dimensional data. In Proc. of VLDB, pp. 28-39, 1996.
3. ∗-tree: an efficient and robust access method for points and rectangles. In Proc. of ACM SIGMOD, pp. 322-331, 1990.
4. T. Bozkaya and M. Ozsoyoglu. Distance-based indexing for high-dimensional metric spaces. In Proc. of A CM SIGMOD, pp. 357-368, 1997.
5. S. Brin. Near neighbor search in large metric spaces. In Proc. of VLDB, pp. 574-584, 1995.
6. A. Califano and I. Rigoutsos. FLASH: a fast look-up algorithm for string homology. In Proc. of IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 353-359, 1993.
7. K. Chakrabarti and S. Mehrotra. The Hybrid Tree: an index structure for high dimensional feature spaces. In Proc. of IEEE ICDE, pp. 440-447, 1999.
8. W. Chen and K. Aberer. Efficient querying on genomic databases by using metric space indexing techniques (extended abstract). In Proc.of Int'l Workshop on DEXA, pp. 48-152, 1997.
9. T. Chiueh. Content-based image indexing. In Proc. of VLDB, pp. 582-593, 1994.
10. P. Ciaccia, M. Patella and P. Zezula. M-tree: an efficient access method for similarity search in metric spaces. In Proc. of VLDB, pp. 426-435, 1997.
11. J. Clement, P. Flajolet and B. Vallee. Dynamic sources in information theory: a general analysis of trie structures. In Algorithmica, 29(1/2):307-369, 2001.
12. C. Faloutsos and K.-I. Lin. FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In Proc. of ACM SIGMOD, pp. 163-174, 1995.
13. P. Ferragina and R. Grossi. The String B-tree: a new data structure for string search in external memory and its applications. In J. ACM, 46(2):236-280, 1999.
14. C. Fondrat and P. Dessen. A rapid access motif database (RAMdb) with a search algorithm for the retrieval patterns in nucleic acids or protein databanks. In Computer Applications Biosciences, 11(3):273-279, 1995.
15. A. Guttman. R-trees: a dynamic index structure for spatial searching. In Proc. of ACM SIGMOD, pp. 47-57, 1984.
16. A. Henrich. The LSDh-tree: an access structure for feature vectors. In Proc. of IEEE ICDE, pp. 362-369, 1998.
17. N. Katayama and S. Satoh. The SR-tree: an index structure for high-dimensional nearest neighbor queries. In Proc. of ACM SIGMOD, pp. 369-380, 1997.
18. W. J. Kent. BLAT - the BLAST-like aligment tool. In Genome Research, 12:656-664, 2002.
19. J. Li. Efficient similarity search based on data distribution properties in high dimension. In Ph. D. Dissertation, Michigan State University, 2001.
20. B. C. Orcutt and W. C. Barker. Searching the protein database. In Bulletin of Math. Biology, 46:545-552, 1984.
21. J. T. Robinson. The K-D-B-Tree: a search structure for large multidimensional dynamic indexes. In Proc. of ACM SIGMOD, pp. 10-18, 1981.
22. J. K. Uhlmann. Satisfying general proximity/similarity queries with metric trees. In Inf. Proc. Lett., 40(4):175-179, 1991.
23. R. Weber, H.-J. Schek and S. Blott. A quantitative analysis and performance study for similaritysearch methods in high-dimensional spaces. In Proc. of VLDB, pp. 357-367, 1998.
24. D. White and R. Jain. Similarity indexing with the SS-tree. In Proc. of IEEE ICDE, pp. 516-523, 1996.
25. H. E. Williams and J. Zobel. Indexing and retrival for genomic databases. In IEEE Trans. on Knowl. and Data Eng., 14(1):63-78, 2002.