IP Library › Granted Patent US 12,517,889
Granted Patent B2
US 12,517,889 · App. 18/740,434 · Granted Jan 6, 2026

Database system with database engine and separate distributed storage service

Inventors: Anurag Windlass Gupta (Atherton, CA); Neal Fachan (Seattle, WA); Samuel James McKelvie (Seattle, WA); Laurion Darrell Burchall (Seattle, WA); Christopher Richard Newcombe (Kirkland, WA); Pradeep Jnana Madhavarapu (Mountain View, CA); Benjamin Tobler (Seattle, WA); James McClellan Corey (Bothell, WA)
Assignee: Amazon Technologies, Inc.
G06F16/2365G06F11/1451G06F11/1471G06F16/23G06F11/2094G06F2201/80
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 12,517,889
App. No.
18/740,434
Granted
Jan 6, 2026
Kind
B2
Abstract

A database system may include a database service and a separate distributed storage service. The database service (or a database engine head node thereof) may be responsible for query parsing, optimization, and execution, transactionality, and consistency, while the storage service may be responsible for generating data pages from redo log records and for durability of those data pages. For example, in response to a write request directed to a particular data page, the database engine head node may generate a redo log record and send it, but not the data page, to a storage service node. The storage service node may store the redo log record and return a write acknowledgement to the database service prior to applying the redo log record. The server node may apply the redo log record and other redo log records to a previously stored version of the data page to create a current version.

Claims (49)

1 . A system, comprising:

at least one processor; and

a memory, storing program instructions that when executed by the at least one processor cause the at least one processor to:

receive, from a client, a write request to add data to a database table;

in response to the reception of the write request, send an indication of the write request to a plurality of storage nodes of a distributed storage system that store at least a portion of the database table;

receive, from a number of the plurality of storage nodes of the distributed storage system that satisfies a write quorum, an indication for performance of the write request; and

responsive to reception of the indication for performance of the write request from the number of the plurality of storage nodes that satisfies the write quorum, return to the client an acknowledgement of the write request as complete.

2 . The system of claim 1 , further comprising program instructions that when executed by the at least one processor cause the at least one processor to:

receive, from the client, a different write request to add other data to the database table;

in response to the reception of the different write request, send an indication of the different write request to the plurality of storage nodes of the distributed storage system; and

after a period of time without receiving enough write acknowledgements from the number of the plurality of storage nodes that satisfies the write quorum, determine that an error condition exists in the distributed storage system.

3 . The system of claim 1 , wherein a given storage node comprises a virtual machine on which storage node server code is deployed.

4 . The system of claim 1 , further comprising program instructions that when executed by the at least one processor cause the at least one processor to:

receive, from the client, a read request directed to a data page; and

responsive to a determination that a cache comprises the data page, return, to the client, data corresponding to the read request.

5 . The system of claim 1 , wherein the plurality of storage nodes of the distributed storage system store data for a network-based database service.

6 . The system of claim 1 , wherein the plurality of storage nodes comprises a protection group for a portion of a database volume.

7 . The system of claim 6 , wherein the database volume comprises a contiguous sequence of volume extents.

8 . A method, comprising:

receiving, from a client, a write request to add data to a database table;

in response to receiving the write request, sending an indication of the write request to a plurality of storage nodes of a distributed storage system that store at least a portion of the database table;

receiving, from a number of the plurality of storage nodes of the distributed storage system that satisfies a write quorum, an indication for performance of the write request; and

responsive to receiving the indication for performance of the write request from the number of the plurality of storage nodes that satisfies the write quorum, returning to the client an acknowledgement of the write request as complete.

9 . The method of claim 8 , further comprising:

receiving, from the client, a different write request to add other data to the database table;

in response to receiving the different write request, sending an indication of the different write request to the plurality of storage nodes of the distributed storage system; and

after a period of time without receiving enough write acknowledgements from the number of the plurality of storage nodes that satisfies the write quorum, determining that an error condition exists in the distributed storage system.

10 . The method of claim 8 , wherein a given storage node comprises a virtual machine on which storage node server code is deployed.

