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 …

Query languages for graph databases started to be investigated some 25 years ago. With
much current data, such as linked data on the Web and social network data, being graph …

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 …

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 …

Subject to the huge semantic gap between natural and formal languages, neural semantic
parsing is typically bottlenecked by its complexity of dealing with both input semantics and …

XPath plays a prominent role as an XML navigational language due to several factors,
including its ability to express queries of interest, its close connection to yardstick database …

Nested regular expressions (NREs) have been proposed as a powerful formalism for
querying RDFS graphs, but not too much investigation on NREs has been pursued in a …

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 …

Navigational graph queries are an important class of queries that can extract implicit binary
relations over the nodes of input graphs. Most of the navigational query languages used in …

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 …