×

INDEXING AND FILTERING USING COMPOSITE DATA STORES

  • US 20090064042A1
  • Filed: 06/20/2008
  • Published: 03/05/2009
  • Est. Priority Date: 08/30/2007
  • Status: Active Grant
First Claim
Patent Images

1. In a computing environment comprising a plurality of data stores, wherein the data stores are combined into a composite data store, the composite data store storing the data stores sequentially such that each data store in the composite data store is in a range comprising a beginning composite data store address and an ending composite data store address, a method of finding records in one or more of the data stores based on user specified search parameter patterns and based on selected data stores, the method comprising:

  • referencing a first index entry for a user specified first parameter pattern, the first index entry including references to record addresses for records in the composite data store which include the first parameter pattern, further comprising referencing a first record address in the first index entry;

    referencing a first beginning composite data store address of a first selected data store;

    determining 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; and

    based on determining that the first beginning composite data store address is at or above a predetermined threshold above the first record address, using a speed-up data structure 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.

View all claims
  • 3 Assignments
Timeline View
Assignment View
    ×
    ×