A comprehensive XQuery to SQL translation using dynamic interval encoding

DeHaan, David; Toman, David; Consens, Mariano P.; Özsu, M. Tamer

doi:10.1145/872830.872832

Cited by 14 publications

(14 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This, however, calls for an extension of sql to support certain recursive operator. As observed by [40], although there has been a host of work on storing and querying xml using an rdbms [11,16,26,28,29,31,36,39,41,42,45,57,58,62,64], the problem of translating recursive xml queries into sql has not been well studied in the presence of recursive dtds, and it was singled out as the most important open problem for schema-based xml storage in [40].…”

Section: Introductionmentioning

confidence: 99%

“…There has also been a host of work on translating xml queries to sql, for schema-oblivious xml storage, e.g., pathbased methods [36,45,64], and region/Dewey encoding [11,16,31,62]. Combining path index and Dewey encoding, optimization techniques to minimize structural joins, e.g., Primitive Path Fragment (ppf) [28,29], have also been developed.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Query translation from XPath to SQL in the presence of recursive DTDs

Fan

et al. 2009

The VLDB Journal

View full text Add to dashboard Cite

We study the problem of evaluating xpath queries over xml data that is stored in an rdbms via schema-based shredding. The interaction between recursion (descendantsaxis) in xpath queries and recursion in dtds makes it challenging to answer xpath queries using rdbms. We present a new approach to translating xpath queries into sql queries based on a notion of extended XPath expressions and a simple least fixpoint (lfp) operator. Extended xpath expressions are a mild extension of xpath, and the lfp operator takes a single input relation and is already supported by most commercial rdbms. We show that extended xpath expressions are capable of capturing both dtd recursion and xpath queries in a uniform framework. Furthermore, they can be translated into an equivalent sequence of sql queries with the lfp operator. We present algorithms for rewriting xpath queries over An extended abstract was presented at the 31st international conference on Very Large Data Bases (VLDB), 2005.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Query translation from XPath to SQL in the presence of recursive DTDs

Fan

et al. 2009

The VLDB Journal

View full text Add to dashboard Cite

show abstract

“…Another popular approach (perhaps, due to existing system support) was to use relational databases and map XML documents into relations. Such solutions were presented in [1,3,14,16,18]. But these mappings may come at the expense of efficiency and performance since relational databases were not designed for XML data.…”

Section: Introductionmentioning

confidence: 99%

“…For example in Figure 6, the red(gray) circle indicates how the A nodes form a logical class for each witness tree. Every node in every tree in any intermediate result is marked as member of at least one logical class 1 . We also permit predicates on logical class membership as part of an annotated pattern tree specification, thus allowing operators late in the plan to reuse pattern tree matches computed earlier.…”

mentioning

confidence: 99%

The Importance of Algebra for XML Query Processing

Paparizos

Jagadish

2006

Current Trends in Database Technology – EDBT 2006

View full text Add to dashboard Cite

Relational algebra has been a crucial foundation for relational database systems, and has played a large role in enabling their success. A corresponding XML algebra for XML query processing has been more elusive, due to the comparative complexity of XML, and its history. We argue that having a sound algebraic basis remains important nonetheless. In this paper, we show how the complexity of XML can be modeled effectively in a simple algebra, and how the conceptual clarity attained thereby can lead to significant benefits.

show abstract

“…There are some other research works that focus on how to implement XQuery in a relational database. These works can be found in [33,34].…”

Section: Schema-oblivious Approachmentioning

confidence: 99%

Mapping, indexing and querying of MPEG-7 descriptors and description schemes

Chu¹

View full text Add to dashboard Cite

MPEG-7 is a promising standard for the description of multimedia content. Today, more and more multimedia applications based on MPEG-7 descriptions have been set up for research, commercial and industrial applications. Therefore, an efficient storage solution for large amounts of MPEG-7 descriptions is certainly desirable. However, few existing works focus on a comprehensive MPEG-7 descriptions management system. Although the MPEG-7 descriptions are also the XML documents, the current database solutions for XML documents do not fulfill all the requirements for the management of MPEG-7 descriptions. The goal of this thesis is to investigate the MPEG-7 descriptions storage solution and present the implementation of an MPEG-7 descriptions management system: IXMMS, which is based on RDBMS and ORDBMS. IXMMS is a novel XML storage solution to overcome the problems in the current XML storage solutions for the management of MPEG-7 descriptions. The design of IXMMS pays attention to both multimedia information exchange and multimedia data manipulation. IXMMS introduces two separate databases, one to store MPEG-7 descriptions from the XML perspective, and the other for the low-level multimedia content within the MPEG-7 descriptors. Thus, IXMMS supports the management of MPEG-7 descriptions and MPEG-7 information exchange not only from the XML perspective, but also from the multimedia perspective, and its features can reach the most critical requirements for the MPEG-7 documents storage and management. In IXMMS, we propose a novel XML storage approach, called SM3, for the MPEG-7 documents storage solution. As a kind of data-centric XML documents, MPEG-7 descriptions can be stored in the relational DBMS for efficient and effective management. The approaches of storing XML data in relational DBMS can be classified into two classes of storage model: schema-conscious and schema-oblivious. The schema-conscious

show abstract

A comprehensive XQuery to SQL translation using dynamic interval encoding

Cited by 14 publications

References 10 publications

Query translation from XPath to SQL in the presence of recursive DTDs

Query translation from XPath to SQL in the presence of recursive DTDs

The Importance of Algebra for XML Query Processing

Mapping, indexing and querying of MPEG-7 descriptors and description schemes

Contact Info

Product

Resources

About