Path constraints in semistructured databases

DOI10.1006/jcss.2000.1710zbMath0963.68056OpenAlexW2084175122WikidataQ57495639 ScholiaQ57495639MaRDI QIDQ1591150

Wenfei Fan, Peter Buneman, 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)

Related Items (13)

On the data complexity of consistent query answering over graph databases ⋮ Integrity constraints for XML ⋮ On the Complexity of Finding Set Repairs for Data-Graphs ⋮ An epistemic approach to model uncertainty in data-graphs ⋮ Path constraints in semistructured data ⋮ Graph Grammars for Querying Graph-like Data ⋮ Querying incomplete information in semistructured data ⋮ Partially ordered regular languages for graph queries ⋮ Functional and multivalued dependencies in nested databases generated by record and list constructor ⋮ Regular path queries under approximate semantics ⋮ Unnamed Item ⋮ Unauthorized inferences in semistructured databases ⋮ Constraints in RDF

Uses Software

• Lorel

Cites Work

• Upper and lower bounds for first order expressibility
• On Moschovakis closure ordinals
• On the Decision Problem for Two-Variable First-Order Logic
• Interaction between path and type constraints
• Implication problems for functional constraints on databases supporting complex objects
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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