面向交易实时数据库内存数据的组织方法

研究面向大规模电子交易实时数据库中密集内存数据的高效组织方法.采用线性存储池实现内存数据的物理存储组织,并根据交易事务更新内存数据的update-in-place和append-only特点,采用T树索引实现元组固定数据的逻辑组织,采用缠绕的双向链式索引实现动态数据的逻辑组织.简化了物理空间的分配和调整算法,提高了数据更新和索引重构的效率,降低了内存数据查询访问的时间复杂度.结果表明,基于T-树索引和链式索引的数据查询算法的时间复杂度分别控制在O(lnN)和O(ln(N 1)-1),满足大规模电子交易的需要.

Memory Data Manipulation Method in Trade-Oriented Real-Time Database

The effective manipulation methods of massive memory data in large scale e-trading oriented real-time database are studied, using linear pool to organize the memory data for physical storage, based on the update-in-place and append-only characteristics of trade transaction updating memory data. T-tree index is used for the logical manipulation of record-number-fixed data and entangled bidirectional linked-list index is adapted for the logical manipulation of dynamic data. The algorithm of physical memory allocation and buffer adjustment is simplified. The efficiency of data updating and index reconstruction is increased and the time complexity of memory data querying and accessing reduced. The results show that the time complexities of the two query methods, based on T-tree index and linked-list index, are not more than O(lnN) and O(ln(N 1)-1) respectively, and they fit for the need of large scale e-trading.