Querying graph databases

P Barceló Baeza - Proceedings of the 32nd ACM SIGMOD-SIGACT …, 2013 - dl.acm.org
Graph databases have gained renewed interest in the last years, due to its applications in
areas such as the Semantic Web and Social Networks Analysis. We study the problem of …

Querying graphs with data

L Libkin, W Martens, D Vrgoč - Journal of the ACM (JACM), 2016 - dl.acm.org
Graph databases have received much attention as of late due to numerous applications in
which data is naturally viewed as a graph; these include social networks, RDF and the …

An introduction to graph data management

R Angles, C Gutierrez - Graph Data Management: Fundamental Issues …, 2018 - Springer
Graph data management concerns the research and development of powerful technologies
for storing, processing and analyzing large volumes of graph data. This chapter presents an …

Regular queries on graph databases

JL Reutter, M Romero, MY Vardi - Theory of computing Systems, 2017 - Springer
Graph databases are currently one of the most popular paradigms for storing data. One of
the key conceptual differences between graph and relational databases is the focus on …

Distributed Pregel-based provenance-aware regular path query processing on RDF knowledge graphs

X Wang, S Wang, Y Xin, Y Yang, J Li, X Wang - World Wide Web, 2020 - Springer
With the proliferation of knowledge graphs, massive RDF graphs have been published on
the Web. As an essential type of queries for RDF graphs, Regular Path Queries (RPQs) have …

The complexity of regular expressions and property paths in SPARQL

K Losemann, W Martens - ACM Transactions on Database Systems …, 2013 - dl.acm.org
The World Wide Web Consortium (W3C) recently introduced property paths in SPARQL 1.1,
a query language for RDF data. Property paths allow SPARQL queries to evaluate regular …

Trial for RDF: adapting graph query languages for RDF data

L Libkin, J Reutter, D Vrgoč - Proceedings of the 32nd ACM SIGMOD …, 2013 - dl.acm.org
Querying RDF data is viewed as one of the main applications of graph query languages,
and yet the standard model of graph databases--essentially labeled graphs--is different from …

Relative expressive power of navigational querying on graphs

GHL Fletcher, M Gyssens, D Leinders… - Proceedings of the 14th …, 2011 - dl.acm.org
Motivated by both established and new applications, we study navigational query languages
for graphs (binary relations). The simplest language has only the two operators union and …

Semantic acyclicity on graph databases

P Barceló Baeza, M Romero, MY Vardi - Proceedings of the 32nd ACM …, 2013 - dl.acm.org
It is known that unions of acyclic conjunctive queries (CQs) can be evaluated in linear time,
as opposed to arbitrary CQs, for which the evaluation problem is NP-complete. It follows …

Practical and comprehensive formalisms for modelling contemporary graph query languages

C Sharma, R Sinha, K Johnson - Information Systems, 2021 - Elsevier
The industry-wide adoption of graph databases has been hindered due to the fragmentation
in syntax and semantics of available graph query languages. As a result, several projects …