Method for maintaining a sample synopsis under arbitrary insertions and deletions
AssigneeInternational Business Machines Corporation
InventorsRAINER GEMULLA, PETER J. HAAS, WOLFGANG LEHNER
Life of this patent
Estimating the term…
Loading patent…
AssigneeInternational Business Machines Corporation
InventorsRAINER GEMULLA, PETER J. HAAS, WOLFGANG LEHNER
Estimating the term…
A method of incrementally maintaining a stable, bounded, uniform random sample S from a dataset R, in the presence of arbitrary insertions and deletions to the dataset R, and without accesses to the dataset R, comprises a random pairing method in which deletions are uncompensated until compensated by a subsequent insertion (randomly paired to the deletion) by including the insertion's item into S if and only if the uncompensated deletion's item was removed from S (i.e., was in S so that it could be removed). A method for resizing a sample to a new uniform sample of increased size while maintaining a bound on the sample size and balancing cost between dataset accesses and transactions to the dataset is also disclosed. A method for maintaining uniform, bounded samples for a dataset in the presence of growth in size of the dataset is additionally disclosed.
A computer-implemented method of incrementally maintaining a stable, bounded, uniform random sample S from a dataset R, in the presence of arbitrary insertions and deletions to the dataset R, and without accesses to the dataset R, comprising the steps of:
A database system, the database system including a dataset R having size |R| and a sample S from the dataset R, the sample S bounded by M, the database system executing steps for:
A computer program product comprising a computer useable medium including a computer readable program, wherein the computer readable program when executed on a computer causes the computer to:
Dependencies are inferred from the claim text.