Patent ID: 12259905

The drawings are not necessarily to scale. The drawings are merely representations, not intended to portray specific parameters of the invention. The drawings are intended to depict only typical embodiments of the invention, and therefore should not be considered as limiting in scope. In the drawings, like numbering represents like elements.

DETAILED DESCRIPTION

The descriptions of the various embodiments of the present invention will be presented for purposes of illustration but are not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.

The data analysis system may, for example, be a data warehousing system or master data management system. The data analysis system may enable data warehousing or master data management or another technique that uses a source and target database systems, wherein the target database system comprises a target database that is configured to receive/comprise a copy of a content of a corresponding source database of the source database system. The source database system may, for example, be a transactional engine and the target database system may be an analytical engine. For example, the source database system may be an online transaction processing (OLTP) system and the target database system may be an online analytical processing (OLAP) system. The source database system may comprise a source dataset and the target database system may comprise a target dataset. The source dataset may be part of a source database and the target dataset may be part of a target database. The source and target datasets may be stored in a same or different format. The formats may differ in encryption, compression, row-oriented vs. column-oriented storage, etc. For example, the source dataset may be stored in a row-oriented format and the target dataset may be stored in a column-oriented format. In other terms, the target dataset may be stored by column rather than by row. The content of the source dataset may be changed by one or more database transactions. The data analysis system may be log-based database replication system.

The target database system may comprise multiple target database nodes. The source database system may be connected to each of the target database nodes via a direct connection. The connection may, for example, be a TCP/IP connection or another connection enabling the communication of data via the connection between the source database system and the target database node. The target database node may comprise one or more database partitions. The database partition may be a part of a table that consists of its own data, indexes, configuration files, and transaction logs. Each of the target database nodes may store records of a table based on a value of a distribution key of the table. A data record or record of a table is a collection of related data items or attributes such as a name, date of birth and class of a particular user. A record represents an entity, wherein an entity refers to a user, object, or concept about which information is stored in the record. The data record may comprise values of a set of attributes. The distribution key of a table may be an attribute or group of attributes that may be used to determine the database partition in which a particular data record of the table is stored.

The data analysis system may be configured to replicate changes that occur in a source table of the source database system to the target database system so that said changes may be applied on a target table of the target database system that corresponds to the source table. Applying a change may, for example, comprise inserting one or more records and/or updating one or more records and/or deleting one or more records in one or more tables of the target database system. For that, multiple application algorithms (which may also be referred to as update strategies) may be provided, wherein each application algorithm specifies a sequence of replication operations to be performed in order to apply changes to the target database system. The application algorithms may, for example, comprise an incremental load-based algorithm and a bulk-load based algorithm. The incremental load-based algorithm may propagate changes with a frequency higher than a defined minimum frequency. The incremental load-based algorithm may, for example, require that each recorded change of a log record is applied individually in the target database system. The incremental load-based algorithm may particularly be advantageous for small data sets, because the overhead for large chunks may be high. The bulk-load based algorithm may propagate changes with a frequency smaller than a defined maximum frequency. The bulk load-based application algorithm may, for example, require that the recorded changes of log records are staged into batches. Those batches may then be applied via a bulk load interface to the target database system. The bulk load-based application algorithm may advantageously be used for large datasets. However, the overhead to setup the bulk load may be too high and should not be spent for small-sized chunks that are comprised of just a few rows.

The present subject matter may enable an efficient replication of changes in the data analysis system. The replication is efficient in that the changes are directly sent to the target nodes where they have to be applied. This may prevent proxying all data via a single target node and thus prevents an additional data transfer for all rows that are not stored on the single target node. If direct network connections are supported by additional hardware, between the source database system and each target node, the overall transfer bandwidth may be maximized compared to proxying all data via as single target node.

According to one embodiment, the method further comprises repeating the method for further received change records, thereby distributing the change records to respective target database nodes through respective direct connections.

According to one embodiment, the method is concurrently performed for the change records.

According to one embodiment, the method further comprises: determining a distribution rule of the target database system, the distribution rule being configured to assign a value of the distribution key to a respective target node, wherein selecting the target database node comprises applying the distribution rule on the determined value of the distribution key.

According to one embodiment, selecting the target database node for storing the data record comprises: providing a distribution map of hash values to connection numbers, wherein each connection number indicates a connection between the source database system and a respective target database node, computing a hash value of the determined value of the distribution key of the data record, using the distribution map for assigning the computed hash value to a connection number, wherein the connection is established according to the connection number.

