The Importance of Algebra for XML Query Processing

Paparizos, Stelios; Jagadish, H. V.

doi:10.1007/11896548_13

Cited by 3 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Initial efforts that mapped XML documents into relational databases queried with SQL [11], [12] induced costly table joins. Thus, algebraic approaches based on treeshaped patterns became popular for evaluating XML processing natively instead [13], [14]. Tree algebras indeed provide a formal framework for query expression and optimization, in a way similar to relational algebra with respect to the SQL language [15].…”

Section: Introductionmentioning

confidence: 99%

A Survey of XML Tree Patterns

Hachicha

Darmont²

2013

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

With XML becoming an ubiquitous language for data interoperability purposes in various domains, efficiently querying XML data is a critical issue. This has lead to the design of algebraic frameworks based on tree-shaped patterns akin to the tree-structured data model of XML. Tree patterns are graphic representations of queries over data trees. They are actually matched against an input data tree to answer a query. Since the turn of the twenty-first century, an astounding research effort has been focusing on tree pattern models and matching optimization (a primordial issue). This paper is a comprehensive survey of these topics, in which we outline and compare the various features of tree patterns. We also review and discuss the two main families of approaches for optimizing tree pattern matching, namely pattern tree minimization and holistic matching. We finally present actual tree pattern-based developments, to provide a global overview of this significant research topic

show abstract

Section: Introductionmentioning

confidence: 99%

A Survey of XML Tree Patterns

Hachicha

Darmont²

2013

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

show abstract

“…The join operation is studied by ZHANG code in [12].The XPATH query method is extended to and Twig query in [13]. The tree automata is also applied in probabilistic XML data tree [14].And the probabilistic XML data tree auto is introduced in [15].A new uncertain XML algebra system is found in [16] and is applied to query the uncertain XML data.…”

Section: Introductionmentioning

confidence: 99%

Research on Basic Operations for Query Probabilistic XML Document Based on Path Set

Wang¹,

Zhong-xiao²

2013

JSW

View full text Add to dashboard Cite

Probabilistic XML tree is a typical probabilistic XML data model for representing uncertainty in the form of probability which can be described the nested probabilistic XML element unit. The path set in probabilistic XML unit tree can be analyzed through parsing it and drawing out the corresponding probabilistic XML unit schema tree. The node probability and the node probability threshold computation are defined first. Then the set operations are defined. The probabilistic XML XQuery sentences are extended to query a node or nodes probability, path probability and to list the possible world set. The instance analysis shows that probabilistic XML data is an effective method representing probability data and the given basic operation can realize the related probability query.

show abstract

Handling Hierarchically Structured Resources Addressing Interoperability Issues in Digital Libraries

Agosti

Ferro

Silvello

2011

Learning Structure and Schemas From Documents

View full text Add to dashboard Cite

We present and describe the NEsted SeTs for Object hieRarchies (NESTOR) Framework that allows us to model, manage, access and exchange hierarchically structured resources. We envision this framework in the context of Digital Libraries and using it as a mean to address the complex and multiform concept of interoperability when dealing with hierarchical structures. The NESTOR Framework is based on three main components: The Model, the Algebra and a Prototype. We detail all these components and present a concrete use case based on archives that are collections of historical documents or records providing information about a place, institution, or group of people, because the archives are fundamental and challenging entities in the digital libraries panorama. Within the archives we show how an archive can be represented through set data models and how these models can be instantiated. We compare two instantiations of the NESTOR Model and show how interoperability issues can be addressed by exploiting the NESTOR Framework

show abstract

The Importance of Algebra for XML Query Processing

Cited by 3 publications

References 13 publications

A Survey of XML Tree Patterns

A Survey of XML Tree Patterns

Research on Basic Operations for Query Probabilistic XML Document Based on Path Set

Handling Hierarchically Structured Resources Addressing Interoperability Issues in Digital Libraries

Contact Info

Product

Resources

About