Regular path queries with constraints
From MaRDI portal
Publication:1307690
DOI10.1006/jcss.1999.1627zbMath0939.68025OpenAlexW2042853248MaRDI QIDQ1307690
Publication date: 9 November 1999
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1999.1627
Related Items (21)
On the data complexity of consistent query answering over graph databases ⋮ Labeled cuts in graphs ⋮ Optimal schema hierarchies in searching semistructured databases by conjunctive regular path queries ⋮ Typechecking for XML transformers ⋮ Integrity constraints for XML ⋮ On the Complexity of Finding Set Repairs for Data-Graphs ⋮ An epistemic approach to model uncertainty in data-graphs ⋮ Path querying with conjunctive grammars by matrix multiplication ⋮ Reasoning about XML update constraints ⋮ Path constraints in semistructured data ⋮ Answering regular path queries in expressive description logics via alternating tree-automata ⋮ Graph Grammars for Querying Graph-like Data ⋮ Partially ordered regular languages for graph queries ⋮ XRules: an effective algorithm for structural classification of XML data ⋮ Decidable containment of recursive queries ⋮ Search optimization in semistructured databases using hierarchy of document schemas ⋮ Regular path queries under approximate semantics ⋮ Unnamed Item ⋮ Model checking hybrid logics (with an application to semistructured data) ⋮ Fault-tolerant computation of distributed regular path queries ⋮ Queries and computation on the web
Uses Software
Cites Work
- Recursive query processing: The power of logic
- A data structure for arc insertion and regular path finding
- Bounds in the propagation of selection into logic programs
- On languages with two variables
- Finding Regular Simple Paths in Graph Databases
- Two Complete Axiom Systems for the Algebra of Regular Events
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Regular path queries with constraints