11 . The method of claim 8 , further comprising:

receiving, from the client, a read request directed to a data page; and

responsive to determining that a cache comprises the data page, returning, to the client, data corresponding to the read request.

12 . The method of claim 8 , wherein the plurality of storage nodes of the distributed storage system store data for a network-based database service.

13 . The method of claim 8 , wherein the plurality of storage nodes comprises a protection group for a portion of a database volume.

14 . The method of claim 13 , wherein the database volume comprises a contiguous sequence of volume extents.

15 . The system of claim 1 , further comprising program instructions that when executed) One or more non-transitory, computer-readable storage media, storing program instructions that when executed on or across one or more computing devices, cause the one or more computing devices to implement:

receiving, from a client, a write request to add data to a database table;

in response to receiving the write request, sending an indication of the write request to a plurality of storage nodes of a distributed storage system that store at least a portion of the database table;

receiving, from a number of the plurality of storage nodes of the distributed storage system that satisfies a write quorum, an indication for performance of the write request; and

responsive to receiving the indication for performance of the write request from the number of the plurality of storage nodes that satisfies the write quorum, returning to the client an acknowledgement of the write request as complete.

16 . The one or more non-transitory, computer-readable storage media of claim 15 , storing further instructions that when executed on or across the one or more computing devices, cause the one or more computing devices to further implement:

receiving, from the client, a different write request to add other data to the database table;

in response to receiving the different write request, sending an indication of the different write request to the plurality of storage nodes of the distributed storage system; and

after a period of time without receiving enough write acknowledgements from the number of the plurality of storage nodes that satisfies the write quorum, determining that an error condition exists in the distributed storage system.

17 . The one or more non-transitory, computer-readable storage media of claim 15 , wherein a given storage node comprises a virtual machine on which storage node server code is deployed.

18 . The one or more non-transitory, computer-readable storage media of claim 15 , storing further instructions that when executed on or across the one or more computing devices, cause the one or more computing devices to further implement:

receiving, from the client, a read request directed to a data page; and

responsive to determining that a cache comprises the data page, returning, to the client, data corresponding to the read request.

19 . The one or more non-transitory, computer-readable storage media of claim 15 , wherein the plurality of storage nodes of the distributed storage system store data for a network-based database service.

20 . The one or more non-transitory, computer-readable storage media of claim 15 , wherein the plurality of storage nodes comprises a protection group for a portion of a database volume.

