Query optimization in XML structured-document databases

Che, Dunren; Aberer, Karl; Özsu, M. Tamer

doi:10.1007/s00778-005-0172-6

Cited by 55 publications

(37 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Two central questions are how to store and how to query the data (for example [2,4,7,9,11,15,18], just to cite a few). We can divide those approaches into two categories: (i) those that do not depend on schema definition, such as [9] and [11]; and (ii) those that depend on schema definitions. The second category can be further divided in those that employ DTDs [4,15] and XSDs [2,7,18].…”

Section: Xml Data Management and Schemasmentioning

confidence: 99%

An X-ray on web-available XML schemas

et al. 2009

View full text Add to dashboard Cite

XML has conquered its place as the most used standard for representing Web data. An XML schema may be employed for similar purposes of those from database schemas. There are different languages to write an XML schema, such as DTD and XSD. In this paper, we provide a general view, an X-Ray, on Web-available XSD files by identifying which XSD constructs are more and less frequently used. Furthermore, we provide an evolution perspective, showing results from XSD files collected in 2005 and 2008. Hence, we can also draw some conclusions on what trends seem to exist in XSD usage. The results of such study provide relevant information for developers of XML applications, tools and algorithms in which the schema has a distinguished role.

show abstract

Section: Xml Data Management and Schemasmentioning

confidence: 99%

An X-ray on web-available XML schemas

et al. 2009

View full text Add to dashboard Cite

show abstract

“…At the logical level, the XML query optimization is to utilize the XML Schema, and to apply the rules of normalization or simplification to the inner query expressions so as to simplify the expressions that can improve the query performance. Lots of researches focusing on logical optimization have been done [3,4,5,6,7,9,10]. Our work focuses on the cost-based query optimization at the physical level and deals with how to determine the join order in query trees according to the cost estimation.…”

Section: Related Workmentioning

confidence: 99%

Cost-based Query Optimization for Xpath

Dong¹,

Chen²,

Liang³

et al. 2014

Appl. Math. Inf. Sci.

View full text Add to dashboard Cite

Abstract:In this article, we address the issues which are related to the cost-based XML query optimization for XPath. Specially, we focus on the issue of how to determine the execution order for a given XPath expression according to the cost models. The main impact factor that dominates the execution order is the size of the intermediate results during the evaluation of queries. The hierarchy encoding scheme and the value-encoding histogram are introduced to support the size estimation of the path expressions. Two cost models are proposed to describe the costs of different types of join operations in the path expressions. A heuristic-based dynamic programming approach is proposed to determine the optimal execution tree. The primary experimental results demonstrate the validity of our approaches.

show abstract

“…To achieve good performance in query processing, lots of initiatives focus on indexing [13,14,18,20,21,34,57] and query optimization [15,16,29,55,74]. In addition to these initiatives, distributed query processing can further improve the performance when large collections of documents are involved.…”

Section: Introductionmentioning

confidence: 99%

A Survey on XML Fragmentation

Braganholo

Mattoso

2014

SIGMOD Rec.

View full text Add to dashboard Cite

Efficient document processing is a must when large volumes of XML data are involved. In such critical scenarios, a well-known solution to this problem is to distribute (map) the data among several processing nodes, and then distribute the processing accordingly, taking advantage of parallelism. This is the approach taken by distributed databases and MapReduce environments. Fragmentation techniques play an important role in these scenarios. They provide a way to "cut" the database into pieces and distribute the pieces over a network. This way, queries can also be "cut" into sub-queries that run in parallel, thus achieving better performance when compared to the centralized environment. However, there is no consensus in the database community as to what an XML fragment is. In fact, several approaches in literature present definitions of XML fragments. In addition to query processing, using XML fragmentation techniques may also be helpful when managing XML documents distributed along the web or clouds. This paper surveys the existing XML fragmentation approaches in literature, comparing their features and highlighting their drawbacks. Our contribution resides in establishing a map of the area.

show abstract

Query optimization in XML structured-document databases

Cited by 55 publications

References 26 publications

An X-ray on web-available XML schemas

An X-ray on web-available XML schemas

Cost-based Query Optimization for Xpath

A Survey on XML Fragmentation

Contact Info

Product

Resources

About