Advertisement

Efficient Non-Blocking Top-k Query Processing in Distributed Networks

  • Bo Deng
  • Yan Jia
  • Shuqiang Yang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3882)

Abstract

Incremental access can be essential for top-k queries, as users often want to sift through top answers until satisfied. In this paper, we propose the progressive rank (PR, for short) algorithm, a new non-blocking top-k query algorithm that deals with data items from remote sources via unpredictable, slow, or bursty network traffic. By accessing remote sources asynchronously and scheduling background processing reactively, PR hides intermittent delays in data arrival and produces the first few results quickly. Experiments results show that PR is an effective solution for producing fast query responses in the presence of slow and bursty remote sources, and can be scaled well.

Keywords

Protein Data Bank Round Trip Aggregate Score Score Object Remote Source 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bruno, N., Gravano, L., Marian, A.: Evaluating top-k queries over web-accessible databases. In: ICDE (2002)Google Scholar
  2. 2.
    Balke, W.-T., Nejdl, W., Siberski, W., et al.: Progressive Distributed Top-k Retrieval in Peer-to-Peer Networks. In: ICDE 2005 (2005)Google Scholar
  3. 3.
    Babcock, B., Olston, C.: Distributed Top-K Monitoring. In: SIGMOD (2003)Google Scholar
  4. 4.
    Chang, K.C.-C., Hwang, S.-W.: Minimal probing: supporting expensive predicates for top-k queries. In: SIGMOD (2002)Google Scholar
  5. 5.
    Carey, M.J., Kossmann, D.: On saying “Enough already!” in SQL. In: SIGMOD (1997)Google Scholar
  6. 6.
    Crovella, M.E., Taqqu, M.S., Bestavros, A.: Heavy-tailed probability distributions in the world wide web, chapter A practical guide to heavy tails: statistical techniques and applications, pp. 3–26. Chapman Hall, Boca Raton (1998)MATHGoogle Scholar
  7. 7.
    Cao, P., Wang, Z.: Efficient top-k query calculation in distributed networks. In: PODS (2004)Google Scholar
  8. 8.
    Fagin, R.: Combining fuzzy information from multiple systems. J. Comput. System Sci. 58, 83–99 (1999)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: PODS (2001)Google Scholar
  10. 10.
    Güntzer, U., Balke, W.-T., Kieβling, W.: Optimizing multi-feature queries for image databases. In: VLDB (2000)Google Scholar
  11. 11.
    Güntzer, U., Balke, W.-T., Kieβling, W.: Towards efficient multi-feature queries in heterogeneous environments. In: ITCC (2001)Google Scholar
  12. 12.
    Hwang, S., Chang, K.C.-C.: Optimizing Access Cost for Top-k Queries over Web Sources: A Unified Costbased Approach. In: ICDE (2005)Google Scholar
  13. 13.
    Hellerstein, J.M., Haas, P.J., Wang, H.J.: Online Aggregation. In: Proceedings of the ACM International Conference on Management of Data, In SIGMOD (1997)Google Scholar
  14. 14.
    Marian, A., Gravano, L., Bruno, N.: Evaluating Top-k Queries over Web-Accessible Databases. TODS 29(2) (2004)Google Scholar
  15. 15.
    Michel, S., Triantafillou, P., Weikum, G.: KLEE: A Framework for Distributed Top-k Query Algorithms. In: VLDB (2005)Google Scholar
  16. 16.
    Nepal, S., Ramakrishna, M.V.: Query processing issues in image (multimedia) databases. In: ICDE (1999)Google Scholar
  17. 17.
    Urhan, T., Franklin, M.J.: XJoin: Getting Fast Answers From Slow and Burst Networks. Technical Report CS-TR-3994, UMIACS-TR-99-13, Computer Science Department, University of Maryland (February 1999)Google Scholar
  18. 18.
    Wilschut, A.N., Apers, P.M.G.: Pipelining in Query Execution. In: Databases, Parallel, Architectures, and their applications, Miami (1990)Google Scholar
  19. 19.
    Yu, C., Philip, G., Meng, W.: Distributed Top-N Query Processing with Possibly Uncooperative Local Systems. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) VLDB 2003. LNCS, vol. 2944, Springer, Heidelberg (2004)Google Scholar
  20. 20.
    Zipf, G.K.: Human Behavior and the Principle of Least Effort. Addison-Wesley Press, Reading (1949)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Bo Deng
    • 1
  • Yan Jia
    • 1
  • Shuqiang Yang
    • 1
  1. 1.School of Computer ScienceNational University of Defense TechnologyChangshaChina

Personalised recommendations