Title :
Research on data storage and index of EMMDB
Author :
Song Ling ; Ma Lan ; Xu Bai
Author_Institution :
Sch. of Comput. & Electron. Inf., Guangxi Univ., Nanning, China
Abstract :
This paper proposes the EHAS and the PMCT-tree algorithms as more efficient ones on data organization and index of Embedded Main-Memory Database (EMMDB). Based on area-segment method, the EHAS is a storage algorithm combined with quasi-extendible hashing. It locates and stores records with corresponding unique triples, each of which consists of an area sign, a segment sign and a storage address sign. Compared with the traditional T-tree, a Priority Match Catalog (PMC) is added to the PMCT-tree. And the PMC is mainly composed of some edges thresholds, which are extracted from T-tree nodes. Experimental results have indicated that the EHAS algorithm accelerates storage response time and its average querying time complexity can reach a constant level under certain conditions. Besides, the PMCT-tree algorithm is efficient and effective in querying response time.
Keywords :
data structures; database management systems; EHAS algorithm; EMMDB index; PMCT-tree algorithm; T-tree nodes; data organization; data storage algorithm; embedded main memory database; priority match catalog; quasi-extendible hashing; querying response time; querying time complexity; storage response time; Aerospace electronics; Algorithm design and analysis; Complexity theory; Embedded system; Indexes; Time factors; EMMDB; T-tree; area-segment method; index; quasi-extendible hashing;
Conference_Titel :
Computer Science and Education (ICCSE), 2010 5th International Conference on
Conference_Location :
Hefei
Print_ISBN :
978-1-4244-6002-1
DOI :
10.1109/ICCSE.2010.5593816