Localized data affinity system and hybrid method

US10509807B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-10509807-B2
Application numberUS-201715476105-A
CountryUS
Kind codeB2
Filing dateMar 31, 2017
Priority dateMay 17, 2010
Publication dateDec 17, 2019
Grant dateDec 17, 2019

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A method, system, and computer program for processing records is disclosed. In some aspects, a method includes associating, on at least one of the plurality of processors, each record with a record set of a plurality of record sets. Each record set is assigned to a sub-database based on the record set. A cache is associated with each sub-database, and each sub-database and its associated cache is associated with a processor set. An affinity is created between each database cache and the associated processor set, and records are processed with the processor sets according to the associations.

First claim

Opening claim text (preview).

What is claimed is: 1. A method of processing records in a database on a plurality of processors grouped into a plurality of physically separate processor sets, the method comprising: associating, on at least one of the plurality of processors, each record with a record set of a plurality of record sets; assigning each record set to a sub-database based on the record set; associating a cache with each sub-database; associating each sub-database and its associated cache with a processor set; creating an affinity between each database cache and the associated processor set; and processing the record sets with the processor sets according to the associations between the record sets, sub-databases, and the processor sets. 2. The method of claim 1 , further comprising: creating a logging cache for each processor set of the plurality of processor sets or a single logging cache for the plurality of processors; creating an affinity between each logging cache and an associated processor set; and assigning a single processor in each processor set to log database transactions, wherein each processor set comprises a plurality of processors. 3. The method of claim 1 , further comprising: creating a plurality of server processes, wherein each server process is associated with a processor set of the plurality of processor sets; creating an affinity between each server process and the associated processor set; and associating each server process with a record set, wherein each server process processes records in the associated record set. 4. The method of claim 1 , wherein routing records comprises routing records to processing sets based on a static routing table. 5. The method of claim 1 , wherein associating records comprises associating records with record sets such that there is no data dependency between record sets when processing records. 6. An apparatus comprising a plurality of processors grouped into a plurality of physically separate processor sets configured to process records in a database, wherein at least one of the physically separate processor sets is configured to: associate each record with a record set of a plurality of record sets; assign each record set to a sub-database based on the record set; associate a cache with each sub-database; associate each sub-database and its associated cache with a processor set; create an affinity between each database cache and the associated processor set; and process the records with the processor sets according to the associations between the record sets, sub-databases, and the processor sets. 7. The apparatus of claim 6 , wherein the apparatus is further configured to: create a logging cache for each processor set of the plurality of processor sets or a single logging cache for the plurality of processors; create an affinity between each logging cache and an associated processor set; and assign a single processor in each processor set to log database transactions, wherein each processor set comprises a plurality of processors. 8. The apparatus of claim 6 , wherein the apparatus is further configured to: create a plurality of server processes, wherein each server process is associated with a processor set of the plurality of processor sets; create an affinity between each server process and the associated processor set; and associate each server process with a record set, wherein each server process processes records in the associated record set. 9. The apparatus of claim 6 , wherein the apparatus is further configured to route records to processing sets based on a static routing table. 10. The apparatus of claim 6 , wherein the apparatus is further configured to associate records with record sets such that there is no data dependency between record sets when processing records. 11. A computer-readable non-transitory storage medium comprising code capable of causing a computer to: associating, on at least one of a plurality of processors, each record with a record set of a plurality of record sets; assigning each record set to a sub-database based on the record set; associating a cache with each sub-database; associating each sub-database and its associated cache with a processor set; creating an affinity between each database cache and the associated processor set; and processing the records with the processor sets according to the associations between the record sets, sub-databases, and the processor sets. 12. The computer-readable non-transitory storage medium of claim 11 , further comprising code capable of causing a computer to: create a logging cache for each processor set of the plurality of processor sets or a single logging cache for the plurality of processors; create an affinity between each logging cache and an associated processor set; and assign a single processor in each processor set to log database transactions, wherein each processor set comprises a plurality of processors. 13. The computer-readable non-transitory storage medium of claim 11 , further comprising code capable of causing a computer to: create a plurality of server processes, wherein each server process is associated with a processor set of the plurality of processor sets; create an affinity between each server process and the associated processor set; and associate each server process with a record set, wherein each server process processes records in the associated record set. 14. The computer-readable non-transitory storage medium of claim 11 , further comprising code capable of causing a computer to route records to processing sets based on a static routing table. 15. The computer-readable non-transitory storage medium of claim 11 , further comprising code capable of causing a computer to associate records with record sets such that there is no data dependency between record sets when processing records.

Assignees

Inventors

Classifications

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US10509807B2 cover?
A method, system, and computer program for processing records is disclosed. In some aspects, a method includes associating, on at least one of the plurality of processors, each record with a record set of a plurality of record sets. Each record set is assigned to a sub-database based on the record set. A cache is associated with each sub-database, and each sub-database and its associated cache …
Who is the assignee on this patent?
United States Postal Service
What technology area does this patent fall under?
Primary CPC classification G06F16/285. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Dec 17 2019 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).