Finite automata and unary languages
Theoretical Computer Science
Rational relations with bounded delay
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
Finding Regular Simple Paths in Graph Databases
SIAM Journal on Computing
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Query containment for conjunctive queries with regular expressions
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
GraphLog: a visual formalism for real life recursion
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of integer programming
Journal of the ACM (JACM)
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Flexible queries over semistructured data
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Formal-Language-Constrained Path Problems
SIAM Journal on Computing
Counter machines and verification Problems
Theoretical Computer Science
Optimization Properties for Classes of Conjunctive Regular Path Queries
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Ρ-Queries: enabling querying for semantic associations on the semantic web
WWW '03 Proceedings of the 12th international conference on World Wide Web
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Definable relations and first-order query languages over strings
Journal of the ACM (JACM)
Lower bounds for natural proof systems
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Database and information-retrieval methods for knowledge discovery
Communications of the ACM - A Direct Path to Dependable Software
Unary finite automata vs. arithmetic progressions
Information Processing Letters
Bad news on decision problems for patterns
Information and Computation
On relations defined by generalized finite automata
IBM Journal of Research and Development
Using annotations from controlled vocabularies to find meaningful associations
DILS'07 Proceedings of the 4th international conference on Data integration in the life sciences
Model checking FO(R) over one-counter processes and beyond
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
On the complexity of equational horn clauses
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Proceedings of the 14th International Conference on Database Theory
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Querying semantic web data with SPARQL
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Retrieving keyworded subgraphs with graph ranking score
Expert Systems with Applications: An International Journal
Counting beyond a Yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard
Proceedings of the 21st international conference on World Wide Web
Query languages for graph databases
ACM SIGMOD Record
Regular expressions for data words
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Graph pattern matching revised for social network analysis
Proceedings of the 15th International Conference on Database Theory
Regular path queries on graphs with data
Proceedings of the 15th International Conference on Database Theory
Containment of regular path queries under description logic constraints
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
SPARQL query containment under RDFS entailment regime
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Graph Logics with Rational Relations and the Generalized Intersection Problem
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Expressive Languages for Path Queries over Graph-Structured Data
ACM Transactions on Database Systems (TODS)
Inclusion problems for patterns with a bounded number of variables
Information and Computation
Parameterized regular expressions and their languages
Theoretical Computer Science
Walk logic as a framework for path query languages on graph databases
Proceedings of the 16th International Conference on Database Theory
Querying graph databases with XPath
Proceedings of the 16th International Conference on Database Theory
Definability problems for graph query languages
Proceedings of the 16th International Conference on Database Theory
Schema mappings and data exchange for graph databases
Proceedings of the 16th International Conference on Database Theory
Expressiveness and static analysis of extended conjunctive regular path queries
Journal of Computer and System Sciences
On simplification of schema mappings
Journal of Computer and System Sciences
Proceedings of the 22nd international conference on World Wide Web
Expressive languages for selecting groups from graph-structured data
Proceedings of the 22nd international conference on World Wide Web
Querying graphs with preferences
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Conjunctive regular path queries in lightweight description logics
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Querying Regular Graph Patterns
Journal of the ACM (JACM)
Hi-index | 0.00 |
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 regular path queries (CRPQs) is insufficient in at least two ways. First, they cannot output paths and second, more crucially, they cannot express relations among paths. We thus propose a class of extended CRPQs, called ECRPQs, which add regular relations on tuples of paths, and allow path variables in the heads of queries. We provide several examples of their usefulness in querying graph structured data, and study their properties. We analyze query evaluation and representation of tuples of paths in the output by means of automata. We present a detailed analysis of data and combined complexity of queries, and consider restrictions that lower the complexity of ECRPQs to that of relational conjunctive queries. We study the containment problem, and look at further extensions with first-order features, and with non-regular relations that express arithmetic properties of paths, based on the lengths and numbers of occurrences of labels.