Using Entwisted Linked-List to Index Memory-Resident Dynamic Data in e-Trade Engine

摘要

Data index, based on hash list or hierarchical tree, can't fit for the need of accessing dynamic data in large scale e-trading. Proposes an index method based upon entwisted and sorted bidirectional linked list assembled to a static framework. The framework created according to the intrinsic properties of dynamic business data and the entwisted linked list constructed in terms of both type attributes and sorting keys of these dynamic data. After created, the framework is no longer change. Index updating is only to add a new node to an entwisted list or just to adjust the pointers of a pair of list node. Most of data processing carried out by a business transaction is data finding, operations of searching and matching a specific key along one list of an entwisted linked list of data index. The method both simplifies the processing and improves the accessing of dynamic business data. Use it to organize orders and other dynamic data in trade engine ZCETF, both analysis and test result show that the manipulation of dynamic data is high efficiency.