Distributed top-k aggregation queries at large

Distributed and Parallel Databases

Volumn 26, Issue 1, 2009, Pages 3-27

  Neumann, Thomas ^a   Bender, Matthias ^a   Michel, Sebastian ^b   Schenkel, Ralf ^a   Triantafillou, Peter ^c   Weikum, Gerhard ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b EPFL   (Switzerland)

^c UNIVERSITY OF PATRAS   (Greece)

Author keywords

Cost models; Distributed queries; Query optimization; Top k

Indexed keywords

ADAPTIVE SAMPLING; AGGREGATION QUERIES; COST MODELS; DISTRIBUTED ENVIRONMENTS; DISTRIBUTED QUERIES; FUNDAMENTAL BUILDING BLOCKS; NETWORK NODE; NETWORK SIMULATORS; OPTIMIZATION METHOD; ORDER STATISTICS; PACKET LEVEL SIMULATION; QUERY OPTIMIZATION; REAL LIFE DATASETS; THREE DEGREES OF FREEDOM; TOP-K QUERY PROCESSING; TREE STRUCTURES;

GRAPHICAL USER INTERFACES; LOCAL AREA NETWORKS; OPTIMIZATION; QUERY PROCESSING;

SIMULATORS;

EID: 67651211686     PISSN: 09268782     EISSN: 15737578     Source Type: Journal    
DOI: 10.1007/s10619-009-7041-z     Document Type: Article

References (46)

