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)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Gang Qian
- 2. Qiang Zhu
- 3. Qiang Xue
- 4. Sakti Pramanik
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