Giacomo Bergami
André Petermann
ABSTRACT
Despite the growing popularity of techniques related to graph summarization, a general operator for the flexible nesting of graphs is still missing. We propose a novel nested graph data model and a powerful graph nesting operator. In contrast to existing approaches, our approach is able to summarize vertices and paths among vertex groups within a single query. Further on, our model supports partial nestings under the preservation of original graph elements as well as the full recovery of the original graph. We propose an efficient nesting algorithm (THoSP) that is able to perform vertex and path nestings in a single visit of the input graph. Results of an experimental evaluation show that THoSP outperforms equivalent implementations based on graph (Cypher, SPARQL), relational (SQL) and document oriented (ArangoDB) databases.
- Renzo Angles. 2012. A Comparison of Current Graph Database Models. In Proceedings of the 2012 IEEE 28th International Conference on Data Engineering Workshops (ICDEW '12). IEEE Computer Society, Washington, DC, USA, 171--177. Google Scholar
Digital Library
- G. Bagan, A. Bonifati, R. Ciucanu, G. H. L. Fletcher, A. Lemay, and N. Advokaat. 2017. gMark: Schema-Driven Generation of Graphs and Queries. IEEE Transactions on Knowledge and Data Engineering 29, 4 (2017), 856--869. Google ScholarDigital Library
- Giacomo Bergami. 2018. A new Nested Graph Model for Data Integration. Ph.D. Dissertation. Alma Mater Studiorum - University of Bologna. http://rebrand.ly/401un9a611Google Scholar
- Giacomo Bergami, Matteo Magnani, and Danilo Montesi. 2017. A Join Operator for Property Graphs. In Proceedings of the Workshops of the EDBT/ICDT 2017 Joint Conference (EDBT/ICDT 2017), Venice, Italy, March 21-24, 2017.Google Scholar
- Ulrik Brandes, Markus Eiglsperger, Jürgen Lerner, and Christian Pich. 2007. Graph Markup Language (GraphML). In Handbook of Graph Drawing and Visualization, Roberto Tamassia (Ed.). CRC Press.Google Scholar
- Piotr Bródka and Przemyslaw Kazienko. 2014. Multilayered Social Networks. In Encyclopedia of Social Network Analysis and Mining. 998--1013.Google Scholar
- Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han, and Philip S. Yu. 2008. Graph OLAP: Towards Online Analytical Processing on Graphs.. In ICDM. IEEE Computer Society, 103--112. Google ScholarDigital Library
- Gong Cheng, Cheng Jin, and Yuzhong Qu. 2016. HIEDS: A Generic and Efficient Approach to Hierarchical Dataset Summarization. In Procs. of IJCAI 2016. 3705--3711. Google ScholarDigital Library
- Lorena Etcheverry and Alejandro A. Vaisman. 2012. QB4OLAP: A Vocabulary for OLAP Cubes on the Semantic Web.. In COLD (CEUR Workshop Proceedings), Juan Sequeda, Andreas Harth, and Olaf Hartig (Eds.), Vol. 905. CEUR-WS.org. Google ScholarDigital Library
- David Genest and Eric Salvat. 1998. A Platform Allowing Typed Nested Graphs: How CoGITo Became CoGITaNT (Research Note). In Conceptual Structures: Theory, Tools and Applications, 6th International Conference on Conceptual Structures, ICCS '98, Montpellier, France, August 10-12, 1998, Proceedings. 154--164. Google ScholarDigital Library
- Sairam Gurajada, Stephan Seufert, Iris Miliaraki, and Martin Theobald. 2014. Using Graph Summarization for Join-Ahead Pruning in a Distributed RDF Engine. In Proceedings of Semantic Web Information Management on Semantic Web Information Management (SWIM'14). ACM, New York, NY, USA, Article 41, 4 pages. Google ScholarDigital Library
- David Harel. 1987. Statecharts: A Visual Formalism for Complex Systems. Sci. Comput. Program. 8, 3 (June 1987), 231--274. Google ScholarDigital Library
- Richard C. Holt, Andy Schürr, Susan E. Sim, and Andreas Winter. 2006. GXL: A graph-based standard exchange format for reengineering. Sci. Comput. Program. 60, 2 (2006), 149--170. Google ScholarDigital Library
- Wararat Jakawat, Cécile Favre, and Sabine Loudcher. 2015. OLAP Cube-based Graph Approach for Bibliographic Data. In SOFSEM 2016. Harrachov, Czech Republic.Google Scholar
- Martin Junghanns, André Petermann, and Erhard Rahm. 2017. Distributed Grouping of Property Graphs with Gradoop. In Datenbanksysteme für Business, Technologie und Web (BTW 2017), 17. Fachtagung des GI-Fachbereichs Datenbanken und Informationssysteme" (DBIS), 6.-10. März 2017, Stuttgart, Germany, Proceedings. 103--122.Google Scholar
- Casimir A. Kulikowski and Sholom M. Weiss. 1982. Representation of Expert Knolwedge for Consultation: The CASNET and EXPERT proejcts. In Artificial Intelligence in Medicine. Westview Press, Boulder, Colorado.Google Scholar
- P. Odifreddi. 1992. Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers (Studies in Logic and the Foundations of Mathematics) (new ed ed.). North Holland.Google Scholar
- Minjae Park, Hyun Ahn, and Kwanghoon Pio Kim. 2016. Workflow-supported social networks: Discovery, analyses, and system. Journal of Network and Computer Applications 75 (2016), 355 -- 373. Google ScholarDigital Library
- A. Poulovassilis and M. Levene. 1994. A Nested-Graph Model for the Representation and Manipulation of Complex Objects. ACM Trans. Information Systems 12, 1 (1994), 35--68. Google ScholarDigital Library
- Qiang Qu, Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu, and Hongyan Li. 2011. Efficient Topological OLAP on Information Networks. Springer Berlin Heidelberg, Berlin, Heidelberg, 389--403. Google ScholarDigital Library
- Alexander Richter, Julia Heidemann, Mathias Klier, and Sebastian Behrendt. 2013. Success Measurement of Enterprise Social Networks. Wirtschaftsinformatik 20 (2013).Google Scholar
- Arnab Sinha, Zhihong Shen, Yang Song, Hao Ma, Darrin Eide, Bo-June (Paul) Hsu, and Kuansan Wang. 2015. An Overview of Microsoft Academic Service (MAS) and Applications. In Proceedings of the 24th International Conference on World Wide Web (WWW '15 Companion). ACM, New York, NY, USA, 243--246. Google ScholarDigital Library
- Jie Tang, Jing Zhang, Limin Yao, Juanzi Li, Li Zhang, and Zhong Su. 2008. Arnet-Miner: Extraction and Mining of Academic Social Networks. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '08). ACM, New York, NY, USA, 990--998. Google ScholarDigital Library
- Yuanyuan Tian, Richard A. Hankins, and Jignesh M. Patel. 2008. Efficient Aggregation for Graph Summarization (SIGMOD). 567--580. Google ScholarDigital Library
- Elena Vasilyeva, Maik Thiele, Christof Bornhövd, and Wolfgang Lehner. 2013. Leveraging Flexible Data Management with Graph Databases. In First International Workshop on Graph Data Management Experiences and Systems (GRADES '13). ACM, New York, NY, USA, Article 12, 6 pages. Google ScholarDigital Library
- Jierui Xie, Stephen Kelley, and Boleslaw K. Szymanski. 2013. Overlapping Community Detection in Networks: The State-of-the-art and Comparative Study. ACM Comput. Surv. 45, 4, Article 43 (Aug. 2013), 35 pages. Google ScholarDigital Library
- Dan Yin and Hong Gao. 2016. A flexible aggregation framwork on large-scale heterogeneous information networks. In Journal of Information Science. 1--18. Google ScholarDigital Library
- Peixiang Zhao, Xiaolei Li, Dong Xin, and Jiawei Han. 2011. Graph Cube: On Warehousing and OLAP Multidimensional Networks. In Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data (SIGMOD '11). ACM, New York, NY, USA, 853--864. Google ScholarDigital Library
Index Terms
- THoSP: an algorithm for nesting property graphs
Recommendations
On approximate nesting of multiple social network graphs: a preliminary study
IDEAS '19: Proceedings of the 23rd International Database Applications & Engineering SymposiumA fundamental problem in Social Network Analysis is how to move from single-layer to multi-layer, which provide a holistic view. User profiles resolution has received considerable attention since it allows to match users on different online social ...
Customizing a Fisheye View Algorithm to Preserve the Mental Map
Frequently, large knowledge bases are represented by graphs. Many visualization tools allow users or other applications to interact with and adjust the layouts of these graphs. One layout adjustment problem is that of showing more detail without eliding ...
On the Multichromatic Number of s-Stable Kneser Graphs
For positive integers n and s, a subset Sï [n] is s-stable if sï |i-j|ï n-s for distinct i,j∈S . The s-stable r-uniform Kneser hypergraph KGrn,ks-stable is the r-uniform hypergraph that has the collection of all s-stable k-element subsets of [n] as ...
Comments