Static and incremental dynamic approaches for multi-objective bitmap join indexes selection in data warehouses

Toumi, Lyazid; Ugur, Ahmet

doi:10.1007/s11227-020-03423-7

Cited by 3 publications

(4 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In our approach, the simultaneity between materialized and indexed views used to benefit from the interaction between these structures. In addition, a mathematical modulization of the problem has been proposed based on the backpack algorithm which proves their performance compared to the greedy algorithm used by N. Maiz et al [5].…”

Section: Optimization Techniquesmentioning

confidence: 86%

“…These works only deal with the case where the load of requests is static and does not change over time. In [5], authors proposed an approach to dynamically select materialized views. The approach is based on the PRQ predictor to predict the next request and materialize its corresponding views using the conditional probability.…”

Section: Optimization Techniquesmentioning

confidence: 99%

“…Likewise, for the Matrix VT[v, t] which presents the materialized views linked to the tables. For example, if the materialized view number 5 (MV5) is linked with Table 4 then VT [5,4] = 1 otherwise equal to 0.…”

Section: Dynamic Databasementioning

confidence: 99%

See 2 more Smart Citations

Queries Processing in Wireless Sensor Network

Abbassi¹,

Ezzedine²

2021

Wireless Sensor Networks - Design, Deployment and Applications

View full text Add to dashboard Cite

For the super-excellence applications used to control the water level in rivers, temperature handles a very large volume of information and does not stop constantly changing. These spatio-temporal data collected by a network of sensors form a set of thematic, integrated, non-volatile and historical data organized to help decision-making. Usually this process is performed with temporal, spatial and spatiotemporal queries. This in turn increases the execution time of the query load. In the literatures, several techniques have been identified such as materialized views (MV), indexes, fragmentation, scheduling, and buffer management. These techniques do not consider the update of the request load and the modification at the database level. In this chapter, we propose an optimal dynamic selection solution based on indexes and VMs. the solution is optimal when it meets the entire workload with a reasonable response time. The proposed approach supports modification at the database level and at the workload level to ensure the validity of the optimal solution for this the knapsack algorithm was used.

show abstract

Section: Optimization Techniquesmentioning

confidence: 86%

Section: Optimization Techniquesmentioning

confidence: 99%

See 1 more Smart Citation

Queries Processing in Wireless Sensor Network

Abbassi¹,

Ezzedine²

2021

Wireless Sensor Networks - Design, Deployment and Applications

View full text Add to dashboard Cite

show abstract

“…Considering that the main purpose of the design of information integration platform is to integrate all aspects of grid information of student dormitories and assist managers to establish decision-making schemes. e establishment of data warehouse needs to be based on providing high-level decision support function [22,23], and then design low-level query function according to the requirements of detailed data statistics. Based on the above integration content, the grid information integration model of student dormitory is constructed by using the three-level mode.…”

Section: Establish Grid Warehouse Of Student Dormitorymentioning

confidence: 99%

Grid Information Integration Platform of Student Dormitory Based on Edge Computing

2022

Mathematical Problems in Engineering

View full text Add to dashboard Cite

In order to solve the problem that the average response time of the grid information integration platform in student dormitories is too long, a grid information integration platform for student dormitory based on edge computing is proposed. In terms of hardware, on the basis of clarifying the principle of edge computing, the overall framework of the platform is built based on the B/S structure. The central unit, power supply circuit, LCD display, signal processor, and power supply of voltage regulator in the framework are optimized. In terms of software, a three-level data integration model combined with a two-way mapping strategy is used to establish a grid warehouse in student dormitories. Based on the distributed link structure and the principle of management domain, the distributed data acquisition technology is designed to collect the grid information of students’ dormitory in real time and store it in the warehouse. Using the IFB tree structure in the edge computing branch, the edge computing data query model is constructed. Finally, the grid information integration algorithm of student dormitory is designed to realize the grid information integration of student dormitory. The platform test results show that the average response time of the design platform is less than 2.426 s, which meets the timeliness requirements of data integration management.

show abstract

Research on MapReduce Heuristic Multi Table Join Algorithm Based on Binary Optimization and Pancake Parallel Strategy

Cai

Jia

Yang

et al. 2023

ENG

View full text Add to dashboard Cite

Background: With the development of technology, the data amount has increased significantly. In data processing, multi table query is the most frequently operation. Because the join keys cannot correspond one by one, there will be much redundant data transmission, resulting in a waste of network bandwidth. Objective: In order to solve the problems of network overhead and low efficiency, this paper proposes a heuristic multi table join optimization method. By sharing information, the unconnected tuples are eliminated, so as to reduce the amount of data transmitting. This shortens response time and improves the execution performance. Method: Firstly, the join key information of one table is compressed by the algorithm to make the filtered information for sharing. Then, the concurrent execution is controlled according to the pancake parallel strategy. Finally, the selection strategy of multi table join order is proposed. Results/Discussion: The experiments show that the proposed algorithm can filter a large amount of useless data and improve query efficiency. At the same time, the proposed algorithm reduces a lot of network overhead, improves the algorithm performance, and better solves the problem of low efficiency of multi table join. Conclusion: This paper introduces the heuristic strategy to optimize the algorithm, so that it can perform the join tasks in parallel, which further improves the performance of multi table join. The algorithm creatively combines heuristic data filtering, which greatly improves the quality of data processing. The algorithm is worth popularizing and applying.

show abstract

Static and incremental dynamic approaches for multi-objective bitmap join indexes selection in data warehouses

Cited by 3 publications

References 33 publications

Queries Processing in Wireless Sensor Network

Queries Processing in Wireless Sensor Network

Grid Information Integration Platform of Student Dormitory Based on Edge Computing

Research on MapReduce Heuristic Multi Table Join Algorithm Based on Binary Optimization and Pancake Parallel Strategy

Contact Info

Product

Resources

About