Now a day, it is very common to see that complex queriesare being vastly used in the real time database applications.These complex queries often have a lot of common subexpressions,either within a single query or across multiplesuch queries run as a batch. Multi-query optimization aimsat ...
Selecting views to materialize is one of the most important decisions in designing a data warehouse. Decision support systems usually use complex queries in large databases. Because response time should be short, therefore query optimization is very important. In this paper, we present four advances...
Dynamic Query Optimization Approach for Semantic Database Grid Fundamentally, semantic grid database is about bringing globally distributed databases together in order to coordinate resource sharing and problem solving... XQ Zheng,HJ Chen,ZH Wu,... - 《计算机科学技术学报(英文版)》 被引量: 28发表...
A heuristic-based algorithm is defined as an approach used to find solutions to complex problems by providing near-optimal solutions in a faster and more efficient way compared to traditional methods. AI generated definition based on: Engineering Science and Technology, an International Journal, 2019...
a详细分析了查询优化时采用的启发式算法和最优查询树的类型,并给出了四表连接查询的详细优化过程。 When multianalysis inquiry optimization uses the heuristic algorithm and the most superior inquiry tree's type, and has given four table connection inquiry detailed optimized process. [translate] ...
Cloud load balancing algorithm is proposed using dynamic annexed balance method to improve the QoS parameters like execution cost, time, throughput, task deployment etc. in cloud environment (Chenet al., 2017). A novel approach to balance the workload among the VMs has been proposed by M. ...
Since the simple genetic algorithm (GA) is an instance of random heuristic search, a corollary is a result concerning GAs and time to convergence. 关键词: Convergence ntttgenetic algorithm ntttrandom heuristic approach nttttime to convergence DOI: 10.1162/evco.1996.4.4.395 被引量: 5 年份:...
Alternatively, they are solved using heuristics algorithms, which provide a sub-optimal solution that, hopefully, is arbitrarily close to the optimal. Such problems are found in a wide range of applications, including artificial intelligence, game theory, graph partitioning, database query optimization...
In particular, the generation of 1 basepair permutations of the query may benefit from further optimization and from another MapReduce step. In addition, higher throughput would be achieved with the recruitment of more computational nodes in the cluster. This approach would also be applicable to ...
(many of which have been successful) without investigating the fundamental nature of the low level heuristics and in particular subsequence selection. Finally, it is encouraging to see that an offline approach to heuristic selection is able to outperform an online approach. Although the improvement ...