Multi-join query optimization in bucket-based encrypted databases using an enhanced ant colony optimization algorithm

被引:0
作者
Mahmoud Jafarinejad
Morteza Amini
机构
[1] Sharif University of Technology,Department of Computer Engineering
来源
Distributed and Parallel Databases | 2018年 / 36卷
关键词
Query optimization; Multi-join queries; Encrypted database; Bucket-based encryption; Ant colony optimization;
D O I
暂无
中图分类号
学科分类号
摘要
One of the organizations’ main concerns is to protect sensitive data in database systems, especially the ones outsourced to untrusted service providers. An effective solution for this issue is to employ database encryption methods. Among different encryption approaches, Bucket-based method has the advantage of balancing security and performance of database operations. However, generating false-positive results in executing queries is the main drawback of this method. On the other hand, multi-join queries are one of the most critical operations executed on these stored sensitive data. Hence, acceptable processing and response time in executing multi-join queries is required. In this paper, we propose an enhanced ant-colony algorithm (named BACO) which aims to reduce the required processing efforts in multi-join query optimization problem alongside with reducing the total false-positive results generated in Bucket-based encrypted databases. Our enhanced solution approach leads to much less response time without losing solutions’ quality. Experimental results denote that our proposed solution can yield 75% decrease in multi-join queries processing efforts and 74% decrease in the total amount of false-positive results in a faster manner and with better performance than previous methods.
引用
收藏
页码:399 / 441
页数:42
相关论文
共 22 条
[1]  
Bellman R(1962)Dynamic programming treatment of the travelling salesman problem J. ACM (JACM) 9 61-63
[2]  
Ding W(2012)Database multi-joint query optimization based on generic-tabu algorithm J. Converg. Inf. Technol. (JCIT) 7 263-270
[3]  
Lv X(1997)Ant colony system: a cooperative learning approach to the traveling salesman problem IEEE Trans. Evol. Comput. 1 53-66
[4]  
Dorigo M(2014)A multi-colony ant algorithm for optimizing join queries in distributed database systems Knowl. Inf. Syst. 39 175-206
[5]  
Gambardella LM(2014)Query join ordering optimization with evolutionary multi-agent systems Exp. Syst. Appl. 41 6934-6944
[6]  
Golshanara L(1995)Efficient optimization of large join queries using tabu search Inf. Sci. 83 77-88
[7]  
Rankoohi SMTR(1997)Heuristic and randomized optimization for the join ordering problem VLDB J. Int. J. Very Large Data Bases 6 191-208
[8]  
Shah-Hosseini H(2000)MAX-MIN ant system Future Gener. Comput. Syst. 16 889-914
[9]  
Gonçalves FACA(1996)Rapid bushy join-order optimization with cartesian products ACM SIGMOD Record ACM 25 35-46
[10]  
Guimarães FG(1976)Decomposition—a strategy for query processing ACM Trans. Database Syst. (TODS) 1 223-241