An Algorithm Based on N-gram String Segmentation

Index,as an important part of data query system,has been one of the hot spots.Inverted index structure is popular for its fast speed and high efficiency.The B+ tree is a mature structure,which is often used on establishing indexes.In our paper,we present an algorithm to achieve inverted index by B+ tree structure.It combines the advantages of inverted index and the B+ tree,and has high query speed and efficiency.It will be widely used in data cloning and data query.