Finding Regular Simple Paths in Graph Databases
SIAM Journal on Computing
Query containment for conjunctive queries with regular expressions
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Query Optimization for Semistructured Data Using Path Constraints in a Deterministic Data Model
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
Optimization Properties for Classes of Conjunctive Regular Path Queries
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Structure identification of Boolean relations and plain bases for co-clones
Journal of Computer and System Sciences
On the Expressive Power of the Relational Algebra on Finite Sets of Relation Pairs
IEEE Transactions on Knowledge and Data Engineering
Efficient inclusion for a class of XML types with interleaving and counting
Information Systems
Inference of concise regular expressions and DTDs
ACM Transactions on Database Systems (TODS)
Expressive languages for path queries over graph-structured data
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data
ACM Transactions on the Web (TWEB)
Testing expressibility is hard
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Relative expressive power of navigational querying on graphs
Proceedings of the 14th International Conference on Database Theory
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of evaluating path expressions in SPARQL
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Regular path queries on graphs with data
Proceedings of the 15th International Conference on Database Theory
Walk logic as a framework for path query languages on graph databases
Proceedings of the 16th International Conference on Database Theory
| Hi-index | 0.00 |
Given a graph, a relation on its nodes, and a query language Q of interest, we study the Q-definability problem which amounts to deciding whether there exists a query in Q defining precisely the given relation over the given graph. Previous research has identified the complexity of FO- and CQ-definability. In this paper, we consider the definability problem for regular paths and conjunctive regular path queries (CRPQs) over labelled graphs.