Using Transversals for Discovering XML Functional Dependencies

DOI10.1007/978-3-540-77684-0_15MaRDI QIDQ5445302zbMATH OpenOpenAlexFDO

Authors Thu Trinh

Publication date 4 March 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77684-0_15

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Discovering functional and inclusion dependencies in relational databases
• scientific article; zbMATH DE number 1982638
• The implication problem for `closest node' functional dependencies in complete XML documents
• On the equivalence between FDs in XML and FDs in relations
• scientific article; zbMATH DE number 2213336

Cites work

• scientific article; zbMATH DE number 1755716 (Why is no real title available?)
• Algorithms for inferring functional dependencies from relations
• An Efficient Algorithm for the Transversal Hypergraph Generation
• Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies

Cited in

(4)

• Lower bounds for three algorithms for transversal hypergraph generation
• Appropriate inferences of data dependencies in relational databases
• The implication problem for `closest node' functional dependencies in complete XML documents
• Foundations of Information and Knowledge Systems

Describes a project that uses

Uses Software

• TANE
• FastFDs

This page was built for publication: Using Transversals for Discovering XML Functional Dependencies

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