A Methodology for Vertically Partitioning in a Multi-Relation Database Environment

Autores
Gorla, Narasimhaiah
Año de publicación
2007
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
Vertical partitioning, in which attributes of a relation are assigned to partitions, is aimed at improving database performance. We extend previous research that is based on a single relation to multi-relation database environment, by including referential integrity constraints, access time based heuristic, and a comprehensive cost model that considers most transaction types including updates and joins. The algorithm was applied to a real-world insurance CLAIMS database. Simulation experiments were conducted and the results show a performance improvement of 36% to 65% over unpartitioned case. Application of our method for small databases resulted in partitioning schemes that are comparable to optimal.
Facultad de Informática
Materia
Ciencias Informáticas
Constraints
Base de Datos
partitioning schemes
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc/3.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/9560
Acceder
id SEDICI_9f4c5438220246ab518e68504182ba17
oai_identifier_str oai:sedici.unlp.edu.ar:10915/9560
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling A Methodology for Vertically Partitioning in a Multi-Relation Database EnvironmentGorla, NarasimhaiahCiencias InformáticasConstraintsBase de Datospartitioning schemesVertical partitioning, in which attributes of a relation are assigned to partitions, is aimed at improving database performance. We extend previous research that is based on a single relation to multi-relation database environment, by including referential integrity constraints, access time based heuristic, and a comprehensive cost model that considers most transaction types including updates and joins. The algorithm was applied to a real-world insurance CLAIMS database. Simulation experiments were conducted and the results show a performance improvement of 36% to 65% over unpartitioned case. Application of our method for small databases resulted in partitioning schemes that are comparable to optimal.Facultad de Informática2007-10info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf217-227http://sedici.unlp.edu.ar/handle/10915/9560enginfo:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Oct07-5.pdfinfo:eu-repo/semantics/altIdentifier/issn/1666-6038info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc/3.0/Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-11-12T10:15:28Zoai:sedici.unlp.edu.ar:10915/9560Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-11-12 10:15:29.202SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv A Methodology for Vertically Partitioning in a Multi-Relation Database Environment
title A Methodology for Vertically Partitioning in a Multi-Relation Database Environment
spellingShingle A Methodology for Vertically Partitioning in a Multi-Relation Database Environment
Gorla, Narasimhaiah
Ciencias Informáticas
Constraints
Base de Datos
partitioning schemes
title_short A Methodology for Vertically Partitioning in a Multi-Relation Database Environment
title_full A Methodology for Vertically Partitioning in a Multi-Relation Database Environment
title_fullStr A Methodology for Vertically Partitioning in a Multi-Relation Database Environment
title_full_unstemmed A Methodology for Vertically Partitioning in a Multi-Relation Database Environment
title_sort A Methodology for Vertically Partitioning in a Multi-Relation Database Environment
dc.creator.none.fl_str_mv Gorla, Narasimhaiah
author Gorla, Narasimhaiah
author_facet Gorla, Narasimhaiah
author_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
Constraints
Base de Datos
partitioning schemes
topic Ciencias Informáticas
Constraints
Base de Datos
partitioning schemes
dc.description.none.fl_txt_mv Vertical partitioning, in which attributes of a relation are assigned to partitions, is aimed at improving database performance. We extend previous research that is based on a single relation to multi-relation database environment, by including referential integrity constraints, access time based heuristic, and a comprehensive cost model that considers most transaction types including updates and joins. The algorithm was applied to a real-world insurance CLAIMS database. Simulation experiments were conducted and the results show a performance improvement of 36% to 65% over unpartitioned case. Application of our method for small databases resulted in partitioning schemes that are comparable to optimal.
Facultad de Informática
description Vertical partitioning, in which attributes of a relation are assigned to partitions, is aimed at improving database performance. We extend previous research that is based on a single relation to multi-relation database environment, by including referential integrity constraints, access time based heuristic, and a comprehensive cost model that considers most transaction types including updates and joins. The algorithm was applied to a real-world insurance CLAIMS database. Simulation experiments were conducted and the results show a performance improvement of 36% to 65% over unpartitioned case. Application of our method for small databases resulted in partitioning schemes that are comparable to optimal.
publishDate 2007
dc.date.none.fl_str_mv 2007-10
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Articulo
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/9560
url http://sedici.unlp.edu.ar/handle/10915/9560
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Oct07-5.pdf
info:eu-repo/semantics/altIdentifier/issn/1666-6038
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc/3.0/
Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc/3.0/
Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)
dc.format.none.fl_str_mv application/pdf
217-227
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_ 1848605216603111424
score 12.976206

Publicaciones similares