research-article

Finding optimal probabilistic generators for XML collections

Authors:

Serge Abiteboul,

Yael Amsterdamer,

Pierre SenellartAuthors Info & Claims

ICDT '12: Proceedings of the 15th International Conference on Database Theory

Pages 127 - 139

https://doi.org/10.1145/2274576.2274591

Published: 26 March 2012 Publication History

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 likelihood 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.

References

[1]

S. Abiteboul, O. Benjelloun, and T. Milo. The Active XML project: an overview. VLDB J., 17(5), 2008.

Digital Library

[2]

S. Abiteboul, P. Bourhis, A. Galland, and B. Marinoiu. The AXML artifact model. In TIME, 2009.

Digital Library

[3]

S. Abiteboul, T.-H. H. Chan, E. Kharlamov, W. Nutt, and P. Senellart. Aggregate queries for discrete and continuous probabilistic XML. In ICDT, 2010.

Digital Library

[4]

S. Abiteboul, B. Kimelfeld, Y. Sagiv, and P. Senellart. On the expressiveness of probabilistic XML models. VLDB J., 18(5), 2009.

Digital Library

[5]

T. Antonopoulos, F. Geerts, W. Martens, and F. Neven. Generating, sampling and counting subclasses of regular tree languages. In ICDT, 2011.

Digital Library

[6]

D. Barbosa, A. O. Mendelzon, J. Keenleyside, and K. A. Lyons. ToXgene: An extensible template-based data generator for XML. In WebDB, 2002.

Digital Library

[7]

M. Benedikt, E. Kharlamov, D. Olteanu, and P. Senellart. Probabilistic XML via Markov chains. PVLDB, 3(1), 2010.

Digital Library

[8]

G. J. Bex, W. Gelade, F. Neven, and S. Vansummeren. Learning deterministic regular expressions for the inference of schemas from XML data. In WWW, 2008.

Digital Library

[9]

G. J. Bex, F. Neven, T. Schwentick, and K. Tuyls. Inference of concise DTDs from XML data. In VLDB, 2006.

Digital Library

[10]

G. J. Bex, F. Neven, and S. Vansummeren. Inferring XML schema definitions from XML data. In VLDB, 2007.

Digital Library

[11]

C. M. Bishop. Pattern Recognition and Machine Learning. Springer, 2006.

Digital Library

[12]

Z. Chi and S. Geman. Estimation of probabilistic context-free grammars. Comput. Linguist., 24(2), 1998.

Digital Library

[13]

S. Cohen. Generating XML structure using examples and constraints. PVLDB, 1(1), 2008.

Digital Library

[14]

S. Cohen, B. Kimelfeld, and Y. Sagiv. Incorporating constraints in probabilistic XML. In PODS, 2008.

Digital Library

[15]

C. David, L. Libkin, and T. Tan. Efficient reasoning about data trees via integer linear programming. In ICDT, 2011.

Digital Library

[16]

K. Etessami and M. Yannakakis. Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. JACM, 56(1), 2009.

Digital Library

[17]

W. Fan and L. Libkin. On XML integrity constraints in the presence of DTDs. JACM, 49(3), 2002.

Digital Library

[18]

D. Freedman. Markov Chains. Springer-Verlag, 1983.

[19]

M. Garofalakis, A. Gionis, R. Rastogi, S. Seshadri, and K. Shim. XTRACT: a system for extracting document type descriptors from XML documents. In SIGMOD, 2000.

Digital Library

[20]

W. Gelade, T. Idziaszek, W. Martens, and F. Neven. Simplifying XML schema: Single-type approximations of regular tree languages. In PODS, 2010.

Digital Library

[21]

G. Grahne and J. Zhu. Discovering approximate keys in XML data. In CIKM, 2002.

Digital Library

[22]

R. Kosala, H. Blockeel, M. Bruynooghe, and J. Van den Bussche. Information extraction from structured documents using k-testable tree automaton inference. Data Knowl. Eng., 58(2), 2006.

Digital Library

[23]

K. Lange. Optimization. Springer-Verlag, 2004.

[24]

K. Lary and S. J. Young. The estimation of stochastic context-free grammars using the inside-outside algrithm. Computer Speech and Language, 4, 1990.

[25]

W. Martens, F. Neven, and T. Schwentick. Simple off the shelf abstractions for xml schema. SIGMOD Record, 36(3):15--22, 2007.

Digital Library

[26]

W. Martens, F. Neven, T. Schwentick, and G. J. Bex. Expressiveness and complexity of XML schema. ACM Trans. Database Syst., 31(3), 2006.

Digital Library

[27]

W. Martens, F. Neven, T. Schwentick, and G. J. Bex. Expressiveness and complexity of xml schema. ACM Trans. Database Syst., 31(3):770--813, 2006.

Digital Library

[28]

W. Martens and J. Niehren. On the minimization of XML schemas and tree automata for unranked trees. J. Comput. Syst. Sci., 73(4), 2007.

Digital Library

[29]

T. Milo and D. Suciu. Type inference for queries on semistructured data. In PODS, 1999.

Digital Library

[30]

