Repositório Digital

A- A A+

Unnesting queries using algebraic equivalents in an Xquery engine

.

Unnesting queries using algebraic equivalents in an Xquery engine

Mostrar registro completo

Estatísticas

Título Unnesting queries using algebraic equivalents in an Xquery engine
Autor Bernd, Augusto Barcellos
Orientador Sauer, Caetano
Co-orientador Galante, Renata de Matos
Data 2015
Nível Graduação
Instituição Universidade Federal do Rio Grande do Sul. Instituto de Informática. Curso de Ciência da Computação: Ênfase em Ciência da Computação: Bacharelado.
Assunto Álgebra
Banco : Dados
[en] Algebraic
[en] Database
[en] Equivalence
[en] Optimization
[en] Rewrite
[en] Subquery
[en] Unnesting
[en] XML
[en] XQuery
Abstract Since the beginning of the 80’s, during the rise of relational databases, it has been developed many strategies to deal with problems of executing queries in a nested way. Most of these strategies are based on classification into generic query types, followed by an unnest technique for each type. The two main approaches to unnest are: source level and algebraic level. The latter has some advantages, as expressiveness. These publications were important to the success of relational database architectures. However, all this knowledge is not only useful for relational databases, but also for queries from non-relational databases, e.g. XML databases. Brackit is an open-source XQuery compilation engine, developed at Technische Universität Kaiserslautern. The compilation pipeline in this engine includes an optimization stage where we could develop unnesting algorithms. Aiming optimize the query evaluation in Brackit, we present how we applied algebraic equivalences to unnest queries. The contribution of this work is the implementation of an efficient and high level unnesting technique, easy to understand and to improve. This implementation reduces the heavy code legacy of the current optimizer version. The basis of these equivalences application was the good correspondence between the algebra and Brackit’s AST nodes. The optimization, thus, was based on AST manipulation. Here, we are going to call this manipulation as rewriting. For experimental analysis, it was performed simulations throw XQuery to prove the gain of the unnesting strategy.
Tipo Trabalho de conclusão de graduação
URI http://hdl.handle.net/10183/126066
Arquivos Descrição Formato
000972331.pdf (1.294Mb) Texto completo Adobe PDF Visualizar/abrir

Este item está licenciado na Creative Commons License

Este item aparece na(s) seguinte(s) coleção(ões)


Mostrar registro completo

Percorrer



  • O autor é titular dos direitos autorais dos documentos disponíveis neste repositório e é vedada, nos termos da lei, a comercialização de qualquer espécie sem sua autorização prévia.
    Projeto gráfico elaborado pelo Caixola - Clube de Criação Fabico/UFRGS Powered by DSpace software, Version 1.8.1.