• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Xian Hequn and Feng Dengguo. A Query Rewriting Algorithm Supporting Attribute Grain Database Encryption[J]. Journal of Computer Research and Development, 2008, 45(8): 1307-1314.
Citation: Xian Hequn and Feng Dengguo. A Query Rewriting Algorithm Supporting Attribute Grain Database Encryption[J]. Journal of Computer Research and Development, 2008, 45(8): 1307-1314.

A Query Rewriting Algorithm Supporting Attribute Grain Database Encryption

More Information
  • Published Date: August 14, 2008
  • Query processing over encrypted database is one of the key issues to the DAS (database as a service) modal encryption. Due to the unique trust modal and system structure of the DAS modal, data encryption and decryption can only be carried out at the client site. The server is not trusted and sensitive data should be protected from potentially malicious database administrators. Current studies employ query rewriting techniques based on tuple level encryption, which are inefficient in encryption operations. They may waste a great deal of computational power on encrypting data that are not secret, especially when only one or a few attributes in a relation need to be protected. In this paper, a query rewriting algorithm is proposed, which supports attribute grain database encryption in the DAS model. The algorithm rewrites user queries according to relational algebra formulas, and it discriminates those encryption involving predicates from the others that do not use encrypted attributes. New queries are reconstructed and executed respectively on the client and the server so that optimization can be achieved. The algorithm is capable of processing correlated subquery with any depth in a recursive manner. Experiments show that the algorithm can reduce the network traffic caused by temporary query result transferring and shorten the query execution time effectively.
  • Related Articles

    [1]Zhang Weijuan, Bai Lu, Ling Yuqing, Lan Xiao, Jia Xiaoqi. Cache Side-Channel Attacks and Defenses[J]. Journal of Computer Research and Development, 2023, 60(1): 206-222. DOI: 10.7544/issn1000-1239.202110774
    [2]Li Li, Liu Huanyu, Lu Laifeng. Probabilistic Caching Content Placement Method Based on Content-Centrality[J]. Journal of Computer Research and Development, 2020, 57(12): 2648-2661. DOI: 10.7544/issn1000-1239.2020.20190704
    [3]Li Chu, Feng Dan, Wang Fang. A High Performance and Reliable Hybrid Host Cache System[J]. Journal of Computer Research and Development, 2017, 54(11): 2497-2507. DOI: 10.7544/issn1000-1239.2017.20160793
    [4]Wang Yanshi, Wang Wei, Liu Zhaohui, Wei Jun, Huang Tao. A Mechanism for Transparent Data Caching[J]. Journal of Computer Research and Development, 2015, 52(4): 907-917. DOI: 10.7544/issn1000-1239.2015.20131910
    [5]Yao Yingbiao, Shen Zuobing. An Improved DFTL Algorithm Based on Sequential Cache and Second Level Cache[J]. Journal of Computer Research and Development, 2014, 51(9): 2012-2021. DOI: 10.7544/issn1000-1239.2014.20130660
    [6]Su Wen, Zhang Longbing, Gao Xiang, Su Menghao. A Cache Locking and Direct Cache Access Based Network Processing Optimization Method[J]. Journal of Computer Research and Development, 2014, 51(3): 681-690.
    [7]Zhu Guosheng, Yu Shaohua, Xu Ning. Research on IP Routing Cache Technologies[J]. Journal of Computer Research and Development, 2012, 49(4): 710-716.
    [8]Cai Jianyu, Wu Quanyuan, Jia Yan, and Zou Peng. Research on Aggregate Query Matching in Semantic Cache[J]. Journal of Computer Research and Development, 2006, 43(12): 2124-2130.
    [9]Liu Wei, ChunTung Chou, Cheng Wenqing, Du Xu. Proxy Caching for Interactive Streaming Media[J]. Journal of Computer Research and Development, 2006, 43(4): 594-600.
    [10]Zhang Jianyu, Wei Tao, and Zou Wei. A Packet Classification Algorithm Based on Self-Adaptive Cache[J]. Journal of Computer Research and Development, 2006, 43(2): 196-203.

Catalog

    Article views (722) PDF downloads (678) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return