Database Paper Browser

Back to papers

The ND-Tree: A Dynamic Indexing Technique for Multidimensional Non-ordered Discrete Data Spaces

Summary: ND-tree is a dynamic index for multidimensional, non-ordered discrete data spaces (NDDS) enabling efficient similarity search where traditional CDS methods fail. By extending CDS geometric concepts and indexing strategies to NDDS, it achieves faster construction and, on synthetic and genomic data, outperforms linear scan and M-tree in high dimensions. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9010
Venue
VLDB
Year
2003
Pagerank
4.1945683e-05
Overall Rank
12,625 | 12.17%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers