Tesis doctorales: TESEO

Ayuda Salir

Ficha de Tesis

Imprimir

Ministerio de Educación, Cultura y Deporte - Gobierno de España

Título: COMPACT DATA STRUCTURES FOR LARGE AND COMPLEX DATASETS
Autor: Silva Coira, Fernando
Universidad: Universidad de A Coruña
Departamento: Computación
Fecha de Lectura: 26/07/2017
Mención Europeo / Mención Internacional: Concedido
Programa de doctorado: Programa de Doctorado en Computación por la Universidad de A Coruña
Dirección:
- Parama Gabia, Jose Ramon (Director)
- Ladra González, Susana (Director)
Tribunal:
- RODRIGUEZ BRISABOA, NIEVES (presidente)
- Martínez Prieto, Miguel Ángel (secretario)
- GUTIERREZ RETEMAL, GILBERTO (vocal)
Descriptores:
- INFORMATICA
- CODIGO Y SISTEMAS DE CODIFICACION
- CONSTRUCCION DE ALGORITMOS
- SISTEMAS DE INFORMACION GEOGRAFICA
Marcador: https://www.educacion.es/teseo/mostrarRef.do?ref=1484724Añadir a favoritos.
Resumen:
In this thesis, we study the problem of processing large and complex collections of data, presenting new data structures and algorithms that allow us to efficiently store and analyze them. We focus on three main domains: processing of multidimensional data, representation of spatial information, and analysis of scientific data. The common nexus is the use of compact data structures, which combine in a unique data structure a compressed representation of the data and the structures to access such data. The target is to be able to manage data directly in compressed form, and in this way, to keep data always compressed, even in main memory. With this, we obtain two benefits: we can manage larger datasets in main memory and we take advantage of a better usage of the memory hierarchy. In the first part, we propose a compact data structure for multidimensional databases where the domains of each dimension are hierarchical. It allows efficient queries of aggregate information at different levels of each dimension. A typical application environment for our solution would be an OLAP system. Second, we focus on the representation of spatial information, specifically on raster data, which are commonly used in geographic information systems (GIS) to represent spatial attributes (such as the altitude of a terrain, the average temperature, etc.). The new method enables several typical spatial queries with better response times than the state of the art, at the same time that saves space in both main memory and disk. Besides, we also present a framework to run a spatial join between raster and vector datasets, that uses the compact data structure previously presented in this part of the thesis. Finally, we present a solution for the computation of empirical moments from a set of trajectories of a continuous time stochastic process observed in a given period of time. The empirical autocovariance function is an example of such operations. In this thesis, we propose a method that compresses sequences of floating numbers representing Brownian motion trajectories, although it can be used in other similar areas. In addition, we also introduce a new algorithm for the calculation of the autocovariance that uses a single trajectory at a time, instead of loading the whole dataset, reducing the memory consumption during the calculation process.

Imprimir

Modificar Consulta Nueva Consulta

versión 4.2