Patent ID: 8572126
Filing Date: 2013-10-29
Classification: G06F

Abstract:
1. A computer memory storing a data structure representing a ternary search tree for word n-grams for a corpus of documents, the data structure comprising: a plurality of records, each record representing a node of a ternary search tree and each record comprising a plurality of fields, the ternary search tree representing multiple word n-grams, at least some of said word n-grams comprising a sequence of units, the plurality of records being stored at said computer memory; wherein the plurality of fields of a record for each node including a given node includes: wherein the plural child fields store one of a null value indicating the absence of an associated child node or an identifier identifying a memory location of the respective child node; wherein, for at least one record of said data structure, at least one of said plural child fields stores an identifier identifying a memory location of another computer memory different than said computer memory; and wherein the ternary tree is configured to be searched by comparing units of a query to nodes of the ternary tree, wherein a current unit of the query is compared to the payload information of a current node of the ternary tree, and wherein i) if the current unit of the query matches the payload information, then selecting the equal-child node as the current node; ii) if the current unit of the query is less than the payload information, then selecting the lo-child node as the current node; and iii) if the current unit of the query is greater than the payload information, then selecting the hi-child node as the current node.