System for reducing transaction failure
US-12175472-B2 · Dec 24, 2024 · US
US2019392065A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2019392065-A1 |
| Application number | US-201816016498-A |
| Country | US |
| Kind code | A1 |
| Filing date | Jun 22, 2018 |
| Priority date | Jun 22, 2018 |
| Publication date | Dec 26, 2019 |
| 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.
Methods and systems are presented for accessing various data values in a record stored in a data store independently from other data values in the record and without taking computationally expensive or storage-intensive procedures such as de-serializing a record based on a primary key. A data service module is provided to access each record in a data store, and generate for the records a table including a map of key-value pairs representing the data values in the records. When the data service module receives a request from an application for accessing a first data value in a first record, the data service module may retrieve a first key-value pair corresponding to the first data value in the first record without de-serializing the record. The data service module then provides a first value of the first key-value pair to the application.
Opening claim text (preview).
What is claimed is: 1 . A data access system comprising: a non-transitory memory; and one or more hardware processors communicatively coupled to the non-transitory memory and configured to read instructions from the non-transitory memory to perform operations comprising: accessing a record from a data store based on a particular primary key associated with the record, wherein the record comprises a plurality of data values associated with a user account organized according to a data structure; generating, for the record, a table comprising a map of key-value pairs corresponding to the plurality of data values; in response to receiving, from an application, a first request for a first data value in the record, directly accessing a first key-value pair from the table corresponding to the first data value independently from other key-value pairs in the table and without de-serializing the record based on the particular primary key; and transmitting a first value of the first key-value pair to the application via the network as a response to the first request. 2 . The system of claim 1 , wherein the operations further comprise: receiving, from the application, a second request for incrementing a second data value in the record; and updating the second data value by: (i) directly accessing a second key-value pair in the table corresponding to the second data value independently from other key-value pairs in the table and without de-serializing the record based on the particular primary key; and (ii) incrementing a second value of the second key-value pair based on the request to update the second key-value pair. 3 . The system of claim 2 , wherein the application is a first application, and wherein the operations further comprise: receiving, from a second application, a third request for updating a third data value in the record; and updating the third data value by: (i) directly accessing a third key-value pair in the table corresponding to the third data value; and (ii) modifying a third value of the third key-value pair based on the request to update the third key-value pair, wherein the update to the third data value is performed in parallel to the update to the second data value. 4 . The system of claim 3 , wherein the operations further comprise: performing a batch update process to update the record in the data storage based on the updated second key-value pair and the updated third key-value pair. 5 . The system of claim 2 , wherein the operations further comprise returning a signal indicating the second data value has been updated to the application as a response to the second request. 6 . The system of claim 2 , wherein the operations further comprise updating the record based on the updated second key-value pair. 7 . The system of claim 1 , wherein the first request comprises a first key associated with the first key-value pair. 8 . The system of claim 1 , wherein the data structure comprises a recursive data structure having a plurality of levels, and wherein the first data value is stored below a first level within the recursive data structure. 9 . The system of claim 1 , wherein the data structure is a first data structure, and wherein the operations further comprise: constructing an object having a second data structure corresponding to the data structure of the record; inserting the first value of the first key-value pair in a first position within the second data structure of the object according to a second position of the first data value within the first data structure; and providing the object to the application. 10 . A method of accessing data, comprising: retrieving a record from a data store based on a particular primary key associated with the record, wherein the record comprises a plurality of data values associated with a user account organized according to a data structure; accessing, for the record, a table comprising a map of key-value pairs corresponding to the plurality of data values; in response to receiving, from an application, a first request for updating a first data value in the record, directly accessing a first key-value pair from the table corresponding to the first data value independently from other key-value pairs in the table and without de-serializing the record based on the particular primary key; modifying a first value of the first key-value pair based on the first request to update the first key-value pair; and transmitting the modified first value to the application via the network as a response to the first request. 11 . The method of claim 10 , wherein modifying the first value comprises incrementing the value. 12 . The method of claim 10 , wherein modifying the first value comprises decrementing the value. 13 . The method of claim 10 , wherein the application is associated with a risk engine configured to evaluate a risk associated with a user request. 14 . The method of claim 13 , wherein the first value is used by the application to evaluate the risk associated with the user request. 15 . The method of claim 13 , wherein the user request comprises at least one of a login request for logging in to a user account, an electronic fund transfer request associated with the user account, or an on-boarding request associated with the user account. 16 . The method of claim 10 , wherein the application is a first application, the method further comprising: receiving, from a second application, a second request for the first data value in the record; directly accessing the first key-value pair having the modified first value based on the second request; and transmitting the modified first value to the second application via the network as a response to the second request. 17 . A non-transitory machine-readable medium having stored thereon machine-readable instructions executable to cause a machine to perform operations comprising: accessing a record from a data store based on a particular primary key associated with the record, wherein the record comprises a plurality of data values associated with a user account organized according to a data structure; generating, for the record, a table comprising a map of key-value pairs corresponding to the plurality of data values; in response to receiving, from an application, a first request for a first data value in the record, directly accessing a first key-value pair from the table corresponding to the first data value independently from other key-value pairs in the table and without de-serializing the record based on the particular primary key; and transmitting a first value of the first key-value pair to the application via the network as a response to the first request. 18 . The non-transitory machine-readable medium of claim 17 , wherein the data structure is a recursive data structure comprising at least one of a list-within-a-list structure or a map-within-a-map structure. 19 . The non-transitory machine-readable medium of claim 17 , wherein the operations further comprise: receiving, from the application, a second request for incrementing a second data value in the record; and performing an update to the second data value by: (i) directly accessing a second key-value pair in the table corresponding to the second data value independently from other key-value pairs in the table and without de-serializing the record according to the particular primary key; and (ii) incrementing a second value of the second key-value pair based on the request.
between a Database Management System and a front-end application · CPC title
Indexing structures · CPC title
involving fraud or risk level assessment in transaction processing · CPC title
specially adapted for electronic funds transfer [EFT] systems; specially adapted for home banking systems · CPC title
Updates performed during online database operations; commit processing · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.