{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:50:12Z","timestamp":1725573012824},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253341"},{"type":"electronic","value":"9783540320050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11408079_35","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T20:38:10Z","timestamp":1292877490000},"page":"385-397","source":"Crossref","is-referenced-by-count":3,"title":["A New Indexing Method for High Dimensional Dataset"],"prefix":"10.1007","author":[{"given":"Jiyuan","family":"An","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi-Ping Phoebe","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinying","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"An, J., Chen, H., Furuse, K., Ishikawa, M.: The convex polyhedra technique: An index structure for high-dimensional space. In: Proc. of the 13th Australasian Database Conference, pp. 33\u201340 (2002)"},{"key":"35_CR2","unstructured":"An, J., Chen, H., Furuse, K., Ohbo, N.: CVA-file: An Index Structure for High-Dimensional Datasets. Journal of knowledge and Information Systems (to appear)"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Beyer, K.S., Goldstein, J., Ramakrishnan, R., Shaft, U.: When Is \"Nearest Neighbor\" Meaningful. When Is \"Nearest Neighbor\" Meaningful, 217\u2013235 (1999)","DOI":"10.1007\/3-540-49257-7_15"},{"key":"35_CR4","unstructured":"Berchtold, S., Keim, D., Kriegel, H.-P.: The X-tree: An Index Structure for High-Dimensional Data. In: 22nd Conf. on Very Large Database, Bombay, India, pp. 28\u201339 (1996)"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Berchtold, S., Keim, D., Kriegel, H.-P.: The pyramid-Technique: Towards Breaking the Curse of Dimensional Data Spaces. In: Proc. ACM SIGMOD Int. Conf. Managment of Data, Seattle, pp. 142\u2013153 (1998)","DOI":"10.1145\/276305.276318"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, P.H., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree:An Efficient Access Method for Similarity Seach in Metric Spaces. In: Proc. 23rd Int. Conf. on Very Large Data Bases, Athens, Greece, pp. 426\u2013435 (1997)","DOI":"10.1145\/275487.275495"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-tree: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"35_CR9","unstructured":"Hellerstein, J.M., Naughton, J.F., Pfefer, A.: Generalized search trees for database systems. In: Proc. of the 21th VLDB conference, Zurich, Switzerland, September 1995, pp. 562\u2013573 (1995)"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Katayama, N., Satoh, S.: The SR-tree: An index structure for high-dimensional nearest neighbour queries. In: Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, pp. 369\u2013380 (1997)","DOI":"10.1145\/253260.253347"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Ooi, B.C., Tan, K.L., Yu, C., Bressan, S.: Indexing the Edges - A Simple and Yet Efficient Approach to High-Dimensional Indexing. In: PODS 2000, pp. 166\u2013174 (2000)","DOI":"10.1145\/335168.335219"},{"key":"35_CR12","unstructured":"Weber, R., Schek, J.H., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proceedings of 24th International Conference on Very Large Data Bases, pp. 194\u2013205 (1998)"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Zhang, R., Ooi, B.C., Tan, K.L.: Making the Pyramid Technique Robust to Query Types and Workloads. In: ICDE 2004, pp. 313\u2013324 (2004)","DOI":"10.1109\/ICDE.2004.1320007"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11408079_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T05:18:06Z","timestamp":1712035086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11408079_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253341","9783540320050"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11408079_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}