{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:04:32Z","timestamp":1648616672118},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,3,1]],"date-time":"2007-03-01T00:00:00Z","timestamp":1172707200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comput Sci Technol"],"published-print":{"date-parts":[[2007,3]]},"DOI":"10.1007\/s11390-007-9027-5","type":"journal-article","created":{"date-parts":[[2007,4,18]],"date-time":"2007-04-18T14:54:08Z","timestamp":1176908048000},"page":"208-217","source":"Crossref","is-referenced-by-count":2,"title":["Composite Distance Transformation for Indexing and k-Nearest-Neighbor Searching in High-Dimensional Spaces"],"prefix":"10.1007","volume":"22","author":[{"given":"Yi","family":"Zhuang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue-Ting","family":"Zhuang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,4,17]]},"reference":[{"issue":"33","key":"9027_CR1","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"Christian B\u00f6hm","year":"2001","unstructured":"Christian B\u00f6hm, Stefan Berchtold, Daniel Keim. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Surveys, 2001, 33(3): 322\u2013373.","journal-title":"ACM Computing Surveys"},{"key":"9027_CR2","doi-asserted-by":"crossref","unstructured":"Guttman A. R-tree: A dynamic index structure for spatial searching. In Proc. the ACM SIGMOD Int. Conf. Management Data, Boston, USA, 1984, pp. 47\u201354.","DOI":"10.1145\/971697.602266"},{"key":"9027_CR3","doi-asserted-by":"crossref","unstructured":"Beckmann N, Kriegel H-P, Schneider R, Seeger B. The R *-tree: An efficient and robust access method for points and rectangles. In Proc. ACM SIGMOD Int. Conf. Management Data, Atlantic, USA, 1990, pp. 322\u2013331.","DOI":"10.1145\/93597.98741"},{"key":"9027_CR4","unstructured":"Berchtold S, Keim D A, Kriegel H P. The X-tree: An index structure for high-dimensional data. In Proc. 22nd Int. Conf. Very Large Data Bases, India, 1996, pp. 28\u201337."},{"key":"9027_CR5","doi-asserted-by":"crossref","unstructured":"Katamaya N, Satoh S. The SR-tree: An index structure for high-dimensional nearest neighbor queries. In Proc. ACM SIGMOD Int. Conf. Management of Data, Arizona, USA, 1997, pp. 32\u201342.","DOI":"10.1145\/253260.253347"},{"key":"9027_CR6","unstructured":"Weber R, Schek H, Blott S. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proc. 24th Int. Conf. Very Large Data Bases, New York, USA, 1998, pp. 194\u2013205."},{"key":"9027_CR7","doi-asserted-by":"crossref","unstructured":"Berchtold S, Bohm C, Kriegel H P et al. Independent quantization: An index compression technique for high-dimensional data spaces. In Proc. 16th Int. Conf. Data Engineering, San Diego, USA, 2000, pp. 577\u2013588.","DOI":"10.1109\/ICDE.2000.839456"},{"key":"9027_CR8","doi-asserted-by":"crossref","unstructured":"Fonseca M J, Jorge J A. Indexing high-dimensional data for content-based retrieval in large databases. In Proc. the 8th Int. Conf. Database Systems for Advanced Applications, Kyoto, Japan, 2003, pp. 267\u2013274.","DOI":"10.1109\/DASFAA.2003.1192391"},{"issue":"2","key":"9027_CR9","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"H V Jagadish","year":"2005","unstructured":"Jagadish H V, Ooi B C, Tan K L et al. iDistance: An adaptive B+-tree based indexing method for nearest neighbor search. ACM Trans. Data Base Systems, 2005, 30(2): 364\u2013397.","journal-title":"ACM Trans. Data Base Systems"},{"key":"9027_CR10","unstructured":"The UCI KDD Archive. http:\/\/www.kdd.ics.uci.edu , 2002."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9027-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-007-9027-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9027-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:32:38Z","timestamp":1559385158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-007-9027-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,3]]}},"alternative-id":["9027"],"URL":"https:\/\/doi.org\/10.1007\/s11390-007-9027-5","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3]]}}}