Typechecking for semistructured data

DOI10.1007/3-540-46093-4_1MaRDI QIDQ5714247zbMATH OpenFDO

Authors Dan Suciu

Publication date 28 December 2005

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2397/23970001.htm

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 1792116
• Union types for semistructured data
• Specification and verification for semi-structured data
• Semistructured database design.
• Theorem prover approach to semistructured data design

Cited in

(10)

• Minimal type inference for linked data consumers
• XML compression via directed acyclic graphs
• Union types for semistructured data
• On the complexity of typechecking top-down XML transformations
• Distributed XML design
• Well-definedness and semantic type-checking for the nested relational calculus
• Automata for XML -- a survey
• Frontiers of tractability for typechecking simple XML transformations
• On the minimization of XML schemas and tree automata for unranked trees
• Typechecking top-down XML transformations: Fixed input or output schemas

This page was built for publication: Typechecking for semistructured data

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