According to one embodiment, receiving the change record comprises reading a transaction recovery log indicating transactions to be replicated to the target database system.

According to one embodiment, the type of operation includes at least one of inserting, deleting or updating a data record.

According to one embodiment, the distribution key comprises one or more attributes of the data record.

FIG.1is a block diagram of a data analysis system100in accordance with an example of the present subject matter. The data analysis system100may be configured for data synchronization between a source database system101and target database system103using data synchronization system102in accordance with an example of the present subject matter. The source database system101may, for example, be an online transaction processing (OLTP) system. The target database system103may, for example, be an online analytical processing (OLAP) system.

The source database system101comprises one or more source tables125of a source database and a transaction recovery log106. Source tables125can be relational tables in DB2® for z/OS®, DB2 for Linux, UNIX, and Windows, and Oracle. The entries (also referred to as log records or change records) of the transaction recovery log106describe changes to rows or records of the source tables125at the source database system101.FIG.1shows an example content of a change record130. The change record130may comprise a timestamp, LRSN and attribute changes. More specifically, the change records in the transaction recovery log106may, for example, contain information defining (1) the table being changed, (2) the value of the distribution key in the row being changed, (3) the old and new values of all columns of the changed row, and (4) the transaction (unit of work) causing the change. By definition, an insert is a new data record and therefore has no old values. For delete changes, there is by definition no new data record, only an old data record. Thus, transaction change records for inserted rows may contain only new column values while transaction change records for deleted rows may contain only old column values. Transaction change records for updated rows may contain the new and old values of all row columns. The order of change records in the transaction recovery log106may reflect the order of change operations of the transactions. The type of row operations in transaction change records can, for example, be delete, insert or update.

The target database system103may comprise N target database nodes105A-105N, where N≥2. Each of the target database nodes105A-105N may comprise portions of target tables that correspond to the source tables125respectively. As illustrated inFIG.1, the source table T1has a corresponding target table T1′. The target table T1′ may be split over and stored on different partitions. For example, some of the rows of the table T1′ may be stored on the target database node105A e.g., in the partitions P1A and P2A and other rows of the table T1′ may be stored on the target database node105N e.g., in the partitions P1N and P2N. The content of the target table T1′ and the source table T1may be synchronized so that changes to the source table T1may be applied to the target table T1′. An incremental update of the target tables T1′ may be performed so that changes to the source tables T1are propagated to the corresponding target tables T1′ with a high frequency and just a brief delay (e.g., the frequency of change propagation is higher than a defined minimum frequency); the data synchronization system102may thus be referred to as log-based incremental update system. For that, each of the target database nodes105A-105N may comprise an apply program108A-108N. Each of the apply programs108A-108N may be configured to receive streams of change records e.g., via a log streaming interface. Each of the apply programs108A-108N may buffer the received change records and consolidate the changes into batches to improve efficiency when applying the modifications to the target tables of the target database e.g., via a bulk-load interface. In integrated synchronization, the extraction and preparation of the change records into batches may be done single threaded. Each of the apply programs108A-108N may be configured to apply changes indicated in the change records into the target table via a respective data change apply interface109A-N of the target database node. The target database system103may further comprise a metadata catalog and a target database management system119. The metadata catalog comprises cluster metadata and table metadata115. The table metadata115comprises information on the distribution keys of the target tables. The cluster metadata comprises information on target nodes such as their number and storage properties.

The data synchronization system102comprises a log reader104. Although shown as part of the data synchronization system102, the log reader104may, in another example, be part of the source database system101. The log reader104may read change records of the transaction recovery log106and provide them to a cluster apply component117. The cluster apply component117comprises a distribution module120and a list of connections121. The list of connections121may refer to connections between the cluster apply component117and the target database nodes105A-N. As sown inFIG.1, the cluster apply component117has direct connections133A-N to the respective target database nodes105A-N. These connections may be established once when the incremental update pipeline is configured with help of the target database system metadata and may be adjusted, e.g., if the distribution key or the cluster topology changes. The connections may, for example, be TCP/IP connections. The connections may, for example, be referenced by connection umbers or connection names such as “Node A” as indicated inFIG.1. The distribution module120may obtain the distribution key associated with the table T1from the target database management system119. The distribution module120may process each of the change records received at the cluster apply component117in order to read the value(s) of the distribution key and select one of the target database nodes105A-105N of the target database system103where the change record shall be applied. The cluster apply component117may distribute the received change records through their respective connections to the apply algorithms108A-N.

