On efficient top-k query processing in highly distributed environments

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2008, Pages 753-764

  Vlachou, Akrivi ^a   Doulkeridis, Christos ^a   Nørvåg, Kjetil ^b   Vazirgiannis, Michalis ^a  

^a ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

^b NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

Author keywords

Peer to peer systems; Skyline operator; Top k queries

Indexed keywords

CENTRALIZED DATABASES; CHALLENGING PROBLEMS; DATA OBJECTS; DATA VOLUMES; DISTRIBUTED ENVIRONMENTS; EXACT RESULTS; PEER-TO-PEER NETWORKS; PEER-TO-PEER SYSTEMS; QUERY OPERATORS; RESPONSE TIMES; SKYLINE OPERATOR; SUPER-PEER NETWORKS; THRESHOLDING; VARIATIONS OF;

ADMINISTRATIVE DATA PROCESSING; CLIENT SERVER COMPUTER SYSTEMS; COMPUTER NETWORKS; COMPUTER SYSTEMS; DATABASE SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION RETRIEVAL; MANAGEMENT INFORMATION SYSTEMS; QUERY PROCESSING;

DISTRIBUTED DATABASE SYSTEMS;

EID: 57149132518     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376616.1376692     Document Type: Conference Paper

References (22)

1. R. Akbarinia, E. Pacitti, and P. Valduriez. Reducing network traffic in unstructured P2P systems using top-k queries. Distributed and Parallel Databases, 19(2-3) :67-86, 2006.
2. R. Akbarinia, E. Pacitti, and P. Valduriez. Best position algorithms for top-k queries. In Proceedings of Int. Conf. on Very Large Data Bases (VLDB), pages 495-506, 2007.
3. W.-T. Balke and U. Güntzer. Multi-objective query processing for database systems. In Proceedings of Int. Conf. on Very Large Data Bases (VLDB), pages 936-947, 2004.
4. W.-T. Balke, W. Nejdl, W. Siberski, and U. Thaden. Progressive distributed top-k retrieval in peer-to-peer networks. In Proceedings of IEEE Int. Conf. on Data Engineering (ICDE), pages 174-185, 2005.
5. S. Börzsönyi, D. Kossmann, and K. Stocker. The skyline operator. In Proceedings of IEEE Int. Conf. on Data Engineering (ICDE), pages 421-430, 2001.
6. P. Cao and Z. Wang. Efficient top-k query calculation in distributed networks. In Proceedings of Annual A CM Symposium, on Principles of Distributed Computing (PODC), pages 206-215, 2004.
7. S. Chaudhuri, N. N. Dalvi, and R. Kaushik. Robust cardinality and cost estimation for skyline operator. In Proceedings of IEEE Int. Conf. on Data Engineering (ICDE), page 64, 2006.
8. S. Chaudhuri and L. Gravano. Evaluating top-k selection queries. In Proceedings of Int. Conf. on Very Large Data Bases (VLDB), pages 397-410, 1999.
9. S. Chaudhuri, L. Gravano, and A. Marian. Optimizing top-k selection queries over multimedia repositories. IEEE Transactions on Knowledge and Data Engineering, 16(8):992-1009, 2004.
10. J. Chomicki, P. Godfrey, J. Gryz, and D. Liang. Skyline with presorting. In Proceedings of Int. Conf. on Data Engineering (ICDE), pages 717-719, 2003.
11. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In Proceedings of Symposium on Principles of Database Systems (PODS), pages 102-113, 2001.
12. U. Güntzer, W.-T. Balke, and W. Kießling. Optimizing multi-feature queries for image databases. In Proceedings of Int. Conf. on Very Large Data Bases (VLDB), pages 419-428, 2000.
13. K. Hose, M. Karnstedt, K.-U. Sattler, and D. Zinn. Processing top-N queries in P2P-based web integration systems with probabilistic guarantees. In Proceedings of International Workshop on Web and Databases (WebDB), pages 109-114, 2005.
14. V. Hristidis, N. Koudas, and Y. Papakonstantinou. PREFER: A system for the efficient execution of multi-parametric ranked queries. In Proceedings of ACM Int. Conf. on Management of Data (SIGMOD), pages 259-270, 2001.
15. J. Lu and J. Callan. Merging retrieval results in hierarchical peer-to-peer networks. In Proceedings of the ACM Int. Conf. on Research and Development in Information Retrieval (SIGIR), pages 472-473, 2004.
16. J. Lu and J. Callan. Federated search of text-based digital libraries in hierarchical peer-to-peer networks. In Proceedings of European Conference on IR Research (ECIR), pages 52-66, 2005.
17. A. Marian, N. Bruno, and L. Gravano. Evaluating top-k queries over web-accessible databases. ACM Transactions on Database Systems, 29(2):319-362, 2004.
18. S. Michel, P. Triantafillou, and G. Weikum. KLEE: a framework for distributed top-k query algorithms. In Proceedings of Int. Conf. on Very Large Data Bases (VLDB), pages 637-648, 2005.
19. K. Mouratidis, S. Bakiras, and D. Papadias. Continuous monitoring of top-k queries over sliding windows. In Proceedings of ACM Int. Conf. on Management of Data (SIGMOD), pages 635-646, 2006.
20. D. Papadias, Y. Tao, G. Fu, and B. Seeger. Progressive skyline computation in database systems. ACM Transactions on Database Systems, 30(1):41-82. 2005.
21. P. Tsaparas, T. Palpanas, Y. Kotidis, N. Koudas, and D. Srivastava. Ranked join indices. In Proceedings of IEEE Int. Conf. on Data Engineering (ICDE), pages 277-288, 2003.
22. K. Zhao, Y. Tao, and S. Zhou. Efficient top-k processing in large-scaled distributed environments. Data and Knowledge Engineering, 63(2):315-335, 2007.