{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T22:10:03Z","timestamp":1747692603274,"version":"3.40.5"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662464847"},{"type":"electronic","value":"9783662464854"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46485-4_3","type":"book-chapter","created":{"date-parts":[[2015,2,21]],"date-time":"2015-02-21T10:51:17Z","timestamp":1424515877000},"page":"53-79","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Exact and Approximate Generic Multi-criteria Top-k Query Processing"],"prefix":"10.1007","author":[{"given":"Mehdi","family":"Badr","sequence":"first","affiliation":[]},{"given":"Dan","family":"Vodislav","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,22]]},"reference":[{"key":"3_CR1","unstructured":"Akbarinia, R., Pacitti, E., Valduriez, P.: Best position algorithms for top-k queries. In: VLDB, pp. 495\u2013506 (2007)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Badr, M., Vodislav, D.: A general top-k algorithm for web data sources. In: DEXA, pp. 379\u2013393 (2011)","DOI":"10.1007\/978-3-642-23088-2_28"},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C B\u00f6hm","year":"2001","unstructured":"B\u00f6hm, C., Berchtold, S., Keim, D.A.: Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Comput. Surv. 33(3), 322\u2013373 (2001)","journal-title":"ACM Comput. Surv."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Bruno, N., Gravano, L., Marian, A.: Evaluating top-k queries over web-accessible databases. In: ICDE, pp. 369\u2013378 (2002)","DOI":"10.1109\/ICDE.2002.994751"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Cao, P., Wang, Z.: Efficient top-k query calculation in distributed networks. In: PODC, pp. 206\u2013215 (2004)","DOI":"10.1145\/1011767.1011798"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Chang, K.C.-C., won Hwang, S.: Minimal probing: supporting expensive predicates for top-k queries. In: SIGMOD Conference, pp. 346\u2013357 (2002)","DOI":"10.1145\/564691.564731"},{"issue":"4","key":"3_CR7","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. 66(4), 614\u2013656 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR8","unstructured":"G\u00fcntzer, U., Balke, W.-T., Kie\u00dfling, W.: Optimizing multi-feature queries for image databases. In: VLDB, pp. 419\u2013428 (2000)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"G\u00fcntzer, U., Balke, W.-T., Kie\u00dflingm, W.: Towards efficient multi-feature queries in heterogeneous environments. In: ITCC, pp. 622\u2013628 (2001)","DOI":"10.1109\/ITCC.2001.918866"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s00778-004-0128-2","volume":"13","author":"IF Ilyas","year":"2004","unstructured":"Ilyas, I.F., Aref, W.G., Elmagarmid, A.K.: Supporting top-k join queries in relational databases. VLDB J. 13(3), 207\u2013221 (2004)","journal-title":"VLDB J."},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"11:1","DOI":"10.1145\/1391729.1391730","volume":"40","author":"IF Ilyas","year":"2008","unstructured":"Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top- k query processing techniques in relational database systems. ACM Comput. Surv. 40(4), 11:1\u201311:58 (2008)","journal-title":"ACM Comput. Surv."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Li, C., Chang, K.C.-C., Ilyas, I.F.: Supporting ad-hoc ranking aggregates. In: SIGMOD Conference, pp. 61\u201372 (2006)","DOI":"10.1145\/1142473.1142481"},{"key":"3_CR13","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: SIGMOD Conference, pp. 131\u2013142 (2005)","DOI":"10.1145\/1066157.1066173"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Mamoulis, N., Cheng, K.H., Yiu, M.L., Cheung, D.W.: Efficient aggregation of ranked inputs. In: ICDE, p. 72 (2006)","DOI":"10.1109\/ICDE.2006.54"},{"issue":"2","key":"3_CR15","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 Trans. Database Syst. 29(2), 319\u2013362 (2004)","journal-title":"ACM Trans. Database Syst."},{"key":"3_CR16","unstructured":"Michel, S., Triantafillou, P., Weikum, G.: Klee: A framework for distributed top-k query algorithms. In: VLDB, pp. 637\u2013648 (2005)"},{"key":"3_CR17","unstructured":"Natsev, A., Chang, Y.-C., Smith, J.R., Li, C.-S., Vitter, J.S.: Supporting incremental join queries on ranked inputs. In: VLDB, pp. 281\u2013290 (2001)"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Theobald, M., Weikum, G., Schenkel, R.: Top-k query evaluation with probabilistic guarantees. In: VLDB, pp. 648\u2013659 (2004)","DOI":"10.1016\/B978-012088469-8.50058-9"},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/1206049.1206054","volume":"32","author":"S won Hwang","year":"2007","unstructured":"won Hwang, S., Chang, K.C.-C.: Optimizing top-k queries for middleware access: A unified cost-based approach. ACM Trans. Database Syst. 32(1), 5 (2007)","journal-title":"ACM Trans. Database Syst."}],"container-title":["Lecture Notes in Computer Science","Transactions on Large-Scale Data- and Knowledge-Centered Systems XVIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46485-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T21:32:05Z","timestamp":1747690325000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-46485-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662464847","9783662464854"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46485-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"22 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}