Regular path queries with constraints

DOI10.1006/JCSS.1999.1627MaRDI QIDQ1307690zbMATHOpenAlexFDO

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

zbMATH Keywords

path constraints

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Path constraints in semistructured databases
• scientific article; zbMATH DE number 2080409
• Mathematical Foundations of Computer Science 2004
• On decidability of boundedness property for regular path queries
• A Modal Perspective on Path Constraints

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 1142327 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• A data structure for arc insertion and regular path finding
• Bounds in the propagation of selection into logic programs
• Finding Regular Simple Paths in Graph Databases
• On languages with two variables
• Recursive query processing: The power of logic
• Two Complete Axiom Systems for the Algebra of Regular Events

Cited in

(28)

• Fault-tolerant computation of distributed regular path queries
• Integrity constraints for XML
• Optimal schema hierarchies in searching semistructured databases by conjunctive regular path queries
• Weighted path queries on semistructured databases
• scientific article; zbMATH DE number 2241907 (Why is no real title available?)
• On the data complexity of consistent query answering over graph databases
• Queries and computation on the web
• On the Complexity of Finding Set Repairs for Data-Graphs
• The first-order truth behind undecidability of regular path queries determinacy
• Graph grammars for querying graph-like data
• XRules: an effective algorithm for structural classification of XML data
• Partially ordered regular languages for graph queries
• On decidability of boundedness property for regular path queries
• An epistemic approach to model uncertainty in data-graphs
• scientific article; zbMATH DE number 2080409 (Why is no real title available?)
• Decidable containment of recursive queries
• Model checking hybrid logics (with an application to semistructured data)
• scientific article; zbMATH DE number 7650892 (Why is no real title available?)
• Revisiting restricted path consistency
• Answering regular path queries in expressive description logics via alternating tree-automata
• Labeled cuts in graphs
• Reasoning about XML update constraints
• Rewriting of regular expressions and regular path queries
• Search optimization in semistructured databases using hierarchy of document schemas
• Path constraints in semistructured data
• Typechecking for XML transformers
• Regular path queries under approximate semantics
• Path querying with conjunctive grammars by matrix multiplication

Describes a project that uses

Uses Software

• GraphLog
• Lorel

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)