AN EFFICIENT BIG DATA STORAGE STRUCTURE SUPPORTING FAST INDEXING
Trie tree provides efficient storage and indexing to handle string data.However,the data storage using Trie tree will lead to lower spatial efficiency when the String data is large.Therefore,an efficient big data storage structure supporting fast indexing,named as 16-bit Trie tree,is proposed.The structure used 16 bits to represent child nodes information,and mapping table was used to help quickly index to the specified child nodes,which made higher spatial efficiency for 16-bit Trie tree as processing big data.The results show that the 16-bit Trie tree retains the higher indexing speed of the traditional Trie tree and improves its space efficiency.Compared with the Red-black tree and the B+tree,the 16-bit Trie tree has the same insertion time and space consumption,but the index speed is about 2 times faster than the Red-black tree and B+tree.
String retrievalTrie treeString processing and indexFast retrieval
万方数据
维普
