首页 | 本学科首页   官方微博 | 高级检索  
     

查找、插入及删除时间为O(1)的方法研究
引用本文:宫团基,夏克俭. 查找、插入及删除时间为O(1)的方法研究[J]. 计算机工程与设计, 2010, 31(9)
作者姓名:宫团基  夏克俭
作者单位:北京科技大学,信息工程学院,北京,100083
摘    要:提出一种查找、插入及删除对象时间为O(1)的方法,以双向链表存储数据对象,通过地址指针方式获取对象.即客户端与服务器进行数据的交互时,传输中包含对象在服务器的地址指针值,服务器根据地址指针值,直接获取对象信息的方式.同时提出了计算指针值的校验和的算法,解决验证地址的有效性问题和安全问题,及提出了细粒度锁对象方式解决并发访问的问题.

关 键 词:地址指针  数据帧传输协议(SCMP)  映射  双向链表  校验和

Study of operation of insertion, search and deletion in O(1) time
GONG Tuan-ji,XIA Ke-jian. Study of operation of insertion, search and deletion in O(1) time[J]. Computer Engineering and Design, 2010, 31(9)
Authors:GONG Tuan-ji  XIA Ke-jian
Affiliation:GONG Tuan-ji,XIA Ke-jian (School of Information Engineering,University of Science , Technology Beijing,Beijing 100083,China)
Abstract:A novel method of operation of insertion, search and deletion in O (1) time , which employs double-list to contain objects and obtains object by converting address pointer to object pointer, is proposed. In the course of interactive between client and server, data frame consists of the address value which server allocates for object. Server receives data frame and extracts address value, computer checksum and convert to object pointer. In order to assure the address which is a valid address and the object t...
Keywords:address pointer  SCMP  MAP  double-list  checksum
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号