WO2016157358A1 - Système de traitement de données - Google Patents

Système de traitement de données Download PDF

Info

Publication number
WO2016157358A1
WO2016157358A1 PCT/JP2015/059905 JP2015059905W WO2016157358A1 WO 2016157358 A1 WO2016157358 A1 WO 2016157358A1 JP 2015059905 W JP2015059905 W JP 2015059905W WO 2016157358 A1 WO2016157358 A1 WO 2016157358A1
Authority
WO
WIPO (PCT)
Prior art keywords
server
data
business
processing
servers
Prior art date
Application number
PCT/JP2015/059905
Other languages
English (en)
Japanese (ja)
Inventor
裕三 石田
浩雄 吉田
正樹 曽我
俊輔 村上
正州 根岸
Original Assignee
株式会社野村総合研究所
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 株式会社野村総合研究所 filed Critical 株式会社野村総合研究所
Priority to PCT/JP2015/059905 priority Critical patent/WO2016157358A1/fr
Priority to JP2017508882A priority patent/JP6475820B2/ja
Priority to SG11201707971YA priority patent/SG11201707971YA/en
Priority to RU2017134687A priority patent/RU2686028C2/ru
Publication of WO2016157358A1 publication Critical patent/WO2016157358A1/fr
Priority to PH12017501685A priority patent/PH12017501685A1/en

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/16—Error detection or correction of the data by redundancy in hardware
    • G06F11/20—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/16—File or folder operations, e.g. details of user interfaces specifically adapted to file systems
    • G06F16/162—Delete operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23—Updating
    • G06F16/2308—Concurrency control
    • G06F16/2315—Optimistic concurrency control
    • G06F16/2322—Optimistic concurrency control using timestamps

