Skip to main content
SpringerLink
Log in

TopCom: Index for Shortest Distance Query in Directed Graph

  • Conference paper
  • First Online:
Database and Expert Systems Applications (Globe 2015, DEXA 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9261))

Abstract

Finding shortest distance between two vertices in a graph is an important problem due to its numerous applications in diverse domains, including geo-spatial databases, social network analysis, and information retrieval. Classical algorithms (such as, Dijkstra) solve this problem in polynomial time, but these algorithms cannot provide real-time response for a large number of bursty queries on a large graph. So, indexing based solutions that pre-process the graph for efficiently answering (exactly or approximately) a large number of distance queries in real-time are becoming increasingly popular. Existing solutions have varying performance in terms of index size, index building time, query time, and accuracy. In this work, we propose TopCom, a novel indexing-based solution for exactly answering distance queries in a directed acyclic graph (DAG). Our experiments with two of the existing state-of-the-art methods (IS-Label and TreeMap) show the superiority of TopCom over these two methods considering scalability and query time.

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

Notes

  1. 1.

    TopCom stands for Topological Compression which is the fundamental operation that is used to create the index data structure of this method.

  2. 2.

    http://snap.stanford.edu/data/index.html.

References

  1. Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: ACM SIGMOD, pp. 349–360 (2013)

    Google Scholar 

  2. Backstrom, L., Huttenlocher, D., Kleinberg, J., Lan, X.: Group formation in large social networks: membership, growth, and evolution. In: SIGMOD, pp. 44–54 (2006)

    Google Scholar 

  3. Cheng, J., Huang, S., Wu, H., Fu, A.W.C.: TF-Label: a topological-folding labeling scheme for reachability querying in a large graph. In: SIGMOD, pp. 193–204 (2013)

    Google Scholar 

  4. Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. In: SODA, pp. 937–946 (2002)

    Google Scholar 

  5. Fu, A.W.C., Wu, H., Cheng, J., Wong, R.C.W.: IS-Label: an independent-set based labeling scheme for point-to-point distance querying. VLDB 6, 457–468 (2013)

    Google Scholar 

  6. Hasan, M., Zaki, M.: A survey of link prediction in social networks. In: Aggarwal, C.C. (ed.) Social Network Data Analytics, pp. 243–275. Springer, US (2011)

    Chapter  Google Scholar 

  7. Jin, R., Ruan, N., Xiang, Y., Lee, V.: A highway-centric labeling approach for answering distance queries on large sparse graphs. In: SIGMOD, pp. 445–456 (2012)

    Google Scholar 

  8. Kargar, M., An, A.: Keyword search in graphs: Finding r-cliques. Proc. VLDB Endow. 4(10), 681–692 (2011)

    Article  Google Scholar 

  9. Massa, P., Avesani, P.: Trust-aware bootstrapping of recommender systems. In: ECAI Workshop on Recommender Systems, pp. 29–33 (2006)

    Google Scholar 

  10. Okamoto, K., Chen, W., Li, X.-Y.: Ranking of closeness centrality for large-scale social networks. In: Preparata, F.P., Wu, X., Yin, J. (eds.) FAW 2008. LNCS, vol. 5059, pp. 186–195. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Qiao, M., Cheng, H., Chang, L., Yu, J.: Approximate shortest distance computing: a query-dependent local landmark scheme. IEEE Trans. Knowl. Data Eng. 26(1), 55–68 (2014)

    Article  Google Scholar 

  12. Xiang, Y.: Answering exact distance queries on real-world graphs with bounded performance guarantees. VLDB J. 23(5), 677–695 (2014)

    Article  Google Scholar 

  13. Yan, D., Cheng, J., Ng, W., Liu, S.: Finding distance-preserving subgraphs in large road networks. In: ICDE, pp. 625–636 (2013)

    Google Scholar 

  14. Yildirim, H., Chaoji, V., Zaki, M.: Grail: a scalable index for reachability queries in very large graphs. VLDB J. 21(4), 509–534 (2012)

    Article  Google Scholar 

Download references

Acknowledgment

This research is supported by M. Hasan’s NSF CAREER award (IIS-1149851)

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, Indiana University Purdue University Indianapolis, Indianapolis, USA

    Vachik S. Dave & Mohammad Al Hasan

Authors
  1. Vachik S. Dave
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammad Al Hasan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vachik S. Dave .

Editor information

Editors and Affiliations

  1. Hewlett-Packard Enterprise, Sunnyvale, California, USA

    Qiming Chen

  2. Paul Sabatier University, Toulouse, France

    Abdelkader Hameurlain

  3. Blaise Pascal University, Aubiere, France

    Farouk Toumani

  4. University of Linz, Linz, Austria

    Roland Wagner

  5. Universidad Politécnica de Valencia, Valencia, Spain

    Hendrik Decker

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Dave, V.S., Hasan, M.A. (2015). TopCom: Index for Shortest Distance Query in Directed Graph. In: Chen, Q., Hameurlain, A., Toumani, F., Wagner, R., Decker, H. (eds) Database and Expert Systems Applications. Globe DEXA 2015 2015. Lecture Notes in Computer Science(), vol 9261. Springer, Cham. https://doi.org/10.1007/978-3-319-22849-5_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22849-5_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-22848-8

  • Online ISBN: 978-3-319-22849-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation