Article

An Analytics-Aware Conceptual Model for Evolving Graphs

Authors:

Amine Ghrab,

Sabri Skhiri,

Salim Jouili,

Esteban ZimányiAuthors Info & Claims

DaWaK 2013: Proceedings of the 15th International Conference on Data Warehousing and Knowledge Discovery - Volume 8057

Pages 1 - 12

https://doi.org/10.1007/978-3-642-40131-2_1

Published: 26 August 2013 Publication History

Abstract

Graphs are ubiquitous data structures commonly used to represent highly connected data. Many real-world applications, such as social and biological networks, are modeled as graphs. To answer the surge for graph data management, many graph database solutions were developed. These databases are commonly classified as NoSQL graph databases, and they provide better support for graph data management than their relational counterparts. However, each of these databases implement their own operational graph data model, which differ among the products. Further, there is no commonly agreed conceptual model for graph databases.

In this paper, we introduce a novel conceptual model for graph databases. The aim of our model is to provide analysts with a set of simple, well-defined, and adaptable conceptual components to perform rich analysis tasks. These components take into account the evolving aspect of the graph. Our model is analytics-oriented, flexible and incremental, enabling analysis over evolving graph data. The proposed model provides a typing mechanism for the underlying graph, and formally defines the minimal set of data structures and operators needed to analyze the graph.

References

[1]

Angles, R., Gutierrez, C.: Survey of graph database models. ACM Comput. Surv. 401, 1:1---1:39 2008

Digital Library

Google Scholar

[2]

Tang, J., Liu, H., Gao, H., Das Sarmas, A.: eTrust: understanding trust evolution in an online world. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 253---261. ACM 2012

Digital Library

Google Scholar

[3]

Vicknair, C., Macias, M., Zhao, Z., Nan, X., Chen, Y., Wilkins, D.: A comparison of a graph database and a relational database: a data provenance perspective. In: Proceedings of the 48th Annual Southeast Regional Conference, pp. 42:1---42:6. ACM 2010

Digital Library

Google Scholar

[4]

Sadalage, P.J., Fowler, M.: NoSQL Distilled: A Brief Guide to the Emerging World of Polyglot Persistence. Addison-Wesley Professional 2012

Digital Library

Google Scholar

[5]

Romero, O., Abelló, A.: On the need of a reference algebra for OLAP. In: Song, I.-Y., Eder, J., Nguyen, T.M. eds. DaWaK 2007. LNCS, vol. 4654, pp. 99---110. Springer, Heidelberg 2007

Digital Library

Google Scholar

[6]

Tian, Y., Hankins, R.A., Patel, J.M.: Efficient aggregation for graph summarization. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 567---580. ACM 2008

Digital Library

Google Scholar

[7]

Zhao, P., Li, X., Xin, D., Han, J.: Graph cube: on warehousing and OLAP multidimensional networks. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, pp. 853---864. ACM 2011

Digital Library

Google Scholar

[8]

Chen, C., Yan, X., Zhu, F., Han, J., Yu, P.S.: Graph OLAP: a multi-dimensional framework for graph data analysis. Knowl. Inf. Syst. 211, 41---63 2009

Digital Library

Google Scholar

[9]

Malewicz, G., Austern, M.H., Bik, A.J., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 135---146. ACM 2010

Digital Library

Google Scholar

[10]

Ren, C., Lo, E., Kao, B., Zhu, X., Cheng, R.: On querying historical evolving graph sequences. Proceedings of the VLDB Endowment 411, 726---737 2011

Digital Library

Google Scholar

[11]

Khurana, U., Deshpande, A.: Efficient snapshot retrieval over historical graph data. arXiv preprint arXiv:1207.5777 2012

Google Scholar

[12]

Andonoff, E., Hubert, G., Parc, A., Zurfluh, G.: Modelling inheritance, composition and relationship links between objects, object versions and class versions. In: Iivari, J., Rossi, M., Lyytinen, K. eds. CAiSE 1995. LNCS, vol. 932, pp. 96---111. Springer, Heidelberg 1995

Digital Library

Google Scholar

[13]

