Optimizing Large Query by Simulated Annealing Algorithm Based On Graph-Based Approach

Abstract

<p class="Abstract">In general the ordering of join-operations is quite sensitive and has a devastatingly negative effect on the efficiency of the DBMS.&nbsp; Scheufele and Moerkotte proved that join-ordering is NP-complete in the general case [1]. The dynamic programming algorithm has a worst case running time, thus for queries with more than 10 joins, it becomes infeasible. To resolve this problem, random strategies are used. &nbsp;Simulated annealing is an intelligent algorithm of developing very fast. In this paper, we introduce the traditional simulated annealing algorithm through discussing its theory and process, analyzes its shortcoming in detail, simple describe influence of key parameters to simulated annealing algorithm and provided feasible improvement. Especially, in order to avoid the deficiency resulted by the neighbors of state, and make the query optimization support complex non-inner join, the improved algorithm gives a semantics expression of query and a method of constructing the connected join pairs. Experimental results show that the improved algorithm outperforms the original algorithm in terms of both output quality and running time.</p

Join query optimization in the distributed database system using an artificial bee colony algorithm and genetic operators

“…A Simulated Annealing Based On Graph-Based Approach was proposed for Optimizing Large Query by Chen et al 37 This method is a probabilistic algorithm, suitable for optimization problems that involve large solution spaces. Each solution shows a state in the search space, and each state has an associated cost.…”

“…Each state represents a various algebraic expression for the query answer. The cost of the state is the total cost of the operation in 37 Proposing a random-search •Low cost •Dependent on the technique which exploits an •Better quality query cost function and the analogy between the way in •Avoiding getting neighbor function which a metal cools and stuck at the local used in it freezes into a minimum minimal •Deficiency resulted by energy crystalline structure the transformation of the and the search for a state minimum in a more…”

Network Security Risk Assessment Based on Attack Graph

“…In this paper, we adopt attack graph to assess the overall security risk of networks. With the help of attack graphs, most of potential attack path from an attacker can be calculated [10]. Generally, the attack graph model is composed of three consecutive phases: information collecting, attack graph building and analyzing & visualizing.…”

Evaluation of computer network security using attack undirected geography

“…Attack graph algorithm is used to collect security information dynamically. The graph to assess the overall risk of any networks can be computed [4]. Attack route, risk index, and hostname are attained in order to quantify risk assessment at a particular 1509 network node.…”