Definitions

  • the present invention relates to a data processing system, and more particularly to a technique for managing business data generated by a plurality of AP servers by a plurality of DB servers.
  • Patent Document 1 discloses a technique for registering data in a disk device of a primary control device, and then transmitting the same data to a sub-control device installed at a remote place and requesting the registration.
  • the master server that controls the entire process inquires of each target DB server whether the commit can be executed.
  • the DB server that is ready for update returns a “ready” response, confirms that all DB servers have completed the preparation, the master server notifies the commit start, and the database is rewritten all at once. If an error occurs in one of the databases during rewriting, the DB server where the error occurred reports the failure, and the master server notifies all servers of the withdrawal and performs a “rollback” process to restore the data.
  • Non-Patent Document 2 Non-Patent Document 2
  • the present invention has been devised in view of such a current situation, and realizes a technology capable of ensuring the speed of processing while preserving the same data in a plurality of DB servers. It is an object.
  • a data processing system is a data processing system including a plurality of AP servers and a plurality of DB servers, and the DB servers are common to each other.
  • Each table is provided with a table for storing business data, and each table has a restriction that only records can be referenced and added, and deletion and updating are prohibited.
  • the function to execute common business processing for requests sent from client terminals, and the business data generated as a result of processing are sent to each DB server above, It has a function to request additional registration, and each business data mentioned above is assigned a unique ID including an identification code to identify the AP server that generated it.
  • each DB server above stores a responsible AP definition table that defines for each business process the AP server responsible for the specific business process for which exclusive control is required. If the business process request sent from the client terminal does not require exclusive control, it executes it by itself, whereas if it requires exclusive control, refer to the AP definition table in charge, and After identifying the AP server that should be in charge of business processing, delegate the relevant processing to the relevant AP server, and the responsible AP server that received this temporarily stores the delegated business processing in the queue, Each business process is executed in order according to the rules of the FIFO.
  • the data processing system according to claim 2 is the system according to claim 1, and in addition to the main AP application server, the main AP application server performs a process when the main AP application server does not function.
  • a feature is that the sub AP server to be assigned is defined for each business process.
  • the data processing system is the system according to claim 1 or 2, and each of the business data is stamped with a time stamp at the time of business processing execution.
  • new business data with an ascending ID different from the business data, the corrected data, and the time stamp at the time of correction is generated, and the business data for updating is also generated. It is characterized in that existing business data is substantially updated by additionally registering in a corresponding table provided in each DB server.
  • the data processing system is the system according to claims 1 to 3, and further, when the AP server needs to delete the existing business data, the ID of the business data is to be canceled. Generate business data for data cancellation with data items to be stored, and add the business data for data cancellation to the cancellation-dedicated table provided in each DB server to effectively store the existing business data. It is characterized by being deleted.
  • business data generated by the AP server is simultaneously transmitted to a plurality of DB servers and is registered in duplicate in each table, so that the integrity of business data can be improved. it can.
  • it is prohibited to delete or update data that requires complicated processing in the event of a failure. Data can be recovered simply by copying the missing data from another DB server. Therefore, it is not necessary to adopt a strict arbitration method such as a two-phase commit, and it is possible to determine that registration is complete when a receipt notification is simply returned from each DB server.
  • each AP server can freely process a business process that does not require exclusive control. Therefore, the processing efficiency of the entire system can be improved by load balancing.
  • the processes are aggregated in the AP server preset in the assigned AP definition table and processed according to the FIFO rules. It is possible to effectively avoid the generation of contradictory data. Because the business data generated in each AP server is assigned a unique ID including the identification code of each AP server, even if business data is transmitted from each AP server to the DB server, Each ID does not overlap, ensuring absolute uniqueness.
  • the DB server table is provided with a restriction that prohibits deletion and update of records.
  • substantial update of business data and Deletion can be realized.
  • FIG. 1 is an overall configuration diagram of a data processing system 10 according to the present invention.
  • a first AP server 14 a first DB server 16, and a second DB server 18 are installed.
  • a second AP server 22, a third DB server 24, and a fourth DB server 26 are installed in the second data center 20 located in Osaka.
  • Each of the first AP server 14 and the second AP server 22 has the same application program, and executes the same business process for the request transmitted from the client terminal 28 via the communication network 27 such as the Internet. It has the function to do.
  • first AP server 14 and the second AP server 22 are shown, but in reality, a plurality of AP servers having the same function are installed in each data center, and a load (not shown) is shown. Load distribution is achieved through a balancer. In this way, if multiple AP servers are provided in the same data center, even if any AP server is planned or unplanned, it is the same without switching to an AP server in another data center. The remaining AP server in the data center can be replaced, and downtime can be minimized.
  • the number of DB servers is not limited, and three or more DB servers can be installed in each data center.
  • the first DB server 16, the second DB server 18, the third DB server 24, and the fourth DB server 26 each have a common table, and the same data is stored in each table.
  • each DB server has a point addition table 50, an addition cancellation table 51, a point application table 52, an application cancellation table 53, and a responsible AP definition table 54 in common. .
  • point addition table 50 data items such as an addition ID, an account, the number of points, and a time stamp are set. Further, in the addition cancellation table 51, data items such as cancellation targets and time stamps are set.
  • point application table 52 data items such as an application ID, an account, the number of points, and a time stamp are set.
  • application cancellation table 53 data items such as a cancellation target and a time stamp are set.
  • assigned AP definition table 54 data items such as an assigned AP definition ID, an account, a primary assigned AP, and a secondary assigned AP are set.
  • a unique identification code using an artificial key is stored (details will be described later).
  • the first AP server 14 is connected to the first DB server 16 and the second DB server 18 via the LAN, and is installed in the second data center 20 via the communication line 29.
  • the DB server 24 and the fourth DB server 26 are also connected.
  • the second AP server 22 is connected to the third DB server 24 and the fourth DB server 26 via the LAN, and is installed in the first data center 12 via the communication line 29.
  • the first DB server 16 and the second DB server 18 are also connected.
  • the client terminal 28 installed in eastern Japan is connected to the first AP server 14 installed in the first data center 12, and the client terminal 28 installed in western Japan is connected to the second data center 20. It is connected to a second AP server 22 installed inside.
  • each data center normally provides services to neighboring client terminals 28, but also provides services to client terminals 28 nationwide in the event of a disaster.
  • DB servers usually need to keep data of the same content mutually.
  • the AP server can request any DB server to extract data when referring to the data. Dispersion can be achieved.
  • the number of data centers is not limited to two. As many data centers as possible are provided in various locations, and multiple AP servers with the same functions are installed in each data center. It is desirable to connect to all DB servers via a communication network.
  • FIG. 3 shows the internal configuration of the first AP server 14 and the second AP server 22.
  • the business processing unit 30, the artificial key management unit 32, the data control unit 34, and a plurality of DB communications are shown. Part 38.
  • the business processing unit 30 executes data generation processing, arithmetic processing, registration processing in the DB server, etc. in response to a request from the client terminal 28, and the AP server CPU operates according to a dedicated application program. Is realized.
  • the artificial key management unit 32 has a function of issuing an artificial key (surrogate key) in response to a request from the business processing unit 30 (details will be described later).
  • the artificial key management unit 32 is realized by the CPU of the AP server operating according to dedicated middleware.
  • the data control unit 34 When the data control unit 34 receives a data registration instruction from the business processing unit 30, the data control unit 34 has a function of replicating data as many as the number of DB servers and passing them to the DB communication unit 38. This is realized by the CPU of the AP server operating according to the above. In addition, the data control unit 34 has a function of receiving an instruction from the artificial key management unit 32 and instructing the DB communication unit 38 in charge of each DB server installed in the same data center to update the artificial key management data. (Details will be described later).
  • Each DB liaison unit 38 performs functions such as issuing an SQL statement to a DB server assigned to itself in advance and instructing additional registration and reference of data, and the CPU of the AP server according to dedicated middleware. It is realized by operating.
  • the business processing unit 30 that has generated data as a result of the business processing requests the artificial key management unit 32 to designate a table and issue an artificial key (S10).
  • the artificial key management unit 32 In the case of generating data to be stored in the above point addition table 50, it is requested to issue an artificial key for “addition ID”.
  • the artificial key management unit 32 refers to the artificial key management table 56 stored in the DB server installed in the same data center (S12), and works on the latest artificial key related to the point addition table 50.
  • the processing unit 30 is notified (S14).
  • the artificial key management table 56 includes data items of “table ID”, “AP server ID”, and “next key value”, in units of “table ID” + “AP server”. The latest artificial key (next key value) is managed.
  • the “artificial key” is a numerical value having a predetermined length (for example, 32 bits or 64 bits). In the last digit (end) of the numerical value, an identification code (any numerical value from 0 to 9) for specifying the AP server that generated the data is set.
  • the relationship between the ID of each AP server and a numerical value of 0 to 9 is defined in the lower-order digit management table 57 of the artificial key.
  • the AP server management table 58 and the data center management table 59 the relationship between each AP server and the data center is defined. Similar to the artificial key management table 56, the lower one digit management table 57, the AP server management table 58, and the data center management table 59 of these artificial keys are also stored in the DB server in the same data center.
  • the artificial key management unit 32 that has finished notifying the latest value of the artificial key to the business processing unit 30 updates the value of each record in the artificial key management table 56 (S16). Specifically, for the “next key value” in the point addition table 50 related to the AP server, “the last value (the latest value above) is composed of the part excluding the identification code at the end. Is set to a value obtained by adding 1 to a numerical value.
  • the update method of the latest value of the artificial key is not limited to such “ascending order”, but “in the immediately preceding value (the latest value described above) excluding the identification code at the end. It may be “descending order” in which “a value obtained by subtracting 1 from a configured numerical value” is set.
  • the identification code of the AP server is not limited to the numerical value of “0 to 9” as described above, and other character types may be used. Further, an identification code may be inserted at the head of the artificial key. Further, only the numerical value excluding the AP server identification code is stored in the “next key value” of the artificial key management table 56, and the artificial key management unit 32 sets the corresponding identification code at the time of issuing the artificial key. It can also be added to the end of the numerical value and issued to the business processing unit 30.
  • the business processing unit 30 Upon receiving the latest artificial key from the artificial key management unit 32, the business processing unit 30 generates data in which the artificial key is set as an ID in a primary key or an external key (S18). This data is transmitted to all DB servers via the data control unit 34 and the DB communication unit 38, and is additionally registered in a corresponding table (point addition table 50) provided for each.
  • the uniqueness of the artificial key is ensured in units of “AP server x table”, and each AP server is associated with a specific data center in the data center management table 59. Even if an artificial key is issued, the uniqueness of the last digit is ensured, so there is no risk of duplicated artificial keys being issued, and the uniqueness of each data is reliably ensured.
  • Data generated by the business processing unit 30 of each AP server is stored in a table in each DB server as described above, but deletion (delete) prohibition and update (update) prohibition in each table These restrictions are imposed in advance. In short, in this system 10, only addition (insert) and reference (select) to each table is allowed.
  • application revocation data is added to the application revocation table 53 when the point application data is invalidated. Since the application ID of the point application data to be invalidated is filled in the “cancellation target” of this application cancellation data, the business processing unit 30 applies the application among the point application data registered in the point application table 52. Those whose IDs are registered in the application cancellation table 53 are not counted.
  • the registration data needs to be corrected in this system 10
  • a new addition ID in ascending order different from the addition ID of the point addition data is paid out, and the point addition data in which the number of points is changed in the same account Add to 50.
  • the data before correction and the data after correction are stamped with millisecond precision time stamps, and each is given an addition ID that is different in ascending order. Can definitely be identified.
  • each DB server has a function to execute the same business process.
  • Service can be provided, and load distribution of the entire system 10 can be performed.
  • the business processing unit 30 of the second AP server 22 (S10 in FIG. 7) receives the addition ID from the artificial key management unit 32, and then generates point addition data (S12). .
  • the business processing unit 30 requests the first DB server 14 to the fourth DB server 26 to additionally register the point addition data via each DB communication unit 38 (S14).
  • the first DB server 14 to the fourth DB server 26 add the point addition data to the respective point addition tables 50 all at once.
  • the business processing unit 30 calculates the point balance of the user (S16). Specifically, all point addition data associated with the account is acquired from any DB server (S16-01 in FIG. 8), and an addition ID is extracted from each point addition data (S16-02). Next, this addition ID is transmitted to an arbitrary DB server, and corresponding addition cancellation data is acquired (S16-03). Then, except for the point addition data in which the addition cancellation data is registered, the number of points of the remaining valid point addition data is totaled (S16-04), thereby determining the number of addition points of the user.
  • the point card account (card number) from the client terminal 28B and the number of points applied according to the price of the purchased product are sent to the second AP server 22. Sent.
  • the business processing unit 30 of the second AP server 22 (S30 in FIG. 9) is in charge of the point application process for the account by referring to the assigned AP definition table in any DB server.
  • the AP server to be executed is specified (S32). And if it happens that self is designated as the main AP server, the point application process described later is executed as it is, but another AP server (for example, the first AP server 14) is designated as the responsible AP server. If so, the request (account, number of applied points, etc.) is transferred to the corresponding AP server, and the point application processing is delegated (S34).
  • the first AP server 14 that has received this processing delegation temporarily stores this request in the FIFO queue (S36), and then executes the point application processing in order (S38).
  • This point application process specifically follows the following procedure. First, the first AP server 14 calculates the point balance of the account by the same procedure as described above (S38-01 in FIG. 10).
  • point application data is generated within the range of this point balance (S38-02). For example, if the current point balance exceeds the number of application points this time, the business processing unit 30 receives the application ID issued from the artificial key management unit 32, and then the point application data (application ID, account, number of points) , Timestamp). Then, all the DB servers are requested to register additional point application data (S38-03). On the other hand, if the point balance is less than the number of applied points at this point, the business processing unit 30 generates point application data for the remaining number of points and requests all DB servers to perform additional registration. As a result, the point balance of the account becomes zero.
  • the first AP server 14 that has completed the delegated point application processing notifies the second AP server 22 of the processing result (number of applied points and point balance) (S40 in FIG. 9).
  • the business processing unit 30 of the second AP server transmits the processing result to the client terminal 28B (S42). That is, when points can be applied for the total purchase amount, the client terminal 28B is notified of this and the point balance. On the other hand, when the points are applied only to a part of the purchase amount, the client terminal 28B is notified of the fact and the shortage amount. At this time, cash payment is made for the shortage at the store.
  • the processing authority is transferred from the second AP server 22 to the first AP server 14, and the first AP server 14 determines the FIFO.
  • the point application process is executed according to the rule. For this reason, even if a point application request related to the same account is transmitted from the client terminal 28C to the first AP server 14 at substantially the same time, adjustments between competing requests can be made according to FIFO (first-in first-out) rules.
  • FIFO first-in first-out
  • the assigned AP definition table 54 stores the secondary assigned AP in addition to the primary assigned AP, so if the AP server designated as the primary assigned AP is down, the secondary assigned AP is immediately available. Authority can be delegated to the AP server. If it is uneasy only to prepare the sub AP server, a lower AP server such as the sub AP can be set in advance.
  • the assigned AP definition table 54 is stored in all DB servers, so even if any DB server is temporarily down, the AP server identifies the main assigned AP server from other DB servers. It becomes possible.
  • the type of business processing that requires exclusive control (point application processing) is defined in the application program, and the correspondence between the processing target (account) and the AP server is defined in the assigned AP definition table 54. It is not limited to the method defined on the side.
  • an arrival table 60, an arrival cancellation table 61, a shipping table 62, a shipping cancellation table 63, and a responsible AP definition table 64 are stored in each DB server. Keep it inside.
  • the arrival table 60 data items such as an arrival ID, a product code, the number, and a time stamp are set. Further, in the arrival cancellation table 61, data items such as a cancellation target and a time stamp are set.
  • the shipping table 62 data items such as a shipping ID, a product code, the number of items, and a time stamp are set.
  • the shipping cancellation table 63 data items such as a cancellation target and a time stamp are set.
  • the assigned AP definition table 64 data items such as assigned AP definition ID, product code, main assigned AP, and sub-assigned AP are set. In the above-mentioned arrival ID and shipping ID, a unique identification code using an artificial key is stored.
  • the main AP server temporarily stores the order request in the FIFO queue, and executes the processing in order from the earliest. That is, the business processing unit 30 of the main AP server calculates the stock of the product related to the product code included in the order request, and if the number included in the order request is within the stock range, Generate and request all DB servers to add to the shipping table 62. Thereafter, the processing result is notified from the consignee AP server to the consignee AP server. When the inventory of the product is less than the number of orders, the consignee AP server notifies the consignment AP server of the result of the shortage of inventory without generating shipping data.
  • the application program for the business processing unit 30 defines in advance processing that requires exclusive control (order reception processing) and unnecessary processing (arrival reception processing, inventory confirmation processing). It is necessary to keep it.
  • exclusive control order reception processing
  • unnecessary processing arrival reception processing, inventory confirmation processing
  • there are some products such as software and electronic books sold in download format that do not need to worry about the number of stocks depending on the sales target. In such a case, it is required to define the necessity of exclusive control for each target product (for each product code) even in the same order receiving process.
  • Each DB server in this system 10 receives the data to be added from the DB contact unit 38 and stores it in its own memory, and then sends a receipt completion notice to the DB contact unit 38. Thereafter, the hard disk, SSD, etc. The corresponding record is stored in a table provided in the external storage device.
  • the reception completion notification transmitted from the DB server is collected in the data control unit 34 via each DB communication unit 38.
  • the data control unit 34 outputs a registration completion notification to the business processing unit 30 when reception completion notifications are returned from all the DB communication units 38.
  • the business processing unit 30 recognizes the data as a target to be read when the registration notification completion notification is received from the data control unit 34. In other words, until the registration completion notification is returned, the business processing unit 30 excludes the data from being read, and the registration timing in each DB server is shifted and incorrect data is read. It avoids the danger of end up.
  • the data control unit 34 recognizes that a communication failure or machine trouble has occurred and places the DB server in offline mode. Transition. Specifically, the DB server is temporarily disconnected from the system 10, and the operation mode is based on only the remaining DB servers. That is, when a reception completion notification has been received from all DB servers other than the separated DB server, a registration completion notification is output from the data control unit 34 to the business processing unit 30, and the registered data is to be read.
  • the disconnected DB server is inspected and necessary recovery measures are taken. For example, if it is determined that the receipt completion notification has not arrived due to a failure of the communication device, after replacing the communication device with a new communication device, the DB server is set to the write mode (only data writing is permitted and data reference is not allowed). (Prohibited state) and copy the difference data from another DB server installed in the same data center.
  • the DB server When the stored data catches up to the latest state, the DB server is set to the read / write mode (a state in which data writing and reference is permitted) and reconnected to the system 10. Thereafter, the data control unit 34 resumes data transmission / reception via the DB communication unit 38 in charge of the DB server.
  • each business data is allowed to be added only, and a rule that does not allow deletion or update is applied. Therefore, data recovery is extremely easy.
  • deletion or update of data is allowed, in order to recover data, addition, deletion, or update of data is started from a certain point based on the update history information held by the DB server. It must be reproduced in order, and this takes a long time and a large load.
  • the task processing unit 30 can read the data.
  • memory is a volatile storage means, and data is lost when power supply is stopped, so when data is stored in a nonvolatile storage means (hard disk, etc.) A notification should be returned.
  • a nonvolatile storage means hard disk, etc.
  • the above-mentioned various business data are stamped with a millisecond precision time stamp by the business processing unit 30 as described above. Even when the value of MAX reaches MAX and IDs that are already issued are reissued (recycled), the business processing unit 30 can determine old and new data by comparing time stamps.
  • each AP server handles business processes that do not require exclusive control.
  • business processing that requires exclusive control can also be effectively applied to consolidating processing authority to a preset AP server.
  • FIG. 1 is an overall configuration diagram of a data processing system according to the present invention. It is a figure which shows an example of the table stored in each DB server. It is a block diagram which shows the internal structure of a 1st AP server and a 2nd AP server. It is a flowchart which shows the issuing procedure of an artificial key. It is a figure which shows structures, such as an artificial key management table. It is a schematic diagram which shows the process sequence at the time of applying this system to point management business. It is a flowchart which shows the procedure of a point addition process. It is a flowchart which shows the procedure of a balance calculation process. It is a flowchart which shows the process sequence which concerns on the exclusive control between AP servers. It is a flowchart which shows the procedure of a point application process. The It is a figure which shows the other example of the table stored in each DB server.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Quality & Reliability (AREA)
  • Human Computer Interaction (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Computer And Data Communications (AREA)
  • Multi Processors (AREA)
  • Hardware Redundancy (AREA)

Abstract

Le problème décrit par la présente invention est d'assurer la rapidité de traitement lors de la conservation des mêmes données sur une pluralité de serveurs de BDD. La solution de l'invention concerne un système de traitement de données (10) qui est pourvu d'une pluralité de serveurs de point d'accès (AP) et d'une pluralité de serveurs de base de données (BDD), dans lequel chaque serveur de BDD est doté d'une table partagée qui mémorise des données de travail partagé, la suppression et la mise à jour des enregistrements étant interdites. Chaque serveur d'AP est connecté à tous les serveurs de BDD, exécute un traitement de travail partagé, transmet des données de travail qui sont un résultat de traitement à chaque serveur de BDD et demande l'ajout à une table correspondante. Un ID comprenant un code d'identification pour le serveur d'AP exécutant est attribué à chaque élément de données de travail et une table de définition d'AP responsable, qui définit un serveur d'AP qui est responsable du traitement de travail spécifié pour lequel on cherche une commande exclusive, est mémorisée dans chaque serveur de BDD. Chaque serveur d'AP, dans l'éventualité d'un traitement nécessitant une commande exclusive, consulte la table de définition d'AP responsable, identifie le serveur d'AP responsable et transfère le traitement vers celui-ci. Le serveur d'AP responsable mémorise ce traitement de travail dans une file d'attente et exécute ensuite ledit traitement dans l'ordre en suivant la méthode PEPS.
PCT/JP2015/059905 2015-03-30 2015-03-30 Système de traitement de données WO2016157358A1 (fr)

Priority Applications (5)

Application Number Priority Date Filing Date Title
PCT/JP2015/059905 WO2016157358A1 (fr) 2015-03-30 2015-03-30 Système de traitement de données
JP2017508882A JP6475820B2 (ja) 2015-03-30 2015-03-30 データ処理システム
SG11201707971YA SG11201707971YA (en) 2015-03-30 2015-03-30 Data processing system
RU2017134687A RU2686028C2 (ru) 2015-03-30 2015-03-30 Система обработки данных
PH12017501685A PH12017501685A1 (en) 2015-03-30 2017-09-14 Data processing system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2015/059905 WO2016157358A1 (fr) 2015-03-30 2015-03-30 Système de traitement de données

Publications (1)

Publication Number Publication Date
WO2016157358A1 true WO2016157358A1 (fr) 2016-10-06

Family

ID=57005853

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2015/059905 WO2016157358A1 (fr) 2015-03-30 2015-03-30 Système de traitement de données

Country Status (5)

Country Link
JP (1) JP6475820B2 (fr)
PH (1) PH12017501685A1 (fr)
RU (1) RU2686028C2 (fr)
SG (1) SG11201707971YA (fr)
WO (1) WO2016157358A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2019212109A (ja) * 2018-06-06 2019-12-12 株式会社インテック データ処理装置、データ処理方法及びプログラム

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH11219309A (ja) * 1997-09-29 1999-08-10 Ricoh Co Ltd 分散型データベースシステムの一貫性管理方法およびその方法の各工程をコンピュータに実行させるためのプログラムを記録したコンピュータ読み取り可能な記録媒体
JP2002202904A (ja) * 2000-10-31 2002-07-19 Toshiba Corp データ管理方法およびコンピュータ読み取り可能な記録媒体
JP2002297428A (ja) * 2001-03-29 2002-10-11 Toshiba Corp 分散データ管理システム、分散データ管理方法及び分散データ管理プログラム
JP2013235328A (ja) * 2012-05-07 2013-11-21 Nomura Research Institute Ltd データ管理システム

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6583716B2 (en) * 2001-08-15 2003-06-24 Motorola, Inc. System and method for providing location-relevant services using stored location information
US7370064B2 (en) * 2002-08-06 2008-05-06 Yousefi Zadeh Homayoun Database remote replication for back-end tier of multi-tier computer systems
US7668870B1 (en) * 2004-04-15 2010-02-23 Citicorp Development Center, Inc. Methods and systems for updating web pages via a web data instant update utility
JP5878232B2 (ja) * 2012-03-13 2016-03-08 株式会社野村総合研究所 データ処理システム
JP5604478B2 (ja) * 2012-07-10 2014-10-08 株式会社野村総合研究所 データ利用システム

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH11219309A (ja) * 1997-09-29 1999-08-10 Ricoh Co Ltd 分散型データベースシステムの一貫性管理方法およびその方法の各工程をコンピュータに実行させるためのプログラムを記録したコンピュータ読み取り可能な記録媒体
JP2002202904A (ja) * 2000-10-31 2002-07-19 Toshiba Corp データ管理方法およびコンピュータ読み取り可能な記録媒体
JP2002297428A (ja) * 2001-03-29 2002-10-11 Toshiba Corp 分散データ管理システム、分散データ管理方法及び分散データ管理プログラム
JP2013235328A (ja) * 2012-05-07 2013-11-21 Nomura Research Institute Ltd データ管理システム

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2019212109A (ja) * 2018-06-06 2019-12-12 株式会社インテック データ処理装置、データ処理方法及びプログラム

Also Published As

Publication number Publication date
RU2017134687A (ru) 2019-04-05
RU2686028C2 (ru) 2019-04-23
SG11201707971YA (en) 2017-10-30
PH12017501685A1 (en) 2018-03-19
JP6475820B2 (ja) 2019-02-27
RU2017134687A3 (fr) 2019-04-05
JPWO2016157358A1 (ja) 2018-01-18

Similar Documents

Publication Publication Date Title
CN100536417C (zh) 网格许可服务器和容错网格系统及使用方法
US11768885B2 (en) Systems and methods for managing transactional operation
US7603354B2 (en) Method for enhancing the operation of a database
US11669573B2 (en) Data management system
US8830831B1 (en) Architecture for balancing workload
US11169984B2 (en) Data management system
JP6475820B2 (ja) データ処理システム
JP2015165357A (ja) データ管理システム
JP4406310B2 (ja) Ｍｑデータ同期システム及びｍｑデータ同期プログラム
JP6530337B2 (ja) トランザクション制御システムおよびトランザクション制御方法
CN109976944B (zh) 数据处理方法和系统，存储介质和电子设备
WO2017077643A1 (fr) Système de gestion de données
JP6172294B2 (ja) トランザクション分散処理装置、方法、システム、および、記憶媒体
WO2015133271A1 (fr) Système de gestion de données, système de fourniture de service et procédé pour étendre sa fonctionnalité
JP6359762B2 (ja) 口座データ管理システム
JP7368531B2 (ja) ブロックチェーンに基づく部屋在庫管理システム
US11762643B2 (en) System using blockchain
JP6325494B2 (ja) データ分散管理システムとその動作方法
US20130282667A1 (en) Method and system for implementing a conditional redo repeater
Song Redesign Tactilon Agnet database in distributed environment
JPWO2016157359A6 (ja) 口座データ管理システム
KR20080017156A (ko) Ｉｔ 인프라 운영 관리 시스템 및 그 방법
WO2017081737A1 (fr) Système de gestion de données

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15887511

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 12017501685

Country of ref document: PH

ENP Entry into the national phase

Ref document number: 2017508882

Country of ref document: JP

Kind code of ref document: A

WWE Wipo information: entry into national phase

Ref document number: 11201707971Y

Country of ref document: SG

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 2017134687

Country of ref document: RU

122 Ep: pct application non-entry in european phase

Ref document number: 15887511

Country of ref document: EP

Kind code of ref document: A1