M. Murata, D. Lee, M. Mani, and K. Kawaguchi. Taxonomy of XML schema languages using formal language theory. ACM Trans. Internet Technol., 5(4), 2005.

Digital Library

[31]

S. Nestorov, S. Abiteboul, and R. Motwani. Extracting schema from semistructured data. In SIGMOD, 1998.

Digital Library

Cited By

Uraev DBabkin E(2022)Designing XML Schema Inference Algorithm for Intra-enterprise UsePerspectives in Business Informatics Research10.1007/978-3-031-16947-2_3(35-49)Online publication date: 16-Sep-2022
https://doi.org/10.1007/978-3-031-16947-2_3
Abiteboul SAmsterdamer YDeutch DMilo TSenellart P(2015)Optimal Probabilistic Generation of XML DocumentsTheory of Computing Systems10.1007/s00224-014-9581-557:4(806-842)Online publication date: 1-Nov-2015
https://dl.acm.org/doi/10.1007/s00224-014-9581-5
Arenas MDaenen JNeven FUgarte MBussche JVansummeren S(2014)Discovering XSD Keys from XML DataACM Transactions on Database Systems10.1145/263854739:4(1-49)Online publication date: 30-Dec-2014
https://dl.acm.org/doi/10.1145/2638547
Show More Cited By

Index Terms

Finding optimal probabilistic generators for XML collections
1. Information systems
  1. Data management systems
    1. Database design and models
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Optimal Probabilistic Generation of XML Documents

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 likelihood of the particular corpus to be generated. Focusing first on the structure ...
An Efficient Schema-Based Technique for Querying XML Data

As data integration over the Web has become an increasing demand, there is a growing desire to use XML as a standard format for data exchange. For sharing their grammars efficiently, most of the XML documents in use are associated with a document ...
Combined XML/XQuery generator
DBTest '12: Proceedings of the Fifth International Workshop on Testing Database Systems

Testing and benchmarking of XML related algorithms, XML data processors and applications often require a set of XML documents and the corresponding XQueries that can be applied over the test set. Groups of real-world workloads or specialized ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

ICDT '12: Proceedings of the 15th International Conference on Database Theory

March 2012

329 pages

ISBN:9781450307918

DOI:10.1145/2274576

General Chair:
Alin Deutsch
University of California, San Diego

Copyright © 2012 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 March 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

European Research Council

Conference

ICDT '12

ICDT '12: 15th International Conference on Database Theory

March 26 - 29, 2012

Berlin, Germany

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
90
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Uraev DBabkin E(2022)Designing XML Schema Inference Algorithm for Intra-enterprise UsePerspectives in Business Informatics Research10.1007/978-3-031-16947-2_3(35-49)Online publication date: 16-Sep-2022
https://doi.org/10.1007/978-3-031-16947-2_3
Abiteboul SAmsterdamer YDeutch DMilo TSenellart P(2015)Optimal Probabilistic Generation of XML DocumentsTheory of Computing Systems10.1007/s00224-014-9581-557:4(806-842)Online publication date: 1-Nov-2015
https://dl.acm.org/doi/10.1007/s00224-014-9581-5
Arenas MDaenen JNeven FUgarte MBussche JVansummeren S(2014)Discovering XSD Keys from XML DataACM Transactions on Database Systems10.1145/263854739:4(1-49)Online publication date: 30-Dec-2014
https://dl.acm.org/doi/10.1145/2638547
Arenas MDaenen JNeven FUgarte MVan den Bussche JVansummeren SRoss KSrivastava DPapadias D(2013)Discovering XSD keys from XML dataProceedings of the 2013 ACM SIGMOD International Conference on Management of Data10.1145/2463676.2463705(61-72)Online publication date: 22-Jun-2013
https://dl.acm.org/doi/10.1145/2463676.2463705
Amarilli ASenellart P(2013)On the connections between relational and XML probabilistic data modelsProceedings of the 29th British National conference on Big Data10.1007/978-3-642-39467-6_13(121-134)Online publication date: 8-Jul-2013
https://dl.acm.org/doi/10.1007/978-3-642-39467-6_13
Kimelfeld BSenellart P(2013)Probabilistic XML: Models and ComplexityAdvances in Probabilistic Databases for Uncertain Information Management10.1007/978-3-642-37509-5_3(39-66)Online publication date: 2013
https://doi.org/10.1007/978-3-642-37509-5_3
Abiteboul SAmsterdamer YMilo TSenellart PCandan KChen YSnodgrass RGravano LFuxman A(2012)Auto-completion learning for XMLProceedings of the 2012 ACM SIGMOD International Conference on Management of Data10.1145/2213836.2213928(669-672)Online publication date: 20-May-2012
https://dl.acm.org/doi/10.1145/2213836.2213928
Abiteboul SSenellart PVianu VMille AGandon FMisselis JRabinovich MStaab S(2012)The ERC webdam on foundations of web data managementProceedings of the 21st International Conference on World Wide Web10.1145/2187980.2188011(211-214)Online publication date: 16-Apr-2012
https://dl.acm.org/doi/10.1145/2187980.2188011

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents