The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Jan. 03, 2023

Filed:

Dec. 03, 2018
Applicant:

Zaius, Inc., Leesburg, VA (US);

Inventors:

Spencer Eldon Pingry, Leesburg, VA (US);

Jonathan Bartholomew Mulieri, Broadlands, VA (US);

Assignee:

Episerver Inc., Nashua, NH (US);

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 17/00 (2019.01); G06F 7/00 (2006.01); G06F 16/22 (2019.01); G06F 16/245 (2019.01);
U.S. Cl.
CPC ...
G06F 16/22 (2019.01); G06F 16/245 (2019.01);
Abstract

Various implementations of the invention store and retrieve data via a computing processor. The data is comprised of a plurality of data records with a sequentially changing data value and an other data value. For each data record in the plurality of data records, the computing processor causes the data record to be aggregated and stored with other data records in a first data storage container corresponding to a first data storage space based on the sequentially changing data value of the data record (i.e., sequential data space), and causes the data record to be aggregated and stored with other data records in a second data storage container corresponding to a second data storage space (i.e., finite data space). The data records in the second data storage container are stored based on the other data value. When a query is made against the data, the computing processor determines whether the query is best evaluated in the sequential data space or the finite data space. When the query is best evaluated in the sequential data space, the computing processor retrieves a first retrieved plurality of data records from the first data storage container. When the query is best evaluated in the finite data space, the computing processor retrieves a second retrieved plurality of data records from the second data storage container.


Find Patent Forward Citations

Loading…