×

Data store with lock-free stateless paging capacity

  • US 10,552,496 B2
  • Filed: 03/04/2015
  • Issued: 02/04/2020
  • Est. Priority Date: 12/15/2004
  • Status: Active Grant
First Claim
Patent Images

1. A computer-implemented method for limiting the number of results returned from a data store containing data items, each of said data items having an ordinal ranking within said data store, said method comprising the steps of:

  • receiving, by said data store, from a client device, an initial query comprising one or more query conditions;

    upon receiving said initial query;

    determining, by said data store, an initial subset of said data items that;

    satisfy said query conditions, andhave lowest ordinal rankings among said data items;

    generating, by said data store, a marker indicating the greatest ordinal ranking among said ordinal rankings of said initial subset of data items; and

    returning, by said data store, to said client, an initial page of results comprising said initial subset of data items and said marker;

    receiving, by said data store, from said client device, said marker with a subsequent query; and

    upon receiving said marker with said subsequent query, said data store returning a subsequent page of results comprising data items that have a greater ordinal ranking than the data items included in said initial page of results, wherein said subsequent page of results is disjoint from said initial page of results.

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