DATA ACCESS USING AGGREGATION

• US 20180107719A1
• Filed: 10/18/2016
• Published: 04/19/2018
• Est. Priority Date: 10/18/2016
• Status: Active Grant

• Current Assignee: SAP SE
• Original Assignee: SAP SE
• Inventors: Albrecht, Zoltan, Keil, Ulrich Hanno Peter Christoph
• Granted Patent: US 10,366,094 B2
• Time in Patent Office: Days
• CPC Class Codes: G06F 16/2228 Indexing structures
• CPC Class Codes: G06F 16/2477 Temporal data queries
• CPC Class Codes: G06F 16/248 Presentation of query results

Abstract

Methods, systems, and computer program products for accessing data in a data structure are described. Data from a write data structure is read and aggregated into a plurality of data buckets, each data bucket corresponding to a time window. Each data bucket is stored in a read data structure.

Claims

1. A computerized method for accessing information, the method comprising:

reading data from a write data structure in a database;

aggregating, using one or more hardware processors, the data into a plurality of data buckets, each data bucket corresponding to a time window; and

storing each data bucket in a read data structure in the database.

2. The computerized method of claim 1, wherein the aggregation summarizes the data.

3. The computerized method of claim 1, wherein the aggregation summarizes the data by counting a number of occurrences of a same data type during the corresponding time window.

4. The computerized method of claim 1, wherein the aggregation summarizes the data by summing a value of each occurrence of a same data type during the corresponding time window.

5. The computerized method of claim 1, wherein the time window has a length of one hour, one day, one week, one month, or one year.

6. The computerized method of claim 1, wherein a plurality of the data buckets are aggregated at least partially from a same portion of data of the write data structure.

7. A computerized method for accessing data, comprising:

obtaining a time constraint for a data query;

selecting a first data bucket that satisfies the data query and has a time window that is encompassed by the time constraint, the time window of the first data bucket being a longest time window of any non-selected data bucket; and

providing the selected first data bucket in a query response.

8. The computerized method of claim 7, further comprising:

selecting another data bucket that satisfies the data query and has a time window that is encompassed by the time constraint, the time window of the another data bucket not overlapping the time window of any selected data bucket; and

providing the selected another data bucket in the query response.

9. The computerized method of claim 8, further comprising repeating the selection of the another data bucket until every portion of the time constraint has a corresponding selected data bucket.

10. An apparatus for configuring runtime bundles on a computer, the apparatus comprising:

one or more processors;

memory to store instructions that, when executed by the one or more hardware processors perform operations comprising;

reading data from a write data structure in a database;

aggregating, using one or more hardware processors, the data into a plurality of data buckets, each data bucket corresponding to a time window; and

storing each data bucket in a read data structure in the database.

11. The apparatus of claim 10, wherein the aggregation summarizes the data.

12. The apparatus of claim 10, wherein the aggregation summarizes the data by counting a number of occurrences of a same data type during the corresponding time window.

13. The apparatus of claim 10, wherein the aggregation summarizes the data by summing a value of each occurrence of a same data type during the corresponding time window.

14. The apparatus of claim 10, wherein the time window has a length of one hour, one day, one week, one month, or one year.

15. The apparatus of claim 10, wherein a plurality of the data buckets are aggregated at least partially from a same portion of data of the write data structure.

16. The apparatus of claim 10, the operations further comprising:

obtaining a time constraint for a data query;

selecting a first data bucket that satisfies the data query and has a time window that is encompassed by the time constraint, the time window of the first data bucket being a longest time window of any non-selected data bucket; and

providing the selected first data bucket in a query response.

17. The apparatus of claim 16, the operations further comprising:

selecting another data bucket that satisfies the data query and has a time window that is encompassed by the time constraint, the time window of the another data bucket not overlapping the time window of any selected data bucket; and

providing the selected another data bucket in the query response.

18. The apparatus of claim 17, the operations further comprising repeating the selection of the another data bucket until every portion of the time constraint has a corresponding selected data bucket.

19. A non-transitory machine-readable storage medium comprising instructions, which when implemented by one or more machines, cause the one or more machines to perform operations comprising:

reading data from a write data structure in a database;

aggregating, using one or more hardware processors, the data into a plurality of data buckets, each data bucket corresponding to a time window; and

storing each data bucket in a read data structure in the database.

20. The non-transitory machine-readable storage medium of claim 19, the operations further comprising:

obtaining a time constraint for a data query;

selecting a first data bucket that satisfies the data query and has a time window that is encompassed by the time constraint, the time window of the first data bucket being a longest time window of any non-selected data bucket; and

providing the selected first data bucket in a query response.