一种基于Radix树的数据库前端缓存  

A Radix tree based database front-end cache system

作　　者：熊慕舟[1] 

机构地区：[1]中国地质大学(武汉)计算机学院,湖北武汉430074

出　　处：《华中科技大学学报（自然科学版）》2013年第S2期205-208,共4页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家自然科学基金资助项目(61103145);中央高校基本科研业务费专项资金资助项目(CUG120409)

摘　　要：提出了一种基于Radix树的前端缓存系统,用以实现基于NoSQL概念下的数据库前端缓存系统.该系统采用C/S模式供客户端通过网络调用缓存系统实现数据访问.在服务端利用Radix树实现缓存数据的存储结构,并以Radix树遍历算法为基础实现了数据添加、数据删除、数据查找、数据查询等操作接口.在此基础上实现了包括主进程、协议处理、事件驱动等模块,用以在Linux环境下构建完整的缓存系统;客户端则基于定义的协议通过网络与服务端通信达到数据读写操作的目的.通过与Memcached系统在相同试验环境中的实验结果进行比较,表明该系统能够有效地降低数据读操作的时间开销,并能减少对系统内存的占用.The paper proposes a Radix-tree based front end cache system for database system in order to implement the so-called NoSQL front end cache system.It applies C/S mode for client to access the cache system to implement data operations.At the server side,it adopts Radix-tree as the data structure for data storage for cached data.Based on the data transverse algorithm for Radix tree,system implements data read/write operations,including data insert,delete,search and query.It also provides a set of modules to implement front-end cache system in Linux environments,including main thread process,protocol process,event driven module.Client communicates with the server via network through predefined protocols,in order to obtain data operations cached in server.The paper conducts side-by-side experiments compared with Memcached system in the same experiment environments.The experiment results indicate that the proposed system significantly reduces the cost of data read operation,as well as the size of memory allocation.

关 键 词：数据库系统 客户端服务器模式计算机系统 计算机网络 前端缓存 Radix树 数据操作 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]