{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T15:28:08Z","timestamp":1794583688978,"version":"4.9.1"},"publisher-location":"New York, NY","reference-count":10,"publisher":"Springer New York","isbn-type":[{"value":"9781461482666","type":"print"},{"value":"9781461482659","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-1-4614-8265-9_80680","type":"book-chapter","created":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T06:56:50Z","timestamp":1544079410000},"page":"3080-3084","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rank-Aware Query Processing"],"prefix":"10.1007","author":[{"given":"Ihab F.","family":"Ilyas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"issue":"2","key":"80680_CR1818","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/565117.565143","volume":"31","author":"R Fagin","year":"2002","unstructured":"Fagin R. Combining fuzzy information: an overview. ACM SIGMOD Rec. 2002;31(2):109\u201318.","journal-title":"ACM SIGMOD Rec"},{"issue":"4","key":"80680_CR1819","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. 2003;66(4):614\u201356.","journal-title":"J Comput Syst Sci"},{"key":"80680_CR1820","doi-asserted-by":"crossref","unstructured":"Finger J, Polyzotis N. Robust and efficient algorithms for rank join evaluation. In: Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data; 2009. p. 415\u201328.","DOI":"10.1145\/1559845.1559890"},{"key":"80680_CR1821","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/B978-155860869-6\/50094-9","volume-title":"VLDB '02: Proceedings of the 28th International Conference on Very Large Databases","author":"Ihab F. Ilyas","year":"2002","unstructured":"Ilyas IF, Aref WG, Elmagarmid AK. Joining ranked inputs in practice. In: Proceedings of the 28th International Conference on Very Large Data Bases; 2002. p. 950\u201361."},{"issue":"3","key":"80680_CR1822","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s00778-004-0128-2","volume":"13","author":"IF Ilyas","year":"2004","unstructured":"Ilyas IF, Aref WG, Elmagarmid AK. Supporting top-k join queries in relational databases. VLDB J \u2013 Int J Very Large Data Bases. 2004;13(3):207\u201321.","journal-title":"VLDB J \u2013 Int J Very Large Data Bases"},{"key":"80680_CR1823","doi-asserted-by":"crossref","unstructured":"Li C, Chang KC-C, Ilyas IF, Song S. Ranksql: query algebra and optimization for relational top-k queries. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data; 2005. p. 131\u201342.","DOI":"10.1145\/1066157.1066173"},{"key":"80680_CR1824","unstructured":"Li C, Soliman MA, Chang KC-C, Ilyas IF. Ranksql: supporting ranking queries in relational database management systems. In: Proceedings of the 31st International Conference on Very Large Data Bases; 2005. p. 1342\u201345."},{"key":"80680_CR1825","unstructured":"Natsev A, chi Chang Y, Smith JR, Li C-S, Vitter JS. Supporting incremental join queries on ranked inputs. In: Proceedings of the 27th International Conference on Very Large Data Bases; 2001."},{"issue":"2","key":"80680_CR1826","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/235968.280363","volume":"25","author":"M Roth","year":"1996","unstructured":"Roth MT, Arya M, Haas LM, Carey MJ, Cody W, Fagin R, Schwarz PM, Thomas J, Wimmers EL. The garlic project. Sigmod Rec. 1996;25(2):557.","journal-title":"Sigmod Rec"},{"key":"80680_CR1827","doi-asserted-by":"crossref","unstructured":"Schnaitter K, Polyzotis N. Evaluating rank joins with optimal cost. In: Proceedings of the 27th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 2008. p. 43\u201352.","DOI":"10.1145\/1376916.1376924"}],"container-title":["Encyclopedia of Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4614-8265-9_80680","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T06:24:17Z","timestamp":1792131857000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4614-8265-9_80680"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9781461482666","9781461482659"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-8265-9_80680","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-1-4614-8265-9","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}