Abstract: Searching for data contained in a structured data structure. A method includes receiving a query. The query includes a structured data structure path and a first element related to the structured data structure path. One or more patterns are created comprising at least a portion of the structured data structure path and one or more elements related to the first element. For each of the one or more patterns, a hash is created. The created hashes are looked-up in a hash index to identity one or more structured data structures correlated to the hashes. The one or more structured data structures are identified to a user.

Abstract: A method includes searching for data contained in a structured data structure. The method includes receiving a query. The query includes a structured data structure path and a first element related to the structured data structure path. One or more patterns are created comprising at least a portion of the structured data structure path and one or more elements related to the first element. For each of the one or more patterns, a hash is created. The created hashes are looked-up in a hash index to identify one or more structured data structures correlated to the hashes. The one or more structured data structures are identified to a user.

Abstract: Searching for data contained in a structured data structure. A method includes receiving a query. The query includes a structured data structure path and a first element related to the structured data structure path. One or more patterns are created comprising at least a portion of the structured data structure path and one or more elements related to the first element. For each of the one or more patterns, a hash is created. The created hashes are looked-up in a hash index to identity one or more structured data structures correlated to the hashes. The one or more structured data structures are identified to a user.

Abstract: A search decision table comprises a plurality of references to indexes, such as full text indexes, where each index corresponds to one or more informational resources. The search decision table has a plurality of references to ranges of text, wherein each range of text is bound by a lower text limit and an upper text limit. Preferably, the references to ranges of text are arranged in the matrix sequentially in alphanumeric order, and each reference to a range of text comprises the lower text limit. A plurality of cross-referencing data in the matrix correlate the references to the ranges of text and the references to the indexes, wherein each of the cross-referencing data correspond to a reference to a range of text and to a reference to an index. Preferably, the matrix includes attribute data and/or index data for each reference to range of text. Other embodiments of search decision tables are also disclosed, as well different uses for the search decision table.

Abstract: Methods of hierarchically parsing and indexing text are provided. A source text is parsed to identify first level text entities and lower level text entities wherein the lower level text entities are subsets of their parent text entities. First level text entities are assigned a first level value corresponding to their locations within the source text, and lower level text entities are assigned lower level values, subordinate to their corresponding parent level value. Multiple levels of text entity parsing and numbering may take place. The association of linguistically derived variants of the text entities with their locations takes place.

Abstract: A computer system and method for information indexing and retrieval. The full text index can searchably accommodate linguistic, phonetic, conceptual, contextual and other types of relational and descriptive information. The full text index is created in two phases. In the first phase, a word list symbol table, an alphabetically ordered list and a non-repeating word number stream are constructed from the source text. In the second phase, a word number access array and in-memory full text index are constructed and then index data is merged into the final index.