The following publications are possibly variants of this publication:
- Bulk-Loading the ND-Tree in Non-ordered Discrete Data SpacesHyun-Jeong Seok, Gang Qian, Qiang Zhu, Alexander R. Oswald, Sakti Pramanik. dasfaa 2008: 156-171 [doi]
- Deletion Techniques for the ND-tree in Non-ordered Discrete Data SpacesHyun-Jeong Seok, Qiang Zhu, Gang Qian, Sakti Pramanik, Wen-Chi Hou. sede 2009: 1-6
- A space-partitioning-based indexing method for multidimensional non-ordered discrete data spacesGang Qian, Qiang Zhu, Qiang Xue, Sakti Pramanik. tois, 24(1):79-110, 2006. [doi]
- The BINDS-Tree: A Space-Partitioning Based Indexing Scheme for Box Queries in Non-Ordered Discrete Data SpacesA. K. M. Tauhidul Islam, Sakti Pramanik, Qiang Zhu 0001. ieicet, 102-D(4):745-758, 2019. [doi]
- Dynamic indexing for multidimensional non-ordered discrete data spaces using a data-partitioning approachGang Qian, Qiang Zhu, Qiang Xue, Sakti Pramanik. TODS, 31(2):439-484, 2006. [doi]
- On k-Nearest Neighbor Searching in Non-Ordered Discrete Data SpacesDashiell Kolbe, Qiang Zhu, Sakti Pramanik. icde 2007: 426-435 [doi]