Although shown as separate components, the data synchronization system102may, in another example, be part of the source database system101or be part of the target database system103. In one example, the source and target database systems101and103may be on the same system or on different systems in a distributed network.

FIG.2is a flowchart of a method for replicating changes of a source table Tsof a source database system to a target database system. For the purpose of explanation, the method described inFIG.2may be implemented in the system illustrated inFIG.1, but is not limited to this implementation. The method ofFIG.2may, for example, be performed by the source database system101. The target database system103may comprise a target table Tgwhich stores a copy of the source table Ts.

A change record130of the source table Tsmay be received in step201. The change record may be received by reading the transaction log106and retrieving the change record130from the transaction log106. The transaction log106may, for example, be read with a frequency higher than a defined minimum frequency, e.g., the transaction log106may be read every second or every minute. In another example, the transaction log106may be read as soon as it is modified. The source database system101may use the log reader104to monitor the content of the transaction log106in order to detect new log entries.

The received change record130may be a new entry of the transaction log106that has not yet been processed according to the present method. The change record130may, for example, be received as soon as it is saved in the transaction log106. This may enable to process the change records one by one and as soon as they are saved. Processing the change records one by one as soon as they are saved may be advantageous as it may enable a quasi-continuous and real time synchronization of the tables Tsand Tg. In another example, the received change record130may be one of multiple new change records that have been newly saved in the transaction log106. This later example may advantageously be used in case the transaction log is read with a relatively small frequency.

The change record130may have been recorded in the transaction log106in response to a change in the source table Ts. The change record130may describe an operation performed on a data record e.g., R1, of the source table Ts. If, for example, the operation is an insertion operation, the change record130may comprise the inserted data record R1. The date record R1may be replicated and stored on the target table Tgof the target database system103. If, for example, the operation is an update operation of a data record R1of the table Ts, the change record130may comprise the old values of the data record R1and the new values of the data record R1.

A distribution key of the table Tgmay be determined in step203. The distribution key may be one or more attributes of the table Tgthat may be used by the target database system for distribution of records the table Tgover the target database nodes105A-N. The distribution key may be determined in step203so that the data distribution calculation may be moved from the target database system103to e.g., the source database system101. The distribution key may be one or more attributes of the table Tg. If, for example, the table Tgis an employee table, the distribution key may be the employee ID and/or the employee age. For example, the source database system101may query the target database system103for obtaining the distribution key used by the target database system103in relation to table Tg.

The change record130may be read in step205for determining a value of the distribution key in the data record R1. The values of the one or more attributes that form the distribution key may be read from the data record R1. The values of the one or more attributes may be the last values or most up-to date values of the one or more attributes. If, for example, the operation that caused the received change record is an update operation, the value of the distribution key may be the new value(s) of the distribution key if the distribution key was updated at least partially. Following the above example, the data record R1may be read in order to identify the values of the employee ID and/or employee age.

The value(s) of the distribution key may be used in step207for selecting a target database node of the target database nodes105A-N where the change indicated in the received change record130may be applied. The selection may be performed using a distribution rule. The distribution rule may assign a change record to one of the target database nodes based on the value of the distribution key in the change record. For example, the employee records having an ID within a first range may be stored in the target database node105A, while the employee records having an ID within a second range may be stored in the target database node105B. Thus, it may be determined in step207to which range the value of the distribution key belongs and the corresponding target database node may be selected.

A direct connection may be established in step209to the selected target database node. The connection may be established upon selecting the target database node in step207. This on-demand establishment connection may save resources that would otherwise be required by a connection that is established and not used. Alternatively, the connection may be established upfront e.g., the connections between the source database system101and each of the target database nodes105A-N may be established once the target database nodes are defined as target for replicating or storing the table Tg.

The change record may be provided or sent in step211to the selected target database node through the established direct connection. The apply algorithm108A-N of the selected target database node may use the change record in order to apply the change indicated in the change record to the partition of the table Tgthat is part of the selected target database node. If, for example, the change is caused by an insertion operation, the apply algorithm may insert the new data record R1in the partition of the table Tgin the selected target database node. If, for example, the change is caused by an update operation, the apply algorithm may update the record R1of the target table Tgby the new values of the data record R1indicated in the change record.