Continuity (6)
Continuation 18054870 · Nov 11, 2022
Continuation 16914075 · Jun 26, 2020
Continuation 15369681 · Dec 5, 2016
Division 14201493 · Mar 7, 2014
Provisional Application 61794572 · Mar 15, 2013
Related Publication 20240330270A1 · Oct 3, 2024
References Cited (235)
US 5280612A · Lorie et al. · 1994 [cited by applicant]
US 5452445A · Hallmark et al. · 1995 [cited by applicant]
US 5471614A · Kakimoto · 1995 [cited by applicant]
US 5524205A · Lomet et al. · 1996 [cited by applicant]
US 5530850A · Ford et al. · 1996 [cited by applicant]
US 5870758A · Bamford et al. · 1999 [cited by applicant]
US 5892917A · Myerson · 1999 [cited by applicant]
US 5907848A · Zaiken et al. · 1999 [cited by applicant]
US 5951695A · Kolovson · 1999 [cited by applicant]
US 6041423A · Tsukerman · 2000 [cited by applicant]
US 6205449B1 · Rastogi · 2001 [cited by applicant]
US 6233585B1 · Gupta et al. · 2001 [cited by applicant]
US 6240413B1 · Learmont · 2001 [cited by applicant]
US 6615219B1 · Bruso et al. · 2003 [cited by applicant]
US 6631374B1 · Klein et al. · 2003 [cited by applicant]
US 6732124B1 · Koseki et al. · 2004 [cited by applicant]
US 6732171B2 · Hayden · 2004 [cited by applicant]
US 6792518B2 · Armangau et al. · 2004 [cited by applicant]
US 6832229B2 · Reed · 2004 [cited by applicant]
US 6976022B2 · Vemuri et al. · 2005 [cited by applicant]
US 7010645B2 · Hetzler et al. · 2006 [cited by applicant]
US 7089253B2 · Hinshaw et al. · 2006 [cited by applicant]
US 7146386B2 · Xiao · 2006 [cited by applicant]
US 7287034B2 · Wong et al. · 2007 [cited by applicant]
US 7305386B2 · Hinshaw et al. · 2007 [cited by applicant]
US 7308456B2 · Friske et al. · 2007 [cited by applicant]
US 7328226B1 · Karr et al. · 2008 [cited by applicant]
US 7403945B2 · Lin et al. · 2008 [cited by applicant]
US 7716645B2 · Dolby et al. · 2010 [cited by applicant]
US 7747663B2 · Atkin et al. · 2010 [cited by applicant]
US 7885922B2 · Pareek et al. · 2011 [cited by applicant]
US 7930271B2 · Tarbell · 2011 [cited by applicant]
US 7937551B2 · Schott · 2011 [cited by applicant]
US 7979670B2 · Saliba et al. · 2011 [cited by applicant]
US 8086650B1 · Milford · 2011 [cited by applicant]
US 8156083B2 · Banerjee et al. · 2012 [cited by applicant]
US 8209515B2 · Schott · 2012 [cited by applicant]
US 8255627B2 · Blinick et al. · 2012 [cited by applicant]
US 8266114B2 · Mace et al. · 2012 [cited by applicant]
US 8266122B1 · Newcombe · 2012 [cited by applicant]
US 8271830B2 · Erofeev · 2012 [cited by applicant]
US 8289801B2 · Smith et al. · 2012 [cited by applicant]
US 8301670B2 · Revah et al. · 2012 [cited by applicant]
US 8326897B2 · Butterworth et al. · 2012 [cited by applicant]
US 8341128B1 · Ruggiero · 2012 [cited by applicant]
US 8370715B2 · Hafner et al. · 2013 [cited by applicant]
US 8380670B2 · Kuber et al. · 2013 [cited by applicant]
US 8392479B1 · Pantin · 2013 [cited by applicant]
US 8396831B2 · Larson et al. · 2013 [cited by applicant]
US 8412689B2 · Reid et al. · 2013 [cited by applicant]
US 8412752B2 · Dodge · 2013 [cited by applicant]
US 8429121B2 · Pareek et al. · 2013 [cited by applicant]
US 8463825B1 · Harty et al. · 2013 [cited by applicant]
US 8527462B1 · Talius et al. · 2013 [cited by applicant]
US 8572031B2 · Merriman et al. · 2013 [cited by applicant]
US 8589361B2 · Hu et al. · 2013 [cited by applicant]
US 9047189B1 · Gupta et al. · 2015 [cited by applicant]
US 9171020B2 · Faerber et al. · 2015 [cited by applicant]
US 9208032B1 · McAlister · 2015 [cited by examiner]
US 9223843B1 · Madhavarapu et al. · 2015 [cited by applicant]
US 9229983B2 · Yu et al. · 2016 [cited by applicant]
US 9280591B1 · Kharatishvili et al. · 2016 [cited by applicant]
US 9298564B2 · Lee et al. · 2016 [cited by applicant]
US 9304998B2 · Diaconu et al. · 2016 [cited by applicant]
US 9305056B1 · Gupta et al. · 2016 [cited by applicant]
US 9317213B1 · Gupta et al. · 2016 [cited by applicant]
US 9460008B1 · Leshinsky et al. · 2016 [cited by applicant]
US 9465693B2 · Gupta et al. · 2016 [cited by applicant]
US 9501501B2 · Madhavarapu et al. · 2016 [cited by applicant]
US 9507843B1 · Madhavarapu et al. · 2016 [cited by applicant]
US 9514007B2 · Gupta et al. · 2016 [cited by applicant]
US 9519664B1 · Kharatishvili et al. · 2016 [cited by applicant]
US 9529682B2 · McAlister et al. · 2016 [cited by applicant]
US 9672237B2 · Gupta et al. · 2017 [cited by applicant]
US 9699017B1 · Gupta et al. · 2017 [cited by applicant]
US 9760596B2 · Burchall et al. · 2017 [cited by applicant]
US 9817710B2 · Gupta et al. · 2017 [cited by applicant]
US 9875270B1 · Muniswamy Reddy · 2018 [cited by examiner]
US 10180951B2 · Gupta et al. · 2019 [cited by applicant]
US 10223184B1 · McKelvie et al. · 2019 [cited by applicant]
US 10289544B2 · Geml · 2019 [cited by examiner]
US 10303564B1 · Gupta et al. · 2019 [cited by applicant]
US 10372537B2 · Bennett, Jr. · 2019 [cited by examiner]
US 10437721B2 · Leshinsky et al. · 2019 [cited by applicant]
US 10534768B2 · Madhavarapu et al. · 2020 [cited by applicant]
US 10585587B2 · Noguchi · 2020 [cited by examiner]
US 10698881B2 · Gupta et al. · 2020 [cited by applicant]
US 10725983B2 · Larson et al. · 2020 [cited by applicant]
US 10747746B2 · Gupta et al. · 2020 [cited by applicant]
US 10802766B2 · Choudhury et al. · 2020 [cited by applicant]
US 10803012B1 · Madhavarapu et al. · 2020 [cited by applicant]
US 10909091B1 · Shah et al. · 2021 [cited by applicant]
US 11010267B2 · Neall et al. · 2021 [cited by applicant]
US 11030055B2 · Gupta et al. · 2021 [cited by applicant]
US 11250019B1 · Goyal · 2022 [cited by examiner]
US 11403034B1 · Moertl · 2022 [cited by examiner]
US 11461296B2 · Larson et al. · 2022 [cited by applicant]
US 11500852B2 · Gupta et al. · 2022 [cited by applicant]
US 11947537B1 · Vig · 2024 [cited by examiner]
US 12174845B1 · Gordon · 2024 [cited by examiner]
US 20020107835A1 · Coram et al. · 2002 [cited by applicant]
US 20020143733A1 · Mukkamalla et al. · 2002 [cited by applicant]
US 20040133622A1 · Clubb et al. · 2004 [cited by applicant]
US 20040225696A1 · Wong et al. · 2004 [cited by applicant]
US 20040249869A1 · Oksanen · 2004 [cited by applicant]
US 20050015416A1 · Yamagami · 2005 [cited by applicant]
US 20050097149A1 · Vaitzblit et al. · 2005 [cited by applicant]
US 20060020634A1 · Huras et al. · 2006 [cited by applicant]
US 20060047626A1 · Raheem · 2006 [cited by applicant]
US 20060224636A1 · Kathuria et al. · 2006 [cited by applicant]
US 20070005664A1 · Kodavalla · 2007 [cited by applicant]
US 20070174541A1 · Chandrasekaran · 2007 [cited by applicant]
US 20080010322A1 · Lee et al. · 2008 [cited by applicant]
US 20080077629A1 · Lorenz · 2008 [cited by applicant]
US 20080180731A1 · Tomita · 2008 [cited by examiner]
US 20080183973A1 · Aguilera et al. · 2008 [cited by applicant]
US 20080294648A1 · Lin et al. · 2008 [cited by applicant]
US 20090177671A1 · Pellegrini et al. · 2009 [cited by applicant]
US 20090192979A1 · Lunde · 2009 [cited by applicant]
US 20090228511A1 · Atkin et al. · 2009 [cited by applicant]
US 20090249001A1 · Narayanan et al. · 2009 [cited by applicant]
US 20100036861A1 · Srihari et al. · 2010 [cited by applicant]
US 20100050172A1 · Ferris · 2010 [cited by applicant]
US 20100115284A1 · Hahn · 2010 [cited by applicant]
US 20100153617A1 · Miroshnichenko et al. · 2010 [cited by applicant]
US 20100192131A1 · Dolby et al. · 2010 [cited by applicant]
US 20100274750A1 · Oltean et al. · 2010 [cited by applicant]
US 20110035548A1 · Kimmel et al. · 2011 [cited by applicant]
US 20110060724A1 · Chan · 2011 [cited by applicant]
US 20110072217A1 · Hoang et al. · 2011 [cited by applicant]
US 20110145201A1 · Holst et al. · 2011 [cited by applicant]
US 20110161496A1 · Nicklin · 2011 [cited by applicant]
US 20110178984A1 · Talius et al. · 2011 [cited by applicant]
US 20110251997A1 · Wang et al. · 2011 [cited by applicant]
US 20120005196A1 · Horii · 2012 [cited by applicant]
US 20120011106A1 · Reid et al. · 2012 [cited by applicant]
US 20120041899A1 · Greene et al. · 2012 [cited by applicant]
US 20120102006A1 · Larson · 2012 [cited by applicant]
US 20120109895A1 · Zwilling · 2012 [cited by applicant]
US 20120166390A1 · Merriman et al. · 2012 [cited by applicant]
US 20120174112A1 · Vaidya et al. · 2012 [cited by applicant]
US 20120191648A1 · Kuber et al. · 2012 [cited by applicant]
US 20120254309A1 · Tokashiki · 2012 [cited by applicant]
US 20120259889A1 · Dinker et al. · 2012 [cited by applicant]
US 20120297073A1 · Glover et al. · 2012 [cited by applicant]
US 20120303576A1 · Calder et al. · 2012 [cited by applicant]
US 20120310985A1 · Gale et al. · 2012 [cited by applicant]
US 20120310986A1 · Frantz et al. · 2012 [cited by applicant]
US 20120310991A1 · Frantz et al. · 2012 [cited by applicant]
US 20120323849A1 · Garin, Jr. et al. · 2012 [cited by applicant]
US 20130036281A1 · Revah et al. · 2013 [cited by applicant]
US 20130042056A1 · Shats et al. · 2013 [cited by applicant]
US 20130042156A1 · Srinivasan et al. · 2013 [cited by applicant]
US 20130080386A1 · Dwyer et al. · 2013 [cited by applicant]
US 20130080388A1 · Dwyer et al. · 2013 [cited by applicant]
US 20130086129A1 · Brown et al. · 2013 [cited by applicant]
US 20140279929A1 · Gupta et al. · 2014 [cited by applicant]
US 20150100542A1 · Li et al. · 2015 [cited by applicant]
US 20150113009A1 · Zhou et al. · 2015 [cited by applicant]
US 20150286701A1 · Wideman · 2015 [cited by applicant]
US 20150347541A1 · Holmes et al. · 2015 [cited by applicant]
US 20160179415A1 · Lee · 2016 [cited by examiner]
US 20160371355A1 · Massari · 2016 [cited by examiner]
US 20170075781A1 · Bennett, Jr. · 2017 [cited by examiner]
US 20180024919A1 · Geml · 2018 [cited by examiner]
US 20180081555A1 · Noguchi · 2018 [cited by examiner]
US 20190095297A1 · Neall et al. · 2019 [cited by applicant]
US 20190102113A1 · Choudhury et al. · 2019 [cited by applicant]
US 20190205437A1 · Larson et al. · 2019 [cited by applicant]
US 20220187989A1 · Resch · 2022 [cited by examiner]
US 20230053707A1 · Larson et al. · 2023 [cited by applicant]
US 20230092908A1 · Gupta et al. · 2023 [cited by applicant]
US 20240037118A1 · Grosman et al. · 2024 [cited by applicant]
US 20240330270A1 · Gupta · 2024 [cited by examiner]
US 20250077478A1 · Agababov · 2025 [cited by examiner]
US 20250190344A1 · Bae · 2025 [cited by examiner]
US 20250217286A1 · Choi · 2025 [cited by examiner]
CA 2783370 · 2011 [cited by applicant]
CN 1449530A · 2003 [cited by applicant]
CN 1454349A · 2003 [cited by applicant]
CN 1653451A · 2005 [cited by applicant]
CN 1784676A · 2006 [cited by applicant]
CN 101004714 · 2007 [cited by applicant]
CN 101154234A · 2008 [cited by applicant]
CN 102012849A · 2011 [cited by applicant]
CN 102419764A · 2012 [cited by applicant]
CN 102436490 · 2012 [cited by applicant]
EP 0675451 · 1995 [cited by applicant]
EP 1630674 · 2006 [cited by applicant]
EP 1366420 · 2014 [cited by applicant]
JP H10254748 · 1998 [cited by applicant]
JP 2005050024 · 2005 [cited by applicant]
JP 2005276094 · 2005 [cited by applicant]
JP 2006263581 · 2006 [cited by applicant]
JP 2007200182 · 2007 [cited by applicant]
JP 2007206759 · 2007 [cited by applicant]
JP 2007317017 · 2007 [cited by applicant]
JP 2012014502 · 2012 [cited by applicant]
JP 2012507072 · 2012 [cited by applicant]
WO 200177908A2 · 2001 [cited by applicant]
WO 200195640A2 · 2001 [cited by applicant]
WO 2003096226A1 · 2003 [cited by applicant]
WO 2005086032A1 · 2005 [cited by applicant]
Session Guarantees for Weakly Consistent Replicated Data (Year: 1994). [cited by examiner]
“Amazon Web Services Blog” Downloaded Apr. 30, 2013 from http://aws.typepad.com/aws/2010/10/amazon-rdsannouncing-read-replicas.html, Published Oct. 5, 2010 pp. 1-11. [cited by applicant]
“Bloom Filter” Downloaded from http://en.wikipedia.org/wiki/Bloom_filter on May 15, 2013, pp. 1-12. [cited by applicant]
John Clarke “SQL Result Set Cache in Oracle 11 gR2” published Nov. 16, 2011 downloaded May 15, 2013 from http://www.centroid.com/knowledgebase/blog/sql-result-set-cache-in-oracle-11 gr2, pp. 1-27. [cited by applicant]
Jim Czuprynski “Oracle Database 11g: SQL Query Result Set Caching” published Jul. 30, 2008, downloaded May 15, 2013 from http://www.databasejournal.com/features/oracle/article.php/3760761/Oracle-Database-11 g-SQL -Query… [cited by applicant]
“Oracle Database JDBC Developer's Guide and Reference: Chapter 20 Statement and Result Set Caching”downloaded from http://docs.oracle.com/cd/B28359_01/java.1111b31224/stmtcach.htm via the Wayback Machine Nov. 27, 2011, … [cited by applicant]
Adrian Billington “Query Result Cache in Oracle 11g” downloaded from http://web.archive.org/web/20080124161135/ http://www.oracle-developer.net/display.php?id=503 via the Wayback Machine Jan. 4, 2008, pp. 1-20. [cited by applicant]
Julian Dontcheff “Bloom Filters for DBAs” published Aug. 28, 2012, downloaded from http://juliandontcheff.wordpress.com/2012/08/28/bloom-filters-for-dbas/ on May 14, 2013, pp. 1-4. [cited by applicant]
Julian Dyke “Result Cache Internals” Nov. 2007, pp. 1-38. [cited by applicant]
Michele Cyran et al.“Oracle Database Concepts 10g Release 2 (10.2)” Oct. 2005, pp. 1-542. [cited by applicant]
Lance Ashdown et al.“Oracle Database Concepts 11g Release 2 (11.2)” Sep. 2011, pp. 1-460. [cited by applicant]
“Isolation (database systems)” downloaded from http://en.wikipedia.org/wiki/Isolation_(database_systems) on May 15, 2013, pp. 1-7. [cited by applicant]
Latika C. Savade, et al., “A Technique to Search Log Records using System of Linear Equations”, Software Engineering (CONSEG), 2012 CSI Sixth International Conference, IEEE, Sep. 5, 2012, pp. 1-4. [cited by applicant]
Extended European Search Report from PCT/US2014/023542, Dated Nov. 9, 2016, Amazon Technologies, Inc., pp. 1-6. [cited by applicant]
Sailesh Chutani et al “The Episode File System”, In Proceedings of the USENIX Winter 1992 Technical Conference, Jan. 20, 1992, pp. 43-60. [cited by applicant]
Office Action from Japanese Application No. 2016-501278, Dated Jun. 20, 2017, Amazon Technologies, Inc., pp. 1-8. [cited by applicant]
Office Action from Chinese Application 201480021079.4, Dated Feb. 1, 2018, English translation and Chinese version, Amazon Technologies, Inc., pp. 1-30. [cited by applicant]
“Research on the Data Restoration Technology of Distributed Database System”, Sep. 15, 2003, Chinese version, pp. 1-17. [cited by applicant]
Oracle: “Triggers-Oracle Database Concepts”, Retrieved from URL: https://Web.archive.org/web/20150918220843/ https://docs.oracle.com/cd/B19306_01/server.102/b14220/triggers.htm, retrieved on Jan. 11, 2018, pp. 1-17. [cited by applicant]
Bratko, A. et al., “Exploiting Structural Information for semi-structured document categorization”, Information Processing & Management, Dated May 1, 2006, vol. 42, No. 3, pp. 679-694. [cited by applicant]
Juan Trujillo et al., “A UML Based Approach for Modeling ETL Processes in data warehouses”, In: Network and parallel computing, dated Oct. 16, 2003, pp. 1-14. [cited by applicant]
Anonymous, “Start informatica job when a row is updated”, retrieved from URL: https://network.informatica.com/thread/13920. on Jan. 10, 2018. pp. 1-5. [cited by applicant]
Anonymous, “File based job trigger for deploying talend open studio jobs—Talend Community forum”, Retrieved from URL: https//www.talendforge.org/forum/viewtopic.php?id=45580, retrieved on Jan. 10, 2018, pp. 1-3. [cited by applicant]
Jim Gray, et al., “Transaction Processing: Concepts and Techniques—Chapter 10”, In: “The Morgan Kaufmann Series in data management systems”, Jan. 1, 1993, pp. 529-582. [cited by applicant]
Jim Gray, et al., “Transaction Processing: Concepts and Techniques—Chapter 12”, In: “The Morgan Kaufmann series in data management systems”, Jan. 1, 1993, pp. 631-657. [cited by applicant]
Mokrane Bouzeghoub, et al., “A Framework for Analysis of Data Freshness”, Information Quality in Information Systems, ACM, Jun. 18, 2004, pp. 59-67. [cited by applicant]
M. Tamer Ozsu, et al., “Princeiples of Distributed Database Systems—Chapter 13—Data Replication”, In: Principles of Distributed Database Systems, Third Edition, Mar. 2, 2011, Springer, pp. 459-495. [cited by applicant]
Office Action from Japanese Application No. 2016-501278, Mailing Date Nov. 29, 2016 (English translation and Japanese version, pp. 1-9. [cited by applicant]
Hector Garcia-Molina, et al., “Database Systems—The Complete Book Second Edition—Chapter 18—Concurrency Control”, In: “Database systems the complete book, Second Edition”, Jun. 15, 2005, pp. 883-951. [cited by applicant]
Atul Adya, et al., “Efficient Optimistic Concurrency Control Using Loosely Synchronized Clocks”, SIGMOD Record, ACM, vol. 24, No. 2, May 22, 1995, pp. 23-34. [cited by applicant]
“Oracle TimesTen In-Memory Database Architectural Overview Release 6.0”, Dated Jan. 1, 2006, Retrieved from the Internet: URL:http://downlaod.oracle.com/otn_hosted_doc/timesten/603/TimesTen-Documentation/arch.pdf, pp. 1… [cited by applicant]
Office Action mailed Jan. 5, 2023 in Chinese Patent Application No. 201910182226.0, Amazon Technologies, Inc., pp. 1-10 (including translation). [cited by applicant]