{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:23:29Z","timestamp":1725549809092},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642123092"},{"type":"electronic","value":"9783642123108"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-12310-8_11","type":"book-chapter","created":{"date-parts":[[2010,3,15]],"date-time":"2010-03-15T02:50:31Z","timestamp":1268621431000},"page":"211-224","source":"Crossref","is-referenced-by-count":2,"title":["Chapter 11: Rank-Join Algorithms for Search Computing"],"prefix":"10.1007","author":[{"given":"Ihab F.","family":"Ilyas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davide","family":"Martinenghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Tagliasacchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"11_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/568518.568519","volume":"27","author":"N. Bruno","year":"2002","unstructured":"Bruno, N., Chaudhuri, S., Gravano, L.: Top-k selection queries over relational databases: Mapping strategies and performance evaluation. ACM Transactions on Database Systems\u00a027(2), 153\u2013187 (2002)","journal-title":"ACM Transactions on Database Systems"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Bruno, N., Gravano, L., Marian, A.: Evaluating Top-k Queries over Web-Accessible Databases. In: Proceedings of ICDE 2002, pp. 369\u2013378 (2002)","DOI":"10.1109\/ICDE.2002.994751"},{"issue":"1","key":"11_CR3","first-page":"614","volume":"1","author":"R. Fagin","year":"2001","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. Journal of Computer and System Science\u00a01(1), 614\u2013656 (2001)","journal-title":"Journal of Computer and System Science"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Koudas, N., Papakonstantinou, Y.: PREFER: A System for the Efficient Execution of Multi-parametric Ranked Queries. In: Proceedings of ACM SIGMOD 2001, pp. 259\u2013270 (2001)","DOI":"10.1145\/375663.375690"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00778-003-0099-8","volume":"13","author":"V. Hristidis","year":"2004","unstructured":"Hristidis, V., Papakonstantinou, Y.: Algorithms and applications for answering ranked queries using ranked views. VLDB Journal\u00a013(1), 49\u201370 (2004)","journal-title":"VLDB Journal"},{"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 Journal\u00a013(3), 207\u2013221 (2004)","journal-title":"VLDB Journal"},{"issue":"4","key":"11_CR7","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1145\/1189769.1189772","volume":"31","author":"I.F. Ilyas","year":"2006","unstructured":"Ilyas, I.F., Aref, W.G., Elmagarmid, A.K., Elmongui, H.G., Shah, R., Vitter, J.S.: Adaptive rank-aware query optimization in relational databases. ACM Transactions on Database Systems\u00a031(4), 1257\u20131304 (2006)","journal-title":"ACM Transactions on Database Systems"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Ilyas, I.F., Shah, R., Aref, W.G., Vitter, J.S., Elmagarmid, A.K.: Rank-aware query optimization. In: Proceedings of ACM SIGMOD 2004, pp. 203\u2013214 (2004)","DOI":"10.1145\/1007568.1007593"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Li, C., Chang, K.C.-C., Ilyas, I.F., Song, S.: RankSQL: query algebra and optimization for relational top-k queries. In: Proceedings of ACM SIGMOD 2005, pp. 131\u2013142 (2005)","DOI":"10.1145\/1066157.1066173"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1145\/1005566.1005569","volume":"29","author":"A. Marian","year":"2004","unstructured":"Marian, A., Bruno, N., Gravano, L.: Evaluating top-k queries over web-accessible databases. ACM Transactions on Database Systems\u00a029(2), 319\u2013362 (2004)","journal-title":"ACM Transactions on Database Systems"},{"key":"11_CR11","unstructured":"Natsev, A., Chang, Y.-C., Smith, J.R., Li, C.-S., Vitter, J.S.: Supporting Incremental Join Queries on Ranked Inputs. In: Proceedings of VLDB 2001, pp. 281\u2013290 (2001)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Schnaitter, K., Polyzotis, N.: Evaluating rank joins with optimal cost. In: Proceedings of PODS 2008, pp. 43\u201352 (2008)","DOI":"10.1145\/1376916.1376924"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Tsaparas, P., Palpanas, T., Kotidis, Y., Koudas, N., Srivastava, D.: Ranked Join Indices. In: Proceedings of ICDE 2003, pp. 277\u2013286 (2003)","DOI":"10.1109\/ICDE.2003.1260799"},{"key":"11_CR14","unstructured":"Schnaitter, K., Spiegel, J., Polyzotis, N.: Depth estimation for ranking query optimization. In: Proceedings of VLDB 2007, pp. 902\u2013913 (2007)"},{"key":"11_CR15","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)","DOI":"10.1145\/1391729.1391730"},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1006\/jcss.1998.1600","volume":"58","author":"R. Fagin","year":"1999","unstructured":"Fagin, R.: Combining Fuzzy Information from Multiple Systems. J. Comput. Syst. Sci.\u00a058(1), 83\u201399 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Clough, P., Sanderson, M., Abouammoh, M., Navarro, S., Lestari Paramita, M.: Multiple approaches to analysing query diversity. In: Proceedings of ACM SIGIR 2009, pp. 734\u2013735 (2009)","DOI":"10.1145\/1571941.1572102"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Gollapudi, S., Sharma, A.: An axiomatic approach for result diversification. In: Proceedings of WWW 2009, pp. 381\u2013390 (2009)","DOI":"10.1145\/1526709.1526761"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gollapudi, S., Halverson, A., Ieong, S.: Diversifying search results. In: Proceedings of WSDM 2009, pp. 5\u201314 (2009)","DOI":"10.1145\/1498759.1498766"}],"container-title":["Lecture Notes in Computer Science","Search Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12310-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T20:12:37Z","timestamp":1552421557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12310-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642123092","9783642123108"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12310-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}