RDF Updates with Constraints

Ferrari, Mírian Halfeld; Hara, Carmem S.; Uber, Flavio Rogério

doi:10.1007/978-3-319-69548-8_16

Cited by 4 publications

(9 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this context, two aspects of our work can be considered as particularly original: (i) the use of graph rewriting techniques and (ii) the adoption of CWA with RDF data. Concerning the first aspect, to generalize and abstract consistent updating methods, different works have used formalisms such as tree automata or grammars for XML ( [28,37] as surveys) or first order logic for relational (such as [38]) and, currently, graph databases (e.g., [7,9,15]).…”

Section: Related Workmentioning

confidence: 99%

“…These differences are the consequence of different views of the problem and influence the semantic of changes of each particular proposal. As in [7,15], we consider updates as changes in the world rather than as a revision in our knowledge of the world ( [17,18]). In such update context, the chase procedure is usually associated to the generation of side-effects imposing extra insertions or deletions (w.r.t.…”

Section: Related Workmentioning

confidence: 99%

“…Both [7,10] consider RDF updating methods, but the former goes deeper in the study of null values. A parallel can be done between saturation in [10], the chase in [7,9,15] and SetUp. Authors in [7,9,10,15] offer home-made procedures to implement their methods: [10] deals only with the RDF instance constraints (Fig.…”

Section: Related Workmentioning

confidence: 99%

“…A parallel can be done between saturation in [10], the chase in [7,9,15] and SetUp. Authors in [7,9,10,15] offer home-made procedures to implement their methods: [10] deals only with the RDF instance constraints (Fig. 2); in [7,9], constraints are user's tuple-generating-dependencies.…”

Section: Related Workmentioning

confidence: 99%

See 3 more Smart Citations

Graph Rewriting Rules for RDF Database Evolution Management

Chabin

Eichler

Ferrari

et al. 2020

Proceedings of the 22nd International Conference on Information Integration and Web-Based Applications &Amp; Services

Self Cite

View full text Add to dashboard Cite

This paper introduces SetUp, a theoretical and applied framework for the management of RDF/S database evolution on the basis of graph rewriting rules. Rewriting rules formalize instance or schema changes, ensuring graph's consistency with respect to given constraints. Constraints considered in this paper are a well known variant of RDF/S semantic, but the approach can be adapted to user-defined constraints. Furthermore, SetUp manages updates by ensuring rule applicability through the generation of side-effects: new updates which guarantee that rule application conditions hold. We provide herein formal validation and experimental evaluation of SetUp. CCS CONCEPTS• Information systems → Graph-based database models; • Theory of computation → Rewrite systems.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Graph Rewriting Rules for RDF Database Evolution Management

Chabin

Eichler

Ferrari

et al. 2020

Proceedings of the 22nd International Conference on Information Integration and Web-Based Applications &Amp; Services

Self Cite

View full text Add to dashboard Cite

show abstract

“…Deleting the fact servedByStation(Louvre, P alaisRoyal) may just correspond to the insertion of servedByStation(Louvre, N2) avoiding all the backward chaining of constraint rules. Our proposal in [36] deals with this aspect.…”

Section: Constraints and Updatesmentioning

confidence: 99%

Graph Constraints in Urban Computing: Dealing with Conditions in Processing Urban Data

d’Orazio

Ferrari

Hara

et al. 2017

2017 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and I

Self Cite

View full text Add to dashboard Cite

Smart Cities is a worldwide initiative leading to better exploit the resources in a city in order to offer higher level services to people. In this context, urban computing is a process of acquisition, integration, and analysis of big and heterogeneous data generated by a diversity of sources in urban spaces, such as sensors, traffic devices, vehicles, buildings, and humans, to tackle the major issues that cities face, e.g. air pollution, increased energy consumption and traffic congestion. The majority of these information can be represented as graphs, such as the transportation network, in which places (nodes) are connected by some form of public transportation (edges). A vision of the "city of the future", or even the city of the present, rests on the integration of science and technology through information systems. This vision requires a rethinking of the relationships between technology, government, city managers, business, academia and the research community. This position paper presents our views towards developing techniques for querying and evolving graph-modeled datasets based on userdefined constraints. Our focus is to show how these techniques can be applied to effectively retrieve urban data and have automated mechanisms that guarantee data consistency.

show abstract

Consistent updating of databases with marked nulls

Chabin¹,

Ferrari²,

Laurent³

2019

Knowl Inf Syst

Self Cite

View full text Add to dashboard Cite

Efficient consistency maintenance of incomplete and dynamic real-life databases is a quality label for further data analysis. In prior work, we tackled the generic problem of database updating in the presence of tuple generating constraints from a theoretical viewpoint. The current paper considers the usability of our approach by (a) introducing incremental update routines (instead of the previous from-scratch versions) and (b) removing the restriction that limits the contents of the database to fit in the main memory. In doing so, this paper offers new algorithms, proposes queries and data models inviting discussions on the representation of incompleteness on databases. We also propose implementations under a graph database model and the traditional relational database model. Our experiments show that computation times are similar globally but point to discrepancies in some steps.

show abstract

RDF Updates with Constraints

Cited by 4 publications

References 9 publications

Graph Rewriting Rules for RDF Database Evolution Management

Graph Rewriting Rules for RDF Database Evolution Management

Graph Constraints in Urban Computing: Dealing with Conditions in Processing Urban Data

Consistent updating of databases with marked nulls

Contact Info

Product

Resources

About