FIG.3is a flowchart of a method for replicating changes of a source table Tsof a source database system. For the purpose of explanation, the method described inFIG.3may be implemented in the system illustrated inFIG.1, but is not limited to this implementation. The method ofFIG.3may, for example, be performed by the source database system101. The target database system103may comprise a target table Tgwhich stores a copy of the source table Ts. Connections133A-N may be (pre)established between the source database system101and the target database nodes105A-N respectively.

A change record130may be received in step301. The change record may be received by reading the transaction log106and retrieving the change record130from the transaction log106. The transaction log106may, for example, be read with a frequency higher than a defined minimum frequency, e.g., the transaction log106may be read every second or every minute. In another example, the transaction log106may be read as soon as it is modified. The source database system101may use the log reader104to monitor the content of the transaction log106in order to detect new log entries.

The received change record130may be a new entry of the transaction log106that has not yet been processed according to the present method. The change record130may, for example, be received as soon as it is saved in the transaction log106. This may enable to process the change records one by one and as soon as they are saved. Processing the change records one by one as soon as they are saved may be advantageous as it may enable a quasi-continuous and real time synchronization of the tables Tsand Tg. In another example, the received change record130may be one of multiple new change records that have been newly saved in the transaction log106. This later example may advantageously be used in case the transaction log is read with a relatively high frequency.

The change record130may have been recorded in the transaction log106in response to a change in the source table Ts. The change record130may describe an operation performed on a data record R1of the table Ts. If, for example, the operation is an insertion operation, the change record130may comprise the inserted data record R1. The date record R1may be replicated and stored on the target table Tgof the target database system103. If, for example, the operation is an update operation of a data record R1of the table Ts, the change record130may comprise the old values of the data record R1and the new values of the data record R1.

A distribution key of the table Tgmay be determined in step303. The distribution key may be one or more attributes of the table Tgthat may be used by the target database system for distribution of records over the target database nodes105A-N. The distribution key may be determined in step203so that the data distribution calculation may be moved from the target database system103to e.g., the source database system101. The distribution key may be one or more attributes of the table Tg. If, for example, the table Tgis an employee table, the distribution key may be the employee ID and/or the employee age. For example, the source database system101may query the target database system103for obtaining the distribution key used by the target database system103in relation to table Tg.

The change record130may be read in step305for determining a value of the distribution key in the data record R1. The values of the one or more attributes that form the distribution key may be read from the data record R1. The values of the one or more attributes may be the last values or most up-to date values of the one or more attributes. If, for example, the operation that caused the received change record is an update operation, the value of the distribution key may be the new value(s) of the distribution key if the distribution key was updated at least partially. Following the above example, the data record R1may be read in order to identify the values of the employee ID and/or employee age.

The value(s) of the distribution key may be used in step307for selecting a target database node of the target database nodes105A-B where the change indicated in the received change record130may be applied. The selection may be performed using a distribution rule. The distribution rule may assign a change record to one of the target database nodes based on the value of the distribution key in the change record. For example, the employee records having an ID within a first range may be stored in the target database node105A, while the employee records having an ID within a second range may be stored in the target database node105B. Thus, it may be determined in step207to which range the value of the distribution key belongs and the corresponding target database node may be selected.

The change record may be provided or sent in step311to the selected target database node through the preestablished direct connection between the source database system and the selected target database node. The apply algorithm108A-N of the selected target database node may use the change record in order to apply the change indicated in the change record to the partition of the table Tgthat is part of the selected target database node. If, for example, the change is caused by an insertion operation, the apply algorithm may insert the new data record R1in the partition of the table Tgin the selected target database node. If, for example, the change is caused by an update operation, the apply algorithm may update the record R1of the target table Tgby the new values of the data record R1indicated in the change record.

FIG.4is a flowchart of a method for replicating changes of a source table Tsof a source database system. For the purpose of explanation, the method described inFIG.4may be implemented in the system illustrated inFIG.1, but is not limited to this implementation. The method ofFIG.4may, for example, be performed by the source database system101. The target database system103may comprise a target table Tgwhich stores a copy of the source table Ts.

Multiple change records may be received in step401e.g., K change records. The change records may be received by reading the transaction log106and retrieving the change records from the transaction log106. The transaction log106may, for example, be read with a frequency higher than a defined minimum frequency, e.g., the transaction log106may be read every 5 minutes. The source database system101may use the log reader104to monitor the content of the transaction log106in order to detect new log entries.

