A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Filters
Data Warehouse Performance: Optimization by Double Partitioning of Materialized Views
2021
International Journal of Computer Applications
In this work, we will demonstrate that if we end up with the partitioning of materialized views, we can optimize the functioning of data warehouses. ...
Materialized views also improve the execution time of data warehouse queries. ...
In vertical partitioning, a relation is divided into sub relations called vertical fragments which are projections applied to the relation. ...
doi:10.5120/ijca2021921029
fatcat:6dikwa5oqrae7p2423gjezv2re
Data mining-based fragmentation of XML data warehouses
2008
Proceeding of the ACM 11th international workshop on Data warehousing and OLAP - DOLAP '08
With the multiplication of XML data sources, many XML data warehouse models have been proposed to handle data heterogeneity and complexity in a way relational data warehouses fail to achieve. ...
Derived horizontal fragmentation is typically used in relational data warehouses and can definitely be adapted to the XML context. ...
ACKNOWLEDGMENTS The authors would like to thank Houssem Aissa, Anouar Benzakour, Kevin du Repaire and Hamza El Kartite, who participated in coding our approach in Java. ...
doi:10.1145/1458432.1458435
dblp:conf/dolap/MahboubiD08
fatcat:zeypfx4hq5c5nis3sh44tf6oem
Data Mining-based Fragmentation of XML Data Warehouses
[article]
2008
arXiv
pre-print
With the multiplication of XML data sources, many XML data warehouse models have been proposed to handle data heterogeneity and complexity in a way relational data warehouses fail to achieve. ...
Derived horizontal fragmentation is typically used in relational data warehouses and can definitely be adapted to the XML context. ...
ACKNOWLEDGMENTS The authors would like to thank Houssem Aissa, Anouar Benzakour, Kevin du Repaire and Hamza El Kartite, who participated in coding our approach in Java. ...
arXiv:0811.0741v1
fatcat:mxfgybhr45buffdol72gnlw4uu
Fragmenting very large XML data warehouses via K-means clustering algorithm
2009
International Journal of Business Intelligence and Data Mining
As a consequence, many XML data warehouse models have been proposed during past years in order to handle hetero-geneity and complexity of multidimensional data in a way traditional relational data warehouse ...
Derived horizontal fragmentation is already used in relational data warehouses, and can definitely be adapted to the XML context. ...
Vertical fragmentation splits a given relation R into sub-relations that are projections of R with respect to a subset of attributes. ...
doi:10.1504/ijbidm.2009.029076
fatcat:wve3gtsfmnccvl2mnrp3q7ft3e
Double Partitioning with global and local Indexing: Effect on Data Warehouse Performance
2018
International Journal of Computer Applications
performance of the data warehouse. ...
Designers of data warehouses always try to minimize the execution time of the analysis requests and optimize the performance of the warehouse in order to present the reports in the best time and condition ...
In vertical partitioning, a relation is divided into sub relations called vertical fragments which are projections applied to the relation. ...
doi:10.5120/ijca2018917148
fatcat:tfa4hanrz5ar3coi5v6mz3ewwm
Review on Fragmentation in Distributed Database Environment
2014
IOSR Journal of Engineering
In Traditional environments, there are many advantages of distributed data warehouses. Distributed processing is the efficient way to increase efficiency of data. ...
Here focus is on the distributed data warehouses, which combines the known predicate construction techniques with a clustering method to fragment data warehouse relations by using the data miningbased ...
Fragmentation can be of any type: horizontal, vertical and hybrid/mixed.
1.1.1 Vertical Fragmentation Vertical fragmentation splits a single relation R into sub-relations that are projections of relation ...
doi:10.9790/3021-04362832
fatcat:qzlxl22c3ndypffudhxq4lgpne
Selecting and materializing horizontally partitioned warehouse views
2001
Data & Knowledge Engineering
Data warehouse views typically store large aggregate tables based on a subset of dimension attributes of the main data warehouse fact table. ...
Methods have been proposed for selecting only some of the data cube views to materialize in order to speed up query response time, accommodate storage space constraint and reduce warehouse maintenance ...
Acknowledgements This research was supported by the Natural Science and Engineering Research Council (NSERC) of Canada under an operating grant (OGP-0194134) and a University of Windsor grant. ...
doi:10.1016/s0169-023x(00)00044-6
fatcat:gj4blndzhvdohlxw5xbzgp3uvq
Enhancing XML data warehouse query performance by fragmentation
2009
Proceedings of the 2009 ACM symposium on Applied Computing - SAC '09
In relational data warehouses, several studies recommend the use of derived horizontal fragmentation. Hence, we propose to adapt it to the XML context. ...
Fragmenting and distributing XML data warehouses (e.g., on data grids) allow to address both these issues. In this paper, we work on XML warehouse fragmentation. ...
To improve ad-hoc query performance, Datta et al. exploit a vertical fragmentation of facts to build the Cuio index [8] , while Golfarelli et al. apply the same fragmentation on warehouse views [10] ...
doi:10.1145/1529282.1529630
dblp:conf/sac/MahboubiD09
fatcat:2khly6tcqrawnpfiinalt2nvbm
Enhancing XML Data Warehouse Query Performance by Fragmentation
[article]
2009
arXiv
pre-print
In relational data warehouses, several studies recommend the use of derived horizontal fragmentation. Hence, we propose to adapt it to the XML context. ...
Fragmenting and distributing XML data warehouses (e.g., on data grids) allow to address both these issues. In this paper, we work on XML warehouse fragmentation. ...
To improve ad-hoc query performance, Datta et al. exploit a vertical fragmentation of facts to build the Cuio index [8] , while Golfarelli et al. apply the same fragmentation on warehouse views [10] ...
arXiv:0908.3957v1
fatcat:w4spkdssxjfe7obliv42ewezvy
An Approach to Extracting Distributed Data From the Integrated Environment of Web Technologies Based on Set Theory
2019
International Journal of Computer Science & Information Technology (IJCSIT)
In fact, Web technologies have been proposed to meet certain needs related to heterogeneous and distributed information systems for communicating and exchanging computerized data on the Web. ...
The composition and extraction of the information distributed by the different web technologies allow a design of a multifunction imported data environment. ...
[22]
Subset Distribution (Data Mart) A Data Mart (data warehouse) is a subset of a relational database used in business intelligence. ...
doi:10.5121/ijcsit.2019.11303
fatcat:455tagkn5rfvpplrxoqbtqwzrq
Page 167 of Distributed Computing Vol. 4, Issue 4
[page]
1991
Distributed Computing
Inventory of mer¬ chandise and payroll related data are examples of this set.
2. ...
Sometimes, warehouses within a single group may run out of certain goods. In such cases, the demands of the stores in the group are forwarded to the warehouses in nearby groups. ...
Horizontal Partitioning by Predicate Abstraction and Its Application to Data Warehouse Design
[chapter]
2010
Lecture Notes in Computer Science
We apply this partitioning to address the problem of finding suitable design for a relational data warehouse modeled using star schemas such that the performance of a given workload is optimized. ...
The method is formal and compositional: arbitrary fragments of relations can be partitioned with arbitrary number of predicates. ...
In [7] is proposed a technique for materializing data warehouse views in vertical fragments, aimed to tightly fit the reference workload. ...
doi:10.1007/978-3-642-15576-5_14
fatcat:v4eg4tz5ofdchayfq4gu6kizpy
Vertical Fragmentation for Database Using FPClose Algorithm
2019
Journal of Information Security and Cybercrimes Research
Vertical fragmentation technique is used to enhance the performance of database system and reduce the number of access to irrelevant instances by splitting a table or relation into different fragments ...
The partitioning design can be derived using FPClose algorithm, which is a data mining algorithm used to extract the frequent closed itemsets in a dataset. ...
Al-Shannaq, Sultan Almotairi
Related work Vertical fragmentation in data warehouse views and it's utility was experimentally confirmed in terms of cost reduction for the expected workload execution ...
doi:10.26735/16587790.2019.005
fatcat:hp3n4jvco5f5dbkupthyya3d3e
Examining the Performance of Vertical Fragmentation using FP-MAX Algorithm
2015
International Journal of Computer Applications
Fragmentation on large as well as small database such as educational database, data warehouses, medical databases. ...
In Present work FP-MAX data mining algorithm is used to extract frequent item set attributes of a large database table. The frequent accessed instance variables are grouped called Vertical fragments. ...
A technique of Vertical Fragmentation of Views in multidimensional databases is proposed. ...
doi:10.5120/20514-2691
fatcat:btbrwzqhsjglxesz6raesllcva
A New Approach for Knowledge Discovery in Distributed Databases Using Fragmented Data Storage Model
2013
Chinese Business Review
The new model can effectively organize and use complex data sources, even when they are distributed in different sites in a fragmented form. ...
Since the early 1990, significant progress in database technology has provided new platform for emerging new dimensions of data engineering. ...
In a homogenous distributed relational database they use the same DBMS nevertheless still they split the conceptual relations to vertical and/or horizontal fragments. ...
doi:10.17265/1537-1506/2013.12.005
fatcat:pbejth56jvfa5ow6zzs76mfh5a
« Previous
Showing results 1 — 15 out of 5,607 results