{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:23:36Z","timestamp":1725578616868},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642196676"},{"type":"electronic","value":"9783642196683"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19668-3_11","type":"book-chapter","created":{"date-parts":[[2011,3,9]],"date-time":"2011-03-09T02:53:17Z","timestamp":1299639197000},"page":"121-127","source":"Crossref","is-referenced-by-count":0,"title":["Proximity Rank Join in Search Computing"],"prefix":"10.1007","author":[{"given":"Davide","family":"Martinenghi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Tagliasacchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"11_CR1","first-page":"326","volume":"1","author":"G. Beskales","year":"2008","unstructured":"Beskales, G., Soliman, M.A., Ilyas, I.F.: Efficient search for the top-k probable nearest neighbors in uncertain databases. PVLDB\u00a01(1), 326\u2013339 (2008)","journal-title":"PVLDB"},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.datak.2003.08.007","volume":"49","author":"A. Corral","year":"2004","unstructured":"Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Algorithms for processing k-closest-pair queries in spatial databases. Data Knowl. Eng.\u00a049(1), 67\u2013104 (2004)","journal-title":"Data Knowl. Eng."},{"issue":"4","key":"11_CR3","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/S0022-0000(03)00026-6","volume":"66","author":"R. Fagin","year":"2003","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci.\u00a066(4), 614\u2013656 (2003)","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"crossref","unstructured":"Finger, J., Polyzotis, N.: Robust and efficient algorithms for rank join evaluation. In: SIGMOD Conference, pp. 415\u2013428 (2009)","key":"11_CR4","DOI":"10.1145\/1559845.1559890"},{"doi-asserted-by":"crossref","unstructured":"Hjaltason, G.R., Samet, H.: Incremental distance join algorithms for spatial databases. In: SIGMOD Conference, pp. 237\u2013248 (1998)","key":"11_CR5","DOI":"10.1145\/276305.276326"},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s00778-004-0128-2","volume":"13","author":"I.F. Ilyas","year":"2004","unstructured":"Ilyas, I.F., Aref, W.G., Elmagarmid, A.K.: Supporting top-k join queries in relational databases. VLDB J.\u00a013(3), 207\u2013221 (2004)","journal-title":"VLDB J."},{"doi-asserted-by":"crossref","unstructured":"Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top- query processing techniques in relational database systems. ACM Comput. Surv.\u00a040(4) (2008)","key":"11_CR7","DOI":"10.1145\/1391729.1391730"},{"doi-asserted-by":"crossref","unstructured":"Mamoulis, N., Theodoridis, Y., Papadias, D.: Spatial joins: Algorithms, cost models and optimization techniques. In: Spatial Databases, pp. 155\u2013184 (2005)","key":"11_CR8","DOI":"10.4018\/978-1-59140-387-6.ch007"},{"issue":"1","key":"11_CR9","first-page":"352","volume":"3","author":"D. Martinenghi","year":"2010","unstructured":"Martinenghi, D., Tagliasacchi, M.: Proximity rank join. PVLDB\u00a03(1), 352\u2013363 (2010)","journal-title":"PVLDB"},{"issue":"3","key":"11_CR10","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1093\/comjnl\/bxl002","volume":"49","author":"A.N. Papadopoulos","year":"2006","unstructured":"Papadopoulos, A.N., Nanopoulos, A., Manolopoulos, Y.: Processing distance join queries with constraints. Comput. J.\u00a049(3), 281\u2013296 (2006)","journal-title":"Comput. J."},{"doi-asserted-by":"crossref","unstructured":"Schnaitter, K., Polyzotis, N.: Evaluating rank joins with optimal cost. In: PODS, pp. 43\u201352 (2008)","key":"11_CR11","DOI":"10.1145\/1376916.1376924"},{"unstructured":"Schnaitter, K., Spiegel, J., Polyzotis, N.: Depth estimation for ranking query optimization. In: VLDB, pp. 902\u2013913 (2007)","key":"11_CR12"},{"doi-asserted-by":"crossref","unstructured":"Silva, Y.N., Aref, W.G., Ali, M.H.: The similarity join database operator. In: ICDE (2010)","key":"11_CR13","DOI":"10.1109\/ICDE.2010.5447873"},{"doi-asserted-by":"crossref","unstructured":"Thonangi, R., He, H., Doan, A., Wang, H., Yang, J.: Weighted proximity best-joins for information retrieval. In: ICDE, pp. 234\u2013245 (2009)","key":"11_CR14","DOI":"10.1109\/ICDE.2009.61"}],"container-title":["Lecture Notes in Computer Science","Search Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19668-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T05:56:36Z","timestamp":1558418196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19668-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642196676","9783642196683"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19668-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}