The Research of Embedded Database Hybrid Indexing Mechanism Based on Dynamic Hashing

For the sake of improving the retrieval and insertion efficiency of embedded database when dealing with large-scale data, this paper was proposed a hybrid indexing structure based on dynamic hashing and designed a hybrid indexing mechanism combined with the characteristic of extendible hashing, linear hashing and red black tree. After retrieving and inserting large amounts of data, the results show that this hybrid indexing mechanism can make the time complexity of embedded database retrieval and update operation almost to be O(1). At last, the hybrid index mechanism provides for embedded database with real-time index insertion and record querying.