Yin, M., Wu, B., Zeng, Z.: HMGraph OLAP: a novel framework for multi-dimensional heterogeneous network analysis. In: Proceedings of the 15th International Workshop on Data Warehousing and OLAP, pp. 137---144. ACM 2012

Digital Library

Google Scholar

[14]

Thusoo, A., Sarma, J.S., Jain, N., Shao, Z., Chakka, P., Anthony, S., Liu, H., Wyckoff, P., Murthy, R.: Hive: a warehousing solution over a map-reduce framework. Proceedings of the VLDB Endowment 22, 1626---1629 2009

Digital Library

Google Scholar

Cited By

View all

Tsoukanara EKoloniari GPitoura E(2023)Skyline-Based Temporal Graph ExplorationAdvances in Databases and Information Systems10.1007/978-3-031-42914-9_7(88-102)Online publication date: 4-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-42914-9_7
Queiroz-Sousa PSalgado A(2019)A Review on OLAP Technologies Applied to Information NetworksACM Transactions on Knowledge Discovery from Data10.1145/337091214:1(1-25)Online publication date: 13-Dec-2019
https://dl.acm.org/doi/10.1145/3370912
Yan DBu YTian YDeshpande A(2017)Big Graph Analytics PlatformsFoundations and Trends in Databases10.1561/19000000567:1-2(1-195)Online publication date: 12-Jan-2017
https://dl.acm.org/doi/10.1561/1900000056
Show More Cited By

Recommendations

Comparability Graphs Among Cover-Incomparability Graphs
Algorithms and Discrete Applied Mathematics
Abstract
Comparability graphs and cover-incomparability graphs (C-I graphs) are two interesting classes of graphs from posets. Comparability graph of a poset $P = (V, \leq)$ is a graph with vertex set V and two vertices u and v are adjacent in V if u and v are ...
Collapsible graphs and Hamiltonian connectedness of line graphs

Thomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai [Z.-H. Chen, H.-J. Lai, Reduction techniques for super-Eulerian graphs and related topics-an update, in: Ku Tung-Hsin (Ed.), Combinatorics and Graph Theory, vol. 95, ...
Equimatchable Graphs on Surfaces

A graph G is equimatchable if each matching in G is a subset of a maximum-size matching and it is factor critical if G-v has a perfect matching for each vertex v of G. It is known that any 2-connected equimatchable graph is either bipartite or factor ...

Comments

Information & Contributors

Information

Published In

DaWaK 2013: Proceedings of the 15th International Conference on Data Warehousing and Knowledge Discovery - Volume 8057

August 2013

371 pages

ISBN:9783642401305

Editors:
Ladjel Bellatreche
LIAS/ISAE-ENSMA, Futuroscope Chasseneuil Cedex, France
,
Mukesh Mohania
IBM India Research Lab, New Delhi, India

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 26 August 2013

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Tsoukanara EKoloniari GPitoura E(2023)Skyline-Based Temporal Graph ExplorationAdvances in Databases and Information Systems10.1007/978-3-031-42914-9_7(88-102)Online publication date: 4-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-42914-9_7
Queiroz-Sousa PSalgado A(2019)A Review on OLAP Technologies Applied to Information NetworksACM Transactions on Knowledge Discovery from Data10.1145/337091214:1(1-25)Online publication date: 13-Dec-2019
https://dl.acm.org/doi/10.1145/3370912
Yan DBu YTian YDeshpande A(2017)Big Graph Analytics PlatformsFoundations and Trends in Databases10.1561/19000000567:1-2(1-195)Online publication date: 12-Jan-2017
https://dl.acm.org/doi/10.1561/1900000056
Kordjamshidi PRoth DWu H(2015)SaulProceedings of the 24th International Conference on Artificial Intelligence10.5555/2832415.2832505(1844-1851)Online publication date: 25-Jul-2015
https://dl.acm.org/doi/10.5555/2832415.2832505

Abstract

References

Cited By

Recommendations

Comparability Graphs Among Cover-Incomparability Graphs

Collapsible graphs and Hamiltonian connectedness of line graphs

Equimatchable Graphs on Surfaces

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations