{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:23:37Z","timestamp":1725578617947},"publisher-location":"Berlin, Heidelberg","reference-count":10,"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_10","type":"book-chapter","created":{"date-parts":[[2011,3,9]],"date-time":"2011-03-09T02:53:17Z","timestamp":1299639197000},"page":"115-120","source":"Crossref","is-referenced-by-count":0,"title":["The Rank Join Problem"],"prefix":"10.1007","author":[{"given":"Neoklis","family":"Polyzotis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, P., Widom, J.: Confidence-aware join algorithms. In: International Conference on Data Engineering, pp. 628\u2013639 (2009)","DOI":"10.1109\/ICDE.2009.141"},{"issue":"1","key":"10_CR2","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.\u00a0Comput. Syst. Sci.\u00a058(1), 83\u201399 (1999)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"issue":"4","key":"10_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.\u00a0Comput. Syst. Sci.\u00a066(4), 614\u2013656 (2003)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Finger, J., Polyzotis, N.: Robust and efficient algorithms for rank join evaluation. In: Proceedings of SIGMOD (2009)","DOI":"10.1145\/1559845.1559890"},{"issue":"3","key":"10_CR5","first-page":"207","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. International Journal on Very Large Databases (VLDBJ)\u00a013(3), 207\u2013221 (2004)","journal-title":"International Journal on Very Large Databases (VLDBJ)"},{"key":"10_CR6","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, pp. 131\u2013142 (2005)","DOI":"10.1145\/1066157.1066173"},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1272743.1272749","volume":"32","author":"N. Mamoulis","year":"2007","unstructured":"Mamoulis, N., Yiu, M.L., Cheng, K.H., Cheung, D.W.: Efficient top-k aggregation of ranked inputs. ACM Transactions on Database Systems\u00a032(3), 19 (2007)","journal-title":"ACM Transactions on Database Systems"},{"key":"10_CR8","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, pp. 281\u2013290 (2001)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Schnaitter, K., Polyzotis, N.: Evaluating rank joins with optimal cost. In: Proceedings of the 27th Symposium on Principles of Database Systems, pp. 43\u201352 (2008)","DOI":"10.1145\/1376916.1376924"},{"key":"10_CR10","unstructured":"Schnaitter, K., Spiegel, J., Polyzotis, N.: Depth estimation for ranking query optimization. In: Proceedings of VLDB, pp. 902\u2013913 (2007)"}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:17:51Z","timestamp":1558419471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19668-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642196676","9783642196683"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19668-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}