Perfect Search Corporation Patent applications |
Patent application number | Title | Published |
20120096008 | HYPERSPACE INDEX - 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. | 04-19-2012 |
20110167072 | INDEXING AND FILTERING USING COMPOSITE DATA STORES - 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. | 07-07-2011 |
20090319549 | INDEX COMPRESSION - 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. | 12-24-2009 |
20090064042 | INDEXING AND FILTERING USING COMPOSITE DATA STORES - 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. | 03-05-2009 |
20090063479 | SEARCH TEMPLATES - 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. | 03-05-2009 |
20090063454 | VORTEX SEARCHING - 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. | 03-05-2009 |