{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T07:54:22Z","timestamp":1761292462061},"reference-count":25,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780127224428"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1016\/b978-012722442-8\/50061-6","type":"book-chapter","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T12:42:39Z","timestamp":1188909759000},"page":"620-631","source":"Crossref","is-referenced-by-count":10,"title":["The ND-Tree"],"prefix":"10.1016","author":[{"given":"Gang","family":"Qian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sakti","family":"Pramanik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/B978-012722442-8\/50061-6_bib1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/320521.320530","article-title":"Prefix B-trees","volume":"2","author":"Bayer","year":"1977","journal-title":"ACM TODS"},{"key":"10.1016\/B978-012722442-8\/50061-6_bib2","series-title":"Proc. of VLDB","first-page":"28","article-title":"The X-tree: an index structure for high-dimensional data","author":"Berchtold","year":"1996"},{"key":"10.1016\/B978-012722442-8\/50061-6_bib3","series-title":"Proc. of ACM SIGMOD","first-page":"322","article-title":"The R*-tree: an efficient and robust access method for points and rectangles","author":"Beckmann","year":"1990"},{"key":"10.1016\/B978-012722442-8\/50061-6_bib4","series-title":"Proc. of ACM SIGMOD","first-page":"357","article-title":"Distance-based indexing for high-dimensional metric spaces","author":"Bozkaya","year":"1997"},{"key":"10.1016\/B978-012722442-8\/50061-6_bib5","series-title":"Proc. of VLDB","first-page":"574","article-title":"Near neighbor search in large metric spaces","author":"Brin","year":"1995"},{"key":"10.1016\/B978-012722442-8\/50061-6_bib6","series-title":"Proc. of IEEE Computer Society Conference on Computer Vision and Pattern Recognition","first-page":"353","article-title":"FLASH: a fast look-up algorithm for string homology","author":"Califano","year":"1993"},{"key":"10.1016\/B978-012722442-8\/50061-6_bib7","series-title":"Proc. of IEEE ICDE","first-page":"440","article-title":"The Hybrid Tree: an index structure for high dimensional feature spaces","author":"Chakrabarti","year":"1999"},{"key":"10.1016\/B978-012722442-8\/50061-6_bib8","series-title":"Proc. of Int't Workshop on DEXA","first-page":"148","article-title":"Efficient querying on genomic databases by using metric space indexing techniques (extended abstract)","author":"Chen","year":"1997"},{"key":"10.1016\/B978-012722442-8\/50061-6_bib9","series-title":"Proc. of VLDB","first-page":"582","article-title":"Content-based image indexing","author":"Chiueh","year":"1994"},{"key":"10.1016\/B978-012722442-8\/50061-6_bib10","series-title":"Proc. of VLDB","first-page":"426","article-title":"M-tree: an efficient access method for similarity search in metric spaces","author":"Ciaccia","year":"1997"},{"issue":"1\/2","key":"10.1016\/B978-012722442-8\/50061-6_bib11","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02679623","article-title":"Dynamic sources in information theory: a general analysis of trie structures","volume":"29","author":"Clement","year":"2001","journal-title":"Algorithmica"},{"key":"10.1016\/B978-012722442-8\/50061-6_bib12","series-title":"Proc. of ACM SIGMOD","first-page":"163","article-title":"FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets","author":"Faloutsos","year":"1995"},{"issue":"2","key":"10.1016\/B978-012722442-8\/50061-6_bib13","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/301970.301973","article-title":"The String B-tree: a new data structure for string search in external memory and its applications","volume":"46","author":"Ferragina","year":"1999","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/B978-012722442-8\/50061-6_bib14","first-page":"273","article-title":"A rapid access motif database (RAMdb) with a search algorithm for the retrieval patterns in nucleic acids or protein databanks","volume":"11","author":"Fondrat","year":"1995","journal-title":"Computer Applications Biosciences"},{"key":"10.1016\/B978-012722442-8\/50061-6_bib15","series-title":"Proc. of ACM SIGMOD","first-page":"47","article-title":"R-trees: a dynamic index structure for spatial searching","author":"Guttman","year":"1984"},{"key":"10.1016\/B978-012722442-8\/50061-6_bib16","series-title":"Proc. of IEEE ICDE","first-page":"362","article-title":"The LSDh-tree: an access structure for feature vectors","author":"Henrich","year":"1998"},{"key":"10.1016\/B978-012722442-8\/50061-6_bib17","series-title":"Proc. of ACM SIGMOD","first-page":"369","article-title":"The SR-tree: an index structure for high-dimensional nearest neighbor queries","author":"Katayama","year":"1997"},{"key":"10.1016\/B978-012722442-8\/50061-6_bib18","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1101\/gr.229202. Article published online before March 2002","article-title":"BLAT \u2014 the BLAST-like aligment tool","volume":"12","author":"Kent","year":"2002","journal-title":"Genome Research"},{"key":"10.1016\/B978-012722442-8\/50061-6_bib19","article-title":"Efficient similarity search based on data distribution properties in high dimension","author":"Li","year":"2001","journal-title":"Ph.D. Dissertation, Michigan State University"},{"key":"10.1016\/B978-012722442-8\/50061-6_bib20","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/BF02459502","article-title":"Searching the protein database","volume":"46","author":"Orcutt","year":"1984","journal-title":"Bulletin of Math. Biology"},{"key":"10.1016\/B978-012722442-8\/50061-6_bib21","series-title":"Proc. of ACM SIGMOD","first-page":"10","article-title":"The K-D-B-Tree: a search structure for large multidimensional dynamic indexes","author":"Robinson","year":"1981"},{"key":"10.1016\/B978-012722442-8\/50061-6_bib22","first-page":"175","article-title":"Satisfying general proximity\/similarity queries with metric trees","volume":"40","author":"Uhlmann","year":"1991"},{"key":"10.1016\/B978-012722442-8\/50061-6_bib23","series-title":"Proc. of VLDB","first-page":"357","article-title":"A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces","author":"Weber","year":"1998"},{"key":"10.1016\/B978-012722442-8\/50061-6_bib24","series-title":"Proc. of IEEE ICDE","first-page":"516","article-title":"Similarity indexing with the SS-tree","author":"White","year":"1996"},{"issue":"1","key":"10.1016\/B978-012722442-8\/50061-6_bib25","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/69.979973","article-title":"Indexing and retrival for genomic databases","volume":"14","author":"Williams","year":"2002","journal-title":"IEEE Trans. on Knowl. and Data Eng."}],"container-title":["Proceedings 2003 VLDB Conference"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,1,4]],"date-time":"2019-01-04T21:22:23Z","timestamp":1546636943000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780127224428500616"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9780127224428"],"references-count":25,"URL":"https:\/\/doi.org\/10.1016\/b978-012722442-8\/50061-6","relation":{},"subject":[],"published":{"date-parts":[[2003]]}}}