Applying DAC Principles to the RDF Graph Data Model

Background/Objectives: It is still a challenging issue to represent the reification effectively since the reification representation of RDF standard has been revealed some drawbacks.Methods/Statistical analysis: Currently, there are two main graph data models: RDF and LPG. LPG is a popular graph data model that is usually applied to NoSQL graph databases.This paper derives three types of the reification structures in terms of the structural and semantic relationships of the reification statements. The detailed representation of each type of the reification is presented with the extended LPG model.Findings: This paper proposes a novel approach to represent the reification structure of RDF from the perspective of LPG. The paper explores the formal, conceptual properties of the conventional LPG models and proposes their extension to capture more complex knowledge structures efficiently. These augmentations of LPG can achieve more efficient and flexible resource modeling. This paper derives three types of the reification structures in terms of the structural and semantic relationships of the reification statements: assertion, quantification, and entailment.The proposed approach not only preserves the structure and semantics of the reification but also enables LPG modeling of the complex structural statements to be easy and intuitive.This can contribute to transfer RDF graphs into LPGs.Improvements/Applications: The implementation of the extended LPG and the query processing of the reification remain future work.

Download Full-text

A Survey of RDF Stores & SPARQL Engines for Querying Knowledge Graphs

10.20944/preprints202104.0199.v1 ◽

2021 ◽

Author(s):

Waqas Ali ◽

Muhammad Saleem ◽

Yao Bin ◽

Aidan Hogan ◽

A.-C. Ngonga Ngomo

Keyword(s):

Data Model ◽

Incomplete Data ◽

Large Scale ◽

Query Language ◽

Real World Data ◽

Diverse Range ◽

Survey Paper ◽

Rdf Graph ◽

Knowledge Graphs ◽

Rdf Graphs

Recent years have seen the growing adoption of non-relational data models for representing diverse, incomplete data. Among these, the RDF graph-based data model has seen ever-broadening adoption, particularly on the Web. This adoption has prompted the standardization of the SPARQL query language for RDF, as well as the development of a variety of local and distributed engines for processing queries over RDF graphs. These engines implement a diverse range of specialized techniques for storage, indexing, and query processing. A number of benchmarks, based on both synthetic and real-world data, have also emerged to allow for contrasting the performance of different query engines, often at large scale. This survey paper draws together these developments, providing a comprehensive review of the techniques, engines and benchmarks for querying RDF knowledge graphs.

Download Full-text

Network Vulnerability Analysis Using a Constrained Graph Data Model

Information Systems Security - Lecture Notes in Computer Science ◽

10.1007/978-3-319-49806-5_14 ◽

2016 ◽

pp. 263-282 ◽

Cited By ~ 3

Author(s):

Mridul Sankar Barik ◽

Chandan Mazumdar ◽

Amarnath Gupta

Keyword(s):

Data Model ◽

Vulnerability Analysis ◽

Network Vulnerability ◽

Graph Data

Download Full-text

Design of a Data Model for Social Network Applications

Data Warehousing and Mining ◽

10.4018/978-1-59904-951-9.ch140 ◽

2008 ◽

pp. 2338-2363

Author(s):

Susanta Mitra ◽

Aditya Bagchi ◽

A. K. Bandyopadhyay

Keyword(s):

Social Network ◽

Directed Graph ◽

Data Model ◽

Generic Model ◽

Social Community ◽

Graph Data ◽

Related Data ◽

Network Applications ◽

Object Relational ◽

The Common

A social network defines the structure of a social community like an organization or institution, covering its members and their inter-relationships. Social relationships among the members of a community can be of different types like friendship, kinship, professional, academic, and so forth. Traditionally, a social network is represented by a directed graph. Analysis of graph structure representing a social network is done by the sociologists to study a community. Hardly any effort has been made to design a data model to store and retrieve social-network-related data. In this paper, an object-relational graph data model has been proposed for modeling a social network. The objective is to illustrate the power of this generic model to represent the common structural and node-based properties of different social network applications. A novel, multi-paradigm architecture has been proposed to efficiently manage the system. New structural operators have been defined in the paper and the application of these operators has been illustrated through query examples. The completeness and the minimality of the operators have also been shown.

Download Full-text