Suffix Tree
In computer science, a suffix tree (also called suffix trie, PAT tree or, in an earlier form, position tree) is a data structure that presents the suffixes of a given string in a way that allows for a particularly fast implementation of many important string operations.
 Compound term processing
Compound terms are built by combining two (or more) simple terms, for example "triple" is a single word term but "triple heart bypass" is a compound term.
 bplusdotnet
A B+tree implementation for C#, java, and Python
Seach Index
Inverted index
 Forward Index
The forward index stores a list of words for each document.
http://en.wikipedia.org/wiki/Inverted_index

In information technology, an inverted index (also referred to as postings file or inverted file) is an index data structure storing a mapping from content, such as words or numbers, to its locations in a database file, or in a document or a set of documents, in this case allowing full text search.

/livcos.org/data/map/brainstorm/DataSearch