{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:34:46Z","timestamp":1725471286745},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359692"},{"type":"electronic","value":"9783540359715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11788911_14","type":"book-chapter","created":{"date-parts":[[2006,9,25]],"date-time":"2006-09-25T09:15:34Z","timestamp":1159175734000},"page":"164-176","source":"Crossref","is-referenced-by-count":0,"title":["SC-Tree: An Efficient Structure for High-Dimensional Data Indexing"],"prefix":"10.1007","author":[{"given":"Ben","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John Q.","family":"Gan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Procopiuc, C., Wolf, J.L., Yu, P.S., Park, J.S.: Fast algorithms for projected clustering. In: Proc. of the ACM SIGMOD Conference, Philadelphia, USA, pp. 61\u201372 (1999)","DOI":"10.1145\/304182.304188"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Bartolini, I., Ciaccia, P., Patella, M.: String matching with metric trees using an approximate distance. In: Proc. of the 9th Int. Symposium on String Processing and Information Retrieval (SPIRE), Lisbon, Portugal, pp. 271\u2013283 (2002)","DOI":"10.1007\/3-540-45735-6_24"},{"key":"14_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. of the 1990 ACM SIGMOD International Conference on Management of Data, Atlantic City, NJ, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"14_CR4","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.P.: The X-tree: An index structure for high-dimensional data. In: Proc. 22nd Int. Conference on Very Large DataBases (VLDB), Bombay, India, pp. 28\u201339 (1996)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Bozkaya, T., Ozsoyoglu, M.: Distance-based indexing for high-dimensional metric spaces. In: Proc. of ACM SIGMOD, Tucson, USA, pp. 357\u2013368 (1997)","DOI":"10.1145\/253260.253345"},{"key":"14_CR6","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: Proc. 21st Int. Conference on Very Large DataBases (VLDB), San Francisco, USA, pp. 574\u2013584 (1995)"},{"key":"14_CR7","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: Proc. Int. Conference of VLDB, Athens, Greece, pp. 522\u2013525 (1997)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BFb0100974","volume-title":"Advances in Database Technology - EDBT \u201998","author":"P. Ciaccia","year":"1998","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: Processing complex similarity queries with distance-based access methods. In: Schek, H.-J., Saltor, F., Ramos, I., Alonso, G. (eds.) EDBT 1998. LNCS, vol.\u00a01377, pp. 9\u201313. Springer, Heidelberg (1998)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Ciaccia, P., Patella, M.: PAC nearest neighbor queries: Approximate and controlled search in high-dimensional and metric spaces. In: Proc. of the 16th Int. Conference on Data Engineering (ICDE), California, USA, pp. 244\u2013255 (2000)","DOI":"10.1109\/ICDE.2000.839417"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/582410.582412","volume":"27","author":"P. Ciaccia","year":"2002","unstructured":"Ciaccia, P., Patella, M.: Searching in metric spaces with user-defined and approximate distances. ACM Transactions on Database Systems\u00a027, 398\u2013437 (2002)","journal-title":"ACM Transactions on Database Systems"},{"key":"14_CR11","unstructured":"Ciaccia, P., Nanni, A., Patella, M.: A query-sensitive cost model for similarity queries with M-tree. In: Proc. of the 10th Australasian Database Conference (ADC), New Zealand, pp. 65\u201376 (1999)"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"R. Finkel","year":"1974","unstructured":"Finkel, R., Bentley, J.: Quad-trees: A data structure for retrieval on composite keys. ACTA Informatica\u00a04, 1\u20139 (1974)","journal-title":"ACTA Informatica"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. of ACM SIGMOD, Boston, USA, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"14_CR14","unstructured":"Heisterkamp, D.R., Peng, J.: A kernel vector approximation file for nearest neighbor search using kernel methods. In: Proc. of the 6th Kernel Machines Workshop at Neural Information Processing Systems Conference, Whistler, Canada, pp. 1\u201312 (2002)"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1109\/34.955110","volume":"23","author":"J. McNames","year":"2001","unstructured":"McNames, J.: A fast nearest neighbor algorithm based on a principal axis search tree. IEEE Transactions on Pattern Analysis and Intelligence\u00a023, 964\u2013976 (2001)","journal-title":"IEEE Transactions on Pattern Analysis and Intelligence"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"Nievergelt, J., Hinterberger, H., Sevcik, K.C.: The grid file: An adaptable, symmetric multikey file structure. ACM Trans. on Database Systems\u00a09, 38\u201371 (1984)","journal-title":"ACM Trans. on Database Systems"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Robinson, J.: The KDB-tree: A search structure for large multidimensional dynamic indexes. In: Proc. of the ACM SIGMOD Int. Conference on Management of Data, Ann Arbor, Michigan, pp. 10\u201318 (1981)","DOI":"10.1145\/582318.582321"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J.K. Uhlmann","year":"1991","unstructured":"Uhlmann, J.K.: Satisfying general proximity\/similarity queries with metric trees. Information Processing Letters\u00a040, 175\u2013179 (1991)","journal-title":"Information Processing Letters"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s007780050069","volume":"7","author":"P. Zezula","year":"1998","unstructured":"Zezula, P., Savino, P., Amato, G., Rabitti, F.: Approximate similarity retrieval with M-trees. VLDB Journal\u00a07, 275\u2013293 (1998)","journal-title":"VLDB Journal"}],"container-title":["Lecture Notes in Computer Science","Flexible and Efficient Information Handling"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11788911_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:09:50Z","timestamp":1605643790000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11788911_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359692","9783540359715"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11788911_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}