A solution to the materialized view selection problem in data warehousing

Autores
Tamiozzo, Ayelén S.; Ale, Juan María
Año de publicación
2014
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
One of the most important decisions in the physical designing of a data warehouse is the selection of materialized views and indexes to be created. The problem is to select an appropriate set of views and indexes to storage that minimizes the total query response time, as long as the cost of maintaining them, given a constraint of some resource like storage space, is kept as low as possible.In this work, we have developed a new algorithm for the general problem of se-lection of views considering indexes, as an extension to a well-known algorithm. We present a heuristic for selection of views and indexes to optimize total que-ry response under a materialization time constraint. Finally, we present an ex-perimental comparison of our proposal with the considered state-of-art ap-proach.
XI Workshop Bases de Datos y Minería de Datos
Red de Universidades con Carreras de Informática (RedUNCI)
Materia
Ciencias Informáticas
views
view selection
data warehouse
indexes
materialization
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/42286
Acceder
id SEDICI_437ee680bfc3ed2a0db36421808ad449
oai_identifier_str oai:sedici.unlp.edu.ar:10915/42286
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling A solution to the materialized view selection problem in data warehousingTamiozzo, Ayelén S.Ale, Juan MaríaCiencias Informáticasviewsview selectiondata warehouseindexesmaterializationOne of the most important decisions in the physical designing of a data warehouse is the selection of materialized views and indexes to be created. The problem is to select an appropriate set of views and indexes to storage that minimizes the total query response time, as long as the cost of maintaining them, given a constraint of some resource like storage space, is kept as low as possible.In this work, we have developed a new algorithm for the general problem of se-lection of views considering indexes, as an extension to a well-known algorithm. We present a heuristic for selection of views and indexes to optimize total que-ry response under a materialization time constraint. Finally, we present an ex-perimental comparison of our proposal with the considered state-of-art ap-proach.XI Workshop Bases de Datos y Minería de DatosRed de Universidades con Carreras de Informática (RedUNCI)2014-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/42286enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:01:23Zoai:sedici.unlp.edu.ar:10915/42286Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:01:23.209SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv A solution to the materialized view selection problem in data warehousing
title A solution to the materialized view selection problem in data warehousing
spellingShingle A solution to the materialized view selection problem in data warehousing
Tamiozzo, Ayelén S.
Ciencias Informáticas
views
view selection
data warehouse
indexes
materialization
title_short A solution to the materialized view selection problem in data warehousing
title_full A solution to the materialized view selection problem in data warehousing
title_fullStr A solution to the materialized view selection problem in data warehousing
title_full_unstemmed A solution to the materialized view selection problem in data warehousing
title_sort A solution to the materialized view selection problem in data warehousing
dc.creator.none.fl_str_mv Tamiozzo, Ayelén S.
Ale, Juan María
author Tamiozzo, Ayelén S.
author_facet Tamiozzo, Ayelén S.
Ale, Juan María
author_role author
author2 Ale, Juan María
author2_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
views
view selection
data warehouse
indexes
materialization
topic Ciencias Informáticas
views
view selection
data warehouse
indexes
materialization
dc.description.none.fl_txt_mv One of the most important decisions in the physical designing of a data warehouse is the selection of materialized views and indexes to be created. The problem is to select an appropriate set of views and indexes to storage that minimizes the total query response time, as long as the cost of maintaining them, given a constraint of some resource like storage space, is kept as low as possible.In this work, we have developed a new algorithm for the general problem of se-lection of views considering indexes, as an extension to a well-known algorithm. We present a heuristic for selection of views and indexes to optimize total que-ry response under a materialization time constraint. Finally, we present an ex-perimental comparison of our proposal with the considered state-of-art ap-proach.
XI Workshop Bases de Datos y Minería de Datos
Red de Universidades con Carreras de Informática (RedUNCI)
description One of the most important decisions in the physical designing of a data warehouse is the selection of materialized views and indexes to be created. The problem is to select an appropriate set of views and indexes to storage that minimizes the total query response time, as long as the cost of maintaining them, given a constraint of some resource like storage space, is kept as low as possible.In this work, we have developed a new algorithm for the general problem of se-lection of views considering indexes, as an extension to a well-known algorithm. We present a heuristic for selection of views and indexes to optimize total que-ry response under a materialization time constraint. Finally, we present an ex-perimental comparison of our proposal with the considered state-of-art ap-proach.
publishDate 2014
dc.date.none.fl_str_mv 2014-10
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/42286
url http://sedici.unlp.edu.ar/handle/10915/42286
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844615880152973312
score 13.070432

Publicaciones similares