Regular path queries with constraints
From MaRDI portal
Publication:1307690
DOI10.1006/JCSS.1999.1627zbMATH Open0939.68025OpenAlexW2042853248MaRDI QIDQ1307690FDOQ1307690
Authors: Serge Abiteboul, Victor Vianu 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two Complete Axiom Systems for the Algebra of Regular Events
- Title not available (Why is that?)
- Title not available (Why is that?)
- On languages with two variables
- Title not available (Why is that?)
- Finding Regular Simple Paths in Graph Databases
- Bounds in the propagation of selection into logic programs
- A data structure for arc insertion and regular path finding
- Recursive query processing: The power of logic
Cited In (28)
- Rewriting of regular expressions and regular path queries
- Model checking hybrid logics (with an application to semistructured data)
- Path constraints in semistructured data
- Decidable containment of recursive queries
- XRules: an effective algorithm for structural classification of XML data
- On decidability of boundedness property for regular path queries
- Reasoning about XML update constraints
- Queries and computation on the web
- Graph grammars for querying graph-like data
- Typechecking for XML transformers
- Fault-tolerant computation of distributed regular path queries
- Partially ordered regular languages for graph queries
- Labeled cuts in graphs
- Regular path queries under approximate semantics
- Path querying with conjunctive grammars by matrix multiplication
- The first-order truth behind undecidability of regular path queries determinacy
- Optimal schema hierarchies in searching semistructured databases by conjunctive regular path queries
- On the Complexity of Finding Set Repairs for Data-Graphs
- An epistemic approach to model uncertainty in data-graphs
- Title not available (Why is that?)
- Answering regular path queries in expressive description logics via alternating tree-automata
- Weighted path queries on semistructured databases
- Title not available (Why is that?)
- On the data complexity of consistent query answering over graph databases
- Revisiting restricted path consistency
- Search optimization in semistructured databases using hierarchy of document schemas
- Title not available (Why is that?)
- Integrity constraints for XML
Uses Software
This page was built for publication: Regular path queries with constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1307690)
