Path constraints in semistructured databases
From MaRDI portal
Publication:1591150
DOI10.1006/JCSS.2000.1710zbMATH Open0963.68056DBLPjournals/jcss/BunemanFW00OpenAlexW2084175122WikidataQ57495639 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
Cites Work
- On the Decision Problem for Two-Variable First-Order Logic
- Interaction between path and type constraints
- Upper and lower bounds for first order expressibility
- On Moschovakis closure ordinals
- Implication problems for functional constraints on databases supporting complex objects
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (15)
- Path constraints in semistructured data
- Title not available (Why is that?)
- Querying incomplete information in semistructured data
- Partially ordered regular languages for graph queries
- Regular path queries under approximate semantics
- Title not available (Why is that?)
- On the Complexity of Finding Set Repairs for Data-Graphs
- An epistemic approach to model uncertainty in data-graphs
- 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
- Graph Grammars for Querying Graph-like Data
- Integrity constraints for XML
Uses Software
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)
