| dc.contributor.author | Rodríguez-Mazahua, Nidia | |
| dc.contributor.author | Rodríguez-Mazahua, Lisbeth | |
| dc.contributor.author | López-Chau, Asdrúbal | |
| dc.contributor.author | Alor-Hernández, Giner | |
| dc.contributor.author | Machorro-Cano, Isaac | |
| dc.date.accessioned | 2023-01-18T04:47:15Z | |
| dc.date.available | 2023-01-18T04:47:15Z | |
| dc.date.issued | 2022-10-28 | |
| dc.identifier.issn | 2076-3417 | |
| dc.identifier.uri | http://repositorios.orizaba.tecnm.mx:8080/xmlui/handle/123456789/746 | |
| dc.description | Data warehousing gives frameworks and means for enterprise administrators to methodically prepare, comprehend, and utilize the data to improve strategic decision-making skills. One of the principal challenges to data warehouse designers is fragmentation. Currently, several frag mentation approaches for data warehouses have been developed since this technique can decrease the OLAP (online analytical processing) query response time and it provides considerable benefits in table loading and maintenance tasks. In this paper, a horizontal fragmentation method, called FTree, that uses decision trees to fragment data warehouses is presented to take advantage of the effectiveness that this technique provides in classification. FTree determines the OLAP queries with major relevance, evaluates the predicates found in the workload, and according to this, builds the decision tree to select the horizontal fragmentation scheme. To verify that the design is correct, the SSB (star schema benchmark) was used in the first instance; later, a tourist data warehouse was built, and the fragmentation method was tested on it. The results of the experiments proved the efficacy of the method. | es |
| dc.description.abstract | Data warehousing gives frameworks and means for enterprise administrators to methodically prepare, comprehend, and utilize the data to improve strategic decision-making skills. One of the principal challenges to data warehouse designers is fragmentation. Currently, several frag mentation approaches for data warehouses have been developed since this technique can decrease the OLAP (online analytical processing) query response time and it provides considerable benefits in table loading and maintenance tasks. In this paper, a horizontal fragmentation method, called FTree, that uses decision trees to fragment data warehouses is presented to take advantage of the effectiveness that this technique provides in classification. FTree determines the OLAP queries with major relevance, evaluates the predicates found in the workload, and according to this, builds the decision tree to select the horizontal fragmentation scheme. To verify that the design is correct, the SSB (star schema benchmark) was used in the first instance; later, a tourist data warehouse was built, and the fragmentation method was tested on it. The results of the experiments proved the efficacy of the method. | es |
| dc.description.sponsorship | Consejo Nacional de Ciencia y Tecnología (CONACYT)
Secretaría de Educación Pública (SEP)
Tecnológico Nacional de México (TecNM) | es |
| dc.language.iso | en | es |
| dc.publisher | MDPI Publishing | es |
| dc.subject | Horizontal fragmentation | es |
| dc.subject | Decision trees | es |
| dc.subject | Data Warehouse | es |
| dc.subject | Cost model | es |
| dc.title | Decision-Tree-Based Horizontal Fragmentation Method for Data Warehouses | es |
| dc.type | Article | es |
