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: Flattening a relational database. A method includes accessing a first database table. A first entry value is identified in a first entry from the first database table. The first entry value represents a plurality of entry values of corresponding entries in a second database table. An array is created that includes one or more representations of the plurality of entry values. At least a portion of the first database table is converted to one or more hierarchical record documents, with columns of the first database table represented at a first hierarchical level and values in entries in the columns represented at a second hierarchical level below the first hierarchical level for a corresponding column. Converting the first database table to one or more hierarchical record documents includes substituting the array in a hierarchical record document for each entry in the plurality of entries having the first entry value.

Abstract: Data stores are combined into a composite data store. A method includes referencing a first index entry for a user specified first parameter pattern. The first index entry includes references to record addresses for records in the composite data store which include the first parameter pattern. A first beginning composite data store address of a first selected data store is referenced. A determination is made that the first beginning composite data store address is at or above an address at or above a predetermined threshold above the first record address. Based on determining that the first beginning composite data store address is at or above a predetermined threshold above the first record address, a speed-up data structure is used to eliminate one or more comparisons of record entries in the first index entry between the first record address and the first beginning composite data store address.

Abstract: Indexing data items into an index. A method includes identifying a parameter pattern for a data item stored in a data store record of a data store. The data store record has a data store location identifier. The method further includes identifying a hash of the parameter pattern. The data store location identifier is correlated to at least a portion of the hash in the index. The index includes index entries where each index entry includes at least a portion of a hash and one or more references to data store records by reference to data store location identifiers.

Abstract: Flattening a relational database. A method includes accessing a first database table. A first entry value is identified in a first entry from the first database table. The first entry value represents a plurality of entry values of corresponding entries in a second database table. An array is created that includes one or more representations of the plurality of entry values. At least a portion of the first database table is converted to one or more hierarchical record documents, with columns of the first database table represented at a first hierarchical level and values in entries in the columns represented at a second hierarchical level below the first hierarchical level for a corresponding column. Converting the first database table to one or more hierarchical record documents includes substituting the array in a hierarchical record document for each entry in the plurality of entries having the first entry value.

Abstract: Hyperspace index data structure. A data structure indexes identifiers corresponding to parameter patterns. The presence of an identifier in the data structure indicates that the corresponding parameter pattern may be present in a set of parameter patterns, while absence of the indicator can be used to indicate that the corresponding parameter pattern is not present. The data structure includes a first field which includes binary bits or groups of small parameter pattern keyed records. Each binary bit or parameter pattern keyed record corresponds to an identifier corresponding to a parameter pattern. If the bit or record corresponding to the identifier is set or present, the identifier is included in the first field. One or more additional fields are hierarchically below the first data field. Each of the additional fields includes identifiers for a subset of information in the first field.

Abstract: A data structure indexes identifiers corresponding to parameter patterns. The presence of an identifier in the data structure indicates that the corresponding parameter pattern may be present in a set of parameter patterns, while absence of the indicator can be used to indicate that the corresponding parameter pattern is not present. The data structure includes a first field which includes small parameter pattern records. Each parameter pattern record corresponds to an identifier corresponding to a parameter pattern. If the record corresponding to the identifier is set or present, the identifier is included in the first field. One or more additional fields are hierarchically below the first field. Each of the additional fields includes identifiers for a subset of information in the first field. The absence of an identifier corresponding to a parameter pattern at any level in all of the hierarchical threads indicates that the parameter pattern is not present.

Abstract: A pattern index can be created and used to searching for desired content in electronic databases. The pattern index can include a tuple pattern index containing separately identifiable and indexed tuple entries that are based on combinations of words within the electronic documents. The pattern index and other indexes can also be used in an incrementally graduating search to inherently apply order and priority to the search. Suggested terms and alternate terms, which are different than those that are provided by the user as part of a search request, can also be considered as part of the search and can be provided to the user for selection during the search to dynamically alter the scope of the search and to provide auto-complete functionality.

Abstract: Compressing and decompressing compressed index lists. One or more index lists include at least a portion of the list that is compressed. A method includes reading an entry from a list. The method further includes determining that the entry indicates the start of a compressed block of the list. The compressed block is compressed using a compression algorithm including a plurality of delta pointers. Each of the delta pointers point to data store entries by reference to a difference from a reference in a previous entry in the list. An entry size indicator is referenced. The entry size indicator is configured to indicate a memory storage size for a delta pointer, and the entry size indicator supports indications for all of fixed storage sizes, variable storage sizes, and run length encoding. The compressed block of the list is decompressed according to the entry size indicator.

Abstract: Data stores may be combined into a composite data store. A method includes referencing a first index entry for a user specified first parameter pattern. The first index entry includes references to record addresses for records in the composite data store which include the first parameter pattern. A first beginning composite data store address of a first selected data store is referenced. A determination is made that the first beginning composite data store address is at or above an address at or above a predetermined threshold above the first record address. Based on determining that the first beginning composite data store address is at or above a predetermined threshold above the first record address, a speed-up data structure is used to eliminate one or more comparisons of record entries in the first index entry between the first record address and the first beginning composite data store address.

Abstract: Data stores combined into a composite data store. A method includes referencing a first index entry for a user specified first parameter pattern. The first index entry includes references to record addresses for records in the composite data store which include the first parameter pattern. A first beginning composite data store address of a first selected data store is referenced. A determination is made that the first beginning composite data store address is at or above an address at or above a predetermined threshold above the first record address. Based on determining that the first beginning composite data store address is at or above a predetermined threshold above the first record address, a speed-up data structure is used to eliminate one or more comparisons of record entries in the first index entry between the first record address and the first beginning composite data store address.

