共查询到10条相似文献,搜索用时 125 毫秒
1.
数据仓库中的一种提高多表连接效率的有效方法 总被引:4,自引:0,他引:4
联机分析处理OLAP查询经常涉及多表连接,所以提高多表连接的性能就成了提高OLAP查询处理的关键性问题.针对目前直接提高多表连接效率的方法、并行多表连接算法和连接索引,提出了变形多表连接索引.该方法基于使用SQL语句表述的查询模型库QMB建立一系列符合条件的变形多表连接事实表,并建立这些变形多表连接事实表的索引.在特定的多表连接查询中,变形多表连接事实表能替代原事实表与各维表连接,并在查询处理过程中动态更新.理论分析和实验结果表明,该方法可以有效地提高多表连接的查询效率. 相似文献
2.
Donghua Yang 《Information Sciences》2007,177(17):3574-3591
Query processing in data grids is a difficult issue due to the heterogeneous, unpredictable and volatile behaviors of the grid resources. Applying join operations on remote relations in data grids is a unique and interesting problem. However, to the best of our knowledge, little is done to date on multi-join query processing in data grids. An approach for processing multi-join queries is proposed in this paper. Firstly, a relation-reduction algorithm for reducing the sizes of operand relations is presented in order to minimize data transmission cost among grid nodes. Then, a method for scheduling computer nodes in data grids is devised to parallel process multi-join queries. Thirdly, an innovative method is developed to efficiently execute join operations in a pipeline fashion. Finally, a complete algorithm for processing multi-join queries is given. Analytical and experimental results show the effectiveness and efficiency of the proposed approach. 相似文献
3.
分析了面向先进硬件平台上的数据库优化技术,提出了基于内存存储模型的多表连接查询处理优化技术,采用内存存储模型存储维表并对维表主键进行顺序化,从而使维表的主键与内存维表记录的内存偏移地址相一致,实现对维表记录的内存直接访问。通过列存储技术减少维表记录的访问宽度,进一步优化维表访问的cache性能。与基于SQL Server 2005的查询执行计划的连接算法、join index连接算法以及基于列存储模型的优化连接算法进行了实验比较和性能分析,结果表明:基于内存存储模型的多表连接算法在处理星型结构数据仓库多谓词、多连接的复杂查询时具有很好的性能,与join index相比不需要额外的空间开销,与列存储数据模型相比具有更好的兼容性和性能。 相似文献
4.
Ming-Syan Chen Hui-I Hsiao Philip S. Yu 《The VLDB Journal The International Journal on Very Large Data Bases》1997,6(2):121-131
In this paper, we explore an approach of interleaving a bushy execution tree with hash filters to improve the execution of
multi-join queries. Similar to semi-joins in distributed query processing, hash filters can be applied to eliminate non-matching
tuples from joining relations before the execution of a join, thus reducing the join cost. Note that hash filters built in
different execution stages of a bushy tree can have different costs and effects. The effect of hash filters is evaluat
ed first. Then, an efficient scheme to determine an effective sequence of hash filters for a bushy execution tree is developed,
where hash filters are built and applied based on the join sequence specified in the bushy tree so that not only is the reduction
effect optimized but also the cost associated is minimized. Various schemes using hash filters are implemented and evaluated
via simulation. It is experimentally shown that the application of hash filters is in general a very powerful means to improve
th
e execution of multi-join queries, and the improvement becomes more prominent as the number of relations in a query increases.
Edited by G. Gardarin. Received October 1994 / Accepted December 1995 相似文献
5.
6.
退火遗传算法的多连接查询应用 总被引:3,自引:0,他引:3
多连接查询的优化是数据库查询的关键问题之一,遗传算法与模拟退火算法的结合有利于全局最优解的搜索。提出了一种混合算法,并将其应用到多连接优化问题中,改进了获得最优查询计划的性能。 相似文献
7.
8.
Lin E.T. Omiecinski E.R. Yalamanchili S. 《Knowledge and Data Engineering, IEEE Transactions on》1994,6(2):304-315
Optimizing large join queries that consist of many joins has been recognized as NP-hard. Most of the previous work focuses on a uniprocessor environment. In a multiprocessor, the location of each join adds another dimension to the complexity of the problem. In this paper, we examine the feasibility of exploiting the inherent parallelism in optimizing large join queries on a hypercube multiprocessor. This includes using the multiprocessor not only to answer the large join query but also to optimize it. We propose an algorithm to estimate the cost of a parallel large join plan. Three heuristics are provided for generating an initial solution, which is further optimized by an iterative local-improvement method. The entire process of parallel query optimization and execution is simulated on an Intel iPSC/2 hypercube machine. Our experimental results show that the performance of each heuristic depends on the characteristics of the query 相似文献
9.
Optimization of parallel execution for multi-join queries 总被引:5,自引:0,他引:5
Ming-Syan Chen Yu P.S. Kun-Lung Wu 《Knowledge and Data Engineering, IEEE Transactions on》1996,8(3):416-428
We study the subject of exploiting interoperator parallelism to optimize the execution of multi-join queries. Specifically, we focus on two major issues: (1) scheduling the execution sequence of multiple joins within a query, and (2) determining the number of processors to be allocated for the execution of each join operation obtained in (1). For the first issue, we propose and evaluate by simulation several methods to determine the general join sequences, or bushy trees. Despite their simplicity, the heuristics proposed can lead to the general join sequences that significantly outperform the optimal sequential join sequence. The quality of the join sequences obtained by the proposed heuristics is shown to be fairly close to that of the optimal one. For the second issue, it is shown that the processor allocation for exploiting interoperator parallelism is subject to more constraints-such as execution dependency and system fragmentation-than those in the study of intraoperator parallelism for a single join. The concept of synchronous execution time is proposed to alleviate these constraints. Several heuristics to deal with the processor allocation, categorized by bottom-up and top-down approaches, are derived and are evaluated by simulation. The relationship between issues (1) and (2) is explored. Among all the schemes evaluated, the two-step approach proposed, which first applies the join sequence heuristic to build a bushy tree as if under a single processor system, and then, in light of the concept of synchronous execution time, allocates processors to execute each join in the bushy tree in a top-down manner, emerges as the best solution to minimize the query execution time 相似文献
10.
列的连接策略优化是列存储数据查询中的重要问题。现有的列存储系统中,列的连接存在策略单一,缺少优化处理,无法满足复杂查询等缺陷。针对这些问题,提出一种连接策略选择方法。该方法首先定义简单规则过滤代价过大的查询计划,生成候选查询计划树。进而根据动态Huffman树原理提出动态优化树算法,对候选查询计划树中的查询执行顺序进行改进。根据列存储数据的特点,候选计划中每个连接节点的执行策略被归纳为两种:串行连接和并行连接。在此基础上构建代价估计模型,集中针对这两种连接策略进行代价估计和策略选择,从而以较小的时间复杂度获得优化的查询执行策略。 相似文献