Design and Implementation of a Main-memory Storage System for Real-time Retrievals

Main Memory storage system can increase the performance of the system by assigning enough slack time to real-time transactions. Due to its high response time of main memory devices, main memory resident data management systems have been used for location management of personal mobile clients to cope with urgent location related operations. In this paper we have developed a multi-threaded main memory storage system as a core component of real-time retrieval system to handle a huge amount of readers and writers of main memory resident data. The storage system is implemented as an embedded component which is working with the help of a disk resident database system. It uses multi-threaded executions and utilizes latches for its concurrency control rather than complex locking method. It only saves most recent data on main memory and data synchronization is done only when disk resident database asks for update transactions. The system controls the number of read threads and update threads to guarantee the minimum requirements of real-time retrievals.',ABE = 'Mobile clients like a PDA need a cache and a spatial index to search and access map data efficiently. When a server transmits spatial objects to a mobile client which has a low storage capacity, some of them can be duplicated in a cache of the mobile client. Moreover, the cost for strong added data in the cache and reconfiguring spatial index is very high in the mobile client with low computing power. The scheme for processing duplicated objects and disturbing tasks of the mobile client which has low computing power is needed. In this paper, we classify the method for storing duplicated objects and present the scheme for the both caching objects and reconfiguring a spatial index of cached objects using the clipping technique. We propose the caching system based on an agent in order to distribute the overhead of a mobile client as well as to provide efficiently map services. We design and implement it, and evaluate the performance.',PY = '2003-04-00',RF = '15',BN = '