6 papers
Earliest query answering over streamed trees
Mateusz Gienieczko, MartÃn Muñoz, Filip Murlak +1
Streaming allows executing queries over massive JSON or XML documents whose size makes it infeasible to fully parse them into a tree. Earliest query answering is a radical approach…
Validation of graph databases against PG-Schema
Jacek Ciszewski, Jakub KÅos, Maxime Jakubowski +2
The problem of validating a given graph database instance against a given PG-Schema graph type without integrity constraints is NP- complete in terms of combined complexity and in…
Common Foundations for Recursive Shape Languages
Shqiponja Ahmetaj, Iovka Boneva, Jan Hidders +9
As schema languages for RDF data become more mature, we are seeing efforts to extend them with recursive semantics, applying diverse ideas from logic programming and description lo…
Revisiting Conjunctive Query Entailment for
YazmÃn Ibáñez-GarcÃa, Jean Christoph Jung, Vincent Michielini +1
We clarify the complexity of answering unions of conjunctive queries over knowledge bases formulated in the description logic , the extension of with tr…
Common Foundations for SHACL, ShEx, and PG-Schema
S. Ahmetaj, I. Boneva, J. Hidders +11
Graphs have emerged as an important foundation for a variety of applications, including capturing and reasoning over factual knowledge, semantic data integration, social networks,…
Transforming Property Graphs
Angela Bonifati, Filip Murlak, Yann Ramusat
In this paper, we study a declarative framework for specifying transformations of property graphs. In order to express such transformations, we leverage queries formulated in the G…