Abstract: Determining intersection points of parameter patterns. Parameter patterns are specified in a query. A method includes identifying a first parameter pattern from the query as occurring less often in the index than one other parameter pattern in the query. The data store is searched until a present location of the data store has been identified as including the first parameter pattern. Then the data store is searched for a location of another parameter pattern. If the present location is identified as including the another parameter pattern, then an indication is provided identifying an intersection. Otherwise, the method includes continuing searching remaining portions of the data store to find a location of the another parameter pattern at a new present location. At least one of the acts of searching above includes eliminating at least a portion of records of the data store from searching without being searched prior to being eliminated.

Abstract: Searching a data store for parameter patterns specified in a query. A method includes receiving a query from a user including N parameter patterns. One or more alternatives are associated to one or more of the N parameter patterns. One or more templates are created. Each of the templates describes a number of microsearches. Each of the microsearches includes one or more of the N parameter patterns or the alternatives. Microsearches described by at least one of the one or more templates are enumerated. One or more sub-microsearches are performed by searching for parameter patterns and/or alternatives. Each sub-microsearch may have less than all terms needed for a full microsearch. Based on the results of the one or more sub-microsearches, one or more microsearches are eliminated from searching. The data store is searched using one or more of the remaining microsearches.

Abstract: Abbreviated index of parameter patterns. An abbreviated index includes indicators that a parameter pattern may be in a set of parameter patterns. To create the abbreviated index, indicators for overlapping parameter patterns of a given parameter pattern are placed in the index. Different patterns may have the same indicator, so the abbreviated index does not necessarily give an absolute indication of the presence of a parameter pattern in the set of parameter patterns, but rather may give an indication of the possible inclusion of a parameter pattern. The use of indicators for overlapping patterns can be used to increase confidence as to the existence of a given parameter pattern in the set of parameter patterns. The absence of an indicator for a parameter pattern or an overlapping parameter pattern will indicate with certainty that the parameter pattern is not present in the set of parameter patterns.

Abstract: Compressing and decompressing compressed index lists. One or more index lists include at least a portion of the list that is compressed. A method includes reading an entry from a list. The method further includes determining that the entry indicates the start of a compressed block of the list. The compressed block is compressed using a compression algorithm including a plurality of delta pointers. Each of the delta pointers point to data store entries by reference to a difference from a reference in a previous entry in the list. An entry size indicator is referenced. The entry size indicator is configured to indicate a memory storage size for a delta pointer, and the entry size indicator supports indications for all of fixed storage sizes, variable storage sizes, and run length encoding. The compressed block of the list is decompressed according to the entry size indicator.

Abstract: Searching a data store for parameter patterns specified in a query. A method includes receiving a query from a user including N parameter patterns. One or more alternatives are associated to one or more of the N parameter patterns. One or more templates are created. Each of the templates describes a number of microsearches. Each of the microsearches includes one or more of the N parameter patterns or the alternatives. Microsearches described by at least one of the one or more templates are enumerated. One or more sub-microsearches are performed by searching for parameter patterns and/or alternatives. Each sub-microsearch may have less than all terms needed for a full microsearch. Based on the results of the one or more sub-microsearches, one or more microsearches are eliminated from searching. The data store is searched using one or more of the remaining microsearches.

Abstract: Data stores may be combined into a composite data store. A method includes referencing a first index entry for a user specified first parameter pattern. The first index entry includes references to record addresses for records in the composite data store which include the first parameter pattern. A first beginning composite data store address of a first selected data store is referenced. A determination is made that the first beginning composite data store address is at or above an address at or above a predetermined threshold above the first record address. Based on determining that the first beginning composite data store address is at or above a predetermined threshold above the first record address, a speed-up data structure is used to eliminate one or more comparisons of record entries in the first index entry between the first record address and the first beginning composite data store address.

Abstract: Determining intersection points of parameter patterns. Parameter patterns are specified in a query. A method includes identifying a first parameter pattern from the query as occurring less often in the index than one other parameter pattern in the query. The data store is searched until a present location of the data store has been identified as including the first parameter pattern. Then the data store is searched for a location of another parameter pattern. If the present location is identified as including the another parameter pattern, then an indication is provided identifying an intersection. Otherwise, the method includes continuing searching remaining portions of the data store to find a location of the another parameter pattern at a new present location. At least one of the acts of searching above includes eliminating at least a portion of records of the data store from searching without being searched prior to being eliminated.

Abstract: Abbreviated index of parameter patterns. An abbreviated index includes indicators that a parameter pattern may be in a set of parameter patterns. To create the abbreviated index, indicators for overlapping parameter patterns of a given parameter pattern are placed in the index. Different patterns may have the same indicator, so the abbreviated index does not necessarily give an absolute indication of the presence of a parameter pattern in the set of parameter patterns, but rather may give an indication of the possible inclusion of a parameter pattern. The use of indicators for overlapping patterns can be used to increase confidence as to the existence of a given parameter pattern in the set of parameter patterns. The absence of an indicator for a parameter pattern or an overlapping parameter pattern will indicate with certainty that the parameter pattern is not present in the set of parameter patterns.

Abstract: Indexing data items into an index. A method includes identifying a parameter pattern for a data item stored in a data store record of a data store. The data store record has a data store location identifier. The method further includes identifying a hash of the parameter pattern. The data store location identifier is correlated to at least a portion of the hash in the index. The index includes index entries where each index entry includes at least a portion of a hash and one or more references to data store records by reference to data store location identifiers.