×

Vortex searching

  • US 7,774,347 B2
  • Filed: 08/30/2007
  • Issued: 08/10/2010
  • Est. Priority Date: 08/30/2007
  • Status: Active Grant
First Claim
Patent Images

1. In a computing environment including a data store including data items, a method for determining one or more intersection points of parameter patterns in data items, the parameter patterns being specified in a query of a data store including records identified by sequentially ordered identifiers, the query including N parameter patterns to attempt to locate one or more records including the N parameter patterns, the method comprising a computing system performing the following:

  • a) identifying a first parameter pattern from a query, the parameter patterns being specified in a query of a data store including records identified by sequentially ordered identifiers, the query including N parameter patterns to attempt to locate one or more records including the N parameter patterns to find one or more intersection points of parameter patterns in data items, wherein the first parameter pattern occurs less often in an index of records of a data store than at least one other parameter pattern specified in the query;

    b) searching the index until a record of the data store has been identified as including the first parameter pattern wherein a present location identifies the record of the data store identified as including the first parameter pattern;

    c) then searching the index for another parameter pattern from the query;

    d) if the present location is identified as including the another parameter pattern, as a result of searching the index for another parameter pattern, then providing an indication identifying a record at the present location as an intersection;

    elsee) continuing searching remaining portions of the index to find the another parameter pattern in the data store at a different location, wherein the present location is then configured to identify the different location of the another parameter pattern in the data store; and

    wherein at least one of the acts of searching in acts b), c), and e) comprises eliminating at least a portion of records of the data store from searching without being searched prior to being eliminated using a speed-up data structure that skips comparison of record identifiers by skipping indexed record identifiers correlated to offsets in offset correlation table, wherein the offset correlation table indexes parameter patterns based on record identifier offsets, the offset correlation table including an offset column comprising record identifier offsets and a records column comprising record identifiers corresponding to the offsets, wherein the offsets are a predetermined portion of the corresponding record identifiers to which they correspond, wherein the portions of indexed record identifiers are skipped by skipping comparing indexed record identifiers based on the offset, and wherein eliminating at least a portion of records of the data store from searching without being searched prior to being eliminated is performed in response to an act of determining that eliminating at least a portion of records of the data store from searching without being searched prior to being eliminated would be more efficient, by using less processing power, than actually performing comparisons based on the distance between two record identifiers and the size of the database.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×