Path constraints in semistructured databases

DOI10.1006/JCSS.2000.1710MaRDI QIDQ1591150zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Peter Buneman, Wenfei Fan, Scott Weinstein

Publication date 21 June 2001

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcss.2000.1710

zbMATH Keywords

semistructured databases

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Path constraints in semistructured data
• Interaction between path and type constraints
• Mathematical Foundations of Computer Science 2004
• scientific article; zbMATH DE number 2080409
• A Modal Perspective on Path Constraints

Cites work

• scientific article; zbMATH DE number 3467028 (Why is no real title available?)
• scientific article; zbMATH DE number 194907 (Why is no real title available?)
• scientific article; zbMATH DE number 803291 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• scientific article; zbMATH DE number 857696 (Why is no real title available?)
• scientific article; zbMATH DE number 3222108 (Why is no real title available?)
• scientific article; zbMATH DE number 3366917 (Why is no real title available?)
• scientific article; zbMATH DE number 965572 (Why is no real title available?)
• Implication problems for functional constraints on databases supporting complex objects
• Interaction between path and type constraints
• On Moschovakis closure ordinals
• On the Decision Problem for Two-Variable First-Order Logic
• Upper and lower bounds for first order expressibility

Cited in

(22)

• Verification of evolving graph-structured data under expressive path constraints
• A Modal Perspective on Path Constraints
• Path constraints in semistructured data
• Mathematical Foundations of Computer Science 2004
• Querying incomplete information in semistructured data
• Graph grammars for querying graph-like data
• Constraint-based approach to semistructured data.
• Partially ordered regular languages for graph queries
• Regular path queries under approximate semantics
• The first-order truth behind undecidability of regular path queries determinacy
• scientific article; zbMATH DE number 1735826 (Why is no real title available?)
• On the Complexity of Finding Set Repairs for Data-Graphs
• An epistemic approach to model uncertainty in data-graphs
• scientific article; zbMATH DE number 2051179 (Why is no real title available?)
• scientific article; zbMATH DE number 2080409 (Why is no real title available?)
• Functional and multivalued dependencies in nested databases generated by record and list constructor
• Unauthorized inferences in semistructured databases
• On the data complexity of consistent query answering over graph databases
• Revisiting restricted path consistency
• Constraints in RDF
• Integrity constraints for XML
• Interaction between path and type constraints

Describes a project that uses

Uses Software

• Lorel

This page was built for publication: Path constraints in semistructured databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1591150)