Finding optimal probabilistic generators for XML collections - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Finding optimal probabilistic generators for XML collections

(1, 2) , (3) , (2) , (4) , (3)
1
2
3
4

Abstract

We study the problem of, given a corpus of XML documents and its schema, finding an optimal (generative) probabilistic model, where optimality here means maximizing the like- lihood of the particular corpus to be generated. Focusing first on the structure of documents, we present an efficient algorithm for finding the best generative probabilistic model, in the absence of constraints. We further study the problem in the presence of integrity constraints, namely key, inclusion, and domain constraints. We study in this case two different kinds of generators. First, we consider a continuation-test generator that performs, while generating documents, tests of schema satisfiability; these tests prevent from generating a document violating the constraints but, as we will see, they are computationally expensive. We also study a restart generator that may generate an invalid document and, when this is the case, restarts and tries again. Finally, we consider the injection of data values into the structure, to obtain a full XML document. We study different approaches for generating these values.
Fichier principal
Vignette du fichier
abiteboul2012finding.pdf (467.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00765545 , version 1 (14-12-2012)

Identifiers

  • HAL Id : hal-00765545 , version 1

Cite

Serge Abiteboul, Yael Amsterdamer, Daniel Deutch, Tova Milo, Pierre Senellart. Finding optimal probabilistic generators for XML collections. ICDT, Mar 2012, Berlin, Germany. pp.127-139. ⟨hal-00765545⟩
194 View
161 Download

Share

Gmail Facebook Twitter LinkedIn More