Each of the K change records may describe an operation performed on a respective data record Riof the table Ts, where i is an index running e.g., from 1 to K.

A distribution key of the target table Tgmay be determined in step403. The distribution key may be one or more attributes of the target table Tgthat may be used by the target database system for distribution of records over the target database nodes105A-N. The distribution key may be determined in step403so that the data distribution calculation may be moved from the target database system103to e.g., the source database system101. The distribution key may be one or more attributes of the target table T g. For example, the source database system101may query the target database system103for obtaining the distribution key used by the target database system103in relation to table Tg.

Each ithchange record of the received change records may be read in step405for determining a value of the distribution key in the respective data record Ri. The values of the one or more attributes that form the distribution key may be read from the data record Ri. The values of the one or more attributes may be the last values or most up-to date values of the one or more attributes. This may result in the values of the distributions key: Key1, Key2. . . . KeyKfor the records R1, R2. . . . RKrespectively.

The determined values Key1, Key2. . . . KeyKof the distribution key may be used in step407for selecting target database nodes of the target database nodes105A-B where the changes indicated in the received change records may be applied. The selection may be performed using a distribution rule. The distribution rule may assign a change record to one of the target database nodes based on the value of the distribution key in the change record. For example, for each value Key1, Key2. . . . KeyK, a target database node may be selected. This may result in a number J of selected target database nodes, which is at most equal to the number of data records K i.e., J≤K.

A number J of direct connections may be established in step409to the J selected target database nodes respectively. The connections may be established upon selecting the target database node in step407. Alternatively, the connections may be established upfront e.g., the connections between the source database system101and each of the N target database nodes115A-N may be established once the target database nodes are defined as target for replicating or storing the table Tg.

The received change records may be provided or sent in step411to the associated selected target database nodes through the established direct connections respectively. The apply algorithm of each of the selected target database nodes may use the respective change record(s) in order to apply the change indicated in the change record to the partition of the table Tgthat is part of the selected target database node. If, for example, the change is caused by an insertion operation, the apply algorithm may insert the new data record Riin the partition of the table Tgin the selected target database node.

In one example implementation, steps405to411may be performed on individual change records and in parallel for the K received change records e.g., K parallel execution of steps405to411for the K received change records respectively. For example, a multiprocessor system may be used for the parallel execution of the steps405to411.

FIG.5is a flowchart of a method for selecting target database nodes based on the distribution key. For the purpose of explanation, the method described inFIG.5may be implemented in the system illustrated inFIG.1, but is not limited to this implementation. The method ofFIG.5provides an example implementation of steps207,307and407.

A distribution rule may be provided in step501. The distribution rule may, for example, be obtained by the source database system from the target database system.

The distribution rule may comprise a rule logic, wherein the rule logic is configured to receive as input the value(s) of the distribution key and the target database nodes105A-N and provides as an output a target database node that would receive the data record having the distribution key.

The value of the distribution key may be input in step503to the distribution rule. And an indication of the target database node may be received in step505as an output of the distribution rule.

FIG.6represents a general computerized system600suited for implementing at least part of method steps as involved in the disclosure.

It will be appreciated that the methods described herein are at least partly non-interactive, and automated by way of computerized systems, such as servers or embedded systems. In exemplary embodiments though, the methods described herein can be implemented in a (partly) interactive system. These methods can further be implemented in software612,622(including firmware622), hardware (processor)605, or a combination thereof. In exemplary embodiments, the methods described herein are implemented in software, as an executable program, and is executed by a special or general-purpose digital computer, such as a personal computer, workstation, minicomputer, or mainframe computer. The most general system600therefore includes a general-purpose computer601.

In exemplary embodiments, in terms of hardware architecture, as shown inFIG.6, the computer601includes a processor605, memory (main memory)610coupled to a memory controller615, and one or more input and/or output (I/O) devices (or peripherals)10,645that are communicatively coupled via a local input/output controller635. The input/output controller635can be, but is not limited to, one or more buses or other wired or wireless connections, as is known in the art. The input/output controller635may have additional elements, which are omitted for simplicity, such as controllers, buffers (caches), drivers, repeaters, and receivers, to enable communications. Further, the local interface may include address, control, and/or data connections to enable appropriate communications among the aforementioned components. As described herein the I/O devices10,645may generally include any generalized cryptographic card or smart card known in the art.

