{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,10]],"date-time":"2026-09-10T23:12:49Z","timestamp":1789081969950,"version":"build-2803163510"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Parallel Databases"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s10619-009-7041-z","type":"journal-article","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T10:06:02Z","timestamp":1245233162000},"page":"3-27","source":"Crossref","is-referenced-by-count":17,"title":["Distributed top-k aggregation queries at large"],"prefix":"10.1007","volume":"26","author":[{"given":"Thomas","family":"Neumann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthias","family":"Bender","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastian","family":"Michel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ralf","family":"Schenkel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Triantafillou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gerhard","family":"Weikum","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,6,18]]},"reference":[{"issue":"2\u20133","key":"7041_CR1","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10619-006-8313-5","volume":"19","author":"R. Akbarinia","year":"2006","unstructured":"Akbarinia, R., Pacitti, E., Valduriez, P.: Reducing network traffic in unstructured p2p systems using top-k queries. Distributed Parallel Databases 19(2\u20133), 67\u201386 (2006)","journal-title":"Distributed Parallel Databases"},{"key":"7041_CR2","doi-asserted-by":"crossref","unstructured":"Anh, V.N., Moffat, A.: Pruned query evaluation using pre-computed impacts. In: SIGIR, pp. 372\u2013379 (2006)","DOI":"10.1145\/1148170.1148235"},{"key":"7041_CR3","doi-asserted-by":"crossref","unstructured":"Babcock, B., Olston, C.: Distributed top-k monitoring. In: SIGMOD Conference, pp. 28\u201339 (2003)","DOI":"10.1145\/872757.872764"},{"key":"7041_CR4","doi-asserted-by":"crossref","unstructured":"Balke, W.T., Nejdl, W., Siberski, W., Thaden, U.: Progressive distributed top k retrieval in peer-to-peer networks. In: ICDE, pp. 174\u2013185 (2005)","DOI":"10.1109\/ICDE.2005.115"},{"key":"7041_CR5","doi-asserted-by":"crossref","unstructured":"Bender, M., Michel, S., Triantafillou, P., Weikum, G., Zimmer, C.: Improving collection selection with overlap awareness in p2p search engines. In: SIGIR, pp. 67\u201374 (2005)","DOI":"10.1145\/1076034.1076049"},{"key":"7041_CR6","doi-asserted-by":"crossref","unstructured":"Brijs, T., Swinnen, G., Vanhoof, K., Wets, G.: Using association rules for product assortment decisions: A case study. In: KDD, pp. 254\u2013260 (1999)","DOI":"10.1145\/312129.312241"},{"issue":"2","key":"7041_CR7","doi-asserted-by":"crossref","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 Trans. Database Syst. 27(2), 153\u2013187 (2002a)","journal-title":"ACM Trans. Database Syst."},{"key":"7041_CR8","doi-asserted-by":"crossref","unstructured":"Bruno, N., Gravano, L., Marian, A.: Evaluating top-k queries over web-accessible databases. In: ICDE, pp. 369\u2013 (2002b)","DOI":"10.1109\/ICDE.2002.994751"},{"key":"7041_CR9","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":"7041_CR10","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"},{"key":"7041_CR11","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Das, G., Hristidis, V., Weikum, G.: Probabilistic ranking of database query results. In: VLDB, pp. 888\u2013899 (2004a)","DOI":"10.1016\/B978-012088469-8.50078-4"},{"issue":"8","key":"7041_CR12","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1109\/TKDE.2004.30","volume":"16","author":"S. Chaudhuri","year":"2004","unstructured":"Chaudhuri, S., Gravano, L., Marian, A.: Optimizing top-k selection queries over multimedia repositories. IEEE Trans. Knowl. Data Eng. 16(8), 992\u20131009 (2004b)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"7041_CR13","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1017\/S1351324900000139","volume":"1","author":"K. Church","year":"1995","unstructured":"Church, K., Gale, W.: Poisson mixtures. Nat. Lang. Eng. 1(2), 163\u2013190 (1995)","journal-title":"Nat. Lang. Eng."},{"key":"7041_CR14","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. MIT\/McGraw-Hill, Cambridge (2001)"},{"key":"7041_CR15","unstructured":"Das, G., Gunopulos, D., Koudas, N., Tsirogiannis, D.: Answering top-k queries using views. In: VLDB, pp. 451\u2013462 (2006)"},{"key":"7041_CR16","unstructured":"Das, G., Gunopulos, D., Koudas, N., Sarkas, N.: Ad-hoc top-k query answering for data streams. In: VLDB, pp. 183\u2013194 (2007)"},{"key":"7041_CR17","doi-asserted-by":"crossref","DOI":"10.1002\/0471722162","volume-title":"Order Statistics","author":"H. David","year":"2003","unstructured":"David, H., Nagaraja, H.: Order Statistics, 3rd edn. Wiley, New York (2003)","edition":"3"},{"key":"7041_CR18","doi-asserted-by":"crossref","unstructured":"Dubinko, M., Kumar, R., Magnani, J., Novak, J., Raghavan, P., Tomkins, A.: Visualizing tags over time. In: WWW, pp. 193\u2013202 (2006)","DOI":"10.1145\/1135777.1135810"},{"key":"7041_CR19","unstructured":"Garofalakis, M. (ed): Special issue on in-network query processing. IEEE Data Eng. Bull. 28(1) (2005)"},{"issue":"4","key":"7041_CR20","doi-asserted-by":"crossref","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":"7041_CR21","unstructured":"G\u00fcntzer, U., Balke, W.T., Kie\u00dfling, W.: Optimizing multi-feature queries for image databases. In: VLDB, pp. 419\u2013428 (2000)"},{"key":"7041_CR22","doi-asserted-by":"crossref","unstructured":"G\u00fcntzer, U., Balke, W.T., Kie\u00dfling, W.: Towards efficient multi-feature queries in heterogeneous environments. In: ITCC, pp. 622\u2013628 (2001)","DOI":"10.1109\/ITCC.2001.918866"},{"issue":"4","key":"7041_CR23","doi-asserted-by":"crossref","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 Trans. Database Syst. 31(4), 1257\u20131304 (2006)","journal-title":"ACM Trans. Database Syst."},{"key":"7041_CR24","unstructured":"Information Sciences Institute The University of Southern California: The network simulator\u2014ns-2 (2007). http:\/\/www.isi.edu\/nsnam\/ns\/"},{"key":"7041_CR25","doi-asserted-by":"crossref","unstructured":"Ioannidis, Y.E.: The history of histograms (abridged). In: VLDB, pp. 19\u201330 (2003)","DOI":"10.1016\/B978-012722442-8\/50011-2"},{"key":"7041_CR26","doi-asserted-by":"crossref","unstructured":"Kaushik, R., Krishnamurthy, R., Naughton, J.F., Ramakrishnan, R.: On the integration of structure indexes and inverted lists. In: SIGMOD Conference, pp. 779\u2013790 (2004)","DOI":"10.1145\/1007568.1007656"},{"key":"7041_CR27","doi-asserted-by":"crossref","unstructured":"Koudas, N., Ooi, B.C., Tan, K.L.: Approximate nn queries on streams with guaranteed error\/performance bounds. In: VLDB, pp. 804\u2013815 (2004)","DOI":"10.1016\/B978-012088469-8.50071-1"},{"key":"7041_CR28","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":"7041_CR29","doi-asserted-by":"crossref","unstructured":"Long, X., Suel, T.: Optimized query execution in large search engines with global page ordering. In: VLDB, pp. 129\u2013140 (2003)","DOI":"10.1016\/B978-012722442-8\/50020-3"},{"key":"7041_CR30","doi-asserted-by":"crossref","unstructured":"Luo, Y., Lin, X., Wang, W., Zhou, X.: Spark: top-k keyword query in relational databases. In: SIGMOD Conference, pp. 115\u2013126 (2007)","DOI":"10.1145\/1247480.1247495"},{"issue":"1","key":"7041_CR31","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1145\/1061318.1061322","volume":"30","author":"S. Madden","year":"2005","unstructured":"Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: Tinydb: an acquisitional query processing system for sensor networks. ACM Trans. Database Syst. 30(1), 122\u2013173 (2005)","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"7041_CR32","doi-asserted-by":"crossref","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":"7041_CR33","unstructured":"Michel, S., Triantafillou, P., Weikum, G.: Klee: A framework for distributed top-k query algorithms. In: VLDB, pp. 637\u2013648 (2005)"},{"key":"7041_CR34","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":"7041_CR35","doi-asserted-by":"crossref","unstructured":"Nepal, S., Ramakrishna, M.V.: Query processing issues in image (multimedia) databases. In: ICDE, pp. 22\u201329 (1999)","DOI":"10.1109\/ICDE.1999.754894"},{"key":"7041_CR36","doi-asserted-by":"crossref","unstructured":"Neumann, T., Michel, S.: Smooth interpolating histograms with error guarantees. In: BNCOD, pp. 126\u2013138 (2008)","DOI":"10.1007\/978-3-540-70504-8_12"},{"key":"7041_CR37","doi-asserted-by":"crossref","unstructured":"Neumann, T., Bender, M., Michel, S., Schenkel, R., Triantafillou, P., Weikum, G.: Optimizing distributed top-k queries. In: WISE, pp. 337\u2013349 (2008)","DOI":"10.1007\/978-3-540-85481-4_26"},{"issue":"2","key":"7041_CR38","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s00778-008-0124-z","volume":"18","author":"K. Schnaitter","year":"2009","unstructured":"Schnaitter, K., Spiegel, J., Polyzotis, N.: Depth estimation for ranking query optimization. VLDB J. 18(2), 521\u2013542 (2009)","journal-title":"VLDB J."},{"key":"7041_CR39","doi-asserted-by":"crossref","unstructured":"Soliman, M.A., Ilyas, I.F., Chang, K.C.C.: Top-k query processing in uncertain databases. In: ICDE, pp. 896\u2013905 (2007)","DOI":"10.1109\/ICDE.2007.367935"},{"key":"7041_CR40","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"},{"key":"7041_CR41","doi-asserted-by":"crossref","unstructured":"de Vries, A.P., Mamoulis, N., Nes, N., Kersten, M.L.: Efficient k-nn search on vertically decomposed data. In: SIGMOD Conference, pp. 322\u2013333 (2002)","DOI":"10.1145\/564691.564729"},{"key":"7041_CR42","unstructured":"Winick, J., Jamin, S.: Inet-3.0: Internet topology generator. http:\/\/topology.eecs.umich.edu\/inet\/ . Tech. Rep. UM-CSE-TR-456-02, EECS, University of Michigan, citeseer.nj.nec.com\/526211.html (2002)"},{"key":"7041_CR43","doi-asserted-by":"crossref","unstructured":"Xin, D., Han, J., Chang, K.C.C.: Progressive and selective merge: computing top-k with ad-hoc ranking functions. In: SIGMOD Conference, pp. 103\u2013114 (2007)","DOI":"10.1145\/1247480.1247494"},{"key":"7041_CR44","doi-asserted-by":"crossref","unstructured":"Yu, H., Li, H.G., Wu, P., Agrawal, D., Abbadi, A.E.: Efficient processing of distributed top-k queries. In: DEXA, pp. 65\u201374 (2005)","DOI":"10.1007\/11546924_7"},{"key":"7041_CR45","doi-asserted-by":"crossref","unstructured":"Zeinalipour-Yazti, D., et al.: The threshold join algorithm for top-k queries in distributed sensor networks. In: DMSN (2005)","DOI":"10.1145\/1080885.1080896"},{"key":"7041_CR46","unstructured":"Zhang, J., Suel, T.: Efficient query evaluation on large textual collections in a peer-to-peer environment. In: Peer-to-Peer Computing, pp. 225\u2013233 (2005)"}],"container-title":["Distributed and Parallel Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-009-7041-z.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T19:35:07Z","timestamp":1558380907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10619-009-7041-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,18]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["7041"],"URL":"https:\/\/doi.org\/10.1007\/s10619-009-7041-z","relation":{},"ISSN":["0926-8782","1573-7578"],"issn-type":[{"value":"0926-8782","type":"print"},{"value":"1573-7578","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,18]]}}}