This application relates to database management system support and more specifically to immutable support for shared ledger entries in the database management system.
Security is a priority when important data, such as financial, health, personal and business data is being shared over a network. blockchain is a technology that came into use with Bitcoin that used blockchain to exchange financial information. As important data is shared over a network using blockchain or distributed ledger technologies, security, volume and throughput becomes paramount. Emerging blockchain technologies lack the ability to support high volume concurrent transactions (e.g. 100,000s of transactions per second) and complex query/analytics support.
Database management systems are able to support complex queries and volume requirements. However, database management systems lack the immutability of blockchain data. The application described in this document provides a blockchain that will be able to support volume, security and immutability.
Example embodiments provide a method that includes at least one of receiving a new entry record, which will be stored in a database, optionally creating different encryption keys which can be used to sign and encrypt the data record and updating the new record in the database by inserting the new record and enabling the database to be unchangeable from subsequent modification attempts. Encryption keys can be optionally used to keep the data private. If the members of a corresponding blockchain decide to enable their data to be public, encryption keys need not be used for those data records that users or blockchain members would like others to read. This embodiment also provides the configuration option of having different records encrypted by different keys so the owners of those records can choose to give access to records x, y, z to users/members 1, 2, 3 and give access to records a, b, z to users/members 4, 5, 6.
One example method of operation includes at least one of receiving a new transaction request to add a record stored in a database with a new entry, encrypting the record, and updating the record by inserting the new entry and enabling the new entry to be unchangeable from subsequent modification attempts.
Another example method may include an apparatus with a receiver configured to receive a new transaction request to add a new record stored in a database with a new entry, and a processor configured to perform at least one of encrypt the record, and add the record and insert the new entry and enable the new entry to be unchangeable from subsequent modification attempts.
Yet another example embodiment may include a non-transitory computer readable storage medium configured to store instructions that when executed causes a processor to perform receiving a new transaction request to add a record stored in a database with a new entry, encrypting the record, and updating the record by adding the new entry and enabling the new entry to be unchangeable from subsequent modification attempts.
Another example embodiment may also include a method that includes receiving a request to add a record stored in a database with a new entry, updating the record by adding the new entry, and enabling the new entry to be unchangeable from subsequent modification attempts based on an immutable attribute.
Still another example embodiment may include an apparatus that includes a receiver configured to receive a new transaction request to add a record stored in a database with a new entry, and a processor configured to add the record by the new entry being inserted, and enable the new entry to be unchangeable from subsequent modification attempts based on an immutable attribute.
Yet still a further example embodiment may include a non-transitory computer readable storage medium configured to store instructions that when executed causes a processor to perform receiving a request to add a record stored in a database with a new entry, adding the record by inserting the new entry, and enabling the new entry to be unchangeable from subsequent modification attempts based on an immutable attribute.
It will be readily understood that the instant components, as generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of at least one of a method, apparatus, and system, as represented in the attached figures, is not intended to limit the scope of the application as claimed, but is merely representative of selected embodiments.
The instant features, structures, or characteristics as described throughout this specification may be combined in any suitable manner in one or more embodiments. For example, the usage of the phrases “example embodiments”, “some embodiments”, or other similar language, throughout this specification refers to the fact that a particular feature, structure, or characteristic described in connection with the embodiment may be included in at least one embodiment. Thus, appearances of the phrases “example embodiments”, “in some embodiments”, “in other embodiments”, or other similar language, throughout this specification do not necessarily all refer to the same group of embodiments, and the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
In addition, while the term “message” may have been used in the description of embodiments, the application may be applied to many types of network data, such as, packet, frame, datagram, etc. The term “message” also includes packet, frame, datagram, and any equivalents thereof. Furthermore, while certain types of messages and signaling may be depicted in exemplary embodiments they are not limited to a certain type of message, and the application is not limited to a certain type of signaling.
Example embodiments provide an application and/or software procedure which provides an operation to manage blockchain data, such as accumulating ledger transactions from customer/merchant sites. The transactions can also be included in a DBMS service operated in the cloud. The records inserted in a database can optionally be signed by a key and also encryption keys can be used to encrypt the data. In general, the blockchain permits a single shared trusted ledger between multiple entities without the need for an intermediary.
Certain DBMS can support high transaction rates, analytics, client authentication, and data replication across multiple instances of a database. Also, “chaincode/smart contracts” can be managed against the database values (i.e., stored SQL procedures). However, support for immutable transactions requires additional consideration. For example, once a transaction is inserted and committed into the DBMS, there must be some guarantee that this entry cannot be altered or deleted in any way to preserve the ledger. Also, the DBMS should support encryption to protect and control access to the transactions recorded in the ledger.
During a table update procedure, the table inserts should be immutable from third parties. As used herein, the term unchangeable or immutable may be used interchangeably. The rows in the immutable table 144 include the ledger data. The DBMS 140 enforces custom logic for the table 144 so the rows/columns cannot be altered once the row insertion is committed to the table 144. Also, the DBMS 140 may use encryption to encrypt data inserted into the ledger table 144 which keeps other user devices and accounts from access to other users' data.
In general, no users or administrators would have access to the ledger data. In the event that a user desires to provide access to their ledger data to an auditor or other users, the user would command the DBMS 140 to offer the indicated user access to the encrypted data owned by that user. This may be an individual entry (i.e., one table row) or a series of entries (i.e., three table rows) received from a common customer site. Once the data is received and logged in the ledger table 144, the DBMS 140 would use a corresponding encryption key to decrypt the data for the user that has been granted access.
When adding content to the table, new rows may be added through an ‘INSERT’ statement. Bulk loads performed via database utilities may be disallowed. Once a row is committed it cannot be updated or deleted. Inserted rows are logged and are fully recoverable. Normal DBMS backup and recovery mechanisms are permitted. However, only recovery to currency is permitted. Recovery to a prior point in time is not permitted. Altering the table to add new columns may be permitted. However, the table cannot be modified to disable the “immutable” attribute. Any database utility is permitted which does not modify the contents of the rows. For example, a ‘REORG’ utility may be permitted since this utility reclaims space, or re-orders rows for query performance but does not attempt to modify row content. However the ‘DISCARD’ option of a ‘REORG’ is not permitted since that option causes rows to be deleted from the table.
In general, a DBMS that provides support for transparent archiving can permit rows for an “immutable” table to be archived, since this fully preserves all the rows' content. The DBMS 140 can also optionally generate encryption keys to control access to the ledger. Data inserted in the ledger could optionally be encrypted using an encryption key.
One example method of operation may include receiving a new transaction request to update a record stored in a database with a new entry, encrypting the record, and updating the record by inserting the new entry and enabling the new entry to be unchangeable from subsequent modification attempts. The record may include a table and the new entry may be a new row in the table. The table includes a plurality of rows each of which are assigned to a corresponding plurality of unique encryption keys depending on the ledger transactions received. The method may also include creating encryption keys to decrypt the new entry, and forwarding the encryption keys to authorized devices. Also, the method provides receiving an insert statement, and updating the table to include the new row when the insert statement is received with the new row to the table. The method may also include receiving a database utility command, determining whether the database utility command will modify table row content, and blocking the database utility command from executing when it is determined the database utility command will modify previously updated table row content. Additionally, the method may include updating the table to include a plurality of rows, such that each row represents a ledger update from customer data transactions, and storing a plurality of unique encryption keys corresponding to the plurality of table rows.
The above embodiments may be implemented in hardware, in a computer program executed by a processor, in firmware, or in a combination of the above. A computer program may be embodied on a computer readable medium, such as a storage medium. For example, a computer program may reside in random access memory (“RAM”), flash memory, read-only memory (“ROM”), erasable programmable read-only memory (“EPROM”), electrically erasable programmable read-only memory (“EEPROM”), registers, hard disk, a removable disk, a compact disk read-only memory (“CD-ROM”), or any other form of storage medium known in the art.
An exemplary storage medium may be coupled to the processor such that the processor may read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an application specific integrated circuit (“ASIC”). In the alternative, the processor and the storage medium may reside as discrete components. For example,
As illustrated in
Although an exemplary embodiment of at least one of a system, method, and non-transitory computer readable medium has been illustrated in the accompanied drawings and described in the foregoing detailed description, it will be understood that the application is not limited to the embodiments disclosed, but is capable of numerous rearrangements, modifications, and substitutions as set forth and defined by the following claims. For example, the capabilities of the system of the various figures can be performed by one or more of the modules or components described herein or in a distributed architecture and may include a transmitter, receiver or pair of both. For example, all or part of the functionality performed by the individual modules, may be performed by one or more of these modules. Further, the functionality described herein may be performed at various times and in relation to various events, internal or external to the modules or components. Also, the information sent between various modules can be sent between the modules via at least one of: a data network, the Internet, a voice network, an Internet Protocol network, a wireless device, a wired device and/or via plurality of protocols. Also, the messages sent or received by any of the modules may be sent or received directly and/or via one or more of the other modules.
One skilled in the art will appreciate that a “system” could be embodied as a personal computer, a server, a console, a personal digital assistant (PDA), a cell phone, a tablet computing device, a smartphone or any other suitable computing device, or combination of devices. Presenting the above-described functions as being performed by a “system” is not intended to limit the scope of the present application in any way, but is intended to provide one example of many embodiments. Indeed, methods, systems and apparatuses disclosed herein may be implemented in localized and distributed forms consistent with computing technology.
It should be noted that some of the system features described in this specification have been presented as modules, in order to more particularly emphasize their implementation independence. For example, a module may be implemented as a hardware circuit comprising custom very large scale integration (VLSI) circuits or gate arrays, off-the-shelf semiconductors such as logic chips, transistors, or other discrete components. A module may also be implemented in programmable hardware devices such as field programmable gate arrays, programmable array logic, programmable logic devices, graphics processing units, or the like.
A module may also be at least partially implemented in software for execution by various types of processors. An identified unit of executable code may, for instance, comprise one or more physical or logical blocks of computer instructions that may, for instance, be organized as an object, procedure, or function. Nevertheless, the executables of an identified module need not be physically located together, but may comprise disparate instructions stored in different locations which, when joined logically together, comprise the module and achieve the stated purpose for the module. Further, modules may be stored on a computer-readable medium, which may be, for instance, a hard disk drive, flash device, random access memory (RAM), tape, or any other such medium used to store data.
Indeed, a module of executable code could be a single instruction, or many instructions, and may even be distributed over several different code segments, among different programs, and across several memory devices. Similarly, operational data may be identified and illustrated herein within modules, and may be embodied in any suitable form and organized within any suitable type of data structure. The operational data may be collected as a single data set, or may be distributed over different locations including over different storage devices, and may exist, at least partially, merely as electronic signals on a system or network.
It will be readily understood that the components of the application, as generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the detailed description of the embodiments is not intended to limit the scope of the application as claimed, but is merely representative of selected embodiments of the application.
One having ordinary skill in the art will readily understand that the above may be practiced with steps in a different order, and/or with hardware elements in configurations that are different than those which are disclosed. Therefore, although the application has been described based upon these preferred embodiments, it would be apparent to those of skill in the art that certain modifications, variations, and alternative constructions would be apparent.
While preferred embodiments of the present application have been described, it is to be understood that the embodiments described are illustrative only and the scope of the application is to be defined solely by the appended claims when considered with a full range of equivalents and modifications (e.g., protocols, hardware devices, software platforms etc.) thereto.
Number | Name | Date | Kind |
---|---|---|---|
5596747 | Katabami | Jan 1997 | A |
5751949 | Thomson | May 1998 | A |
5809539 | Sakakibara | Sep 1998 | A |
6003024 | Bair | Dec 1999 | A |
6145065 | Takahashi | Nov 2000 | A |
6336114 | Garrison | Jan 2002 | B1 |
6516317 | Samar | Feb 2003 | B1 |
6606631 | Martin, Jr. | Aug 2003 | B1 |
6662198 | Satyanarayanan et al. | Dec 2003 | B2 |
6834290 | Pugh | Dec 2004 | B1 |
7016497 | Henson | Mar 2006 | B2 |
7093137 | Sato | Aug 2006 | B1 |
7269607 | Cotner et al. | Sep 2007 | B2 |
7401358 | Christie | Jul 2008 | B1 |
7661141 | Dutta | Feb 2010 | B2 |
7831621 | Banks | Nov 2010 | B1 |
8132243 | Bychkov | Mar 2012 | B2 |
8707438 | Hsu | Apr 2014 | B1 |
8832148 | Kisin et al. | Sep 2014 | B2 |
9111114 | Choi | Aug 2015 | B1 |
9117208 | Drury et al. | Aug 2015 | B2 |
9397985 | Seger, II et al. | Jul 2016 | B1 |
9588973 | Shetty | Mar 2017 | B2 |
9674202 | Margel | Jun 2017 | B1 |
9858436 | Arnold | Jan 2018 | B2 |
10114969 | Chaney | Oct 2018 | B1 |
20040044655 | Cotner | Mar 2004 | A1 |
20040054922 | Hiraga | Mar 2004 | A1 |
20040083197 | Iwata | Apr 2004 | A1 |
20040139116 | Porter | Jul 2004 | A1 |
20040267800 | Gupta | Dec 2004 | A1 |
20050120288 | Boehme | Jun 2005 | A1 |
20060080324 | Bower | Apr 2006 | A1 |
20060288035 | Viavant | Dec 2006 | A1 |
20070074047 | Metzger | Mar 2007 | A1 |
20070198591 | Teng | Aug 2007 | A1 |
20070299816 | Arora | Dec 2007 | A1 |
20080098046 | Alpern | Apr 2008 | A1 |
20080133935 | Elovici | Jun 2008 | A1 |
20080284597 | Shah | Nov 2008 | A1 |
20080317242 | Bohush | Dec 2008 | A1 |
20080317251 | Foody | Dec 2008 | A1 |
20090019363 | Andreev | Jan 2009 | A1 |
20090182747 | Bird | Jul 2009 | A1 |
20090292711 | Konik | Nov 2009 | A1 |
20100161995 | Browning | Jun 2010 | A1 |
20100211554 | Reid et al. | Aug 2010 | A1 |
20100262625 | Pittenger | Oct 2010 | A1 |
20110219020 | Oks | Sep 2011 | A1 |
20110289447 | Kawaguti | Nov 2011 | A1 |
20120109827 | Otterstrom | May 2012 | A1 |
20120197925 | Balagopalan | Aug 2012 | A1 |
20120209884 | Mattsson | Aug 2012 | A1 |
20120254842 | Henderson | Oct 2012 | A1 |
20120323873 | Mistry | Dec 2012 | A1 |
20130238351 | Burns | Sep 2013 | A1 |
20140006458 | Hsieh | Jan 2014 | A1 |
20140052999 | Aissi | Feb 2014 | A1 |
20140095547 | Guo | Apr 2014 | A1 |
20140149387 | Konik | May 2014 | A1 |
20140289715 | Meijer et al. | Sep 2014 | A1 |
20150039901 | Freeman | Feb 2015 | A1 |
20150100606 | Bonner | Apr 2015 | A1 |
20150135327 | Wall | May 2015 | A1 |
20150227693 | Ahmed | Aug 2015 | A1 |
20150254272 | Regni | Sep 2015 | A1 |
20160048559 | Ulke | Feb 2016 | A1 |
20160048792 | Finkelstein | Feb 2016 | A1 |
20160063100 | Anton | Mar 2016 | A1 |
20160080397 | Bacastow | Mar 2016 | A1 |
20160092444 | Dornquast et al. | Mar 2016 | A1 |
20160147786 | Andrei | May 2016 | A1 |
20160188617 | Gaikwad | Jun 2016 | A1 |
20160224802 | Arnold | Aug 2016 | A1 |
20160328429 | Lipcon | Nov 2016 | A1 |
20170005804 | Zinder | Jan 2017 | A1 |
20170041322 | Kurian | Feb 2017 | A1 |
20170199920 | Pearson | Jul 2017 | A1 |
20170249472 | Levy | Aug 2017 | A1 |
20170295023 | Madhavan | Oct 2017 | A1 |
20180123790 | Itamar | May 2018 | A1 |
Entry |
---|
Alan Morrison, The Rise of Immutable Data Stores, http://www.odbms.org/2015/10/the-rise-of-immutable-data-stores/, Oct. 9, 2015, published at PwC website. |
Bryce Nyeggen, Immutable SQL, http://nyeggen.com/post/2014-02-01-immutable-sql/, Feb. 1, 2014, Blog. |
Ed Carrel, Favoring Immutability in Database Design, http://programmers.stackexchange.com/questions/105851/favoring-immutability-in-database-design, Sep. 5, 2011, Blog. |
Gregoire Jaunin, From SQL to the Immutable Database, http://blog.nexthink.com/from-sql-to-the-immutable-database/, Oct. 14, 2015, Blog. |
Rich Hickey, Intro to Datomic, http://www.datomic.com/, video. |
Bitcoin.info, https://bitcoin.info/. |
Bitcoin About Block Explorer, https://blockexplorer.com/, web tool. |
Trent McConaghy, Rodolphe Marques, Andreas Muller ,Dimitri De Jonghe, Troy McConaghy, Greg McMullen, Ryan Henderson, Sylvain Bellmare and Alberto Granzotto, Big Chain DB: A Scalable Blockchain Database, https://blockexplorer.com/, Jun. 8, 2016, GmbH, Berlin Germany. |
Mykletun, E., Narasimha, M., & Tsudik, G. (2006). Authentication and integrity in outsourced databases. ACM Transactions on Storage (TOS), 2(2), 107-138. See highlighted sections. |
Wang, J., Chen, X., Huang, X. et al. (2015). Verifiable auditing for outsourced database in cloud computing. IEEE Transactions on Computers, 64(11), 3293-3303. See highlighted section. |
Kong, L., Li, Q., Li, L. (2014). Enabling Access Control in Partially Honest Outsourced Databases. International Journal of Database Theory and Application, 7(3), 63-72. See highlighted sections. |
Foresti, S. (2011). Overview of the State of the Art. Preserving Privacy in Data Outsourcing, 9-30. See highlighted sections. |
Number | Date | Country | |
---|---|---|---|
20180026979 A1 | Jan 2018 | US |