On the difficulty of finding optimal relational decompositions for XML workloads: A complexity theoretic perspective

DOI10.1007/3-540-36285-1_18MaRDI QIDQ4414541zbMATH OpenFDO

Authors Rajasekar Krishnamurthy, Venkatesan T. Chakaravarthy, Jeffrey F. Naughton

Publication date 25 July 2003

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/2572/25720270.htm

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Towards optimal workload-aware XML to relational schema mapping
• Construction of an optimal relational schema for storing XML documents in an RDBMS without using DTD/XML schema
• Adaptive XML to relational mapping: An integrated approach
• Research on XML query optimization
• Propagating XML constraints to relations

Cited in

(1)

• Towards optimal workload-aware XML to relational schema mapping

This page was built for publication: On the difficulty of finding optimal relational decompositions for XML workloads: A complexity theoretic perspective

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