Regular path queries with constraints
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Object identity as a query language primitive
Journal of the ACM (JACM)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Expressive and efficient pattern languages for tree-structured data (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Flexible queries over semistructured data
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Extended path expressions of XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A fine-grained access control system for XML documents
ACM Transactions on Information and System Security (TISSEC)
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM Transactions on Internet Technology (TOIT)
SigDAQ: an enhanced XML query optimization technique
Journal of Systems and Software
Ordering and Path Constraints over Semistructured Data
Journal of Intelligent Information Systems
The ρ operator: discovering and ranking associations on the semantic web
ACM SIGMOD Record
Approximate Graph Schema Extraction for Semi-Structured Data
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Algebraic Rewritings for Optimizing Regular Path Queries
ICDT '01 Proceedings of the 8th International Conference on Database Theory
New Rewritings and Optimizations for Regular Path Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Extracting Large-Scale Knowledge Bases from the Web
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Proceedings of the 27th International Conference on Very Large Data Bases
Partially Ordered Regular Languages for Graph Queries
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Family of Nested Query Languages for Semi-structured Data
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
NGIT '99 Proceedings of the 4th International Workshop on Next Generation Information Technologies and Systems
Taking the RDF Model Theory Out for a Spin
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Context and Caterpillars and Structured Documents
PODDP '98 Proceedings of the 4th International Workshop on Principles of Digital Document Processing
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
XML query processing using document type definitions
Journal of Systems and Software
Locating and accessing data repositories with WebSemantics
The VLDB Journal — The International Journal on Very Large Data Bases
Query containment and rewriting using views for regular path queries under constraints
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Ρ-Queries: enabling querying for semantic associations on the semantic web
WWW '03 Proceedings of the 12th international conference on World Wide Web
Algebraic rewritings for optimizing regular path queries
Theoretical Computer Science - Database theory
Retrieval of semistructured Web data
Intelligent exploration of the web
Partially ordered regular languages for graph queries
Journal of Computer and System Sciences
Distributed evaluation of generalized path queries
Proceedings of the 2005 ACM symposium on Applied computing
Regular path queries under approximate semantics
Annals of Mathematics and Artificial Intelligence
Weighted path queries on semistructured databases
Information and Computation
Constraint-Based Approach to Semistructured Data
Fundamenta Informaticae - Intelligent Systems
A graph grammars based framework for querying graph-like data
Data & Knowledge Engineering - Special issue: ER 2003
IEEE Transactions on Knowledge and Data Engineering
Towards practically feasible answering of regular path queries in lav data integration
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Language constrained graph problems: a microcosm of engineering research and development
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
Dominator-tree analysis for distributed authorization
Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security
Write it recursively: a generic framework for optimal path queries
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
An Extension of SPARQL for RDFS
Semantic Web, Ontologies and Databases
Engineering Label-Constrained Shortest-Path Algorithms
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Fault-tolerant computation of distributed regular path queries
Theoretical Computer Science
Preferential Regular Path Queries
Fundamenta Informaticae
Bounded regular path queries in view-based data integration
Information Processing Letters
Extending SPARQL with regular expression patterns (for querying RDF)
Web Semantics: Science, Services and Agents on the World Wide Web
The Perfect Match: RPL and RDF Rule Languages
RR '09 Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems
Weighted path queries on semistructured databases
Information and Computation
Complexity results on labeled shortest path problems from wireless routing metrics
Computer Networks: The International Journal of Computer and Telecommunications Networking
The web as a graph: measurements, models, and methods
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Exploring XML web collections with DescribeX
ACM Transactions on the Web (TWEB)
Expressive languages for path queries over graph-structured data
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computing label-constraint reachability in graph databases
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Certain answers and rewritings for local regular path queries on graph-structured data
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
nSPARQL: A navigational language for RDF
Web Semantics: Science, Services and Agents on the World Wide Web
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Combining approximation and relaxation in semantic web path queries
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Reverse engineering using graph queries
Graph transformations and model-driven engineering
Regular languages with variables on graphs
Information and Computation
Cyclic pattern kernels revisited
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Enhanced regular path queries on semistructured databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
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
The complexity of evaluating path expressions in SPARQL
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
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 large graphs
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Preferential Regular Path Queries
Fundamenta Informaticae
Constraint-Based Approach to Semistructured Data
Fundamenta Informaticae - Intelligent Systems
Expressive Languages for Path Queries over Graph-Structured Data
ACM Transactions on Database Systems (TODS)
Distributed multi-source regular path queries
ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
Fast answering of XPath query workloads on web collections
XSym'07 Proceedings of the 5th international conference on Database and XML Technologies
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
Proceedings of the 32nd symposium on Principles of database systems
A trichotomy for regular simple path queries on graphs
Proceedings of the 32nd symposium on Principles of database systems
The complexity of regular expressions and property paths in SPARQL
ACM Transactions on Database Systems (TODS) - Invited papers issue
Computing weight constraint reachability in large networks
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
We consider the following problem: given a labelled directed graph $G$ and a regular expression $R$, find all pairs of nodes connected by a simple path such that the concatenation of the labels along the path satisfies $R$. The problem is motivated by the observation that many recursive queries in relational databases can be expressed in this form, and by the implementation of a query language, ${\bf G}^+$, based on this observation. We show that the problem is in general intractable, but present an algorithm than runs in polynomial time in the size of the graph when the regular expression and the graph are free of conflicts. We also present a class of languages whose expressions can always be evaluated in time polynomial in the size of both the graph and the expression, and characterize syntactically the expressions for such languages.