Reducing data storage, memory, and computational time needed for ad-hoc data analysis
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Feb 5, 2019
Grant Date -
Sep 20, 2018
app pub date -
Mar 15, 2018
filing date -
Mar 15, 2017
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
A compressed data structure is disclosed for storing collected data and delivering ad-hoc data analysis. The compressed data structure can reduce hardware requirements, such as data storage requirements, and decrease processing requirements during ad-hoc data analysis. Raw data can be pre-aggregated to a base level of aggregation (base cell level) that is determined by the unique combination of attributes available for aggregation. Rather than storing the raw data, the entire distribution is stored at the base cell level along with a selection of pre-computed statistics of the raw data. At the time of ad-hoc analysis, pre-computed results based on the raw data can be retrieved or computed from the pre-computed statistics, or analysis of higher-level data can be computed on-demand based on the pre-aggregated base level data.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully