IP Library Granted Patent US 8,751,525
Granted Patent B2
US 8,751,525 · App. 13/336,951 · Granted Jun 10, 2014

Time slider operator for temporal data aggregation

Inventors: Martin Kaufmann (Zurich, CH); Norman May (Karlsruhe, DE); Andreas Tonder (Weinheim, DE); Donald Kossmann (Zurich, CH)
Assignee: SAP AG
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,751,525
App. No.
13/336,951
Granted
Jun 10, 2014
Kind
B2
Abstract

Calculation of aggregated values in a history database table can be optimized using an approach in which an ordered history table is accessed. The ordered history table can include a sequential listing of commit identifiers associated with updates, insertions, and/or deletions to values in the database table. The ordered history table can be traversed in a single pass to calculate an aggregation function using an optimized algorithm. The optimized algorithm can enable calculation of an aggregated metric of the values based on a selected method for tracking invalidated values to their corresponding commit identifiers. The calculated metric is generated for a current version of the database table; and promoted.

Claims (33)

1. A non-transitory computer program product storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations comprising:

accessing an ordered history table of a database table, the ordered history table comprising a plurality of commit identifiers associated with one or more of updates, insertions, and deletions to values in the database table, the ordered history table comprising a sequential listing of the commit identifiers associated with first occurrences of changes to one or more of the values and a listing of the values corresponding to the sequential listing of the commit identifiers;

traversing the ordered history table in a single pass to calculate an aggregation function using an optimized algorithm, to generate an aggregated metric of the values based on a selected method for tracking invalidated values to their corresponding commit identifiers, the selected method comprising generating an invalidation index using the optimized algorithm, the invalidation index being generated by indexing a commit identifier column in the ordered history table to positions in the ordered history table at which values are invalidated either by deletion or by being updated to another value, the invalidation index listing positions within the ordered history table at which invalidation occurs and being appended as additional updates or deletes of the values occur;

generating the calculated metric for a current version of the database table based on traversing the ordered history table; and

promoting the calculated metric.

2. A computer program product as in claim 1 , wherein the promoting comprises one or more of storing the calculated metric, presenting the calculated metric via a user interface display, and sending an electronic message comprising the calculated metric.

3. A computer program product as in claim 1 , wherein the optimized algorithm further comprises one or more of generating a separate bitlist for each of the commit identifiers, and generating a previous version array.

4. A computer program product as in claim 3 , wherein the operations further comprise selecting the optimized algorithm dependent on the aggregation function from a plurality of algorithms, the selecting cmprising assessing one or more attributes of the database table in relation to a set of optimization criteria for each of the plurality of algorithms.

5. A computer program product as in claim 1 , wherein the traversing comprises one or more of incrementing a variable based on changes to the values at each commit identifiers, creating a chained list corresponding to each commit identifier, and creating a sorted list corresponding to each commit identifier.

6. A computer program product as in claim 1 , wherein the calculated metric comprises one or more of a sum, a count, an average, a minimum value, a maximum value, a median, a mode, and skewness.

7. A computer program product as in claim 1 , wherein the operations further comprise generating the ordered history table by sorting the history table sequentially by the commit identifiers.

8. A system comprising:

at least one programmable processor; and a machine-readable medium storing instructions that, when executed by the at least one programmable processor, cause the at least one programmable processor to perform operations comprising:

accessing an ordered history table of a database table, the ordered history table comprising a plurality of commit identifiers associated with one or more of updates, insertions, and deletions to values in the database table, the ordered history table comprising a sequential listing of the commit identifiers associated with first occurrences of changes to one or more of the values and a listing of the values corresponding to the sequential listing of the commit identifiers;

