On the Difficulty of Finding Optimal Relational Decompositions for XML Workloads: A Complexity Theoretic Perspective

Rajasekar Krishnamurthy, Venkatesan T. Chakaravarthy, Jeffrey F. Naughton. On the Difficulty of Finding Optimal Relational Decompositions for XML Workloads: A Complexity Theoretic Perspective. In Diego Calvanese, Maurizio Lenzerini, Rajeev Motwani, editors, Database Theory - ICDT 2003, 9th International Conference, Siena, Italy, January 8-10, 2003, Proceedings. Volume 2572 of Lecture Notes in Computer Science, pages 267-281, Springer, 2003. [doi]

Abstract

Abstract is missing.