Projects per year
Data trees serve as an abstraction of XML documents: in such trees, every node comes with a label from a finite alphabet, as well as a data value from an infinite set. Incomplete data trees model XML documents with incomplete information; they may include both structural incompleteness and incompleteness of data. Here we study two basic problems for incomplete data trees under typical constraints such as keys and foreign keys. The first problem is consistency of specifications of incomplete data trees. We show that many of recently established results on consistency of constraints and schema descriptions can be transferred to the consistency of incomplete tree specifications without any increase in complexity. After that we examine query answering over incomplete data trees under constraints, and show that tractable bounds can be recovered under key constraints, but are lost under foreign keys.
|Title of host publication||In Search of Elegance in the Theory and Practice of Computation - Essays Dedicated to Peter Buneman|
|Number of pages||18|
|Publication status||Published - 2013|
|Name||Lecture Notes in Computer Science|
|Publisher||Springer Berlin / Heidelberg|
FingerprintDive into the research topics of 'Static Analysis and Query Answering for Incomplete Data Trees with Constraints'. Together they form a unique fingerprint.
- 2 Finished
1/11/13 → 31/10/16
1/09/09 → 30/11/13