Skip to Main content Skip to Navigation
Conference papers

Finding optimal probabilistic generators for XML collections

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.
Complete list of metadatas

Cited literature [28 references]  Display  Hide  Download

https://hal.inria.fr/hal-00765545
Contributor : Émilien Antoine <>
Submitted on : Friday, December 14, 2012 - 5:46:32 PM
Last modification on : Friday, December 20, 2019 - 1:37:06 AM
Document(s) archivé(s) le : Sunday, December 18, 2016 - 2:17:49 AM

File

abiteboul2012finding.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00765545, version 1

Citation

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⟩

Share

Metrics

Record views

432

Files downloads

348