Title :
Concurrent storage structure conversion: from B+ tree to linear hash file
Author :
Omiecinski, Edward
Author_Institution :
Sch. of Inf. & Comput. Sci., Georgia Inst. of Technol., Atlanta, GA, USA
Abstract :
Shows that the efficient reorganization of a B+ tree file into a linear hash file can be done concurrently with user transaction processing. This conversion is motivated by a change in database processing, in which efficient sequential and direct access were originally needed, but now only efficient direct access is needed. This is quite reasonable for a database system which accommodates new and changing applications. Several existing database systems, e.g. INGRES, IMS and IDMS allow this type of reorganization, but the reorganization is performed offline. The author devises an algorithm which performs the conversion and presents an analytic model of the conversion process. The author uses a typical database simulation model to evaluate the reorganization scheme. The results from the analytic model are within 3% (on the average) of the observed simulation results
Keywords :
database management systems; file organisation; simulation; B+ tree; IDMS; IMS; INGRES; concurrent storage structure conversion; database processing; database simulation model; direct access; file reorganization; linear hash file; sequential access; user transaction processing; Algorithm design and analysis; Analytical models; Computer science; Contracts; Database systems; Indexes; Performance analysis; Relational databases; Transaction databases;
Conference_Titel :
Data Engineering, 1988. Proceedings. Fourth International Conference on
Conference_Location :
Los Angeles, CA
Print_ISBN :
0-8186-0827-7
DOI :
10.1109/ICDE.1988.105507