Skip to main content
SpringerLink
Log in

Towards Adaptive Distributed Top-k Query Processing

  • Conference paper
  • First Online:
New Trends in Databases and Information Systems (ADBIS 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 637))

Abstract

ADiT is an adaptive approach for processing distributed top-k queries over peer-to-peer networks optimizing both system load and query response time. It considers the size of the peer to peer network, the amount k of searched objects, and for each peer: the bandwidth, the amount of objects stored, and the speed of in processing a local top-k query. In extensive experiments with a variety of scenarios we could show that ADiT outperforms state-of-the-art distributed query processing techniques.

The work reported here was supported by the Austrian Ministry of Science and Research within the program GENAU (project GATIB II) and within the project BBMRI.AT.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. UCI Machine Learning Repository, US Census Data 1990 (2012).http://archive.ics.uci.edu/ml/datasets/US+Census+Data+(1990)

  2. Akbarinia, R., Pacitti, E., Valduriez, P.: Reducing network traffic in unstructured P2P systems using Top-k queries. Dist. Parallel Databases 19, 67–86 (2006)

    Article  Google Scholar 

  3. Akbarinia, R., Pacitti, E., Valduriez, P.: Best position algorithms for top-k queries. In: Proceedings of VLDB 2007 (2007)

    Google Scholar 

  4. Balke, W.-T., Nejdl, W., Siberski, W., Thaden, U.: Progressive distributed top-k retrieval in Peer-to-Peer networks. In: Proceedings of ICDE 2005. IEEE CS (2005)

    Google Scholar 

  5. Bruno, N., Chaudhuri, S., Gravano, L.: Top-k selection queries over relational databases: mapping strategies and performance evaluation. ACM Trans. Database Syst. 27, 153–187 (2002)

    Article  Google Scholar 

  6. Conner, W., Hwang, S., Nahrstedt, K.: Unified Framework for Top-k Query Processing in Peer-to-Peer Networks (2007)

    Google Scholar 

  7. Dabringer, C., Eder, J.: Adaptive Distributed Top-k Query Processing. CoRR 1606.01742 (2016)

    Google Scholar 

  8. Dabringer, C., Eder, J.: Efficient top-k retrieval for user preference queries. In: Proceedings of ACM Symposium on Applied Computing, SAC 2011. ACM (2011)

    Google Scholar 

  9. Dabringer, C., Eder, J.: Fast top-k query answering. In: Hameurlain, A., Liddle, S.W., Schewe, K.-D., Zhou, X. (eds.) DEXA 2011, Part II. LNCS, vol. 6861, pp. 144–153. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Eder, J., Dabringer, C., Schicho, M., Stark, K.: Information systems for federated biobanks. In: Hameurlain, A., Küng, J., Wagner, R. (eds.) Trans. on Large-Scale Data- and Knowl.-Cent. Syst. I. LNCS, vol. 5740, pp. 156–190. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  11. Fang, Q., Yang, G.: Efficient top-k query processing algorithms in highly distributed environments. J. Comput. 9(9), 2000–2006 (2014)

    Article  Google Scholar 

  12. Fang, Q., Zhao, Y., et al.: Best position algorithms for top-k query processing in highly distributed environments. In: ICNDC 2010. IEEE (2010)

    Google Scholar 

  13. Frank, A., Asuncion, A.: UCI Machine Learning Repository (2010)

    Google Scholar 

  14. Frank, H., Eder, J.: Towards an automatic integration of statecharts. In: Akoka, J., Bouzeghoub, M., Comyn-Wattiau, I., Métais, E. (eds.) ER 1999. LNCS, vol. 1728, pp. 430–445. Springer, Heidelberg (1999)

    Google Scholar 

  15. Hagihara, R., Shinohara, M., Hara, T., Nishio, S.: A message processing method for top-k query for traffic reduction in ad hoc networks. In: Proceedings of International Conference on Mobile Data Management, MDM 2009. IEEE Computer Society (2009)

    Google Scholar 

  16. Hristidis, V., Papakonstantinou, Y.: Algorithms and applications for answering ranked queries using ranked views. VLDB J. 13(1), 49–70 (2004)

    Article  Google Scholar 

  17. Hua, M., Pei, J., Fu, A.W.C., Lin, X., Leung, H.-F.: Efficiently answering top-k typicality queries on large databases. In: Proceedings of VLDB (2007)

    Google Scholar 

  18. 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), 1–58 (2008)

    Article  Google Scholar 

  19. Mamoulis, N., Yiu, M.L., Cheng, K.H., Cheung, D.W.: Efficient top-k aggregation of ranked inputs. ACM Trans. Database Syst. 32(3), 19 (2007)

    Article  Google Scholar 

  20. Re, C., Dalvi, N., Suciu, D.: Efficient top-k query evaluation on probabilistic data. Data Engineering (2007)

    Google Scholar 

  21. Ryeng, N.H., Vlachou, A., Doulkeridis, C., Nørvåg, K.: Efficient distributed top-k query processing with caching. In: Kim, M.H., Unland, R., Yu, J.X. (eds.) DASFAA 2011, Part II. LNCS, vol. 6588, pp. 280–295. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  22. Vlachou, A., Doulkeridis, C., Nørvåg, K., Vazirgiannis, M.: On efficient top-k query processing in highly distributed environments. In: Proceedings of SIGMOD (2008)

    Google Scholar 

  23. Zhang, Z., Hwang, S., et al.: Boolean + ranking: querying a database by k-constrained optimization. In: Proceedings of ACM SIGMOD (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics Systems, Alpe Adria University Klagenfurt, Klagenfurt, Austria

    Claus Dabringer & Johann Eder

Authors
  1. Claus Dabringer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Johann Eder
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Johann Eder .

Editor information

Editors and Affiliations

  1. Faculty of Sciences, University of Novi Sad Faculty of Sciences, Novi Sad, Serbia

    Mirjana Ivanović

  2. Christian-Albrechts-Universität Kiel, Kiel, Germany

    Bernhard Thalheim

  3. University of Genoa, Genoa, Italy

    Barbara Catania

  4. Software Competence Cent. Hagenberg GmbH, Hagenberg, Austria

    Klaus-Dieter Schewe

  5. Riga Technical University, Riga, Latvia

    Mārīte Kirikova

  6. VSB-Technical University Ostrava, Ostrava, Czech Republic

    Petr Šaloun

  7. Georgia College and State University, Milledgeville, Georgia, USA

    Ajantha Dahanayake

  8. Politecnico di Torino, Torino, Italy

    Tania Cerquitelli

  9. Politecnico di Torino , Torino, Italy

    Elena Baralis

  10. EURECOM, Biot Sophia Antipolis cedex, France

    Pietro Michiardi

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Dabringer, C., Eder, J. (2016). Towards Adaptive Distributed Top-k Query Processing. In: Ivanović, M., et al. New Trends in Databases and Information Systems. ADBIS 2016. Communications in Computer and Information Science, vol 637. Springer, Cham. https://doi.org/10.1007/978-3-319-44066-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44066-8_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44065-1

  • Online ISBN: 978-3-319-44066-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation