Results 191 to 200 of about 1,234 (209)
Conjunctive Visibly-Pushdown Path Queries
Lecture Notes in Computer Science, 2015 Martin Lange +2 more
exaly +2 more sources
Expressive Languages for Path Queries over Graph-Structured Data [PDF]
ACM Transactions on Database Systems, 2012 For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.), the power of standard languages such as the widely studied conjunctive ...
Pablo Barcelo +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules
International Conference on Principles of Knowledge Representation and ReasoningExtensive research in the field of ontology-based query answering has led to the identification of numerous fragments of existential rules (also known as tuple-generating dependencies) that exhibit decidable answering of atomic and conjunctive queries ...
Piotr Ostropolski-Nalewaja +1 more
semanticscholar +1 more source
Containment of Regular Path Queries under Description Logic Constraints
International Joint Conference on Artificial Intelligence, 2011Diego Calvanese +2 more
semanticscholar +1 more source
New Rewritings and Optimizations for Regular Path Queries
International Conference on Database Theory, 2003G. Grahne, Alex Thomo
semanticscholar +1 more source
Optimization Properties for Classes of Conjunctive Regular Path Queries
Lecture Notes in Computer Science, 2002Alin Deutsch +2 more
exaly