Incomplete Information in Relational Databases
Journal of the ACM (JACM)
A graphical query language supporting recursion
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A query language and optimization techniques for unstructured data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
GraphLog: a visual formalism for real life recursion
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Information and Computation - Special issue on FLOC '96
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Graph-Oriented Object Database Model
IEEE Transactions on Knowledge and Data Engineering
Optimization Properties for Classes of Conjunctive Regular Path Queries
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
View-Based Query Processing and Constraint Satisfaction
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Answering Regular Path Queries Using Views
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Constraint Processing
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Conjunctive queries over trees
Journal of the ACM (JACM)
A query language for biological networks
Bioinformatics
Fast best-effort pattern matching in large attributed graphs
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
On testing satisfiability of tree pattern queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Survey of graph database models
ACM Computing Surveys (CSUR)
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
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
SoQL: A Language for Querying and Creating Data in Social Networks
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Representing, Querying and Transforming Social Networks with RDF/SPARQL
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
Semantics and complexity of SPARQL
ACM Transactions on Database Systems (TODS)
A uniform framework for concept definitions in description logics
Journal of Artificial Intelligence Research
Conjunctive query containment over trees
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Expressive languages for path queries over graph-structured data
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML with incomplete information
Journal of the ACM (JACM)
Graph pattern matching: from intractable to polynomial time
Proceedings of the VLDB Endowment
Graph homomorphism revisited for graph matching
Proceedings of the VLDB Endowment
Proceedings of the 14th International Conference on Database Theory
Relational and XML Data Exchange
Relational and XML Data Exchange
Foundations of Semantic Web databases
Journal of Computer and System Sciences
Incomplete information and certain answers in general data models
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Adding regular expressions to graph reachability and pattern queries
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
An abstract framework for generating maximal answers to queries
ICDT'05 Proceedings of the 10th international conference on Database Theory
Parameterized regular expressions and their languages
Theoretical Computer Science
| Hi-index | 0.00 |
Graph data appears in a variety of application domains, and many uses of it, such as querying, matching, and transforming data, naturally result in incompletely specified graph data, that is, graph patterns. While queries need to be posed against such data, techniques for querying patterns are generally lacking, and properties of such queries are not well understood. Our goal is to study the basics of querying graph patterns. The key features of patterns we consider here are node and label variables and edges specified by regular expressions. We provide a classification of patterns, and study standard graph queries on graph patterns. We give precise characterizations of both data and combined complexity for each class of patterns. If complexity is high, we do further analysis of features that lead to intractability, as well as lower-complexity restrictions. Since our patterns are based on regular expressions, query answering for them can be captured by a new automata model. These automata have two modes of acceptance: one captures queries returning nodes, and the other queries returning paths. We study properties of such automata, and the key computational tasks associated with them. Finally, we provide additional restrictions for tractability, and show that some intractable cases can be naturally cast as instances of constraint satisfaction problems.