{"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":1725578617774},"publisher-location":"Berlin, Heidelberg","reference-count":7,"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_12","type":"book-chapter","created":{"date-parts":[[2011,3,9]],"date-time":"2011-03-09T02:53:17Z","timestamp":1299639197000},"page":"128-134","source":"Crossref","is-referenced-by-count":0,"title":["Uncertainty in Rank Join"],"prefix":"10.1007","author":[{"given":"Ihab F.","family":"Ilyas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"12_CR1","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"},{"key":"12_CR2","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 the 27th International Conference on Very Large Data Bases, pp. 281\u2013290 (2001)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Schnaitter, K., Polyzotis, N.: Evaluating rank joins with optimal cost. In: PODS, pp. 43\u201352 (2008)","DOI":"10.1145\/1376916.1376924"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Soliman, M.A., Ilyas, I.F.: Ranking with uncertain scores. In: ICDE, pp. 317\u2013328 (2009)","DOI":"10.1109\/ICDE.2009.102"},{"issue":"1","key":"12_CR5","first-page":"826","volume":"3","author":"M.A. Soliman","year":"2010","unstructured":"Soliman, M.A., Ilyas, I.F., Saleeb, M.: Building ranked mashups of unstructured sources with uncertain information. PVLDB\u00a03(1), 826\u2013837 (2010)","journal-title":"PVLDB"},{"issue":"1","key":"12_CR6","first-page":"638","volume":"3","author":"J. Li","year":"2010","unstructured":"Li, J., Deshpande, A.: Ranking continuous probabilistic datasets. PVLDB\u00a03(1), 638\u2013649 (2010)","journal-title":"PVLDB"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Cormode, G., Li, F., Yi, K.: Semantics of ranking queries for probabilistic data and expected ranks. In: ICDE, pp. 305\u2013316 (2009)","DOI":"10.1109\/ICDE.2009.75"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:06:14Z","timestamp":1558418774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19668-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642196676","9783642196683"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19668-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}