{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:28Z","timestamp":1750308148579,"version":"3.41.0"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2006,6,1]],"date-time":"2006-06-01T00:00:00Z","timestamp":1149120000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2006,6]]},"abstract":"<jats:p>Similarity searches in multidimensional Non-ordered Discrete Data Spaces (NDDS) are becoming increasingly important for application areas such as bioinformatics, biometrics, data mining and E-commerce. Efficient similarity searches require robust indexing techniques. Unfortunately, existing indexing methods developed for multidimensional (ordered) Continuous Data Spaces (CDS) such as the R-tree cannot be directly applied to an NDDS. This is because some essential geometric concepts\/properties such as the minimum bounding region and the area of a region in a CDS are no longer valid in an NDDS. Other indexing methods based on metric spaces such as the M-tree and the Slim-trees are too general to effectively utilize the special characteristics of NDDSs, resulting in nonoptimized performance. In this article, we propose a new dynamic data-partitioning-based indexing technique, called the ND-tree, to support efficient similarity searches in an NDDS. The key idea is to extend the relevant geometric concepts as well as some indexing strategies used in CDSs to NDDSs. Efficient algorithms for ND-tree construction and techniques to solve relevant issues such as handling dimensions with different alphabets in an NDDS are presented. Our experimental results on synthetic data and real genome sequence data demonstrate that the ND-tree outperforms the linear scan, the M-tree and the Slim-trees for similarity searches in multidimensional NDDSs. A theoretical model is also developed to predict the performance of the ND-tree for random data.<\/jats:p>","DOI":"10.1145\/1138394.1138395","type":"journal-article","created":{"date-parts":[[2006,7,25]],"date-time":"2006-07-25T14:14:26Z","timestamp":1153836866000},"page":"439-484","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Dynamic indexing for multidimensional non-ordered discrete data spaces using a data-partitioning approach"],"prefix":"10.1145","volume":"31","author":[{"given":"Gang","family":"Qian","sequence":"first","affiliation":[{"name":"University of Central Oklahoma, Edmond, OK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Zhu","sequence":"additional","affiliation":[{"name":"The University of Michigan---Dearborn, Dearborn, MI"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Xue","sequence":"additional","affiliation":[{"name":"Michigan State University, East Lansing, MI"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sakti","family":"Pramanik","sequence":"additional","affiliation":[{"name":"Michigan State University, East Lansing, MI"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/320521.320530"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"volume-title":"Proceedings of the International Conference on Very Large Data Bases (VLDB'96)","author":"Berchtold S.","key":"e_1_2_1_3_1","unstructured":"Berchtold , S. , Keim , D. A. , and Kriegel , H . -P. 1996. The X-tree: An index structure for high-dimensional data . In Proceedings of the International Conference on Very Large Data Bases (VLDB'96) . 28--39. Berchtold, S., Keim, D. A., and Kriegel, H.-P. 1996. The X-tree: An index structure for high-dimensional data. In Proceedings of the International Conference on Very Large Data Bases (VLDB'96). 28--39."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253345"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'95)","author":"Brin S.","year":"1995","unstructured":"Brin , S. 1995 . Near neighbor search in large metric spaces . In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'95) . 574--584. Brin, S. 1995. Near neighbor search in large metric spaces. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'95). 574--584."},{"volume-title":"Proceedings of the International Conference on Data Engineering (ICDE'99)","author":"Chakrabarti K.","key":"e_1_2_1_6_1","unstructured":"Chakrabarti , K. and Mehrotra , S . 1999. The hybrid tree: An index structure for high dimensional feature spaces . In Proceedings of the International Conference on Data Engineering (ICDE'99) . 440--447. Chakrabarti, K. and Mehrotra, S. 1999. The hybrid tree: An index structure for high dimensional feature spaces. In Proceedings of the International Conference on Data Engineering (ICDE'99). 440--447."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502808"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the International Conference on Very Large Data Bases (VLDB'94)","author":"Chiueh T.","year":"1994","unstructured":"Chiueh , T. 1994 . Content-based image indexing . In Proceedings of the International Conference on Very Large Data Bases (VLDB'94) . 582--593. Chiueh, T. 1994. Content-based image indexing. In Proceedings of the International Conference on Very Large Data Bases (VLDB'94). 582--593."},{"volume-title":"Proceedings of the International Conference on Very Large Data Bases (VLDB'97)","author":"Ciaccia P.","key":"e_1_2_1_9_1","unstructured":"Ciaccia , P. , Patella , M. , and Zezula , P . 1997. M-tree: An efficient access method for similarity search in metric spaces . In Proceedings of the International Conference on Very Large Data Bases (VLDB'97) . 426--435. Ciaccia, P., Patella, M., and Zezula, P. 1997. M-tree: An efficient access method for similarity search in metric spaces. In Proceedings of the International Conference on Very Large Data Bases (VLDB'97). 426--435."},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Clement J. Flajolet P. and Vallee B. 2001. Dynamic sources in information theory: A general analysis of trie structures. Algorithm 29 1\/2 307--369.  Clement J. Flajolet P. and Vallee B. 2001. Dynamic sources in information theory: A general analysis of trie structures. Algorithm 29 1\/2 307--369.","DOI":"10.1007\/BF02679623"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025026030880"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/301970.301973"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/645483.656224"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253347"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.229202"},{"volume-title":"The Art of Computer Programming","author":"Knuth D. E.","key":"e_1_2_1_17_1","unstructured":"Knuth , D. E. 1973. The Art of Computer Programming , Vol. 3 . Addison-Wesley , Reading, MA . Knuth, D. E. 1973. The Art of Computer Programming, Vol. 3. Addison-Wesley, Reading, MA."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1125857.1125860"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/582318.582321"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223794"},{"volume-title":"Proceedings of Dateso 2004 Annual Internation Workshop on DAtabases, TExts, Specifications and Objects (DATESO'04)","author":"Skopal T.","key":"e_1_2_1_22_1","unstructured":"Skopal , T. , Pokorny , J. , and Snasel , V . 2004. PM-tree: Pivoting metric tree for similarity search in multimedia databases . In Proceedings of Dateso 2004 Annual Internation Workshop on DAtabases, TExts, Specifications and Objects (DATESO'04) . 27--37. Skopal, T., Pokorny, J., and Snasel, V. 2004. PM-tree: Pivoting metric tree for similarity search in multimedia databases. In Proceedings of Dateso 2004 Annual Internation Workshop on DAtabases, TExts, Specifications and Objects (DATESO'04). 27--37."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.991715"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90074-R"},{"volume-title":"Proceedings of the International Conference of Very Large Data Bases (VLDB'98)","author":"Weber R.","key":"e_1_2_1_25_1","unstructured":"Weber , R. , Schek , H.-J. , and Blott , S . 1998. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces . In Proceedings of the International Conference of Very Large Data Bases (VLDB'98) . 357--367. Weber, R., Schek, H.-J., and Blott, S. 1998. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proceedings of the International Conference of Very Large Data Bases (VLDB'98). 357--367."},{"volume-title":"Proceedings of the International Conference Data Engineering (ICDE'96)","author":"White D.","key":"e_1_2_1_26_1","unstructured":"White , D. and Jain , R . 1996. Similarity indexing with the SS-tree . In Proceedings of the International Conference Data Engineering (ICDE'96) . 516--523. White, D. and Jain, R. 1996. Similarity indexing with the SS-tree. In Proceedings of the International Conference Data Engineering (ICDE'96). 516--523."},{"key":"e_1_2_1_27_1","unstructured":"Xue Q. Qian G. Cole J. R. and Pramanik S. 2004. Investigation on approximate q-gram matching in genome sequence databases. Tech. Report Michigan State Univ.  Xue Q. Qian G. Cole J. R. and Pramanik S. 2004. Investigation on approximate q-gram matching in genome sequence databases. Tech. Report Michigan State Univ."},{"volume-title":"Proceedings of the the 14th Australasian Database Conference. 161--168","author":"Zhou X.","key":"e_1_2_1_28_1","unstructured":"Zhou , X. , Wang , G. , Yu , J. X. , and Yu , G . 2003. M&plus;-tree: A new dynamical multidimensional index for metric spaces . In Proceedings of the the 14th Australasian Database Conference. 161--168 . Zhou, X., Wang, G., Yu, J. X., and Yu, G. 2003. M&plus;-tree: A new dynamical multidimensional index for metric spaces. In Proceedings of the the 14th Australasian Database Conference. 161--168."}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1138394.1138395","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1138394.1138395","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:18:41Z","timestamp":1750263521000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1138394.1138395"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["10.1145\/1138394.1138395"],"URL":"https:\/\/doi.org\/10.1145\/1138394.1138395","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"type":"print","value":"0362-5915"},{"type":"electronic","value":"1557-4644"}],"subject":[],"published":{"date-parts":[[2006,6]]},"assertion":[{"value":"2006-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}