{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T19:59:53Z","timestamp":1725911993669},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319684734"},{"type":"electronic","value":"9783319684741"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68474-1_1","type":"book-chapter","created":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T11:15:48Z","timestamp":1506510948000},"page":"3-16","source":"Crossref","is-referenced-by-count":1,"title":["The Power of Distance Distributions: Cost Models and Scheduling Policies for Quality-Controlled Similarity Queries"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Ciaccia","sequence":"first","affiliation":[]},{"given":"Marco","family":"Patella","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,28]]},"reference":[{"issue":"6","key":"1_CR1","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya, S., Mount, D.M., et al.: An optimal algorithm for approximate nearest neighbor searching. JACM 45(6), 891\u2013923 (1998)","journal-title":"JACM"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Berchtold, S., B\u00f6hm, C., et al.: A cost model for nearest neighbor search in high-dimensional data space. In: Proceedings of PODS 1997, Tucson, AZ, pp. 78\u201386 (1997)","DOI":"10.1145\/263661.263671"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Bennett, K.P., Fayyad, U.M., Geiger, D.: Density-based indexing for approximate nearest-neighbor queries. In: Proceedings of KDD 1999, San Diego, CA, pp. 233\u2013243 (1999)","DOI":"10.1145\/312129.312236"},{"issue":"1","key":"1_CR4","first-page":"115","volume":"2","author":"B Bustos","year":"2004","unstructured":"Bustos, B., Navarro, G.: Probabilistic proximity searching algorithms based on compact partitions. JDA 2(1), 115\u2013134 (2004)","journal-title":"JDA"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ding, B., Kandula, S.: Approximate query processing: no silver bullet. In: Proceedings of SIGMOD 2017, Chicago, IL (2017, to appear)","DOI":"10.1145\/3035918.3056097"},{"issue":"3","key":"1_CR6","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., et al.: Proximity searching in metric spaces. ACM Comp. Sur. 33(3), 273\u2013321 (2001)","journal-title":"ACM Comp. Sur."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Ciaccia, P., Patella, M.: PAC nearest neighbor queries: approximate and controlled search in high-dimensional and metric spaces. In: Proceedings of ICDE 2000, San Diego, CA, pp. 244\u2013255 (2000)","DOI":"10.1109\/ICDE.2000.839417"},{"issue":"2","key":"1_CR8","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/1862413.1862418","volume":"2","author":"P Ciaccia","year":"2010","unstructured":"Ciaccia, P., Patella, M.: Approximate and probabilistic methods. SIGSPATIAL Spec. 2(2), 16\u201319 (2010)","journal-title":"SIGSPATIAL Spec."},{"key":"1_CR9","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: an efficient access method for similarity search in metric spaces. In: Proceedings of VLDB 1997, Athens, Greece, pp. 426\u2013435 (1997)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: A cost model for similarity queries in metric spaces. In: Proceedings of PODS 1998, Seattle, WA, pp. 59\u201368 (1998)","DOI":"10.1145\/275487.275495"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Haas, P.J., Hellerstein, J.M.: Ripple joins for online aggregation. In: Proceedings of SIGMOD 1999, New York, NY, pp. 287\u2013298 (1999)","DOI":"10.1145\/304182.304208"},{"key":"1_CR12","unstructured":"Hellerstein, J.M., Naughton, J.F., Pfeffer, A.: Generalized search trees for database systems. In: Proceedings of VLDB 1995, Zurich, Switzerland, pp. 562\u2013573 (1995)"},{"issue":"4","key":"1_CR13","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/958942.958948","volume":"28","author":"GR Hjaltason","year":"2003","unstructured":"Hjaltason, G.R., Samet, H.: Index-driven similarity search in metric spaces. ACM TODS 28(4), 517\u2013580 (2003)","journal-title":"ACM TODS"},{"issue":"1","key":"1_CR14","first-page":"36","volume":"7","author":"M Patella","year":"2009","unstructured":"Patella, M., Ciaccia, P.: Approximate similarity search: a multi-faceted problem. JDA 7(1), 36\u201348 (2009)","journal-title":"JDA"},{"key":"1_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-29151-2","volume-title":"Similarity Search: The Metric Space Approach","author":"P Zezula","year":"2006","unstructured":"Zezula, P., Amato, G., et al.: Similarity Search: The Metric Space Approach. Springer, Heidelberg (2006)"},{"issue":"4","key":"1_CR16","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s007780050069","volume":"7","author":"P Zezula","year":"1998","unstructured":"Zezula, P., Savino, P., et al.: Approximate similarity retrieval with M-trees. VLDBJ 7(4), 275\u2013293 (1998)","journal-title":"VLDBJ"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68474-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T21:15:34Z","timestamp":1570137334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68474-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319684734","9783319684741"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68474-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}