Advertisement

Dynamic Skyline Queries in Large Graphs

  • Lei Zou
  • Lei Chen
  • M. Tamer Özsu
  • Dongyan Zhao
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5982)

Abstract

Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query points. In this paper, we study d ynamic s kyline queries in a large g raph (DSG-query for short). Although dynamic skylines have been studied in Euclidean space [14], road network [5], and metric space [3,6], there is no previous work on dynamic skylines over large graphs. We employ a filter-and-refine framework to speed up the query processing that can answer DSG-query efficiently. We propose a novel pruning rule based on graph properties to derive the candidates for DSG-query, that are guaranteed not to introduce false negatives. In the refinement step, with a carefully-designed index structure, we compute short path distances between vertices in O(H), where H is the number of maximal hops between any two vertices. Extensive experiments demonstrate that our methods outperform existing algorithms by orders of magnitude.

Keywords

Road Network Leaf Node Query Point Large Graph Skyline Query 
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.
    Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: ICDE (2001)Google Scholar
  2. 2.
    Chan, E.P.F., Lim, H.: Optimization and evaluation of shortest path queries. VLDB J. 16(3) (2007)Google Scholar
  3. 3.
    Chen, L., Lian, X.: Dynamic skyline queries in metric spaces. In: EDBT (2008)Google Scholar
  4. 4.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms. MIT Press, Cambridge (2001)zbMATHGoogle Scholar
  5. 5.
    Deng, K., Zhou, X., Shen, H.T.: Multi-source skyline query processing in road networks. In: ICDE (2007)Google Scholar
  6. 6.
    Fuhry, D., Jin, R., Zhang, D.: Efficient skyline computation in metric space. TR-KSU-CS-2008-02, Department of Computer Science Kent State University (2008)Google Scholar
  7. 7.
    Jing, N., Huang, Y.-W., Rundensteiner, E.A.: Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. IEEE Trans. Knowl. Data Eng. 10(3) (1998)Google Scholar
  8. 8.
    Jung, S., Pramanik, S.: An efficient path computation model for hierarchically structured topographical road maps. IEEE Trans. Knowl. Data Eng. 14(5) (2002)Google Scholar
  9. 9.
    Kossmann, D., Ramsak, F., Rost, S.: Shooting stars in the sky: An online algorithm for skyline queries. In: VLDB (2002)Google Scholar
  10. 10.
    Lee, K.C.K., Zheng, B., Li, H., Lee, W.-C.: Approaching the skyline in z order. In: VLDB (2007)Google Scholar
  11. 11.
    Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: SIGMOD (2003)Google Scholar
  12. 12.
    Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: VLDB (2003)Google Scholar
  13. 13.
    Samet, H., Alborzi, J.S.H.: Scalable network distance browsing in spatial databases. In: SIGMOD (2008)Google Scholar
  14. 14.
    Sharifzadeh, M., Shahabi, C.: The spatial skyline queries. In: VLDB (2006)Google Scholar
  15. 15.
    Tan, K.-L., Eng, P.-K., Ooi, B.C.: Efficient progressive skyline computation. In: VLDB (2001)Google Scholar
  16. 16.
    Tong, H., Faloutsos, C.: Center-piece subgraphs: Problem definition and fast solutions. In: SIGKDD (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Lei Zou
    • 1
  • Lei Chen
    • 2
  • M. Tamer Özsu
    • 3
  • Dongyan Zhao
    • 1
    • 4
  1. 1.Institute of Computer Science and TechnologyPeking UniversityBeijingChina
  2. 2.Hong Kong of Science and TechnologyHong KongChina
  3. 3.University of WaterlooWaterlooCanada
  4. 4.Key Laboratory of Computational Linguistics (PKU)Ministry of EducationChina

Personalised recommendations