一种由B+树实现的倒排索引

An Algorithm Based on N-gram String Segmentation

索引作为整个数据检索系统的重要组成部分,一直是人们研究的热点。倒排索引结构以其快的查询速度、高的查询效率得到青睐。而B+树作为一种成熟的数据结构,是创建索引的首选。该文提出了一种由B+树实现的倒排索引结构,结合了B+树与倒排索引的优点,查询速度快、效率高,在数据挖掘以及数据查询等方面应用广泛。

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.