Skip to main content
SpringerLink
Log in

Database Research Challenges and Opportunities of Big Graph Data

  • Conference paper
Big Data (BNCOD 2013)

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

Included in the following conference series:

Abstract

Large volumes of graph-structured data are becoming increasingly prevalent in areas such as

  • social and professional network analysis

  • recommendation services, such as product advertisement, news and media alerts, learning resource recommendation, itinerary recommendation

  • scientific computing: life and health sciences, physical sciences

  • crime investigation and intelligence gathering

  • telecoms network management, for dependency analysis, root cause analysis, location-based service provision

  • linked open data

  • geospatial data

  • business process management: logistics, finance chains, fraud detection, risk analysis, asset management

  • organization management

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aurelius, http://thinkaurelius.com

  2. Cypher, http://docs.neo4j.org/chunked/milestone/cypher-query-lang.html

  3. Giraph, https://github.com/apache/giraph

  4. Gremlin, https://github.com/tinkerpop/gremlin/wiki/

  5. ISWC 2012 Big Graph Data Panel (2012), http://semanticweb.com/video-iswcs-big-graph-data-panels_b34112

  6. Linked Data Benchmark Council, http://www.ldbc.eu/

  7. Neo4j, http://neo4j.org

  8. Angles, R., Gutierrez, C.: Survey of graph database models. ACM Comput. Surv. 40(1) (2008)

    Google Scholar 

  9. Dominguez-Sal, D., Urbón-Bayes, P., Giménez-Vañó, A., Gómez-Villamor, S., Martínez-Bazán, N., Larriba-Pey, J.L.: Survey of graph database performance on the HPC scalable graph analysis benchmark. In: Shen, H.T., Pei, J., Özsu, M.T., Zou, L., Lu, J., Ling, T.-W., Yu, G., Zhuang, Y., Shao, J. (eds.) WAIM 2010. LNCS, vol. 6185, pp. 37–48. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  10. Faloutsos, C., Kang, U.: Mining billion-scale graphs: Patterns and algorithms. In: SIGMOD 2012, pp. 585–588 (2012)

    Google Scholar 

  11. Fernandez, M., Suciu, D.: Optimizing regular path expressions using graph schemas. In: ICDE 1998, pp. 14–23 (1998)

    Google Scholar 

  12. Haffmans, W.J., Fletcher, G.H.L.: Efficient RDFS entailment in external memory. In: Meersman, R., Dillon, T., Herrero, P. (eds.) OTM-WS 2011. LNCS, vol. 7046, pp. 464–473. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  13. Harris, S., Seaborne, A.: SPARQL 1.1 Query Language. In: W3C Recommendation (March 21, 2013)

    Google Scholar 

  14. Jin, R., Ruan, N., Dey, S., Xu, J.Y.: Scaling reachability computation on large graphs. In: SIGMOD 2012, pp. 169–180 (2012)

    Google Scholar 

  15. Kung, U., Tsourakakis, C.E., Faloutsos, C.: Pegasus: A peta-scale graph mining system - implementation and observations. In: International Conference on Data Mining 2009, pp. 229–238 (2009)

    Google Scholar 

  16. Ma, S., Cao, Y., Fan, W., Huai, J., Wo, T.: Capturing topology in graph pattern matching. PVLDB 5(4) (2012)

    Google Scholar 

  17. Malewicz, G., Austern, M.H., Bik, A.J.C., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: SIGMOD 2010, pp. 135–146 (2010)

    Google Scholar 

  18. Martinez-Bazan, N., Aguila-Lorente, M.A., Muntes-Mulero, V., Dominguez-Sal, D., Gomez-Villamor, S., Larriba-Pey, J.L.: Efficient graph management based on bitmap indices. In: IDEAS 2012, pp. 110–119 (2012)

    Google Scholar 

  19. Mondal, J., Deshpande, A.: Managing large dynamic graphs efficiently. In: SIGMOD 2012, pp. 145–156 (2012)

    Google Scholar 

  20. Morsey, M., Lehmann, J., Auer, S., Ngonga Ngomo, A.-C.: DBpedia SPARQL Benchmark – Performance Assessment with Real Queries on Real Data. In: Aroyo, L., Welty, C., Alani, H., Taylor, J., Bernstein, A., Kagal, L., Noy, N., Blomqvist, E. (eds.) ISWC 2011, Part I. LNCS, vol. 7031, pp. 454–469. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  21. Picalausa, F., Luo, Y., Fletcher, G.H.L., Hidders, J., Vansummeren, S.: A structural approach to indexing triples. In: Simperl, E., Cimiano, P., Polleres, A., Corcho, O., Presutti, V. (eds.) ESWC 2012. LNCS, vol. 7295, pp. 406–421. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  22. Poulovassilis, A., Wood, P.T.: Combining approximation and relaxation in semantic web path queries. In: Patel-Schneider, P.F., Pan, Y., Hitzler, P., Mika, P., Zhang, L., Pan, J.Z., Horrocks, I., Glimm, B. (eds.) ISWC 2010, Part I. LNCS, vol. 6496, pp. 631–646. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  23. Sarwat, M., Elnikety, S., He, Y., Kliot, G.: Horton: Online query execution engine for large distributed graphs. In: ICDE 2012, pp. 1289–1292 (2012)

    Google Scholar 

  24. Urbani, J., Kotoulas, S., Oren, E., van Harmelen, F.: Scalable distributed reasoning using mapReduce. In: Bernstein, A., Karger, D.R., Heath, T., Feigenbaum, L., Maynard, D., Motta, E., Thirunarayan, K. (eds.) ISWC 2009. LNCS, vol. 5823, pp. 634–649. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  25. Wood, P.T.: Query languages for graph databases. ACM SIGMOD Record 41(1), 50–60 (2012)

    Article  Google Scholar 

  26. Yildirim, H., Chaoji, V., Zaki, M.J.: GRAIL: Scalable reachability index for large graphs. PVLDB 3(1-2), 276–284 (2010)

    Google Scholar 

  27. Yuan, Y., Wang, G., Wang, H., Chen, L.: Efficient subgraph search over large uncertain graphs. PVLDB 4(11) (2011)

    Google Scholar 

  28. Zeng, K., Yang, J., Wang, H., Shao, B., Wang, Z.: A distributed graph engine for web scale RDF data. PVLDB 6(4) (2013)

    Google Scholar 

  29. Zou, Z., Gao, H., Li, J.: Mining frequent subgraph patterns from uncertain graph data. TKDE 22(9), 1203–1218 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. London Knowledge Lab, University of London, UK, Birkbeck

    Alexandra Poulovassilis

Authors
  1. Alexandra Poulovassilis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3 QD, Oxford, UK

    Georg Gottlob

  2. Department of Computer Science, Oxford University, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK

    Giovanni Grasso  & Christian Schallhart  & 

  3. University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK

    Dan Olteanu

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Poulovassilis, A. (2013). Database Research Challenges and Opportunities of Big Graph Data. In: Gottlob, G., Grasso, G., Olteanu, D., Schallhart, C. (eds) Big Data. BNCOD 2013. Lecture Notes in Computer Science, vol 7968. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39467-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39467-6_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39466-9

  • Online ISBN: 978-3-642-39467-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation