Database system for triggering event notifications based on updates to database records
US-2024419652-A1 · Dec 19, 2024 · US
US2020117655A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2020117655-A1 |
| Application number | US-201916402700-A |
| Country | US |
| Kind code | A1 |
| Filing date | May 3, 2019 |
| Priority date | Oct 16, 2018 |
| Publication date | Apr 16, 2020 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
An apparatus and method are disclosed. The method, which may be performed by one or more processors, may comprise receiving timestamp data representing a plurality of database transactions and dividing the timestamp data into a plurality of partitioning quanta (nPQ), each partitioning quantum (PQ) of the plurality of partitioning quanta representing a range of timestamps. Further, for each partitioning quantum (PQ) of the plurality of partitioning quanta (nPQ), the method may comprise allocating the timestamp data, such that sequentially adjacent timestamps are allocated to different partitions of a physical storage system for subsequent storage at the allocated partitions.
Opening claim text (preview).
1 . A method, performed by one or more processors, the method comprising: receiving timestamp data representing a plurality of database transactions; dividing the timestamp data into a plurality of partitioning quanta (nPQ), each partitioning quantum (PQ) of the plurality of partitioning quanta representing a range of timestamps; and for each partitioning quantum (PQ) of the plurality of partitioning quanta (nPQ), allocating the timestamp data, such that sequentially adjacent timestamps are allocated to different partitions of a physical storage system for subsequent storage at the allocated partitions. 2 . The method of claim 1 , further comprising: storing values representing the timestamp data, or data associated with the timestamp data, in the allocated partitions of one or more physical storage media; and providing keys to enable access to the timestamp data, or data derived from the timestamp data, for access by means of a database management system. 3 . The method of claim 2 , wherein the values allocated to the respective partitions of the one or more physical storage media represent a difference between database transaction commit time (Tc) and the database transaction start time (Ts). 4 . The method of claim 2 , wherein the values allocated to the respective partitions of the one or more physical storage media represent database transaction commit times (Tc) corresponding to the same transaction as the database transaction start times (Ts). 5 . The method of claim 4 , wherein the values are encoded using variable-length encoding. 6 . The method of claim 1 , wherein timestamps within the range of timestamps are sequential timestamps. 7 . The method of claim 1 , wherein the allocating comprises defining a plurality of partitions (NP) over which the timestamp data for each partitioning quantum (PQ) is to be allocated, wherein a number of partitions is less than a number of timestamps within each partitioning quantum (PQ). 8 . The method of claim 1 , wherein the allocating comprises generating a data structure for each partitioning quantum (PQ) comprising N rows and M columns, each of the N rows corresponding to a respective one of the partitions (NP) and each of the M columns corresponding to a subset range of timestamps within each partitioning quantum (PQ), each of the N rows and M columns having respective row and column keys to enable access to the timestamp data. 9 . The method of claim 8 , wherein the row keys are represented using little endian binary format. 10 . The method of claim 8 , wherein the row keys are provided as: LITTLE_ENDIAN((Ts/PQ)*NP+(Ts % PQ) % NP), where LITTLE_ENDIAN means little endian binary format, Ts is a timestamp value and % means modulus. 11 . The method of claim 8 , wherein the column keys are provided as: ((Ts % PQ)/NP), where Ts is a timestamp value and % means modulus. 12 . The method of claim 8 , wherein the row or column keys are encoded using variable-length encoding. 13 . The method of claim 1 , wherein the timestamp data represents database transaction start times (Ts). 14 . A computer program, optionally stored on a non-transitory computer readable medium program which, when executed by one or more processors of a data processing apparatus, causes the data processing apparatus to carry out a method comprising: receiving timestamp data representing a plurality of database transactions; dividing the timestamp data into a plurality of partitioning quanta (nPQ), each partitioning quantum (PQ) of the plurality of partitioning quanta representing a range of timestamps; and for each partitioning quantum (PQ) of the plurality of partitioning quanta (nPQ), allocating the timestamp data, such that sequentially adjacent timestamps are allocated to different partitions of a physical storage system for subsequent storage at the allocated partitions. 15 . The computer program of claim 14 , the method further comprising: storing values representing the timestamp data, or data associated with the timestamp data, in the allocated partitions of one or more physical storage media; and providing keys to enable access to the timestamp data, or data derived from the timestamp data, for access by means of a database management system. 16 . The computer program of claim 15 , wherein the values allocated to the respective partitions of the one or more physical storage media represent a difference between database transaction commit time (Tc) and the database transaction start time (Ts). 17 . The computer program of claim 2 , wherein the values allocated to the respective partitions of the one or more physical storage media represent database transaction commit times (Tc) corresponding to the same transaction as the database transaction start times (Ts). 18 . Apparatus comprising one or more processors or special-purpose computing hardware, the apparatus configured to carry out a method comprising: receiving timestamp data representing a plurality of database transactions; dividing the timestamp data into a plurality of partitioning quanta (nPQ), each partitioning quantum (PQ) of the plurality of partitioning quanta representing a range of timestamps; and for each partitioning quantum (PQ) of the plurality of partitioning quanta (nPQ), allocating the timestamp data, such that sequentially adjacent timestamps are allocated to different partitions of a physical storage system for subsequent storage at the allocated partitions; 19 . The apparatus of claim 18 , the method further comprising storing values representing the timestamp data, or data associated with the timestamp data, in the allocated partitions of one or more physical storage media 20 . The apparatus of claim 19 , the method further comprising providing keys to enable access to the timestamp data, or data derived from the timestamp data, for access by means of a database management system.
Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor · CPC title
Updates performed during online database operations; commit processing · CPC title
Column-oriented storage; Management thereof · CPC title
using timestamps · CPC title
Data partitioning, e.g. horizontal or vertical partitioning · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.