"On the Difficulty of Finding Optimal Relational Decompositions for XML ..."

Rajasekar Krishnamurthy, Venkatesan T. Chakaravarthy, Jeffrey F. Naughton (2003)

> Home

Details and statistics

DOI: 10.1007/3-540-36285-1_18

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icdt/KrishnamurthyCN03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icdt/KrishnamurthyCN03
Rajasekar Krishnamurthy, Venkatesan T. Chakaravarthy, Jeffrey F. Naughton:
On the Difficulty of Finding Optimal Relational Decompositions for XML Workloads: A Complexity Theoretic Perspective. ICDT 2003: 267-281

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.