Research on Data Organization and Index of EMMDB
Ma Lan · Jisuanji kexue yu tansuo · 2010
This paper proposes the EHAS(quasi-extendible hashing area-segment) and the PMCT-tree algorithms,which are more efficient ones on data organization and index of embedded main-memory database(EMMDB).The EHAS is a storage algorithm which combines quasi-extendible hashing and is based on area-segment method.It locates and stores records with corresponding unique triples,each of which has three parts separately as an area sign,a segment sign and a storage address sign.The PMCT-tree has a priority match catalog(PMC) more than typical T-tree.The PMC is composed of some edges thresholds,which are extracted from T-tree nodes.Experimental results indicate that the EHAS algorithm accelerates storage response time and its average querying time complexity can reach a constant level under certain conditions;and the PMCT-tree algorithm is good on effectiveness and querying response time.