1. R. Akbarinia E. Pacitti P. Valduriez 2006 Reducing network traffic in unstructured p2p systems using top-k queries Distributed Parallel Databases 19 2-3 67 86
2. Anh, V.N., Moffat, A.: Pruned query evaluation using pre-computed impacts. In: SIGIR, pp. 372-379 (2006)
3. Babcock, B., Olston, C.: Distributed top-k monitoring. In: SIGMOD Conference, pp. 28-39 (2003)
4. Balke, W.T., Nejdl, W., Siberski, W., Thaden, U.: Progressive distributed top k retrieval in peer-to-peer networks. In: ICDE, pp. 174-185 (2005)
5. Bender, M., Michel, S., Triantafillou, P., Weikum, G., Zimmer, C.: Improving collection selection with overlap awareness in p2p search engines. In: SIGIR, pp. 67-74 (2005)
6. Brijs, T., Swinnen, G., Vanhoof, K., Wets, G.: Using association rules for product assortment decisions: A case study. In: KDD, pp. 254-260 (1999)
7. N. Bruno S. Chaudhuri L. Gravano 2002 Top-k selection queries over relational databases: Mapping strategies and performance evaluation ACM Trans. Database Syst. 27 2 153 187
8. Bruno, N., Gravano, L., Marian, A.: Evaluating top-k queries over web-accessible databases. In: ICDE, pp. 369- (2002b)
9. Cao, P., Wang, Z.: Efficient top-k query calculation in distributed networks. In: PODC, pp. 206-215 (2004)
10. Chang, K.C.C., won Hwang, S.: Minimal probing: supporting expensive predicates for top-k queries. In: SIGMOD Conference, pp. 346-357 (2002)
11. Chaudhuri, S., Das, G., Hristidis, V., Weikum, G.: Probabilistic ranking of database query results. In: VLDB, pp. 888-899 (2004a)
12. S. Chaudhuri L. Gravano A. Marian 2004 Optimizing top-k selection queries over multimedia repositories IEEE Trans. Knowl. Data Eng. 16 8 992 1009
13. K. Church W. Gale 1995 Poisson mixtures Nat. Lang. Eng. 1 2 163 190
14. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. MIT/McGraw-Hill, Cambridge (2001)
15. Das, G., Gunopulos, D., Koudas, N., Tsirogiannis, D.: Answering top-k queries using views. In: VLDB, pp. 451-462 (2006)
16. Das, G., Gunopulos, D., Koudas, N., Sarkas, N.: Ad-hoc top-k query answering for data streams. In: VLDB, pp. 183-194 (2007)
17. David, H., Nagaraja, H.: Order Statistics, 3rd edn. Wiley, New York (2003)
18. Dubinko, M., Kumar, R., Magnani, J., Novak, J., Raghavan, P., Tomkins, A.: Visualizing tags over time. In: WWW, pp. 193-202 (2006)
19. Garofalakis, M. (ed): Special issue on in-network query processing. IEEE Data Eng. Bull. 28(1) (2005)
20. R. Fagin A. Lotem M. Naor 2003 Optimal aggregation algorithms for middleware J. Comput. Syst. Sci. 66 4 614 656
21. Güntzer, U., Balke, W.T., Kießling, W.: Optimizing multi-feature queries for image databases. In: VLDB, pp. 419-428 (2000)
22. Güntzer, U., Balke, W.T., Kießling, W.: Towards efficient multi-feature queries in heterogeneous environments. In: ITCC, pp. 622-628 (2001)
23. I.F. Ilyas W.G. Aref A.K. Elmagarmid H.G. Elmongui R. Shah J.S. Vitter 2006 Adaptive rank-aware query optimization in relational databases ACM Trans. Database Syst. 31 4 1257 1304
24. Information Sciences Institute The University of Southern California: The network simulator-ns-2 (2007). http://www.isi.edu/nsnam/ns/
25. Ioannidis, Y.E.: The history of histograms (abridged). In: VLDB, pp. 19-30 (2003)
26. Kaushik, R., Krishnamurthy, R., Naughton, J.F., Ramakrishnan, R.: On the integration of structure indexes and inverted lists. In: SIGMOD Conference, pp. 779-790 (2004)
27. Koudas, N., Ooi, B.C., Tan, K.L.: Approximate nn queries on streams with guaranteed error/performance bounds. In: VLDB, pp. 804-815 (2004)
28. 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-142 (2005)
29. Long, X., Suel, T.: Optimized query execution in large search engines with global page ordering. In: VLDB, pp. 129-140 (2003)
30. Luo, Y., Lin, X., Wang, W., Zhou, X.: Spark: top-k keyword query in relational databases. In: SIGMOD Conference, pp. 115-126 (2007)
31. S. Madden M.J. Franklin J.M. Hellerstein W. Hong 2005 Tinydb: an acquisitional query processing system for sensor networks ACM Trans. Database Syst. 30 1 122 173
32. A. Marian N. Bruno L. Gravano 2004 Evaluating top-k queries over web-accessible databases ACM Trans. Database Syst. 29 2 319 362
33. Michel, S., Triantafillou, P., Weikum, G.: Klee: A framework for distributed top-k query algorithms. In: VLDB, pp. 637-648 (2005)
34. 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-290 (2001)
35. Nepal, S., Ramakrishna, M.V.: Query processing issues in image (multimedia) databases. In: ICDE, pp. 22-29 (1999)
36. Neumann, T., Michel, S.: Smooth interpolating histograms with error guarantees. In: BNCOD, pp. 126-138 (2008)
37. Neumann, T., Bender, M., Michel, S., Schenkel, R., Triantafillou, P., Weikum, G.: Optimizing distributed top-k queries. In: WISE, pp. 337-349 (2008)
38. K. Schnaitter J. Spiegel N. Polyzotis 2009 Depth estimation for ranking query optimization VLDB J. 18 2 521 542
39. Soliman, M.A., Ilyas, I.F., Chang, K.C.C.: Top-k query processing in uncertain databases. In: ICDE, pp. 896-905 (2007)
40. Theobald, M., Weikum, G., Schenkel, R.: Top-k query evaluation with probabilistic guarantees. In: VLDB, pp. 648-659 (2004)
41. de Vries, A.P., Mamoulis, N., Nes, N., Kersten, M.L.: Efficient k-nn search on vertically decomposed data. In: SIGMOD Conference, pp. 322-333 (2002)
42. 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)
43. 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-114 (2007)
44. Yu, H., Li, H.G., Wu, P., Agrawal, D., Abbadi, A.E.: Efficient processing of distributed top-k queries. In: DEXA, pp. 65-74 (2005)
45. Zeinalipour-Yazti, D., et al.: The threshold join algorithm for top-k queries in distributed sensor networks. In: DMSN (2005)
46. Zhang, J., Suel, T.: Efficient query evaluation on large textual collections in a peer-to-peer environment. In: Peer-to-Peer Computing, pp. 225-233 (2005)