traversing the ordered history table in a single pass to calculate an aggregation function using an optimized algorithm to generate an aggregated metric of the values based on a selected method for tracking invalidated values to their corresponding commit identifiers, the selected method includes generating an invalidation index using the optimized algorithm, the invalidation index being generated by indexing a commit identifier column in the ordered history table to positions in the ordered history table at which values are invalidated either by deletion or by being updated to another value, the invalidation index listing positions within the ordered history table at which invalidation occurs and being appended as additional updates or deletes of the values occur;

generating the calculated metric for a current version of the database table based on traversing the ordered history table; and

promoting the calculated metric.

9. A system as in claim 8 , wherein the promoting comprises one or more of storing the calculated metric, presenting the calculated metric via a user interface display, and sending an electronic message comprising the calculated metric.

10. A system as in claim 8 , wherein the optimized algorithm further comprises one or more of generating a separate bitlist for each of the commit identifiers, and generating a previous version array.

11. A system as in claim 10 , wherein the operations further comprise selecting the optimized algorithm from a plurality of algorithms, the selecting comprising assessing one or more attributes of the database table in relation to a set of optimization criteria for each of the plurality of algorithms.

12. A system as in claim 8 , wherein the traversing comprises one or more of incrementing a variable based on changes to the values at each commit identifiers, creating a chained list corresponding to each commit identifier, and creating a sorted list corresponding to each commit identifier.

13. A system as in claim 8 , wherein the calculated metric comprises one or more of a sum, a count, an average, a minimum value, a maximum value, a median, a mode, and a skewness.

14. A computer-implemented method comprising:

accessing an ordered history table of a database table, the ordered history table comprising a plurality of commit identifiers associated with one or more of updates, insertions, and deletions to values in the database table, the ordered history table comprising a sequential listing of the commit identifiers associated with first occurrences of changes to one or more of the values and a listing of the values corresponding to the sequential listing of the commit identifiers;

traversing the ordered history table in a single pass to calculate an aggregation function using an optimized algorithm to generate an aggregated metric of the values based on a selected method for tracking invalidated values to their corresponding commit identifiers, wherein the selected method includes generating an invalidation index using the optimized algorithm, the invalidation index being generated by indexing a commit identifier column in the ordered history table to positions in the ordered history table at which values are invalidated either by deletion or by being updated to another value, the invalidation index listing positions within the ordered history table at which invalidation occurs and being appended as additional updates or deletes of the values occur;

generating the calculated metric for a current version of the database table based on traversing the ordered history table; and

promoting the calculated metric.

15. A computer-implemented method as in claim 14 , wherein the promoting comprises one or more of storing the calculated metric, presenting the calculated metric via a user interface display, and sending an electronic message comprising the calculated metric.

16. A computer-implemented method as in claim 4 , wherein the optimized algorithm further comprises one or more generating a separate bitlist for each of the commit identifiers and generating a previous version array.

17. A computer-implemented method as in claim 16 , further comprising selecting the optimized algorithm from a plurality of algorithms, the selecting comprising assessing one or more attributes of the database table in relation to a set of optimization criteria for each of the plurality of algorithms.

18. A computer-implemented method as in claim 14 , wherein the traversing comprises one or more of incrementing a variable based on changes to the values at each commit identifiers, creating a chained list corresponding to each commit identifier, and creating a sorted list corresponding to each commit identifier.

19. A computer-implemented method as in claim 14 , wherein the calculated metric comprises one or more of a sum, a count, an average, a minimum value, a maximum value, a median, a mode, and a skewness.

20. A computer-implemented method as in claim 14 , wherein at least one of the ordering, the traversing, the generating, and the promoting are performed by one or more programmable processors.

Assignments (2)
CHANGE OF NAME Recorded Aug 26, 2014
From: SAP AG
To: SAP SE
Reel/Frame 033625/0334 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 22, 2012
From: TONDER, ANDREAS; MAY, NORMAN; KAUFMANN, MARTIN; KOSSMANN, DONALD
To: SAP AG
Reel/Frame 027924/0511 →
Continuity (1)
Related Publication 20130166522A1 · Jun 27, 2013