Skip to main content
SpringerLink
Log in

Bounded Paths for LCR Queries in Labeled Weighted Directed Graphs

  • Conference paper
  • First Online:
Advances in Computing and Data Sciences (ICACDS 2018)

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

Included in the following conference series:

Abstract

Most of the data in the Big Data era is semi-structured or unstructured that can be modeled as graphs where nodes could be objects and edges represent the relations among the objects. Given a source and destination vertex along with label-constraint set, the Label-Constraint Reachability(LCR) query finds the existence of a path between the source vertex and destination vertex within the label-constraint. The objective of the paper is to find the label-constrained paths efficiently bounded by cost. We extend and propose landmark based path indexing to compute bounded paths for LCR queries in graphs. It involves choosing a subset of nodes as landmark nodes, constructing an index that constitutes their reachable nodes and corresponding path information. For each non-landmark node, an additional index is constructed that constitutes the reachability to landmark nodes and their corresponding path information. In query processing, these indices are used to check for the reachability and find the bounded paths efficiently. Experiments were conducted on real graphs and benchmark synthetic datasets.

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.

    http://tinyurl.com/gnexfoy.

References

  1. Valstar, L.D.J., Fletcher, G.H.L., Yoshida, Y.: Landmark indexing for evaluation of label-constrained reachability queries. In: Proceedings of 2017 ACM International Conference on Management of Data, SIGMOD, Chicago (2017)

    Google Scholar 

  2. Singh, K., Singh, V.: Graph pattern matching: a brief survey of challenges and research directions. In: 3rd International Conference on Computing for Sustainable Global Development, pp. 199–204. IEEE(2016)

    Google Scholar 

  3. Erez, A., Nadel, A.: Finding bounded path in graph using SMT for automatic clock routing. In: Kroening, D., Păsăreanu, C.S. (eds.) CAV 2015. LNCS, vol. 9207, pp. 20–36. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21668-3_2

    Chapter  Google Scholar 

  4. Zou, L., Xu, K., Chen, L., Xiao, Y., Zhao, D., Yu, J.X.: Efficient processing of label-constraint reachability queries in large graphs. J. Inf. Syst. 40, 47–66 (2014)

    Article  Google Scholar 

  5. Chen, M., Gu, Y., Bao, Y., Yu, G.: Label and distance-constraint reachability queries in uncertain graphs. In: Bhowmick, S.S., Dyreson, C.E., Jensen, C.S., Lee, M.L., Muliantara, A., Thalheim, B. (eds.) DASFAA 2014. LNCS, vol. 8421, pp. 188–202. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-05810-8_13

    Chapter  Google Scholar 

  6. Bonchi, F., Gionis, A., Gullo, F., Ukkonen, A.: Distance Oracles in edge-labeled graphs. In: Proceedings of the 17th International Conference on Extending Database Technology, pp. 547–558. EDBT (2014)

    Google Scholar 

  7. Qiao, M., Cheng, H., Qin, L., Yu, J.X., Yu, P.S., Chang, L.: Computing weight constraint reachability in large networks. VLDB J. 22(3), 275–294 (2013)

    Article  Google Scholar 

  8. Likhyani, A., Bedathur, S.: Label constrained shortest path estimation. In: 22nd International Conference on Information and Knowledge Management, pp. 1177–1180. ACM (2013)

    Google Scholar 

  9. Fan, W., Li, J., Ma, S., Tang, N., Wu, Y.: Adding regular expressions to graph reachability and pattern queries. In: 27th IEEE Proceedings of ICDE, pp. 39–50 (2011)

    Google Scholar 

  10. Malewicz, G., et al.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 135–146 (2010)

    Google Scholar 

  11. Aggarwal, C.C., Wang, H.: Managing and Mining Graph Data. Advances in Database Systems Series. Springer, New York (2010). https://doi.org/10.1007/978-1-4419-6045-0

    Book  MATH  Google Scholar 

  12. Jin, R., Hong, H., Wang, H., Ruan, N., Xiang, Y.: Computing label-constraint reachability in graph databases. In: Proceedings of the ACM International Conference on Management of Data, USA, pp. 123–134 (2010)

    Google Scholar 

  13. Barrett, C., Jacob, R., Marathe, M.: Formal-language constrained path problems, SIAM J. Comput. 30(3), 809–837 (2000)

    Article  MathSciNet  Google Scholar 

  14. Neo4j. https://neo4j.com/

  15. InfiniteGraph.http://www.objectivity.com/infinitegraph

  16. Twitter FlockDB. https://github.com/twitter/flockdb

  17. SNAP: A general purpose network analysis and graph mining library in C++. http://snap.stanford.edu/snap

  18. Konect - the Koblenz Network Collection. http://konect.uni-koblenz.de/

Download references

Author information

Authors and Affiliations

  1. School of Computer and Information Sciences, University of Hyderabad, Hyderabad, Telangana, India

    B. Bhargavi & K. Swarupa Rani

Authors
  1. B. Bhargavi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Swarupa Rani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to B. Bhargavi .

Editor information

Editors and Affiliations

  1. University of KwaZulu-Natal, Durban, South Africa

    Mayank Singh

  2. Jaypee University of Information Technology, Solan, India

    P. K. Gupta

  3. Jaypee University of Engineering and Technology, Guna, Madhya Pradesh, India

    Vipin Tyagi

  4. Institute of Information Theory and Automation, Prague 8, Czech Republic

    Jan Flusser

  5. University of Ottawa, Ottawa, Canada

    Tuncer Ören

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bhargavi, B., Rani, K.S. (2018). Bounded Paths for LCR Queries in Labeled Weighted Directed Graphs. In: Singh, M., Gupta, P., Tyagi, V., Flusser, J., Ören, T. (eds) Advances in Computing and Data Sciences. ICACDS 2018. Communications in Computer and Information Science, vol 905. Springer, Singapore. https://doi.org/10.1007/978-981-13-1810-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-1810-8_13

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-1809-2

  • Online ISBN: 978-981-13-1810-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation