Efficient top-k processing in large-scaled distributed environments

Data and Knowledge Engineering

Volumn 63, Issue 2, 2007, Pages 315-335

  Zhao, Keping ^a   Tao, Yufei ^b   Zhou, Shuigeng ^c  

^a MICROSOFT   (United States)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c FUDAN UNIVERSITY   (China)

Author keywords

Caching; Distributed database; Top k

Indexed keywords

CACHING; THEORETICAL ANALYSIS;

LARGE SCALE SYSTEMS; PARALLEL ALGORITHMS; QUERY LANGUAGES; RAPID PROTOTYPING; SEMANTICS; SERVERS;

DISTRIBUTED DATABASE SYSTEMS;

EID: 34447288754     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2007.03.012     Document Type: Article

References (37)

1. W.-T. Balke, W. Nejdl, W. Siberski, U. Thaden, Progressive distributed peer-to-peer top-k retrieval in peer-to-peer networks, in: Proc. of International Conference on Data Engineering (ICDE), 2005, pp. 174-185.
2. *-tree: An efficient and robust access method for points and rectangles, in: Proc. of ACM Management of Data (SIGMOD), 1990, pp. 322-331.
3. S. Borzsonyi, D. Kossmann, K. Stocker, The skyline operator, in: Proc. of International Conference on Data Engineering (ICDE), 2001, pp. 421-430.
4. Bruno N., Chaudhuri S., and Gravano L. Top-k selection queries over relational databases: Mapping strategies and performance evaluation. ACM Transactions on Database Systems (TODS) 27 2 (2002) 153-187
5. N. Bruno, L. Gravano, A. Marian, Evaluating top-k queries over web-accessible databases, in: Proc. of International Conference on Data Engineering (ICDE), 2002, pp. 369-380.
6. P. Cao, Z. Wang, Efficient top-k query calculation in distributed networks, in: Proc. of ACM Symposium on Principles of Distributed Computing (PODC), 2004, pp. 206-215.
7. M.J. Carey, D. Kossmann, On saying "enough already!" in SQL, in: Proc. of ACM Management of Data (SIGMOD), 1997, pp. 219-230.
8. K.C. Chang, S. Hwang, Minimal probing: Supporting expensive predicates for top-k queries, in: Proc. of ACM Management of Data (SIGMOD), 2002, pp. 346-357.
9. Y.-C. Chang, L. Bergman, V. Castelli, C.-S. Li, M.-L. Lo, J.R. Smith, The Onion Technique: Indexing for linear optimization queries, in: Proc. of ACM Management of Data (SIGMOD), 2000, pp. 391-402.
10. S. Chaudhuri, G. Das, V. Hristidis, G. Weikum, Probabilistic ranking of database query results, in: Proc. of Very Large Data Bases (VLDB), 2004, pp. 888-899.
11. S. Chaudhuri, L. Gravano, Evaluating top-k selection queries, in: Proc. of Very Large Data Bases (VLDB), 1999, pp. 397-410.
12. A. Crespo, H. Garcia-Molina, Routing indices for peer-to-peer systems, in: Proc. of International Conference on Distributed Computing Systems (ICDCS), 2002.
13. G. Das, D. Gunopulos, N. Koudas, D. Tsirogiannis, Answering top-k queries using views, in: Proc. of Very Large Data Bases (VLDB), 2006, pp. 451-462.
14. R. Fagin, Fuzzy queries in multimedia database systems, in: Proc. of ACM Symposium on Principles of Database Systems (PODS), 1998, pp. 1-10.
15. Fagin R. Combining fuzzy information from multiple systems. J. Comput. Syst. Sci. 58 (1999) 83-99
16. Fagin R., Lotem A., and Naor M. Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci. 66 (2003) 614-656
17. R. Fagin, E.L. Wimmers, Incorporating user preferences in multimedia queries, in: Proc. of International Conference on Database Theory (ICDT), 1997, pp. 247-261.
18. Gass S.I. Linear Programming: Methods and Applications. fifth ed. (1984), McGraw-Hill, Inc.
19. U. Guntzer, W.-T. Balke, W. Kiebling, Optimizing multi-feature queries for image databases, in: Proc. of Very Large Data Bases (VLDB), 2000, pp. 419-428.
20. V. Hristidis, N. Koudas, Y. Papakonstantinou, Prefer: a system for the efficient execution of multi-parametric ranked queries, in: Proc. of ACM Management of Data (SIGMOD), 2001, pp. 259-270.
21. Ilyas F., Aref G., and Elmagarmid K. Supporting top-k join queries in relational databases. The VLDB Journal 13 3 (2004) 207-221
22. I. Ilyas, W. Aref, A. Elmagarmid, Joining ranked inputs in practice, in: Proc. of Very Large Data Bases (VLDB), 2002, pp. 950-961.
23. I. Ilyas, W. Aref, A. Elmagarmid, Supporting top-k join queries in relational databases, in: Proc. of Very Large Data Bases (VLDB), 2003, pp. 754-765.
24. I.F. Ilyas, R. Shah, W.G. Aref, J.S. Vitter, A.K. Elmagarmid, Rank-aware query optimization, in: Proc. of ACM Management of Data (SIGMOD), 2004, pp. 203-214.
25. H.V. Jagadish, B.C. Ooi, Q.H. Vu, Baton: a balanced tree structure for peer-to-peer networks, in: Proc. of Very Large Data Bases (VLDB), 2005, pp. 661-672.
26. C. Li, K.C. Chang, I.F. Ilyas, S. Song, Ranksql: Query algebra and optimization for relational top-k queries, in: Proc. of ACM Management of Data (SIGMOD), 2005, pp. 131-142.
27. Marian A., Bruno N., and Gravano L. Evaluating top-k queries over web-accessible databases. ACM Transactions on Database Systems (TODS) 29 2 (2004) 319-362
28. S. Michel, P. Triantafillou, G. Weikum, Klee: A framework for distributed top-k query algorithms, in: Proc. of Very Large Data Bases (VLDB), 2005, pp. 637-648.
29. A. Natsev, Y.-C. Chang, J.R. Smith, C.-S. Li, J.S. Vitter, Supporting incremental join queries on ranked inputs, in: Proc. of Very Large Data Bases (VLDB), 2001, pp. 281-290.
30. S. Nepal, M.V. Ramakrishna, Query processing issues in image (multimedia) databases, in: Proc. of International Conference on Data Engineering (ICDE), 1999, pp. 22-29.
31. S. Ratnasamy, P. Francis, M. Handley, R.M. Karp, S. Shenker, A scalable content-addressable network, in: Proc. of ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), 2001, pp. 161-172.
32. Ren Q., Dunham M.H., and Kumar V. Semantic caching and query processing. IEEE Transactions on Knowledge and Data Engineering 15 1 (2003) 192-210
33. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, in: Proc. of ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), 2001, pp. 149-160.
34. M. Theobald, G. Weikum, R. Schenkel, Top-k query evaluation with probabilistic guarantees, in: Proc. of Very Large Data Bases (VLDB), 2004, pp. 648-659.
35. P. Tsaparas, T. Palpanas, Y. Kotidis, N. Koudas, D. Srivastava, Ranked join indices, in: Proc. of International Conference on Data Engineering (ICDE), 2003, pp. 277-288.
36. K. Yi, H. Yu, J. Yang, G. Xia, Y. Chen, Efficient maintenance of materialized top-k views, in: Proc. of International Conference on Data Engineering (ICDE), 2003, pp. 189-200.
37. H. Yu, H.-G. Li, P. Wu, D. Agrawal, A.E. Abbadi, Efficient processing of distributed top- queries, in: Proc. of Database and Expert Systems Applications (DEXA), 2005, pp. 65-74.