Finding Regular Simple Paths in Graph Databases
SIAM Journal on Computing
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
Regular path queries with constraints
Journal of Computer and System Sciences
Path constraints in semistructured databases
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Constraints for semistructured data and XML
ACM SIGMOD Record
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
New Rewritings and Optimizations for Regular Path Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
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
Algebraic rewritings for optimizing regular path queries
Theoretical Computer Science - Database theory
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
Rewriting XPath queries using materialized views
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Answering tree pattern queries using views
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
View-based query processing: On the relationship between rewriting, answering and losslessness
Theoretical Computer Science
Grid-Aware Evaluation of Regular Path Queries on Spatial Networks
AINA '07 Proceedings of the 21st International Conference on Advanced Networking and Applications
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
SPARQLeR: Extended Sparql for Semantic Association Discovery
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
nSPARQL: A Navigational Language for RDF
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Managing Linked Data on the Web: The LinkedMDB Showcase
LA-WEB '08 Proceedings of the 2008 Latin American Web Conference
On rewriting XPath queries using views
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Ranking Approximate Answers to Semantic Web Queries
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
Programming the Semantic Web
| Hi-index | 0.00 |
In this paper we explore the connection between certain answers and view-based rewritings for local regular path queries (RPQs) which are regular expressions matching paths in graph-structured data starting from a specific node. We show that differently from the case of global RPQs, which match paths starting from any node, the notions of certain answer and rewriting-based answer coincide for local RPQs. The importance of this result is that obtaining the certain answer for local RPQs can be done in polynomial time in the size of the data. We also present an automata-theoretic algorithm for computing maximal view-based rewritings. Notably, these rewritings are an exponential order of magnitude smaller than their counterparts for global RPQs.