Results 11 to 20 of about 4,762 (250)
Regular Path Queries with Constraints
Journal of Computer and System Sciences, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Serge Abiteboul, Victor Vianu
core +4 more sources
Regular path queries on graphs with data [PDF]
Proceedings of the 15th International Conference on Database Theory, 2012 Graph data models received much attention lately due to applications in social networks, semantic web, biological databases and other areas. Typical query languages for graph databases retrieve their topology, while actual data stored in them is usually queried using standard relational mechanisms.Our goal is to develop techniques that combine these ...
Leonid Libkin, Domagoj Vrgoc
openaire +2 more sources
A trichotomy for regular simple path queries on graphs [PDF]
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems, 2013 15 pages, conference ...
Bagan, Guillaume +2 more
core +10 more sources
Boundedness of Conjunctive Regular Path Queries [PDF]
CoRR, 2019 We study the boundedness problem for unions of conjunctive regular path queries with inverses (UC2RPQs). This is the problem of, given a UC2RPQ, checking whether it is equivalent to a union of conjunctive queries (UCQ). We show the problem to be ExpSpace-complete, thus coinciding with the complexity of containment for UC2RPQs.
Pablo Barceló +2 more
core +6 more sources
Graph Traversals for Regular Path Queries
Proceedings of the 2nd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), 2019 Regular Path Queries (RPQs) are at the core of many recent declarative graph pattern matching languages. They leverage the compactness and expressiveness of regular expressions for matching recursive path structures. Unfortunately, most prior works on RPQs only consider breadth-first search as traversal strategy, neglecting other possible graph ...
Frank Tetzel +2 more
openaire +4 more sources
Implementing flexible operators for regular path queries [PDF]
, 2015 Given the heterogeneity of complex graph data on the web, such as RDF linked data,a user wishing to query such data may lack full knowledge of its structure and irregularities.\ud Hence, providing users with flexible querying capabilities can be beneficial.
Petra Selmer +2 more
openaire +2 more sources
Provenance for Regular Path Queries
CoRR, 2020 Regular path queries (RPQs) the ubiquitous mechanism for querying data graphs of partially known structure. RPQs are in essence regular expressions over the edge symbols. The answer to an RPQ on a given graph (database) is the set of pairs of objects, which are connected by paths spelling words in the language of the regular path query.
Gösta Grahne, Alex Thomo
openaire +2 more sources
Expressive Path Queries on Graph with Data [PDF]
Logical Methods in Computer Science, 2015 Graph data models have recently become popular owing to their applications, e.g., in social networks and the semantic web. Typical navigational query languages over graph databases - such as Conjunctive Regular Path Queries (CRPQs) - cannot express ...
Pablo Barcelo +2 more
doaj +1 more source
Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries [PDF]
Logical Methods in Computer ScienceWe show that the problem of whether a query is equivalent to a query of tree-width $k$ is decidable, for the class of Unions of Conjunctive Regular Path Queries with two-way navigation (UC2RPQs).
Diego Figueira, Rémi Morvan
doaj +1 more source
Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features [PDF]
Logical Methods in Computer ScienceWe investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in description logics extending ALC.
Bartosz Bednarczyk
doaj +1 more source