Abstract
Real world data offers a lot of possibilities to be represented as graphs. As a result we obtain undirected or directed graphs, multigraphs and hypergraphs, labelled or weighted graphs and their variants. A development of graph modelling brings also new approaches, e.g., considering constraints. Processing graphs in a database way can be done in many different ways. Some graphs can be represented as JSON or XML structures and processed by their native database tools. More generally, a graph database is specified as any storage system that provides index-free adjacency, i.e. an explicit graph structure. Graph database technology contains some technological features inherent to traditional databases, e.g. ACID properties and availability. Use cases of graph databases like Neo4j, OrientDB, InfiniteGraph, FlockDB, AllegroGraph, and others, document that graph databases are becoming a common means for any connected data. In Big Data era, important questions are connected with scalability for large graphs as well as scaling for read/write operations. For example, scaling graph data by distributing it in a network is much more difficult than scaling simpler data models and is still a work in progress. Still a challenge is pattern matching in graphs providing, in principle, an arbitrarily complex identity function. Mining complete frequent patterns from graph databases is also challenging since supporting operations are computationally costly. In this paper, we discuss recent advances and limitations in these areas as well as future directions.
Chapter PDF
Similar content being viewed by others
References
Angeles, R.: A comparison of current graph database models. In: Proc. of the 2012 IEEE 28th International Conference on Data Engineering Workshops, ICDEW 2012, pp. 171–177. IEEE Computer Society, Washington (2012)
Angeles, R., Gutierrez, C.: Survey of Graph Database Models. ACM Computing Surveys 40(1), Article 1 (2008)
De Virgilio, R., Maccioni, A., Torlone, R.: Model-driven design of graph databases. In: Yu, E., Dobbie, G., Jarke, M., Purao, S. (eds.) ER 2014. LNCS, vol. 8824, pp. 172–185. Springer, Heidelberg (2014)
Holzschuher, F., Peinl, R.: Performance of graph query languages: comparison of cypher, gremlin and native access in Neo4j. In: Proc. of the Joint EDBT/ICDT 2013 Workshops, EDBT 2013, pp. 195–204. ACM, NY (2013)
Hurwitz, J., Nugent, A., Halper, F., Kaufman, M.: Big Data for Dummies. John Wiley & Sons, Inc. (2013)
Kolomičenko, V., Svoboda, M., Holubová – Mlýnková, I.: Experimental comparison of graph databases. In: Proc. of International Conference on Information Integration and Web-based Applications & Services, p. 115. ACM, NY (2013)
Larriba-Pey, J.L., Martínez-Bazán, N., Domínguez-Sal, D.: Introduction to graph databases. In: Koubarakis, M., Stamou, G., Stoilos, G., Horrocks, I., Kolaitis, P., Lausen, G., Weikum, G. (eds.) Reasoning Web. LNCS, vol. 8714, pp. 171–194. Springer, Heidelberg (2014)
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: Proc. of SIGMOD 2010 Int. Conf. on Management of data, pp. 135–146. ACM, NY (2010)
McColl, R., Ediger, D., Poovey, J., Campbell, D., Bader, D.A.: A performance evaluation of open source graph databases. In: Proc. of PPAA 2014, pp. 11–18. ACM, NY (2014)
Ontotext: The Truth about Triplestores. Ontotext (2014)
Pace, M.F.: BSP vs MapReduce. Procedia Computer Science 9, 246–255 (2012)
Pallavi, M., Saxena, A.: Review: Graph Databases. Int. Journal of Advanced Research in Computer Science and Software Engineering 4(5), 195–200 (2014)
Pokorny, J., Snášel, V.: Big graph storage, processing and visualization. In: Pitas, I. (ed.) Graph-Based Social Media Analysis, pp. 403–430. Chapman and Hall/CRC (in print, 2015)
Rastogi, V., Machanavajjhala, A., Chitnis, L., Sarma, A.D.: Finding Connected Components on Map-reduce in Logarithmic Rounds. CoRR, abs/1203.5387. ACM (2012)
Robinson, I., Webber, J., Eifrém, E.: Graph Databases. O’Reilly Media (2013)
Shimpi, D., Chaudhari, S.: An overview of Graph Databases. IJCA Proceedings on International Conference on Recent Trends in Information Technology and Computer Science 2012 ICRTITCS(3), 16–22 (2013)
Yan, X., Yu, P.S., Han, J.: Graph indexing: a frequent structure –based approach. In: Proc. of SIGMOD 2004 Int. Conf. on Management of Data, pp. 335–346. ACM, NY (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 IFIP International Federation for Information Processing
About this paper
Cite this paper
Pokorný, J. (2015). Graph Databases: Their Power and Limitations. In: Saeed, K., Homenda, W. (eds) Computer Information Systems and Industrial Management. CISIM 2015. Lecture Notes in Computer Science(), vol 9339. Springer, Cham. https://doi.org/10.1007/978-3-319-24369-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-24369-6_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24368-9
Online ISBN: 978-3-319-24369-6
eBook Packages: Computer ScienceComputer Science (R0)