The processor605is a hardware device for executing software, particularly that stored in memory610. The processor605can be any custom made or commercially available processor, a central processing unit (CPU), an auxiliary processor among several processors associated with the computer601, a semiconductor-based microprocessor (in the form of a microchip or chip set), or generally any device for executing software instructions.

The memory610can include any one or combination of volatile memory elements (e.g., random access memory (RAM, such as DRAM, SRAM, SDRAM, etc.)) and non-volatile memory elements (e.g., ROM, erasable programmable read only memory (EPROM), electronically erasable programmable read only memory (EEPROM), programmable read only memory (PROM). Note that the memory610can have a distributed architecture, where various components are situated remote from one another, but can be accessed by the processor605.

The software in memory610may include one or more separate programs, each of which comprises an ordered listing of executable instructions for implementing logical functions, notably functions involved in embodiments of this invention. In the example ofFIG.6, software in the memory610includes instructions612e.g. instructions to manage databases such as a database management system.

The software in memory610shall also typically include a suitable operating system (OS)611. The OS611essentially controls the execution of other computer programs, such as possibly software612for implementing methods as described herein.

The methods described herein may be in the form of a source program612, executable program612(object code), script, or any other entity comprising a set of instructions612to be performed. When a source program, then the program needs to be translated via a compiler, assembler, interpreter, or the like, which may or may not be included within the memory610, so as to operate properly in connection with the OS611. Furthermore, the methods can be written as an object-oriented programming language, which has classes of data and methods, or a procedure programming language, which has routines, subroutines, and/or functions.

In exemplary embodiments, a conventional keyboard650and mouse655can be coupled to the input/output controller635. Other output devices such as the I/O devices645may include input devices, for example but not limited to a printer, a scanner, microphone, and the like. Finally, the I/O devices10,645may further include devices that communicate both inputs and outputs, for instance but not limited to, a network interface card (NIC) or modulator/demodulator (for accessing other files, devices, systems, or a network), a radio frequency (RF) or other transceiver, a telephonic interface, a bridge, a router, and the like. The I/O devices10,645can be any generalized cryptographic card or smart card known in the art. The system600can further include a display controller625coupled to a display630. In exemplary embodiments, the system600can further include a network interface for coupling to a network665. The network665can be an IP-based network for communication between the computer601and any external server, client and the like via a broadband connection. The network665transmits and receives data between the computer601and external systems30, which can be involved to perform part, or all of the steps of the methods discussed herein. In exemplary embodiments, network665can be a managed IP network administered by a service provider. The network665may be implemented in a wireless fashion, e.g., using wireless protocols and technologies, such as WiFi, WiMax, etc. The network665can also be a packet-switched network such as a local area network, wide area network, metropolitan area network, Internet network, or other similar type of network environment. The network665may be a fixed wireless network, a wireless local area network W(LAN), a wireless wide area network (WWAN) a personal area network (PAN), a virtual private network (VPN), intranet or other suitable network system and includes equipment for receiving and transmitting signals.

If the computer601is a PC, workstation, intelligent device or the like, the software in the memory610may further include a basic input output system (BIOS)622. The BIOS is a set of essential software routines that initialize and test hardware at start-up, start the OS611, and support the transfer of data among the hardware devices. The BIOS is stored in ROM so that the BIOS can be executed when the computer601is activated.

When the computer601is in operation, the processor605is configured to execute software612stored within the memory610, to communicate data to and from the memory610, and to generally control operations of the computer601pursuant to the software. The methods described herein and the OS611, in whole or in part, but typically the latter, are read by the processor605, possibly buffered within the processor605, and then executed.

When the systems and methods described herein are implemented in software612, as is shown inFIG.6, the methods can be stored on any computer readable medium, such as storage620, for use by or in connection with any computer related system or method. The storage620may comprise a disk storage such as HDD storage.

The present invention may be a system, a method, and/or a computer program product at any possible technical detail level of integration. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention.

The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.

Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.

Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, configuration data for integrated circuitry, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++, or the like, and procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.

These computer readable program instructions may be provided to a processor of a computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.

The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.

The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the blocks may occur out of the order noted in the Figures. For example, two blocks shown in succession may, in fact, be accomplished as one step, executed concurrently, substantially concurrently, in a partially or wholly temporally overlapping manner, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.