Skip to main content

Uncertain Graph Data Management

  • Reference work entry
  • First Online:
Encyclopedia of Database Systems
  • 28 Accesses

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 6,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Abiteboul S, Kanellakis P, Grahne G. On the representation and querying of sets of possible worlds. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1987. p. 34–48.

    MATH  Google Scholar 

  2. Aggarwal CC, Yu PS. A survey of uncertain data algorithms and applications. IEEE Trans Knowl Data Eng. 2009;21(5):609–23.

    Article  Google Scholar 

  3. Ball MO. Network reliability analysis: algorithms and complexity. Cornell University, 1977.

    Google Scholar 

  4. Chen M, Gu Y, Bao Y, Yu G. Label and distance-constraint reachability queries in uncertain graphs. In: Database systems for advanced applications. Springer; 2014. p. 188–202.

    Google Scholar 

  5. Colbourn CJ. The combinatorics of network reliability. Oxford: Oxford University Press; 1987.

    Google Scholar 

  6. Frank H. Shortest paths in probabilistic graphs. Oper Res. 1969;17(4):583–99.

    Article  MathSciNet  MATH  Google Scholar 

  7. Frank H, Hakimi S. Probabilistic flows through a communication network. IEEE Trans Circuit Theory. 1965;12(3):413–4.

    Article  Google Scholar 

  8. Fu Y, Yau SS. A note on the reliability of communication networks. J Soc Ind Appl Math. 1962;10(3): 469–74.

    Article  MathSciNet  MATH  Google Scholar 

  9. Green TJ, Tannen V. Models for incomplete and probabilistic information. In: Current trends in database technology–EDBT 2006. Berlin: Springer; 2006. p. 278–96.

    Chapter  Google Scholar 

  10. Hintsanen P. The most reliable subgraph problem. In: Principles of Data Mining and Knowledge Discovery, 11th European Conference; 2007. p. 471–8.

    Google Scholar 

  11. Hintsanen P, Toivonen H. Finding reliable subgraphs from large probabilistic graphs. Data Min Knowl Discov. 2008;17(1):3–23.

    Article  MathSciNet  Google Scholar 

  12. Hintsanen P, Toivonen H, Sevon P. Fast discovery of reliable subnetworks. In: Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining; 2010. p. 104–11.

    Google Scholar 

  13. Jin R, Liu L, Ding B, Wang H. Distance-constraint reachability computation in uncertain graphs. Proc VLDB Endow. 2011;4(9):551–562.

    Article  Google Scholar 

  14. Khan A, Bonchi F, Gionis A, Gullo F. Fast reliability search in uncertain graphs. In: Proceedings of the 17th International Conference on Extending Database Technology; 2014. p. 535–46.

    Google Scholar 

  15. Li R-H, Yu JX, Shang Z. Estimating node influenceability in social networks. arXiv preprint arXiv:1207.0913; 2012.

    Google Scholar 

  16. Lian X, Chen L. Efficient query answering in probabilistic RDF graphs. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2011. p. 157–68.

    Google Scholar 

  17. Mine H. Reliability of physical system. IRE Trans Inf Theory. 1959;5(5):138–51.

    Article  Google Scholar 

  18. Moore EF, Shannon CE. Reliable circuits using less reliable relays. J Frankl Inst. 1956;262(3): 191–208.

    Article  MathSciNet  MATH  Google Scholar 

  19. Moskowitz F. The analysis of redundancy networks. Trans Am Inst Electr Eng Part I Commun Electron. 1958;77(5):627–32.

    Google Scholar 

  20. Moustafa WE, Kimmig A, Deshpande A, Getoor L. Subgraph pattern matching over uncertain graphs with identity linkage uncertainty. In: Proceedings of the 30th International Conference on Data Engineering; 2014. p. 904–15.

    Google Scholar 

  21. Potamias M, Bonchi F, Gionis A, Kollios G. k-nearest neighbors in uncertain graphs. Proc VLDB Endow. 2010;3(1):997–1008.

    Article  Google Scholar 

  22. Von Neumann J. Probabilistic logics and the synthesis of reliable organisms from unreliable components. Automata Studies. 1956;34:43–98.

    MathSciNet  Google Scholar 

  23. Yuan Y, Wang G, Chen L, Wang H. Efficient subgraph similarity search on large probabilistic graph databases. Proc VLDB Endow. 2012;5(9):800–11.

    Article  Google Scholar 

  24. Yuan Y, Wang G, Wang H, Chen L. Efficient subgraph search over large uncertain graphs. In: Proceedings of the 37th International Conference on Very Large Data Bases; 2011.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lin Liu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Liu, L., Lee, V.E., Jin, R. (2018). Uncertain Graph Data Management. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_80761

Download citation

Publish with us

Policies and ethics