(51) Int Cl.: G06F 11/14 ( ) G06F 17/30 ( )

Size: px
Start display at page:

Download "(51) Int Cl.: G06F 11/14 (2006.01) G06F 17/30 (2006.01)"

Transcription

1 (19) TEPZZ 8_B_T (11) EP B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: Bulletin 14/16 (1) Int Cl.: G06F 11/14 (06.01) G06F 17/ (06.01) (21) Application number: (22) Date of filing: (4) Consistent backup of a distributed database system Konsistentes Backup eines verteilten Datenbanksystems Sauvegarde cohérente d un système de base de données réparties (84) Designated Contracting States: AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR () Priority: US (43) Date of publication of application: Bulletin 12/1 (73) Proprietor: SAP AG Walldorf (DE) (72) Inventor: Schreter, Ivan Walldorf (DE) (74) Representative: Müller-Boré & Partner Patentanwälte PartG mbb Friedenheimer Brücke München (DE) (6) References cited: WO-A1-09/ US-A US-B EP B1 Note: Within nine months of the publication of the mention of the grant of the European patent in the European Patent Bulletin, any person may give notice to the European Patent Office of opposition to that patent, in accordance with the Implementing Regulations. Notice of opposition shall not be deemed to have been filed until the opposition fee has been paid. (Art. 99(1) European Patent Convention). Printed by Jouve, 7001 PARIS (FR)

2 1 EP B1 2 Description FIELD [0001] Some embodiments relate to database systems. In particular, some embodiments concern systems for backing up a distributed database. BACKGROUND [0002] Many database systems allow administrators or other authorized users to restore a database in the event of a database crash or other error. For example, a database system may employ a "shadow paging" system, in which a "last known good" version of a database is maintained within the database despite subsequent changes to the database. In the event of a crash, the last known good version is retrieved from the database and brought up to date (i.e., to the time of the crash) using data from a transaction log which is also stored in the database. The foregoing process limits the downtime needed for generating backups and for restoring the database from a stored previous version. However, the process requires that the last known good version and transaction log can be retrieved from the media in which the database is stored. [0003] In order to provide recovery from media failure or other catastrophic failure, a database system may back up its data to a backup medium which is physically separate from the database system s storage media (e.g., one or more hard disks and/or Random Access Memory). In the event of a hardware failure, and if the database is backed up daily to a separate backup medium, an administrator may restore the database to a previous day s state by retrieving the previous day s data from the backup medium. [0004] In a traditional "single node" database system, which consists of a single executing process and associated storage media, any full backup thereof represents a single consistent state of the database. A distributed database, on the other hand, consists of two or more nodes, each of which consists of a single executing process and associated storage media. The data stored in the storage media of all the nodes, taken together, represents the full database. [000] If each node of a distributed database is backed up as described above with respect to a single node database system, the backup of each node will represent a single consistent state of the node. Even if the backups of each node are commenced simultaneously, the backups of all the nodes will most likely not correspond to a single consistent state of the full database due to ongoing database transactions and a lack of synchronization between the nodes. Therefore, in order to ensure that the backups of all the nodes correspond to a single consistent state of the full database, each node of the distributed database must be stopped, and, after all nodes are stopped, each node is backed up. Each node is restarted only after the backup of all nodes is complete. [0006] The full database is unavailable during the latter backup procedure described above. This downtime is significant and unacceptable in many scenarios. Systems are desired to backup distributed databases in an efficient manner which limits database downtime. [0007] US 04/036 A1 discloses systems and methods for providing an efficient partitioned resource server. The partitioned resource server comprises a plurality of individual servers, and the individual servers support a storage service. The systems and methods provide archiving processes for a partitioned storage service. To this end, the systems and process may include a snapshot process operating on a server and capable of coordinating with other snapshot processes for generating state information representative of the state of the partitioned storage volume. [0008] WO 09/ A1 discloses the generation of snapshots that are consistent across a group of data objects. The snapshots are initiated by a coordinator, which transmits a sequence of commands to each storage node hosting a data object within a group of data objects. The first command prepares a data object for a snapshot. After a data object has been successfully prepared, an acknowledgement is sent to the coordinator. Once all appropriate acknowledgements are received, the coordinator sends a command to confirm that a snapshot has been created for each data object in the respective group. After receiving this confirmation, the coordinator takes action to confirm or record the successful completion of the group-consistent snapshot. [0009] According to an aspect, the problem is solved by a method according to claim 1, a non-transitory computer-readable medium according to claim 6, and a system according to claim 11. Preferred embodiments are defined in the dependent claims. BRIEF DESCRIPTION OF THE DRAWINGS [00] FIG. 1 is a block diagram of a distributed database system according to some embodiments. FIG. 2 is a block diagram of a database node according to some embodiments. FIGS. 3A and 3B comprise a flow diagram of a process according to some embodiments. FIG. 4 illustrates a converter stored in a data area according to some embodiments. FIG. illustrates portions of converter leaf pages according to some embodiments. FIG. 6 illustrates a portion of a restart record of a database node according to some embodiments. 2

3 3 EP B1 4 FIG. 7 illustrates a portion of a snapshot information page of a database node according to some embodiments. FIG. 8 illustrates a portion of an I/O management page of a database node according to some embodiments. DETAILED DESCRIPTION [0011] FIG. 1 is a block diagram of executing database instance 0 according to some embodiments. As shown, database instance 0 comprises a distributed database. The present description will assume that a distributed database consists of two or more database nodes, each of which includes at least one operating system process, a cache and a datastore. The terms "database" and "database instance" will be used interchangeably below. [0012] According to the present example, database instance 0 includes database nodes 1, 1 and 1. Each node includes a respective database server process, a cache and a datastore. The data of datastores 116, 126 and 136, taken together, represent the full database of database instance 0. The corresponding database server processes 112, 122 and 132 operate to transparently provide the data of the full database to database applications. [0013] In some embodiments, each of caches 114, 124 and 134 is implemented in Random Access Memory (RAM), and each of datastores 116, 126 and 136 is implemented in one or more fixed disks. Alternatively, one or more of nodes 1, 1 and 1 may implement an "in-memory" database, in which both the data of the datastore and the cache are stored in volatile (e.g., nondisk-based) memory (e.g., RAM). In some embodiments, the data may comprise one or more of conventional tabular data, row-based data, column-based data, and object-based data. Database instance 0 may also or alternatively support multi-tenancy by providing multiple logical database systems which are programmatically isolated from one another. [0014] Database instance 0 also includes coordinator 1. Coordinator 1 may comprise a process and/or a device executing this process. Generally, coordinator 1 communicates with database nodes 1 through 1 in order to generate a consistent backup of distributed database instance 0. Details of this communication according to some embodiments will be described below. Coordinator 1 may be implemented by a device separate from nodes 1, 1 and 1, or by one or more of nodes 1, 1 and 1. [00] Database instance 0 may communicate with one or more database applications (not shown) over one or more interfaces (e.g., a Structured Query Language (SQL)-based interface). The database applications may provide, for example, business reporting, inventory control, online shopping, and/or any other suitable functions The database applications may, in turn, support client applications that may be executed by client devices. Such a client application may simply comprise a Web browser to access and display reports generated by a database application. [0016] The data of database instance 0 may be received from disparate hardware and software systems, some of which are not interoperational with one another. The systems may comprise a back-end data environment employed in a business or industrial context. The data may be pushed to database instance 0 and/or provided in response to queries received therefrom. [0017] Database instance 0 and each element thereof may also include other unshown elements that may be used during operation thereof, such as any suitable program code, scripts, or other functional data that is executable to interface with other elements, other applications, other data files, operating system files, and device drivers. These elements are known to those in the art, and are therefore not described in detail herein. [0018] FIG. 2 is a block diagram of database node 1 of database instance 0 according to some embodiments. As illustrated, database node 1 includes database server process 112, cache 114 and datastore 116. [0019] For purposes of the foregoing description, it will be assumed that datastore 116 comprises only data volume Datastore 116 may comprise one or more data volumes in some embodiments, with each of the one or more data volumes comprising one or more disparate physical systems for storing data. These physical systems may comprise a portion of a physical hard disk, an entire physical hard disk, a storage system composed of several physical hard disks, and/or RAM. [00] Generally, a data volume is subdivided into storage areas known as blocks, and data is stored in the data volume in data pages having the same size as a block. Accordingly, a particular data page of datastore 116 may be accessed by referencing the data volume and block address associated with that data page. The data pages may include application data consisting of tabular data, row-based data, column-based data, object-based data and associated index entries. In a case that datastore 116 includes more than one data volume, the data pages may be spread across one or more of its data volumes. [0021] Data volume 1162 includes a file directory and a converter. If datastore 116 includes more than one data volume, the file directory and the converter may be spread across one or more of the data volumes. When a new data page is created, the data page is assigned a unique logical page number. The converter maps this logical page number to the data volume and block address at which the data page is stored. The file directory maps a file identifier to a logical page number of a corresponding file root page, and the aforementioned database catalog maps each file identifier to associated metadata, including a name of a database object associated with the file identifier. Accordingly, the information of the database catalog and the file directory may be used to 3

4 EP B1 6 determine a logical page number from a name of a database object, for example. Once the page number is known, the converter may be used to determine a block address at which a root page of the database object is stored. [0022] The foregoing process also applies to "in-memory" implementations. However, an identifier of a data volume in which a data page is stored might not be utilized in such implementations, as the in-memory datastore might simply comprise addressable memory locations which are not divided into logical data volumes. [0023] Datastore 116 may also include configuration files 1164 defining properties of database node 1 (e.g., a size and physical location of each data volume, a maximum number of data volumes in datastore 116, etc.). Moreover, datastore 116 typically includes system files, database parameters, paths, user information and any other suitable information. Datastore 116 may also store a database catalog including metadata describing the database objects that are stored therein. [0024] DB server process 112 may comprise any system for managing a distributed database instance that is or becomes known. Generally, DB server process 112 may receive requests for data (e.g., SQL requests from a database application), may retrieve the requested data from datastore 116 or from cache 114, and may return the requested data to the requestor. In some embodiments, DB server process 112 includes SQL manager 122 to process received SQL statements and data access manager 124 to manage access to stored data. DB server process 112 may also perform start-up, logging, recovery, management, optimization, monitoring, indexing, integrity checks and other database-related tasks. [00] Frequently, SQL commands received from database applications will require the modification of data stored in a database, or addition of data to the database. When information stored in the database is to be modified, the data is retrieved from data volume 1162 and manipulated in cache 114. Once the data manipulation is complete (or after a series of manipulations has completed), the modified data is written from cache 112 to data volume 1162 to update the database. Further, a log entry indicating the modifications may be written in data volume 1162 (e.g., to allow the database to be restored to a consistent state if an error occurs). [0026] Cache 114 stores various elements of datastore 116 during execution of database node 1. These elements may include recently-accessed pages of application data, converter pages, database catalog objects and/or a log queue. [0027] Cache 114 includes converter 1141 and data pages 114. Converter 1141 and data pages 114 are illustrated separately herein for the sake of clarity. However, according to some embodiments, converter 1141 and data pages 114 might not comprise separate, contiguous memory addresses of I/O buffer cache 1. For example, converter pages 1143 may be interspersed among data pages 114 throughout cache [0028] Generally, cache 114 stores pages from data volume 1162 that have been recently read or write-accessed. If a database transaction requires modification of a page, the page is read from a block address of data volume 1162 specified in the file directory, the page is modified, and a log entry describing the modification is recorded. The modified page is stored in cache 114, the modified page is designated as modified, and the original "last known good" page remains at the block address of data volume 1162 from which it was read. Once the number of modified pages in cache 114 reaches a threshold amount, or after passage of a designated time interval, all pages of cache 114 which are designated as modified are written to data volume [0029] A modified page is not written to the block address of data volume 1162 from which it was initially read. Rather, the original unmodified page remains designated as a "last known good" page at its block address and the modified page is written to a new block address of data volume [00] A savepoint is executed to convert the modified pages stored in data volume 1162 to "last known good" pages and frees the blocks used by the existing "last known good" pages, so that pages may be written thereto. At a savepoint, all pages designated as modified in cache 114 are written to data volume 1162 as described above. Once all modified pages are written to data volume 1162, the "last known good" pages associated with the modified pages are released so that their associated block addresses may be overwritten. [0031] As mentioned above, the converter of data volume 1162 maps logical page numbers to block addresses of data volume Accordingly, the converter must be modified once a corresponding data page is saved to a new location of data volume The modified converter pages are flushed to data volume 1162 at the end of a savepoint, particularly after all modified data pages are written. Then, a restart record is created to point to the starting point of the newly-saved converter within data volume The restart record may be stored in any volume of datastore 116. [0032] In case of a system crash, the modified pages stored in data volume 1162 are ignored and data volume 1162 is reconstructed based on the restart record, the converter pages identified from the restart record, the "last known good" pages (which are identified by the converter pages), and the log entries (which reflect page changes since the last savepoint). [0033] U.S. Patent No. 7,4,979, entitled Snapshots For Instant Backup In A Database Management System, describes a system in which, at some savepoints, the previous "last known good" pages are not freed for overwriting. Rather, these data pages are marked, tagged, or otherwise identified as being part of a snapshot. Accordingly, these pages will not be overwritten until a command to remove the snapshot is received. These snapshot pages include pages storing application data (e.g., tabular data, row-based data, column-based data, ob- 4

5 7 EP B1 8 ject-based data and associated index entries) as well as converter pages pointing thereto. A "snapshot restart record" pointing to the starting point of this converter is also created. Consequently, data volume 1162 may be reconstructed based on the snapshot restart record, the converter pages identified from the snapshot restart record, and the "last known good" data pages of the snapshot (which are identified by the identified converter pages). [0034] FIGS. 3A and 3B comprise a flow diagram of process 0 according to some embodiments. Some embodiments of process 0 may provide efficient backup of a multi-node distributed database. In some embodiments, various hardware elements of a database node execute program code to perform process 0. Process 0 may be performed in response to a predefined schedule, a command received from a database manager (not shown), or any other trigger event. [003] Process 0 and all other processes mentioned herein may be embodied in computer-executable program code read from one or more of non-transitory computer-readable media, such as a floppy disk, a CD-ROM, a DVD-ROM, a Flash drive, and a magnetic tape, and then stored in a compressed, uncompiled and/or encrypted format. In some embodiments, hard-wired circuitry may be used in place of, or in combination with, program code for implementation of processes according to some embodiments. Embodiments are therefore not limited to any specific combination of hardware and software. [0036] During a backup of a distributed database according to some embodiments, process 0 is independently and contemporaneously executed by each node of the distributed database. However, for the sake of clarity, process 0 will be described with respect to its execution by a single database node of a multi-node database. [0037] To better convey the foregoing example of process 0 according to some embodiments, FIGS. 4 and illustrate examples of various elements of a database node prior to process 0. Such a database node includes datastore 0 of FIG. 4, which stores converter index pages 4 and converter leaf pages 4 of a converter. Storage locations of converter index pages 4 and converter leaf pages 4 are identified using the convention "volume number/block address", and FIG. 4 thereby indicates that datastore 0 consists of at least three data volumes. As mentioned above, embodiments are not limited to database nodes having more than one data volume. [0038] According to the present example, converter leaf pages 4 of FIG. 4 represent the "last known good" converter pages which were identified at the completion of a last savepoint. Index pages 4 may be used to locate a converter page 4 and to locate a data page in datastore 0 based on the located converter page 4. Each index page 4 includes block addresses of one or more other index pages or of a converter page 4. By virtue of this arrangement, any of converter pages 4 (and any associated data pages) may be located in datastore 0 based only on the block address of converter root page 4. [0039] FIG. illustrates portions of some of converter leaf pages 4 according to some embodiments. Each of converter leaf pages 4 identifies a range of logical page numbers with which it is associated, and a block address at which it is stored. A converter leaf page 4 also associates a block address with each data page having a logical page number in the range of the converter leaf page 4. [00] The node including datastore 0 continues to operate after the savepoint, during which data pages are loaded into the cache of the node and modified. Then, at S1 of process 0, the node receives an instruction to create a snapshot. The instruction is received from a coordinator and is transmitted to each node of the database instance. As mentioned above, the coordinator may transmit the instruction according to a predefined schedule, in response to a command received from a database manager (not shown), or in response to another event. As also mentioned above, the remaining steps of process 0 will be described with respect to a single node, but it should be understood that each node of the database instance executes the remaining steps of process 0 in response to the received instruction. [0041] At S4, the modified pages currently residing in the cache are "flushed" to the datastore of the database node. Flushing comprises writing the modified pages in the cache to the datastore (e.g., datastore 0), releasing the "last known good" pages which are associated with the same logical page numbers as the modified pages, and designating the written modified pages as "last known good". Moreover, appropriate pages of the cached converter are modified to reflect the new locations of the data pages within the datastore, the modified converter pages are written to new locations of the datastore, the "last known good" versions of these converter pages are released, and the written modified converter pages are designated as "last known good". [0042] The node transmits a confirmation message to the coordinator at S6. Since the node is currently executing and servicing requests from applications, etc., data pages begin to repopulate the cache and may be modified as soon as the modified pages are flushed at S4. Accordingly, any modified pages in the cache are repeatedly flushed as described above at S8 until a message is received from the coordinator at S3. [0043] As mentioned, each node of the database instance begins process 0 in response to receiving an instruction from the coordinator. The coordinator then waits to receive a confirmation message which is transmitted from each database node when those nodes reach S6 of process 0. In this regard, each database node may reach S6 at a different point in time. After receiving a confirmation message from each of the database nodes of the database instance, the coordinator sends a message to all of the database nodes to enter a "critical phase".

6 9 EP B [0044] Upon receiving this message at S3, the repetitive flush of S8 terminates and updates to the database node are blocked at S312. According to some embodiments, process 0 prevents concurrent write operations at S312 by acquiring the "consistent change lock" in exclusive mode, and the write operations of the datastore interface acquire the consistent change lock in shared mode. Moreover, a transaction manager is instructed to not start or close any write transactions. A confirmation message is then sent to the coordinator at S314. [004] The coordinator waits to receive such a confirmation message from each database node of the database instance, which may occur at different points in time. Once all of these confirmation messages are received, the coordinator is aware that each database node is in the critical phase. The coordinator then sends another message to all of the database nodes, which is received by each node at 316. [0046] Modified pages may have accumulated in the cache of a database node during the period between termination of the flushing of S8 and blocking of the updates at S312. These modified pages are copied to a staging area (e.g., a temporary memory buffer) at S318, because updates to the datastore are blocked at this point of process 0. [0047] Due to the execution of the repetitive flush at S8, the number of modified pages copied to the staging area during the critical phase is reduced in contrast to other proposed systems. Accordingly, in comparison to the backup systems described in the Background, some embodiments reduce the impact on concurrent write operations by limiting the time spent in the critical phase. [0048] Next, at S3, the current log position is determined and saved. Log replay will start from this position during recovery based on the current backup. Updates to the database node are unblocked at S322. In some embodiments of S322, the consistent change lock is released and the transaction manager is instructed to allow transactions to start and close. [0049] The pages copied to the staging area are written to the datastore at S324. This writing proceeds as described with respect to S4 and S8 (i.e., releasing the previous "last known good" versions of these data pages and marking the newly-written pages as "last known good"). The log queue is also written to the datastore up to the log position saved at S3. [000] At S326, a new restart record is written to the datastore. FIG. 6 illustrates Restart_Record 600 according to some embodiments. As shown, Restart_Record 600 is written to Volume 2, Block 34 of the datastore, and includes members crconvrootba and SnapInfoBA. The value of crconvrootba references a location of the root page of the "last known good" converter, and the value of SnapInfoBA references a location of a page which lists snapshot restart records of all snapshots of the database node. [001] For example, Snapshot_Info page 700 indicates the block address of each snapshot s converter root page. As shown, the snapshot restart record (i.e., 1/7) of the just-created snapshot (i.e., snap3) is identical to "last known good" converter root page of the mostrecent savepoint, which, at the time represented in FIGS. 6 and 7, is the savepoint at which the snapshot was created. [002] An anchor page pointing to the restart record is written at S328. For example, IOMan_InfoPage 800 of FIG. 8 includes, among other members, rstvolumeid and rstblockno fields to identify a location of Restart_Record 600. Embodiments are not limited to the members and or member values illustrated in FIGS. 6 through 8. [003] By virtue of the foregoing, the stored "last known good" pages of each database node, taken together, represent a transactionally-consistent state of the full database instance. Moreover, these "last known good" pages are associated with respective snapshots of each database node and are therefore persisted and easily accessible. [004] Next, at S3, the pages of the snapshot are written to persistent media. In one particular example, the anchor page is used to identify the location of the restart record, which is in turn used to determine the location of the snapshot info page. The converter root page of the latest snapshot is identified from the snapshot info page, and is used to identify all "last known good pages" of the snapshot. These "last known good" pages are written to the persistent media at S3. [00] The persistent media may be physically-removable from the database node in order to decouple the risk exposure of the backup and the database node. Each database node may write the pages of the snapshot to a dedicated persistent media, or two or more (e.g., all) of the database nodes may write their snapshot pages to a same persistent media. [006] In order to restore the full database to a consistent state, each node is independently restored to its prior state using its stored snapshot. Based on this consistent state, and if a log exists in the snapshot of each node, log replay can be activated independently within each node to further bring the full database back to the last-committed consistent state. [007] Elements described herein as communicating with one another are directly or indirectly capable of communicating over any number of different systems for transferring data, including but not limited to shared memory communication, a local area network, a wide area network, a telephone network, a cellular network, a fiber-optic network, a satellite network, an infrared network, a radio frequency network, and any other type of network that may be used to transmit information between devices. Moreover, communication between systems may proceed over any one or more transmission protocols that are or become known, such as Asynchronous Transfer Mode (ATM), Internet Protocol (IP), Hypertext Transfer Protocol (HTTP) and Wireless Application Protocol (WAP). 6

7 11 EP B1 12 [008] Embodiments described herein are solely for the purpose of illustration. Those in the art will recognize other embodiments may be practiced with modifications and alterations to that described above. Claims 1. In an executing database instance (0) including a plurality of database nodes (1, 1, 1), a method to create a backup of the executing database instance (0), comprising: - creating (S2) a current savepoint in one of the plurality of database nodes (1, 1, 1) by: -- storing (S4) first modified pages of a cache (114) of the database node (1) in a datastore (116) of the database node (1); -- transmitting (S6) a first confirmation message to a coordinator (1) after storing the first modified pages; -- repeatedly identifying (S8) second modified pages of the cache (114) and storing the identified second modified pages in the datastore (116) until a first message is received from the coordinator (1); -- receiving (S31 0) the first message from the coordinator (1) to enter a critical phase; -- upon receiving the first message from the coordinator (1): --- stopping the repeated identifying (S8) and storing of the second modified pages; --- blocking (S312) updates to the database node (1); and --- transmitting (S314) a second confirmation message to the coordinator (1); and -- receiving (S316) a second message from the coordinator (1) and, in response to receiving the second message, identifying third modified pages of the cache (114) and copying (S318) the third modified pages of the cache (114) to a staging area, wherein the third modified pages are modified pages that have been accumulated in the cache (114) of the database (1) during the period between the stopping of the repeated identifying (S8) and storing of the second modified pages and the blocking (S312) of the updates to the database node (1); in response to receiving the second message: --- unblocking (S322) updates to the database node (1); and --- storing (S324) the third modified pages copied to the staging area in the datastore (1); - identifying pages associated with the current savepoint and stored in the datastore (116); and - storing (S3) the pages associated with the current savepoint in a persistent media. 2. A method according to Claim 1, further comprising: - creating (S2) a second current savepoint in a second one of the plurality of database nodes (1, 1, 1) by: -- storing (S4) fourth modified pages of a cache (124) of the second database node (1) in a second datastore (126) of the second database node (1); -- transmitting (S6) a third confirmation message to the coordinator (1) after storing the fourth modified pages; -- repeatedly identifying (S8) fifth modified pages of the cache (124) of the second database node (1) and storing the identified fifth modified pages in the second datastore (126) of the second database node (1); -- receiving (S316) the first message from the coordinator (1) to enter the critical phase and stopping the repeated identifying (S8) and storing of the fifth modified pages in response to the first message; -- blocking (S312) updates to the second database node (1) and transmitting (S314) a fourth confirmation message to the coordinator (1); and -- receiving (S316) the second message from the coordinator (1) and, in response to receiving the second confirmation message, identifying sixth modified pages of the cache (124) of the second database node (1) and storing (S318) the sixth modified pages in the second datastore (126) of the second database node (1); - identifying pages associated with the second current savepoint and stored in the second datastore (126) of the second database node (1); and - storing (S3) the pages associated with the second current savepoint in a second persistent media. 7

8 13 EP B A method according to Claim 2, further comprising: restoring the database instance (0) to a consistent state based on the pages stored in the persistent media and the second persistent media. -- code to store (S4) first modified pages of a cache (114) of the database node (1) in a datastore (116) of the database node (1); -- code to transmit (S6) a first confirmation message to a coordinator (1) after storing the first modified pages; -- code to repeatedly identify (S8) second modified pages of the cache (114) and store the identified second modified pages in the datastore (116) until a first message is received from the coordinator (1); -- code to receive (S3) the first message from the coordinator (1) to enter a critical phase, -- upon receiving the first message from the coordinator: 4. A method according to any one of Claims 1 to 3, further comprising: transmitting, from a coordinator (1) to the database node (1) and to the second database node (1), an instruction to create the current savepoint and the second current savepoint; receiving the confirmation message and the third confirmation message at the coordinator (1); in response to receiving the confirmation message and the third confirmation message, transmitting the first message to enter the critical phase to the database node (1) and to the second database node (1); receiving the second confirmation message and the fourth confirmation message at the coordinator (1); in response to receiving the second confirmation message and the fourth confirmation message, transmitting the second message to the database node (1) and to the second database node (1).. A method according to any one of Claims 1 to 4, further comprising: restoring the database instance to a consistent state based on the pages stored in the persistent media. 6. A non-transitory computer-readable medium storing program code, the program code executable by a computer, the program code comprising: - code to create (S2) a current savepoint in one of a plurality of database nodes (1, 1, 1) of an executing database instance code comprising: stop the repeated identification (S8) and storage of the second modified pages; --- code to block (S312) updates to the database node (1); and; --- code to transmit (S314) a second confirmation message to the coordinator (1); -- code to receive (S316) a second message from the coordinator (1) and, in response to the second message, identify third modified pages of the cache (114) and copy (S318) the third modified pages of the cache (114) to a staging area, wherein the third modified pages are modified pages that have been accumulated in the cache (114) of the database (1) during the period between the stopping of the repeated identifying (S8) and storing of the second modified pages and the blocking (S312} of the updates to the database node (1); -- in response to receiving the second message: --- code to unblock (S322) updates to the database node (1); and --- code to store (S324) the third modified pages copied to the staging area in the datastore (1); - code to identify (S3) pages associated with the current savepoint and stored in the datastore (116); and - code to store (S3) the pages associated with the current savepoint in a persistent media. 7. A medium according to Claim 6, the program code further comprising: - code to create (S2) a second current savepoint in a second one of the plurality of database nodes (1, 1, 1) comprising: -- code to store (S4) fourth modified pages of a cache (124) of the second database node (1) in a second datastore (126) of the second database node (1); -- code to transmit (S6) a third confirmation message to the coordinator (1) after 8

9 EP B1 16 storing the fourth modified pages; -- code to repeatedly identify (S8) fifth modified pages of the cache (124) of the second database node (1) and store the identified fifth modified pages in the second datastore (126) of the second database node (1); -- code to receive (S316) the first message from the coordinator (1) to enter the critical phase and, in response to the first message, stop the repeated identification (S8) and storage of the fifth modified pages; -- code to block (S312) updates to the second database node (1) and transmit (S314) a fourth confirmation message to the coordinator (1); and -- code to receive (S316) the second confirmation message and, in response to the second confirmation message, identify sixth modified pages of the cache (124) of the second database node (1) and store (S318) the sixth modified pages in the second datastore (126) of the second database node (1); code to receive the second confirmation message and the fourth confirmation message at the coordinator (1); code to transmit, in response to receiving the second confirmation message and the fourth confirmation message, the second message to the database node (1) and to the second database node (1).. A medium according to any one of Claims 6 to 9, the program code further comprising: code to restore the database instance to a consistent state based on the pages stored in the persistent media. 11. A system comprising: a first database node (1) of a database instance (0), the first database node (1) executing a first distributed database process and comprising a first cache (114) and a first datastore (116), the first database node (1) to: - create (S2) a current savepoint by: - code to identify pages associated with the second current savepoint and stored in the second datastore (126) of the second database node (1); and - code to store (S3) the pages associated with the second current savepoint in a second persistent media. 8. A medium according to any one of Claims 6 to 7, the program code further comprising: code to restore the database instance (0) to a consistent state based on the pages stored in the persistent media and the second persistent media. 9. A medium according to any one of Claims 6 to 8, the program code further comprising: code to transmit, from a coordinator (1) to the database node (1) and to the second database node (1), an instruction to create the current savepoint and the second current savepoint; code to receive the confirmation message and the third confirmation message at the coordinator (1); code to transmit, in response to receiving the confirmation message and the third confirmation message, the first message to enter the critical phase to the database node (1) and to the second database node (1); storing (S4) first modified pages of the first cache (114) in the first datastore (116); -- transmitting (S6) a first confirmation message to a coordinator (1) after storing the first modified pages; -- repeatedly identifying (S8) second modified pages of the first cache (114) and storing the identified second modified pages in the first datastore (116) until a first message is received from the coordinator (1); -- receiving (S3) the first message from the coordinator (1) to enter a critical phase, -- upon receiving the first message from the coordinator (1): --- stopping the repeated identification (S8) and storage of the second modified pages; --- blocking (S312) updates to the first database node (1); and --- transmitting (S314) a second confirmation message to the coordinator (1); and -- receiving (S316) a second message from the coordinator (1) and, in response to the second message, identifying third modified pages of the first cache (114) and copying (S318) the 9

10 17 EP B1 18 third modified pages of the first cache (114) to a staging area, wherein the third modified pages are modified pages that have been accumulated in the cache (114) of the database (1) during the period between the stopping of the repeated identifying (S8) and storing of the second modified pages and the blocking (S312) of the updates to the database node (1); -- in response to receiving the second message: --- unblocking (S322) updates to the first database node (1); and --- storing (S324) the third modified pages copied to the staging area in the datastore (116); - identify (S3) first savepoint pages associated with the current savepoint and stored in the first datastore (116); and - store (S3) the first savepoint pages in a first persistent media. 12. The system according to Claim 11 further comprising: a second database node (1) of the database instance (0), the second database node (1) executing a second distributed database process and comprising a second datastore (126), the second database node (1) to: - create (S2) a second current savepoint in a second one of the plurality of database nodes (1, 1, 1) by: -- storing (S4) fourth modified pages of a cache (124) of the second database node (1) in the second datastore (1); -- transmitting (S6) a third confirmation message to the coordinator (1) after storing the fourth modified pages; -- repeatedly identifying (S8) fifth modified pages of the cache (124) of the second database node (1) and storing the identified fifth modified pages in the second datastore (126); -- receiving (S316) the first message from the coordinator (1) to enter the critical phase and stopping the repeated identifying (S8) and storing of the fifth modified pages in response to the first message; -- blocking (S312) updates to the second database node (1) and transmitting (S314) a fourth confirmation message to the coordinator (1); and receiving (S316) the second message and, in response to receiving the second message, identifying sixth modified pages of the cache (124) of the second database node (1) and storing (S318) the sixth modified pages in the second datastore (126); - in response to receiving the second message, unblocking (S322) updates to the second database node (1) and store (S324) the sixth modified pages of the cache (124) in the second datastore (126); - identify second savepoint pages associated with the second current savepoint and stored in the second datastore; and - store (S3) the second savepoint pages in a second persistent media. 13. The system according to Claim 12, the first database node (1) to: restore the database instance (0) to a consistent state based on the first savepoint pages stored in the persistent media, and the second database node (1) to restore the database instance (0) to the consistent state based on the second savepoint pages the second persistent media. 14. The system according to any one of Claims 11 to 13 further comprising a coordinator (1) to: transmit an instruction to create the current savepoint to the first database node (1), and to transmit an instruction to create the second current savepoint to the second database node (1); receive the confirmation message and the third confirmation message; transmit, in response to receiving the confirmation message and the third confirmation message, the first message to enter the critical phase to the database node (1) and to the second database node (1); receive the second confirmation message and the fourth confirmation message; transmit, in response to receiving the second confirmation message and the fourth confirmation message, the second message to the database node (1) and to the second database node (1). Patentansprüche 1. In einer ausführenden Datenbankinstanz (0), die eine Mehrzahl von Datenbankknoten (1, 1, 1)

11 19 EP B1 enthält, ein Verfahren zum Erzeugen eines Backup der ausführenden Datenbankinstanz (0), umfassend: - Erzeugen (S2) eines aktuellen Sicherungspunkts in einem der Mehrzahl von Datenbankknoten (1, 1, 1) durch: --- Entblocken (S322) von Aktualisierungen des Datenbankknotens (1); und --- Speichern (S324) der dritten modifzierten Seiten, die in den Bereitstellungsbereich kopiert wurden, in dem Datenspeicher (1); -- Speichern (S4) von ersten modifizierten Seiten eines Cache bzw. Zwischenspeichers (114) des Datenbankknotens (1) in einem Datenspeicher (116) des Datenbankknotens (1); -- Übertragen (S6) einer ersten Bestätigungsnachricht an einen Koordinator (1) nach dem Speichern der ersten modifizierten Seiten; -- wiederholt Identifizieren (S8) von zweiten modifizierten Seiten des Cache (114) und Speichern der identifizierten zweiten modifzierten Seiten in einem Datenspeicher (116), bis eine erste Nachricht von dem Koordinator (1) empfangen wird; -- Empfangen (S3) der ersten Nachricht von dem Koordinator (1), in eine kritische Phase einzutreten; -- mit Empfang der ersten Nachricht von dem Koordinator (1): --- Stoppen des wiederholten Identifizierens (S8) und Speicherung der zweiten modifizierten Seiten; --- Blockieren (S312) von Aktualisierungen des Datenbankknotens (1); und --- Übertragen (S314) einer zweiten Bestätigungsnachricht an den Koordinator (1); und -- Empfangen (S316) einer zweiten Nachricht von dem Koordinator (1) und ansprechend auf das Empfangen der zweiten Nachricht Identifizieren von dritten modifzierten Seiten des Cache (114) und Kopieren (S318) der dritten modifzierten Seiten des Cache (114) in einen Bereitstellungsbereich bzw. Staging Area, wobei die dritten modifzierten Seiten modifizierte Seiten sind, die in dem Cache (114) der Datenbank (1) während des Zeitraums zwischen dem Stoppen des wiederholten Identifizierens (S8) und dem Speichern der zweiten modifzierten Seiten und dem Blockieren (S312) der Aktualisierungen des Datenbankknotens (1) angesammelt wurden; -- ansprechend auf das Empfangen der zweiten Nachricht: Identifizieren von Seiten, die mit dem aktuellen Sicherungspunkt assoziiert bzw. verknüpft sind und in dem Datenspeicher (116) gespeichert sind; und - Speichern (S3) der Seiten, die mit dem aktuellen Sicherungspunkt assoziiert bzw. verknüpft sind, in einem persistenten Medien. 2. Verfahren nach Anspruch 1, ferner umfassend: - Erzeugen (S2) eines zweiten aktuellen Sicherungspunkts in einem zweiten der Mehrzahl von Datenbankknoten (1, 1, 1) durch: -- Speichern (S4) von vierten modifizierten Seiten eines Cache bzw. Zwischenspeichers (124) des zweiten Datenbankknotens (1) in einem zweiten Datenspeicher (126) des zweiten Datenbankknotens (1); -- Übertragen (S6) einer dritten Bestätigungsnachricht an den Koordinator (1) nach dem Speichern der vierten modifizierten Seiten; -- wiederholt Identifizieren (S8) von fünften modifizierten Seiten des Cache (124) des zweiten Datenbankknotens (1) und Speichern der identifizierten fünften modifizierten Seiten in dem zweiten Datenspeicher (126) des zweiten Datenbankknotens (1); -- Empfangen (S316) der ersten Nachricht von dem Koordinator (1), in die kritische Phase einzutreten, und Stoppen des wiederholten Identifizierens (S8) und Speichern der fünften modifizierten Seiten ansprechend auf die erste Nachricht; -- Blockieren (S312) von Aktualisierungen des zweiten Datenbankknotens (1) und Übertragen (S314) einer vierten Bestätigungsnachricht an den Koordinator (1); und -- Empfangen (S316) der zweiten Nachricht von dem Koordinator (1) und ansprechend auf das Empfangen der zweiten Bestätigungsnachricht Identifizieren von sechsten modifzierten Seiten des Cache (124) des zweiten Datenbankknotens (1) und Speichern (S318) der sechsten modifzierten Seiten in dem zweiten Datenspeicher (126) des zweiten Datenbankknotens 11

12 21 EP B1 22 (1); - Identifizieren von Seiten, die mit dem zweiten aktuellen Sicherungspunkt assoziiert bzw. verknüpft sind und in dem zweiten Datenspeicher (126) des zweiten Datenbankknotens (1) gespeichert sind; und - Speichern (S3) der Seiten, die mit dem zweiten aktuellen Sicherungspunkt assoziiert bzw. verknüpft sind, in einem zweiten persistenten Medien. 3. Verfahren nach Anspruch 2, ferner umfassend: Wiederherstellen der Datenbankinstanz (0) auf einen konsistenten Zustand basierend auf den Seiten, die in den persistenten Medien und den zweiten persistenten Medien gespeichert sind. 4. Verfahren nach einem der Ansprüche 1 bis 3, ferner umfassend: Übertragen, von einem Koordinator (1) an den Datenbankknoten (1) und an den zweiten Datenbankknoten (1), einer Instruktion, den aktuellen Sicherungspunkt und den zweiten aktuellen Sicherungspunkt zu erzeugen; Empfangen der Bestätigungsnachricht und der dritten Bestätigungsnachricht an dem Koordinator (1); ansprechend auf das Empfangen der Bestätigungsnachricht und der dritten Bestätigungsnachricht, Übertragen der ersten Nachricht, in die kritische Phase einzutreten, an den Datenbankknoten (1) und den zweiten Datenbankknoten (1); Empfangen der zweiten Bestätigungsnachricht und der vierten Bestätigungsnachricht an dem Koordinator (1); ansprechend auf das Empfangen der zweiten Bestätigungsnachricht und der vierten Bestätigungsnachricht, Übertragen der zweiten Nachricht an den Datenbankknoten (1) und den zweiten Datenbankknoten (1).. Verfahren nach einem der Ansprüche 1 bis 4, ferner umfassend: Wiederherstellen der Datenbankinstanz auf einen konsistenten Zustand basierend auf den Seiten, die in den persistenten Medien gespeichert sind. 6. Nicht flüchtiges computerlesbares Medium, das Programmcode speichert, wobei der Programmcode durch einen Computer ausführbar ist, wobei der Programmcode umfasst: Code zum Erzeugen (S2) eines aktuellen Sicherungspunkts in einem einer Mehrzahl von Datenbankknoten (1, 1, 1) eines Ausführenden-Datenbankinstanz-Codes, umfassend: -- Code zum Speichern (S4) von ersten modifizierten Seiten eines Cache bzw. Zwischenspeichers (114) des Datenbankknotens (1) in einem Datenspeicher (116) des Datenbankknotens (1); -- Code zum Übertragen (S6) einer ersten Bestätigungsnachricht an einen Koordinator (1) nach dem Speichern der ersten modifizierten Seiten; -- Code zum wiederholten Identifizieren (S8) von zweiten modifizierten Seiten des Cache (114) und Speichern der identifizierten zweiten modifzierten Seiten in einem Datenspeicher (116), bis eine erste Nachricht von dem Koordinator (1) empfangen wird; -- Code zum Empfangen (S3) der ersten Nachricht von dem Koordinator (1), in eine kritische Phase einzutreten; -- mit Empfang der ersten Nachricht von dem Koordinator (1): --- Stoppen der wiederholten Identifikation (S8) und Speicherung der zweiten modifizierten Seiten; --- Code zum Blockieren (S312) von Aktualisierungen des Datenbankknotens (1); und --- Code zum Übertragen (S314) einer zweiten Bestätigungsnachricht an den Koordinator (1); und -- Code zum Empfangen (S316) einer zweiten Nachricht von dem Koordinator (1) und ansprechend auf die zweite Nachricht Identifizieren von dritten modifzierten Seiten des Cache (114) und Kopieren (S318) der dritten modifzierten Seiten des Cache (114) in einen Bereitstellungsbereich bzw. Staging Area, wobei die dritten modifzierten Seiten modifizierte Seiten sind, die in dem Cache (114) der Datenbank (1) während des Zeitraums zwischen dem Stoppen des wiederholten Identifizierens (S8) und dem Speichern der zweiten modifzierten Seiten und dem Blockieren (S312) der Aktualisierungen des Datenbankknotens (1) angesammelt wurden; -- ansprechend auf das Empfangen der zweiten Nachricht: --- Code zum Entblocken (S322) von 12

13 23 EP B1 24 Aktualisierungen des Datenbankknotens (1); und --- Code zum Speichern (S324) der dritten modifzierten Seiten, die in den Bereitstellungsbereich kopiert wurden, in dem Datenspeicher (1); - Code zum Identifizieren (S3) von Seiten, die mit dem aktuellen Sicherungspunkt assoziiert bzw. verknüpft sind und in dem Datenspeicher (116) gespeichert sind; und - Code zum Speichern (S3) der Seiten, die mit dem aktuellen Sicherungspunkt assoziiert bzw. verknüpft sind, in einem persistenten Medien. 7. Medium nach Anspruch 7, wobei der Programmcode ferner umfasst: - Code zum Erzeugen (S2) eines zweiten aktuellen Sicherungspunkts in einem zweiten der Mehrzahl von Datenbankknoten (1, 1, 1), umfassend: -- Code zum Speichern (S4) von vierten modifizierten Seiten eines Cache bzw. Zwischenspeichers (124) des zweiten Datenbankknotens (1) in einem zweiten Datenspeicher (126) des zweiten Datenbankknotens (1); -- Code zum Übertragen (S6) einer dritten Bestätigungsnachricht an den Koordinator (1) nach dem Speichern der vierten modifizierten Seiten; -- Code zum wiederholten Identifizieren (S8) von fünften modifizierten Seiten des Cache (124) des zweiten Datenbankknotens (1) und Speichern der identifizierten fünften modifizierten Seiten in dem zweiten Datenspeicher (126) des zweiten Datenbankknotens (1); -- Code zum Empfangen (S316) der ersten Nachricht von dem Koordinator (1), in die kritische Phase einzutreten, und ansprechend auf die erste Nachricht Stoppen des wiederholten Identifizierens (S8) und Speichern der fünften modifizierten Seiten; -- Code zum Blockieren (S312) von Aktualisierungen des zweiten Datenbankknotens (1) und Übertragen (S314) einer vierten Bestätigungsnachricht an den Koordinator (1); und -- Code zum Empfangen (S316) der zweiten Bestätigungsnachricht und ansprechend auf die zweite Bestätigungsnachricht Identifizieren von sechsten modifzierten Seiten des Cache (124) des zweiten Datenbankknotens (1) und Speichern (S318) der sechsten modifzierten Seiten in dem zweiten Datenspeicher (126) des zweiten Datenbankknotens (1); - Code zum Identifizieren von Seiten, die mit dem zweiten aktuellen Sicherungspunkt assoziiert bzw. verknüpft sind und in dem zweiten Datenspeicher (126) des zweiten Datenbankknotens (1) gespeichert sind; und - Code zum Speichern (S3) der Seiten, die mit dem zweiten aktuellen Sicherungspunkt assoziiert bzw. verknüpft sind, in einem zweiten persistenten Medien. 8. Medium nach einem der Ansprüche 6 bis 7, wobei der Programmcode ferner umfasst: Code zum Wiederherstellen der Datenbankinstanz (0) auf einen konsistenten Zustand basierend auf den Seiten, die in den persistenten Medien und den zweiten persistenten Medien gespeichert sind. 9. Medium nach einem der Ansprüche 6 bis 8, wobei der Programmcode ferner umfasst: Code zum Übertragen, von einem Koordinator (1) an den Datenbankknoten (1) und an den zweiten Datenbankknoten (1), einer Instruktion, den aktuellen Sicherungspunkt und den zweiten aktuellen Sicherungspunkt zu erzeugen; Code zum Empfangen der Bestätigungsnachricht und der dritten Bestätigungsnachricht an dem Koordinator (1); Code zum Übertragen, ansprechend auf das Empfangen der Bestätigungsnachricht und der dritten Bestätigungsnachricht, der ersten Nachricht, in die kritische Phase einzutreten, an den Datenbankknoten (1) und den zweiten Datenbankknoten (1); Code zum Empfangen der zweiten Bestätigungsnachricht und der vierten Bestätigungsnachricht an dem Koordinator (1); Code zum Übertragen, ansprechend auf das Empfangen der zweiten Bestätigungsnachricht und der vierten Bestätigungsnachricht, der zweiten Nachricht an den Datenbankknoten (1) und den zweiten Datenbankknoten (1).. Medium nach einem der Ansprüche 6 bis 9, wobei der Programmcode ferner umfasst: Code zum Wiederherstellen der Datenbankinstanz auf einen konsistenten Zustand basierend auf den Seiten, die in den persistenten Medien gespeichert sind. 13

14 EP B System, umfassend: einen ersten Datenbankknoten (1) einer Datenbankinstanz (0), wobei der erste Datenbankknoten (1) einen ersten Verteilte-Datenbank-Prozess ausführt und einen ersten Cache bzw. Zwischenspeicher (114) und einen ersten Datenspeicher (116) umfasst, der erste Datenbankknoten (1) zum: - Erzeugen (S2) eines aktuellen Sicherungspunkts durch: -- Speichern (S4) von ersten modifizierten Seiten des ersten Cache (114) in dem ersten Datenspeicher (116); -- Übertragen (S6) einer ersten Bestätigungsnachricht an einen Koordinator (1) nach dem Speichern der ersten modifizierten Seiten; -- wiederholt Identifizieren (S8) von zweiten modifizierten Seiten des ersten Cache (114) und Speichern der identifizierten zweiten modifzierten Seiten in dem ersten Datenspeicher (116), bis eine erste Nachricht von dem Koordinator (1) empfangen wird; -- Empfangen (S3) der ersten Nachricht von dem Koordinator (1), in eine kritische Phase einzutreten; -- mit Empfang der ersten Nachricht von dem Koordinator (1): zweiten modifzierten Seiten und dem Blockieren (S312) der Aktualisierungen des Datenbankknotens (1) angesammelt wurden; -- ansprechend auf das Empfangen der zweiten Nachricht: --- Entblocken (S322) von Aktualisierungen des Datenbankknotens (1); und --- Speichern (S324) der dritten modifzierten Seiten, die in den Bereitstellungsbereich kopiert wurden, in dem Datenspeicher (1); - Identifizieren von ersten Sicherungspunktseiten, die mit dem aktuellen Sicherungspunkt assoziiert bzw. verknüpft sind und in dem Datenspeicher (116) gespeichert sind; und - Speichern (S3) der ersten Sicherungspunktseiten in einem ersten persistenten Medien. 12. System nach Anspruch 11, ferner umfassend: einen zweiten Datenbankknoten (1) der Datenbankinstanz (0), wobei der zweite Datenbankknoten (1) einen zweiten Verteilte-Datenbank-Prozess ausführt und einen zweiten Datenspeicher (126) umfasst, der zweite Datenbankknoten (1) zum: --- Stoppen der wiederholten Identifikation (S8) und Speicherung der zweiten modifizierten Seiten; --- Blockieren (S312) von Aktualisierungen des ersten Datenbankknotens (1); und --- Übertragen (S314) einer zweiten Bestätigungsnachricht an den Koordinator (1); und -- Empfangen (S316) einer zweiten Nachricht von dem Koordinator (1) und ansprechend auf das Empfangen der zweiten Nachricht Identifizieren von dritten modifzierten Seiten des ersten Cache (114) und Kopieren (S318) der dritten modifzierten Seiten des ersten Cache (114) in einen Bereitstellungsbereich bzw. Staging Area, wobei die dritten modifzierten Seiten modifizierte Seiten sind, die in dem Cache (114) der Datenbank (1) während des Zeitraums zwischen dem Stoppen des wiederholten ldentifizierens (S8) und dem Speichern der Erzeugen (S2) eines zweiten aktuellen Sicherungspunkts in einem zweiten der Mehrzahl von Datenbankknoten (1, 1, 1) durch: -- Speichern (S4) von vierten modifizierten Seiten eines Cache bzw. Zwischenspeichers (124) des zweiten Datenbankknotens (1) in dem zweiten Datenspeicher (1); -- Übertragen (S6) einer dritten Bestätigungsnachricht an den Koordinator (1) nach dem Speichern der vierten modifizierten Seiten; -- wiederholt Identifizieren (S8) von fünften modifizierten Seiten des Cache (124) des zweiten Datenbankknotens (1) und Speichern der identifizierten fünften modifizierten Seiten in dem zweiten Datenspeicher (126); -- Empfangen (S316) der ersten Nachricht von dem Koordinator (1), in die kritische Phase einzutreten, und Stoppen des wiederholten Identifizierens (S8) und Speichern der fünften mo- 14

15 27 EP B1 28 difizierten Seiten ansprechend auf die erste Nachricht; -- Blockieren (S312) von Aktualisierungen des zweiten Datenbankknotens (1) und Übertragen (S314) einer vierten Bestätigungsnachricht an den Koordinator (1); und -- Empfangen (S316) der zweiten Nachricht und ansprechend auf das Empfangen der zweiten Bestätigungsnachricht Identifizieren von sechsten modifzierten Seiten des Cache (124) des zweiten Datenbankknotens (1) und Speichern (S318) der sechsten modifzierten Seiten in dem zweiten Datenspeicher (126); - ansprechend auf das Empfangen der zweiten Nachricht, Entblocken (S322) von Aktualisierungen des zweiten Datenbankknotens (1) und Speichern (S324) der sechsten modifizierten Seiten des Cache (124) in dem zweiten Datenspeicher (126); - Identifizieren von zweiten Sicherungspunktseiten, die mit dem zweiten aktuellen Sicherungspunkt assoziiert bzw. verknüpft sind und in dem zweiten Datenspeicher gespeichert sind; und - Speichern (S3) der zweiten Sicherungspunktseiten in einem zweiten persistenten Medien. 13. System nach Anspruch 12, der erste Datenbankknoten (1) zum: Wiederherstellen der Datenbankinstanz (0) auf einen konsistenten Zustand basierend auf den ersten Sicherungspunktseiten, die in den persistenten Medien gespeichert sind, und der zweite Datenbankknoten (1) zum Wiederherstellen der Datenbankinstanz (0) auf den konsistenten Zustand basierend auf den zweiten Sicherungspunktseiten den zweiten persistenten Medien. 14. System nach einem der Ansprüche 11 bis 13, ferner umfassend einen Koordinator (1) zum: Übertragen einer Instruktion, den aktuellen Sicherungspunkt zu dem ersten Datenbankknoten (1) zu erzeugen, und Übertragen einer Instruktion, den zweiten aktuellen Sicherungspunkt zu dem zweiten Datenbankknoten (1) zu erzeugen; Empfangen der Bestätigungsnachricht und der dritten Bestätigungsnachricht; ansprechend auf das Empfangen der Bestätigungsnachricht und der dritten Bestätigungsnachricht, Übertragen der ersten Nachricht, in die kritische Phase einzutreten, an den Datenbankknoten (1) und den zweiten Datenbankknoten (1); Empfangen der zweiten Bestätigungsnachricht und der vierten Bestätigungsnachricht; ansprechend auf das Empfangen der zweiten Bestätigungsnachricht und der vierten Bestätigungsnachricht, Übertragen der zweiten Nachricht an den Datenbankknoten (1) und den zweiten Datenbankknoten (1). Revendications 1. Dans une instance de base de données en cours d exécution (0) incluant une pluralité de noeuds de base de données (1, 1, 1), procédé pour créer une sauvegarde de l instance de base de données en cours d exécution (0) comprenant : - créer (S2) un point de sauvegarde actuel dans un noeud de la pluralité de noeuds de base de données (1, 1, 1) en : -- stockant (S4) des premières pages modifiées d un cache (114) du noeud de base de données (1) dans un magasin de données (116) du noeud de base de données (1); -- transmettant (S6) un premier message de confirmation à un coordinateur (1) après le stockage des premières pages modifiées ; -- identifiant de manière répétée (S8) des deuxièmes pages modifiées du cache (114) et stockant les deuxièmes pages modifiées identifiées dans le magasin de données (116) jusqu à ce qu un premier message soit reçu du coordinateur (1); -- recevant (S3) le premier message du coordinateur (1) pour entrer dans une phase critique ; -- suite à la réception du premier message du coordinateur (1) : --- arrêtant l identification répétée (S8) et le stockage des deuxièmes pages modifiées ; --- bloquant (S312) des mises à jour du noeud de base de données (1) ; et --- transmettant (S314) un deuxième message de confirmation au coordinateur (1) ; et -- recevant (S316) un deuxième message du coordinateur (1) et, en réponse à la réception du deuxième message, identifiant des troisièmes pages modifiées du cache (114) et copiant

16 29 EP B1 (S318) les troisièmes pages modifiées du cache (114) vers une zone de préparation, dans lequel les troisièmes pages modifiées sont des pages modifiées qui ont été accumulées dans le cache (114) de la base de données (1) au cours de la période entre l arrêt de l identification répétée (S8) et du stockage des deuxièmes pages modifiées et le blocage (S312) des mises à jour du noeud de base de données (1) ; -- en réponse à la réception du deuxième message : --- débloquant (S322) des mises à jour du noeud de base de données (1) ; et --- stockant (S324) les troisièmes pages modifiées copiées vers la zone de préparation dans le magasin de données (1) ; - identifier des pages associées au point de sauvegarde actuel et stockées dans le magasin de données (116) ; et - stocker (S3) les pages associées au point de sauvegarde actuel dans un support persistant. 2. Procédé selon la revendication 1, comprenant en outre : - créer (S2) un second point de sauvegarde actuel dans un second noeud de la pluralité de noeuds de base de données (1, 1, 1) en : stockant (S4) des quatrièmes pages modifiées d un cache (124) du second noeud de base de données (1) dans un second magasin de données (126) du second noeud de base de données (1) ; -- transmettant (S6) un troisième message de confirmation au coordinateur (1) après le stockage des quatrièmes pages modifiées ; -- identifiant de manière répétée (S8) des cinquièmes pages modifiées du cache (124) du second noeud de base de données (1) et stockant les cinquièmes pages modifiées identifiées dans le second magasin de données (126) du second noeud de base de données (1) ; -- recevant (S316) le premier message du coordinateur (1) pour entrer dans la phase critique et arrêtant l identification répétée (S8) et le stockage des cinquièmes pages modifiées en réponse au premier message ; -- bloquant (S312) des mises à jour du second noeud de base de données (1) et transmettant (S314) un quatrième message de confirmation au coordinateur (1) ; et -- recevant (S316) le deuxième message du coordinateur (1) et, en réponse à la réception du deuxième message de confirmation, identifiant des sixièmes pages modifiées du cache (124) du second noeud de base de données (1) et stockant (S318) les sixièmes pages modifiées dans le second magasin de données (126) du second noeud de base de données (1) ; - identifier des pages associées au second point de sauvegarde actuel et stockées dans le second magasin de données (126) du second noeud de base de données (1) ; et - stocker (S3) les pages associées au second point de sauvegarde actuel dans un second support persistant. 3. Procédé selon la revendication 2, comprenant en outre : restaurer l instance de base de données (0) à un état cohérent en fonction des pages stockées dans le support persistant et le second support persistant. 4. Procédé selon l une quelconque des revendications 1 à 3, comprenant en outre : transmettre d un coordinateur (1) au noeud de base de données (1) et au second noeud de base de données (1) une instruction de créer le point de sauvegarde actuel et le second point de sauvegarde actuel ; recevoir le message de confirmation et le troisième message de confirmation au niveau du coordinateur (1) ; en réponse à la réception du message de confirmation et du troisième message de confirmation, transmettre le premier message pour entrer dans la phase critique au noeud de base de données (1) et au second noeud de base de données (1) ; recevoir le deuxième message de confirmation et le quatrième message de confirmation au niveau du coordinateur (1) ; en réponse à la réception du deuxième message de confirmation et du quatrième message de confirmation, transmettre le deuxième message au noeud de base de données (1) et au second noeud de base de données (1).. Procédé selon l une quelconque des revendications 1 à 4, comprenant en outre : 16

17 31 EP B1 32 restaurer l instance de base de données à un état cohérent en fonction des pages stockées dans le support persistant. 6. Support non transitoire lisible par ordinateur stockant du code de programme, le code de programme pouvant être exécuté par un ordinateur, le code de programme comprenant : - du code pour créer (S2) un point de sauvegarde actuel dans un noeud d une pluralité de noeuds de base de données (1, 1, 1) d un code d instance de base de données en cours d exécution comprenant : -- du code pour stocker (S4) des premières pages modifiées d un cache (114) du noeud de base de données (1) dans un magasin de données (116) du noeud de base de données (1) ; -- du code pour transmettre (S6) un premier message de confirmation à un coordinateur (1) après le stockage des premières pages modifiées ; -- du code pour identifier de manière répétée (S8) des deuxièmes pages modifiées du cache (114) et stocker les deuxièmes pages modifiées identifiées dans le magasin de données (116) jusqu à ce qu un premier message soit reçu du coordinateur (1) ; -- du code pour recevoir (S3) le premier message du coordinateur (1) pour entrer dans une phase critique, -- suite à la réception du premier message du coordinateur : --- arrêter l identification répétée (S8) et le stockage des deuxièmes pages modifiées ; --- du code pour bloquer (S312) des mises à jour du noeud de base de données (1) ; et --- du code pour transmettre (S314) un deuxième message de confirmation au coordinateur (1) ; -- du code pour recevoir (S316) un deuxième message du coordinateur (1) et, en réponse à la réception du deuxième message, identifier des troisièmes pages modifiées du cache (114) et copier (S318) les troisièmes pages modifiées du cache (114) vers une zone de préparation, dans lequel les troisièmes pages modifiées sont des pages modifiées qui ont été accumulées dans le cache (114) de la base de données (1) au cours de la période entre l arrêt de l identification répétée (S8) et du stockage des deuxièmes pages modifiées et le blocage (S312) des mises à jour du noeud de base de données (1) ; -- en réponse à la réception du deuxième message : --- du code pour débloquer (S322) des mises à jour du noeud de base de données (1) ; et --- du code pour stocker (S324) les troisièmes pages modifiées copiées vers la zone de préparation dans le magasin de données (1) ; - du code pour identifier (S3) des pages associées au point de sauvegarde actuel et stockées dans le magasin de données (116) ; et - du code pour stocker (S3) les pages associées au point de sauvegarde actuel dans un support persistant. 7. Support selon la revendication 6, le code de programme comprenant en outre : - du code pour créer (S2) un second point de sauvegarde actuel dans un second noeud de la pluralité de noeuds de base de données (1, 1, 1) comprenant : -- du code pour stocker (S4) des quatrièmes pages modifiées d un cache (124) du second noeud de base de données (1) dans un second magasin de données (126) du second noeud de base de données (1) ; -- du code pour transmettre (S6) un troisième message de confirmation au coordinateur (1) après le stockage des quatrièmes pages modifiées ; -- du code pour identifier de manière répétée (S8) des cinquièmes pages modifiées du cache (124) du second noeud de base de données (1) et stocker les cinquièmes pages modifiées identifiées dans le second magasin de données (126) du second noeud de base de données (1) ; -- du code pour recevoir (S316) le premier message du coordinateur (1) pour entrer dans la phase critique et, en réponse au premier message, arrêter l identification répétée (S8) et le stockage des cinquièmes pages modifiées ; --- du code pour bloquer (S312) des mises à jour du second noeud de base de données (1) et transmettre (S314) un 17

18 33 EP B1 34 quatrième message de confirmation au coordinateur (1) ; et -- du code pour recevoir (S316) le deuxième message du coordinateur et, en réponse au deuxième message de confirmation, identifier des sixièmes pages modifiées du cache (124) du second noeud de base de données (1) et stocker (S318) les sixièmes pages modifiées dans le second magasin de données (126) du second noeud de base de données (1) ; - du code pour identifier des pages associées au second point de sauvegarde actuel et stockées dans le second magasin de données (126) du second noeud de base de données (1) ; et - du code pour stocker (S3) les pages associées au second point de sauvegarde actuel dans un second support persistant. 8. Support selon l une quelconque des revendications 6 à 7, le code de programme comprenant en outre : du code pour restaurer l instance de base de données (0) à un état cohérent en fonction des pages stockées dans le support persistant et le second support persistant. 9. Support selon l une quelconque des revendications 6 à 8, le code de programme comprenant en outre : du code pour transmettre d un coordinateur (1) au noeud de base de données (1) et au second noeud de base de données (1) une instruction de créer le point de sauvegarde actuel et le second point de sauvegarde actuel ; du code pour recevoir le message de confirmation et le troisième message de confirmation au niveau du coordinateur (1) ; du code pour transmettre, en réponse à la réception du message de confirmation et du troisième message de confirmation, le premier message pour entrer dans la phase critique au noeud de base de données (1) et au second noeud de base de données (1) ; du code pour recevoir le deuxième message de confirmation et le quatrième message de confirmation au niveau du coordinateur (1) ; du code pour transmettre, en réponse à la réception du deuxième message de confirmation et du quatrième message de confirmation, le deuxième message au noeud de base de données (1) et au second noeud de base de données (1).. Support selon l une quelconque des revendications 6 à 9, le code de programme comprenant en outre : du code pour restaurer l instance de base de données à un état cohérent en fonction des pages stockées dans le support persistant. 11. Système comprenant : un premier noeud de base de données (1) d une instance de base de données (0), le premier noeud de base de données (1) exécutant un premier processus de base de données distribuée et comprenant un premier cache (114) et un premier magasin de données (116), le premier noeud de base de données (1) étant destiné à : - créer (S2) un point de sauvegarde actuel en : -- stockant (S4) des premières pages modifiées du premier cache (114) dans le magasin de données (116) ; -- transmettant (S6) un premier message de confirmation à un coordinateur (1) après le stockage des premières pages modifiées ; -- identifiant de manière répétée (S8) des deuxièmes pages modifiées du premier cache (114) et stockant les deuxièmes pages modifiées identifiées dans le premier magasin de données (116) jusqu à ce qu un premier message soit reçu du coordinateur (1) ; -- recevant (S3) le premier message du coordinateur (1) pour entrer dans une phase critique, -- suite à la réception du premier message du coordinateur (1) : --- arrêtant l identification répétée (S8) et le stockage des deuxièmes pages modifiées ; --- bloquant (S312) des mises à jour du premier noeud de base de données (1) ; et --- transmettant (S314) un deuxième message de confirmation au coordinateur (1) ; et -- recevant (S316) un deuxième message du coordinateur (1) et, en réponse au deuxième message, identifiant des troisièmes pages modifiées du premier cache (114) et copiant (S318) les troisièmes pages modifiées du premier cache (114) vers une zone de préparation, dans lequel les troisièmes pages modifiées sont des pages modifiées qui 18

19 3 EP B1 36 ont été accumulées dans le cache (114) de la base de données (1) au cours de la période entre l arrêt de l identification répétée (S8) et du stockage des deuxièmes pages modifiées et le blocage (S312) des mises à jour du noeud de base de données (1) ; -- en réponse à la réception du deuxième message : --- débloquant (S322) des mises à jour du premier noeud de base de données (1) ; et --- stockant (S324) les troisièmes pages modifiées copiées vers la zone de préparation dans le magasin de données (116) ; - identifier des premières pages de point de sauvegarde associées au point de sauvegarde actuel et stockées dans le premier magasin de données (116) ; et - stocker (S3) les premières pages de point de sauvegarde dans un premier support persistant. 12. Système selon la revendication 11, comprenant en outre : un second noeud de base de données (1) de l instance de base de données (0), le second noeud de base de données (1) exécutant un second processus de base de données distribuée et comprenant un second magasin de données (126), le second noeud de base de données (1) étant destiné à : - créer (S2) un second point de sauvegarde actuel dans un second noeud de la pluralité de noeuds de base de données (1, 1, 1) en : stockant (S4) des quatrièmes pages modifiées d un cache (124) du second noeud de base de données (1) dans le second magasin de données (1) ; -- transmettant (S6) un troisième message de confirmation au coordinateur (1) après le stockage des quatrièmes pages modifiées ; -- identifiant de manière répétée (S8) des cinquièmes pages modifiées du cache (124) du second noeud de base de données (1) et stockant les cinquièmes pages modifiées identifiées dans le second magasin de données (126) ; -- recevant (S316) le premier message du coordinateur (1) pour entrer dans la phase critique et arrêtant l identification répétée (S8) et le stockage des cinquièmes pages modifiées en réponse au premier message ; --- bloquant (S312) des mises à jour du second noeud de base de données (1) et transmettant (S314) un quatrième message de confirmation au coordinateur (1) ; et -- recevant (S316) le deuxième message et, en réponse à la réception du deuxième message, identifiant des sixièmes pages modifiées du cache (124) du second noeud de base de données (1) et stockant (S318) les sixièmes pages modifiées dans le second magasin de données (126) ; - en réponse à la réception du deuxième message, débloquant (S322) des mises à jour du second noeud de base de données (1) et stockant (S324) les sixièmes pages modifiées du cache (124) dans le second magasin de données (126) ; - identifier des secondes pages de point de sauvegarde associées au second point de sauvegarde actuel et stockées dans le second magasin de données ; et - stocker (S3) les secondes pages de point de sauvegarde dans un second support persistant. 13. Système selon la revendication 12, le premier noeud de base de données (1) étant destiné à : restaurer l instance de base de données (0) à un état cohérent en fonction des premières pages de point de sauvegarde stockées dans le support persistant, et le second noeud de base de données (1) étant destiné à restaurer l instance de base de données (0) à un état cohérent en fonction des secondes pages de point de sauvegarde le second support persistant. 14. Système selon l une quelconque des revendications 11 à 13, comprenant en outre un coordinateur (1) pour : transmettre une instruction de créer le point de sauvegarde actuel au premier noeud de base de données (1) et pour transmettre une instruction de créer le second point de sauvegarde actuel au second noeud de base de données (1) ; recevoir le message de confirmation et le troisième message de confirmation ; transmettre, en réponse à la réception du message de confirmation et du troisième message 19

20 37 EP B1 38 de confirmation, le premier message pour entrer dans la phase critique au noeud de base de données (1) et au second noeud de base de données (1) ; recevoir le deuxième message de confirmation et le quatrième message de confirmation ; transmettre, en réponse à la réception du deuxième message de confirmation et du quatrième message de confirmation, le deuxième message au noeud de base de données (1) et au second noeud de base de données (1)

TEPZZ 87_546A T EP 2 871 546 A2 (19) (11) EP 2 871 546 A2 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: G05B 19/05 (2006.01)

TEPZZ 87_546A T EP 2 871 546 A2 (19) (11) EP 2 871 546 A2 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: G05B 19/05 (2006.01) (19) TEPZZ 87_46A T (11) EP 2 871 46 A2 (12) EUROPEAN PATENT APPLICATION (43) Date of publication: 13.0.1 Bulletin 1/ (1) Int Cl.: G0B 19/0 (06.01) (21) Application number: 14188238.1 (22) Date of filing:

More information

(51) Int Cl.: G06F 11/14 (2006.01) G06F 12/08 (2006.01)

(51) Int Cl.: G06F 11/14 (2006.01) G06F 12/08 (2006.01) (19) TEPZZ 488949B_T (11) EP 2 488 949 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 07.0.14 Bulletin 14/19 (21) Application number: 76367.4 (22)

More information

TEPZZ 9 Z5A_T EP 2 922 305 A1 (19) (11) EP 2 922 305 A1. (12) EUROPEAN PATENT APPLICATION published in accordance with Art.

TEPZZ 9 Z5A_T EP 2 922 305 A1 (19) (11) EP 2 922 305 A1. (12) EUROPEAN PATENT APPLICATION published in accordance with Art. (19) TEPZZ 9 ZA_T (11) EP 2 922 A1 (12) EUROPEAN PATENT APPLICATION published in accordance with Art. 13(4) EPC (43) Date of publication: 23.09.1 Bulletin 1/39 (21) Application number: 1386446.2 (22) Date

More information

TEPZZ 68575_A_T EP 2 685 751 A1 (19) (11) EP 2 685 751 A1. (12) EUROPEAN PATENT APPLICATION published in accordance with Art.

TEPZZ 68575_A_T EP 2 685 751 A1 (19) (11) EP 2 685 751 A1. (12) EUROPEAN PATENT APPLICATION published in accordance with Art. (19) TEPZZ 687_A_T (11) EP 2 68 71 A1 (12) EUROPEAN PATENT APPLICATION published in accordance with Art. 3(4) EPC (43) Date of publication:.01.14 Bulletin 14/03 (21) Application number: 1278849.6 (22)

More information

(51) Int Cl.: G06F 9/455 (2006.01) G06F 9/50 (2006.01)

(51) Int Cl.: G06F 9/455 (2006.01) G06F 9/50 (2006.01) (19) TEPZZ 6987 B_T (11) EP 2 698 711 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 0.08.1 Bulletin 1/32 (21) Application number: 118777.8 (22) Date

More information

(51) Int Cl.: G10L 15/26 (2006.01)

(51) Int Cl.: G10L 15/26 (2006.01) (19) TEPZZ Z 8B_T (11) EP 2 023 338 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 28.0.14 Bulletin 14/22 (1) Int Cl.: GL /26 (06.01) (21) Application

More information

TEPZZ 6_Z76 A_T EP 2 610 763 A1 (19) (11) EP 2 610 763 A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.:

TEPZZ 6_Z76 A_T EP 2 610 763 A1 (19) (11) EP 2 610 763 A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: (19) TEPZZ 6_Z76 A_T (11) EP 2 6 763 A1 (12) EUROPEAN PATENT APPLICATION (43) Date of publication: 03.07.2013 Bulletin 2013/27 (51) Int Cl.: G06F 17/30 (2006.01) (21) Application number: 12192220.7 (22)

More information

EP 2 455 926 A1 (19) (11) EP 2 455 926 A1 (12) EUROPEAN PATENT APPLICATION. (43) Date of publication: 23.05.2012 Bulletin 2012/21

EP 2 455 926 A1 (19) (11) EP 2 455 926 A1 (12) EUROPEAN PATENT APPLICATION. (43) Date of publication: 23.05.2012 Bulletin 2012/21 (19) (12) EUROPEAN PATENT APPLICATION (11) EP 2 4 926 A1 (43) Date of publication: 23.0.2012 Bulletin 2012/21 (21) Application number: 11190024.7 (1) Int Cl.: G08B 2/14 (2006.01) G08B 2/00 (2006.01) G0B

More information

(51) Int Cl.: H04L 9/32 (2006.01) G09C 1/00 (2006.01) G06F 21/33 (2013.01) H04L 29/06 (2006.01)

(51) Int Cl.: H04L 9/32 (2006.01) G09C 1/00 (2006.01) G06F 21/33 (2013.01) H04L 29/06 (2006.01) (19) TEPZZ Z48B_T (11) EP 2 2 048 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 13.0. Bulletin / (21) Application number: 1179238.6 (22) Date of

More information

TEPZZ 87657ZA_T EP 2 876 570 A1 (19) (11) EP 2 876 570 A1 (12) EUROPEAN PATENT APPLICATION

TEPZZ 87657ZA_T EP 2 876 570 A1 (19) (11) EP 2 876 570 A1 (12) EUROPEAN PATENT APPLICATION (19) TEPZZ 8767ZA_T (11) EP 2 876 70 A1 (12) EUROPEAN PATENT APPLICATION (43) Date of publication: 27.0.201 Bulletin 201/22 (21) Application number: 14189809.8 (1) Int Cl.: G06F 21/34 (2013.01) G08B 13/196

More information

TEPZZ 65Z79 A_T EP 2 650 793 A1 (19) (11) EP 2 650 793 A1. (12) EUROPEAN PATENT APPLICATION published in accordance with Art.

TEPZZ 65Z79 A_T EP 2 650 793 A1 (19) (11) EP 2 650 793 A1. (12) EUROPEAN PATENT APPLICATION published in accordance with Art. (19) TEPZZ 65Z79 A_T (11) EP 2 650 793 A1 (12) EUROPEAN PATENT APPLICATION published in accordance with Art. 153(4) EPC (43) Date of publication: 16.10.2013 Bulletin 2013/42 (21) Application number: 12818771.3

More information

(51) Int Cl.: G06F 11/14 (2006.01) G06F 17/30 (2006.01)

(51) Int Cl.: G06F 11/14 (2006.01) G06F 17/30 (2006.01) (19) TEPZZ_97799B_T (11) EP 1 97 799 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 06.0. Bulletin /19 (1) Int Cl.: G06F 11/14 (06.01) G06F 17/ (06.01)

More information

TEPZZ 96 A_T EP 2 961 111 A1 (19) (11) EP 2 961 111 A1. (12) EUROPEAN PATENT APPLICATION published in accordance with Art.

TEPZZ 96 A_T EP 2 961 111 A1 (19) (11) EP 2 961 111 A1. (12) EUROPEAN PATENT APPLICATION published in accordance with Art. (19) TEPZZ 96 A_T (11) EP 2 961 111 A1 (12) EUROPEAN PATENT APPLICATION published in accordance with Art. 13(4) EPC (43) Date of publication:.12.1 Bulletin 1/3 (21) Application number: 147426.7 (22) Date

More information

(51) Int Cl.: H04L 12/24 (2006.01) G06F 9/445 (2006.01)

(51) Int Cl.: H04L 12/24 (2006.01) G06F 9/445 (2006.01) (19) (12) EUROPEAN PATENT SPECIFICATION (11) EP 1 978 672 B1 (4) Date of publication and mention of the grant of the patent: 01.09. Bulletin /3 (1) Int Cl.: H04L 12/24 (06.01) G06F 9/44 (06.01) (21) Application

More information

(51) Int Cl.: H04L 12/56 (2006.01)

(51) Int Cl.: H04L 12/56 (2006.01) (19) (11) EP 1 779 90 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 28.12.11 Bulletin 11/2 (21) Application number: 0783482.2 (22) Date of filing:

More information

(51) Int Cl.: H04L 29/06 (2006.01) H04M 15/00 (2006.01)

(51) Int Cl.: H04L 29/06 (2006.01) H04M 15/00 (2006.01) (19) TEPZZ 7Z 74 B_T (11) EP 2 702 742 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent:.04. Bulletin /16 (21) Application number: 1171674.6 (22) Date

More information

(51) Int Cl.: H04L 29/06 (2006.01) G06F 9/445 (2006.01) G06F 13/00 (2006.01)

(51) Int Cl.: H04L 29/06 (2006.01) G06F 9/445 (2006.01) G06F 13/00 (2006.01) (19) TEPZZ_7486_6B_T (11) EP 1 748 616 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 03.09.2014 Bulletin 2014/36 (1) Int Cl.: H04L 29/06 (2006.01)

More information

(51) Int Cl.: G06F 11/14 (2006.01)

(51) Int Cl.: G06F 11/14 (2006.01) (19) (12) EUROPEAN PATENT SPECIFICATION (11) EP 1 08 414 B1 (4) Date of publication and mention of the grant of the patent: 04.03.09 Bulletin 09/ (1) Int Cl.: G06F 11/14 (06.01) (21) Application number:

More information

TEPZZ 84 587A_T EP 2 843 587 A1 (19) (11) EP 2 843 587 A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: G06F 21/64 (2013.01)

TEPZZ 84 587A_T EP 2 843 587 A1 (19) (11) EP 2 843 587 A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: G06F 21/64 (2013.01) (19) TEPZZ 84 87A_T (11) EP 2 843 87 A1 (12) EUROPEAN PATENT APPLICATION (43) Date of publication: 04.03.201 Bulletin 201/ (1) Int Cl.: G06F 21/64 (2013.01) (21) Application number: 13181902.1 (22) Date

More information

*EP001173363B1* EP 1 173 363 B1 (19) (11) EP 1 173 363 B1 (12) EUROPEAN PATENT SPECIFICATION

*EP001173363B1* EP 1 173 363 B1 (19) (11) EP 1 173 363 B1 (12) EUROPEAN PATENT SPECIFICATION (19) Europäisches Patentamt European Patent Office Office européen des brevets *EP001173363B1* (11) EP 1 173 363 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of

More information

(51) Int Cl.: H04L 29/06 (2006.01) (56) References cited:

(51) Int Cl.: H04L 29/06 (2006.01) (56) References cited: (19) (11) EP 1 4 48 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 06.08.08 Bulletin 08/32 (21) Application number: 02776379.6 (22) Date of filing:..02

More information

EP 2 365 669 A1 (19) (11) EP 2 365 669 A1 (12) EUROPEAN PATENT APPLICATION. (43) Date of publication: 14.09.2011 Bulletin 2011/37

EP 2 365 669 A1 (19) (11) EP 2 365 669 A1 (12) EUROPEAN PATENT APPLICATION. (43) Date of publication: 14.09.2011 Bulletin 2011/37 (19) (12) EUROPEAN PATENT APPLICATION (11) EP 2 36 669 A1 (43) Date of publication: 14.09.11 Bulletin 11/37 (1) Int Cl.: H04L 12/8 (06.01) (21) Application number: 00243.6 (22) Date of filing:.03. (84)

More information

TEPZZ 8898 7A_T EP 2 889 827 A1 (19) (11) EP 2 889 827 A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: G06Q 40/04 (2012.01)

TEPZZ 8898 7A_T EP 2 889 827 A1 (19) (11) EP 2 889 827 A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: G06Q 40/04 (2012.01) (19) TEPZZ 8898 7A_T (11) EP 2 889 827 A1 (12) EUROPEAN PATENT APPLICATION (43) Date of publication: 01.07.201 Bulletin 201/27 (1) Int Cl.: G06Q 40/04 (2012.01) (21) Application number: 14199864.1 (22)

More information

TEPZZ 69 49A_T EP 2 693 349 A1 (19) (11) EP 2 693 349 A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: G06F 17/30 (2006.01)

TEPZZ 69 49A_T EP 2 693 349 A1 (19) (11) EP 2 693 349 A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: G06F 17/30 (2006.01) (19) TEPZZ 69 49A_T (11) EP 2 693 349 A1 (12) EUROPEAN PATENT APPLICATION (43) Date of publication: 0.02.2014 Bulletin 2014/06 (1) Int Cl.: G06F 17/30 (2006.01) (21) Application number: 13160696.4 (22)

More information

(51) Int Cl.: B29C 41/20 (2006.01) F21S 4/00 (2006.01) H05K 3/28 (2006.01)

(51) Int Cl.: B29C 41/20 (2006.01) F21S 4/00 (2006.01) H05K 3/28 (2006.01) (19) TEPZZ 68698B_T (11) EP 2 68 698 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 18.11.201 Bulletin 201/47 (21) Application number: 11808612.3

More information

(51) Int Cl.: H04L 12/58 (2006.01) H04L 29/06 (2006.01)

(51) Int Cl.: H04L 12/58 (2006.01) H04L 29/06 (2006.01) (19) TEPZZ_986 8 B_T (11) EP 1 986 382 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 19.02.14 Bulletin 14/08 (1) Int Cl.: H04L 12/8 (06.01) H04L

More information

TEPZZ 94Z968A_T EP 2 940 968 A1 (19) (11) EP 2 940 968 A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: H04L 29/08 (2006.01)

TEPZZ 94Z968A_T EP 2 940 968 A1 (19) (11) EP 2 940 968 A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: H04L 29/08 (2006.01) (19) TEPZZ 94Z968A_T (11) EP 2 940 968 A1 (12) EUROPEAN PATENT APPLICATION (43) Date of publication: 04.11.20 Bulletin 20/4 (1) Int Cl.: H04L 29/08 (2006.01) (21) Application number: 1430649.7 (22) Date

More information

(51) Int Cl.: G06F 13/38 (2006.01) G06F 1/16 (2006.01)

(51) Int Cl.: G06F 13/38 (2006.01) G06F 1/16 (2006.01) (19) TEPZZ 9777B_T (11) EP 2 97 77 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 1.07.1 Bulletin 1/29 (1) Int Cl.: G06F 13/38 (06.01) G06F 1/16 (06.01)

More information

(51) Int Cl.: H04W 4/14 (2009.01)

(51) Int Cl.: H04W 4/14 (2009.01) (19) (12) EUROPEAN PATENT SPECIFICATION (11) EP 2 184 897 B1 (4) Date of publication and mention of the grant of the patent: 14.03.12 Bulletin 12/11 (21) Application number: 087774.3 (22) Date of filing:

More information

(51) Int Cl.: G01C 21/36 (2006.01)

(51) Int Cl.: G01C 21/36 (2006.01) (19) TEPZZ_ 678B_T (11) EP 1 26 78 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent:.09.14 Bulletin 14/37 (1) Int Cl.: G01C 21/36 (06.01) (21) Application

More information

(51) Int Cl.: H02H 7/26 (2006.01) H02H 7/30 (2006.01)

(51) Int Cl.: H02H 7/26 (2006.01) H02H 7/30 (2006.01) (19) TEPZZ 66ZZ_B_T (11) EP 2 66 001 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 11.03. Bulletin /11 (1) Int Cl.: H02H 7/26 (06.01) H02H 7/ (06.01)

More information

TEPZZ 88_898A_T EP 2 881 898 A1 (19) (11) EP 2 881 898 A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: G06N 5/04 (2006.01) G06F 17/30 (2006.

TEPZZ 88_898A_T EP 2 881 898 A1 (19) (11) EP 2 881 898 A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: G06N 5/04 (2006.01) G06F 17/30 (2006. (19) TEPZZ 88_898A_T (11) EP 2 881 898 A1 (12) EUROPEAN PATENT APPLICATION (43) Date of publication:.06. Bulletin /24 (1) Int Cl.: G06N /04 (06.01) G06F 17/ (06.01) (21) Application number: 136680.3 (22)

More information

EP 2 492 881 A2 (19) (11) EP 2 492 881 A2 (12) EUROPEAN PATENT APPLICATION. (43) Date of publication: 29.08.2012 Bulletin 2012/35

EP 2 492 881 A2 (19) (11) EP 2 492 881 A2 (12) EUROPEAN PATENT APPLICATION. (43) Date of publication: 29.08.2012 Bulletin 2012/35 (19) (12) EUROPEAN PATENT APPLICATION (11) EP 2 492 881 A2 (43) Date of publication: 29.08.2012 Bulletin 2012/35 (51) Int Cl.: G08B 13/16 (2006.01) G08B 25/08 (2006.01) (21) Application number: 12386006.6

More information

(51) Int Cl.: H04L 29/12 (2006.01) H04L 12/56 (2006.01)

(51) Int Cl.: H04L 29/12 (2006.01) H04L 12/56 (2006.01) (19) (11) EP 1 993 266 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 04.07.12 Bulletin 12/27 (1) Int Cl.: H04L 29/12 (06.01) H04L 12/6 (06.01) (21)

More information

(51) Int Cl.: H04N 7/52 (2011.01)

(51) Int Cl.: H04N 7/52 (2011.01) (19) TEPZZ_9776 B_T (11) EP 1 977 611 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 16.01.13 Bulletin 13/03 (21) Application number: 0683819.1 (22)

More information

TEPZZ_768 7_B_T EP 1 768 371 B1 (19) (11) EP 1 768 371 B1 (12) EUROPEAN PATENT SPECIFICATION. (51) Int Cl.: H04M 19/04 (2006.01)

TEPZZ_768 7_B_T EP 1 768 371 B1 (19) (11) EP 1 768 371 B1 (12) EUROPEAN PATENT SPECIFICATION. (51) Int Cl.: H04M 19/04 (2006.01) (19) TEPZZ_768 7_B_T (11) EP 1 768 371 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 1.01.2014 Bulletin 2014/03 (1) Int Cl.: H04M 19/04 (2006.01)

More information

SAP Note 1642148 - FAQ: SAP HANA Database Backup & Recovery

SAP Note 1642148 - FAQ: SAP HANA Database Backup & Recovery Note Language: English Version: 1 Validity: Valid Since 14.10.2011 Summary Symptom To ensure optimal performance, SAP HANA database holds the bulk of its data in memory. However, it still uses persistent

More information

(51) Int Cl.: H04L 12/24 (2006.01) H04L 12/26 (2006.01)

(51) Int Cl.: H04L 12/24 (2006.01) H04L 12/26 (2006.01) (19) (11) EP 1 3 219 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 03.01.07 Bulletin 07/01 (1) Int Cl.: H04L 12/24 (06.01) H04L 12/26 (06.01) (21)

More information

TEPZZ 79ZZ8_A_T EP 2 790 081 A1 (19) (11) EP 2 790 081 A1 (12) EUROPEAN PATENT APPLICATION. (43) Date of publication: 15.10.2014 Bulletin 2014/42

TEPZZ 79ZZ8_A_T EP 2 790 081 A1 (19) (11) EP 2 790 081 A1 (12) EUROPEAN PATENT APPLICATION. (43) Date of publication: 15.10.2014 Bulletin 2014/42 (19) TEPZZ 79ZZ8_A_T (11) EP 2 790 081 A1 (12) EUROPEAN PATENT APPLICATION (43) Date of publication: 1..14 Bulletin 14/42 (1) Int Cl.: G0D 23/19 (06.01) (21) Application number: 1414221.7 (22) Date of

More information

Title (fr) SOURCE IONIQUE INTERNE DOUBLE POUR PRODUCTION DE FAISCEAU DE PARTICULES AVEC UN CYCLOTRON

Title (fr) SOURCE IONIQUE INTERNE DOUBLE POUR PRODUCTION DE FAISCEAU DE PARTICULES AVEC UN CYCLOTRON Title (en) A TWIN INTERNAL ION SOURCE FOR PARTICLE BEAM PRODUCTION WITH A CYCLOTRON Title (de) DOPPELTE INTERNE IONENQUELLE FÜR PARTIKELSTRAHLHERSTELLUNG MIT EINEM ZYKLOTRON Title (fr) SOURCE IONIQUE INTERNE

More information

*EP001520563A1* EP 1 520 563 A1 (19) (11) EP 1 520 563 A1 (12) EUROPEAN PATENT APPLICATION. (43) Date of publication: 06.04.2005 Bulletin 2005/14

*EP001520563A1* EP 1 520 563 A1 (19) (11) EP 1 520 563 A1 (12) EUROPEAN PATENT APPLICATION. (43) Date of publication: 06.04.2005 Bulletin 2005/14 (19) Europäisches Patentamt European Patent Office Office européen des brevets *EP001520563A1* (11) EP 1 520 563 A1 (12) EUROPEAN PATENT APPLICATION (43) Date of publication: 06.04.2005 Bulletin 2005/14

More information

TEPZZ 69 _ZA T EP 2 692 310 A2 (19) (11) EP 2 692 310 A2. (12) EUROPEAN PATENT APPLICATION published in accordance with Art.

TEPZZ 69 _ZA T EP 2 692 310 A2 (19) (11) EP 2 692 310 A2. (12) EUROPEAN PATENT APPLICATION published in accordance with Art. (19) TEPZZ 69 _ZA T (11) EP 2 692 3 A2 (12) EUROPEAN PATENT APPLICATION published in accordance with Art. 13(4) EPC (43) Date of publication: 0.02.14 Bulletin 14/06 (21) Application number: 1276632.0 (22)

More information

(51) Int Cl.: H04L 12/28 (2006.01) H04L 29/06 (2006.01) H04L 12/56 (2006.01)

(51) Int Cl.: H04L 12/28 (2006.01) H04L 29/06 (2006.01) H04L 12/56 (2006.01) (19) (12) EUROPEAN PATENT SPECIFICATION (11) EP 1 096 7 B1 (4) Date of publication and mention of the grant of the patent: 11.03.09 Bulletin 09/11 (1) Int Cl.: H04L 12/28 (06.01) H04L 29/06 (06.01) H04L

More information

(51) Int Cl.: G06F 11/32 (2006.01) G06F 3/06 (2006.01)

(51) Int Cl.: G06F 11/32 (2006.01) G06F 3/06 (2006.01) (19) TEPZZ _887 _B_T (11) EP 2 188 721 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 07..1 Bulletin 1/41 (21) Application number: 0879818.8 (22)

More information

TEPZZ_946 57B_T EP 1 946 257 B1 (19) (11) EP 1 946 257 B1 (12) EUROPEAN PATENT SPECIFICATION

TEPZZ_946 57B_T EP 1 946 257 B1 (19) (11) EP 1 946 257 B1 (12) EUROPEAN PATENT SPECIFICATION (19) TEPZZ_946 7B_T (11) EP 1 946 27 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent:.01.14 Bulletin 14/03 (21) Application number: 0682689.0 (22) Date

More information

(51) Int Cl.: G06F 21/00 (2006.01) H04L 29/06 (2006.01)

(51) Int Cl.: G06F 21/00 (2006.01) H04L 29/06 (2006.01) (19) TEPZZ_8Z_7 _B_T (11) EP 1 801 721 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 16.06. Bulletin /24 (1) Int Cl.: G06F 21/00 (06.01) H04L 29/06

More information

(51) Int Cl.: G06F 11/14 (2006.01) G06F 17/30 (2006.01)

(51) Int Cl.: G06F 11/14 (2006.01) G06F 17/30 (2006.01) (19) (11) EP 1 618 04 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 24.06.09 Bulletin 09/26 (21) Application number: 04779479.7 (22) Date of filing:

More information

(51) Int Cl.: G06F 3/12 (2006.01)

(51) Int Cl.: G06F 3/12 (2006.01) (19) TEPZZ_ 8 B_T (11) EP 1 38 23 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 16.04.14 Bulletin 14/16 (1) Int Cl.: G06F 3/12 (06.01) (21) Application

More information

(51) Int Cl.: H04N 7/16 (2011.01)

(51) Int Cl.: H04N 7/16 (2011.01) (19) TEPZZ_796 89B_T (11) EP 1 796 389 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 04.03.1 Bulletin 1/ (1) Int Cl.: H04N 7/16 (11.01) (21) Application

More information

EP 2 922 249 A1 (19) (11) EP 2 922 249 A1 (12) EUROPEAN PATENT APPLICATION. (43) Date of publication: 23.09.2015 Bulletin 2015/39

EP 2 922 249 A1 (19) (11) EP 2 922 249 A1 (12) EUROPEAN PATENT APPLICATION. (43) Date of publication: 23.09.2015 Bulletin 2015/39 (19) TEPZZ 9 49A_T (11) EP 2 922 249 A1 (12) EUROPEAN PATENT APPLICATION (43) Date of publication: 23.09. Bulletin /39 (21) Application number: 16003.0 (1) Int Cl.: H04L 12/7 (13.01) H04L 12/717 (13.01)

More information

(51) Int Cl.: H04L 29/06 (2006.01) H04L 12/26 (2006.01) H04M 3/22 (2006.01) H04M 7/00 (2006.01)

(51) Int Cl.: H04L 29/06 (2006.01) H04L 12/26 (2006.01) H04M 3/22 (2006.01) H04M 7/00 (2006.01) (19) TEPZZ 48786B_T (11) EP 2 48 786 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 23.03.16 Bulletin 16/12 (21) Application number: 806012.0 (22)

More information

TEPZZ 9 _88_A_T EP 2 921 881 A1 (19) (11) EP 2 921 881 A1 (12) EUROPEAN PATENT APPLICATION

TEPZZ 9 _88_A_T EP 2 921 881 A1 (19) (11) EP 2 921 881 A1 (12) EUROPEAN PATENT APPLICATION (19) TEPZZ 9 _88_A_T (11) EP 2 921 881 A1 (12) EUROPEAN PATENT APPLICATION (43) Date of publication: 23.09.1 Bulletin 1/39 (21) Application number: 1416041.2 (1) Int Cl.: G01T 1/ (06.01) G03B 42/02 (06.01)

More information

Our patent and trade mark attorneys are here to help you protect and profit from your ideas, making sure they re working every bit as hard as you do.

Our patent and trade mark attorneys are here to help you protect and profit from your ideas, making sure they re working every bit as hard as you do. Our patent and trade mark attorneys are here to help you protect and profit from your ideas, making sure they re working every bit as hard as you do. Our people work with everyone from multi-nationals

More information

TEPZZ 5699Z7B_T EP 2 569 907 B1 (19) (11) EP 2 569 907 B1 (12) EUROPEAN PATENT SPECIFICATION. (51) Int Cl.: H04L 12/803 (2013.01)

TEPZZ 5699Z7B_T EP 2 569 907 B1 (19) (11) EP 2 569 907 B1 (12) EUROPEAN PATENT SPECIFICATION. (51) Int Cl.: H04L 12/803 (2013.01) (19) TEPZZ 699Z7B_T (11) EP 2 69 907 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 06.0.1 Bulletin 1/19 (21) Application number: 117816.1 (22) Date

More information

EP 1 675 420 A1 (19) (11) EP 1 675 420 A1 (12) EUROPEAN PATENT APPLICATION. (43) Date of publication: 28.06.2006 Bulletin 2006/26

EP 1 675 420 A1 (19) (11) EP 1 675 420 A1 (12) EUROPEAN PATENT APPLICATION. (43) Date of publication: 28.06.2006 Bulletin 2006/26 (19) Europäisches Patentamt European Patent Office Office européen des brevets (12) EUROPEAN PATENT APPLICATION (11) EP 1 67 4 A1 (43) Date of publication: 28.06.06 Bulletin 06/26 (1) Int Cl.: H04Q 7/34

More information

EP 2 354 708 A2 (19) (11) EP 2 354 708 A2 (12) EUROPEAN PATENT APPLICATION. (43) Date of publication: 10.08.2011 Bulletin 2011/32

EP 2 354 708 A2 (19) (11) EP 2 354 708 A2 (12) EUROPEAN PATENT APPLICATION. (43) Date of publication: 10.08.2011 Bulletin 2011/32 (19) (12) EUROPEAN PATENT APPLICATION (11) EP 2 354 708 A2 (43) Date of publication:.08.2011 Bulletin 2011/32 (51) Int Cl.: F24H 3/08 (2006.01) F24H 8/00 (2006.01) (21) Application number: 111536.8 (22)

More information

sparktable: Generating Graphical Tables for Websites and Documents with R

sparktable: Generating Graphical Tables for Websites and Documents with R Alexander Kowarik 1, Bernhard Meindl 1 and Matthias Templ 1,2 1. Statistics Austria 2. Vienna University of Technology Q Vienna, June, 2014 sparktable: Generating Graphical Tables for Websites and Documents

More information

(51) Int Cl.: H04L 12/24 (2006.01)

(51) Int Cl.: H04L 12/24 (2006.01) (19) TEPZZ_8_9Z96B_T (11) EP 1 819 096 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 24..12 Bulletin 12/43 (21) Application number: 0818628.9 (22)

More information

(51) Int Cl.: H04L 9/24 (2006.01) G06Q 10/00 (2012.01)

(51) Int Cl.: H04L 9/24 (2006.01) G06Q 10/00 (2012.01) (19) TEPZZ_4Z 68ZB_T (11) EP 1 2 680 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 01.04.1 Bulletin 1/14 (21) Application number: 02741722.9 (22)

More information

(51) Int Cl.: H04L 12/58 (2006.01)

(51) Int Cl.: H04L 12/58 (2006.01) (19) (11) EP 1 628 448 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 21.11.07 Bulletin 07/47 (1) Int Cl.: H04L 12/8 (06.01) (21) Application number:

More information

(51) Int Cl.: G05F 3/26 (2006.01) G05F 3/24 (2006.01)

(51) Int Cl.: G05F 3/26 (2006.01) G05F 3/24 (2006.01) (19) Europäisches Patentamt European Patent Office Office européen des brevets (11) EP 1 280 033 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 31.0.2006

More information

(51) Int Cl.: G06F 15/02 (2006.01)

(51) Int Cl.: G06F 15/02 (2006.01) (19) (11) EP 0 691 619 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 07.02.07 Bulletin 07/06 (1) Int Cl.: G06F 1/02 (06.01) (21) Application number:

More information

(51) Int Cl.: H04L 12/58 (2006.01)

(51) Int Cl.: H04L 12/58 (2006.01) (19) TEPZZ _7 Z7 B_T (11) EP 2 173 072 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 11.09.13 Bulletin 13/37 (1) Int Cl.: H04L 12/8 (06.01) (21)

More information

(51) Int Cl.: G06F 1/00 (2006.01)

(51) Int Cl.: G06F 1/00 (2006.01) (19) TEPZZ_4 Z4ZB_T (11) EP 1 433 040 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 11.11.201 Bulletin 201/46 (21) Application number: 0277267.9

More information

(51) Int Cl.: C08K 5/523 (2006.01) C08K 5/521 (2006.01) C08K 5/52 (2006.01) C08G 64/00 (2006.01)

(51) Int Cl.: C08K 5/523 (2006.01) C08K 5/521 (2006.01) C08K 5/52 (2006.01) C08G 64/00 (2006.01) (19) Europäisches Patentamt European Patent Office Office européen des brevets (11) EP 0 78 966 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 01.03.06

More information

HU CZ FI PL SI PT IT ES NO NL FR DK SE IE GB AT DE CH LU 0 10 20 30 40 Foreigners' share Source: Eurostat More trust 3 4 5 6 7 PL HU CZ SI PT GR ES DK FI SE

More information

*EP001139245A1* EP 1 139 245 A1 (19) (11) EP 1 139 245 A1 (12) EUROPEAN PATENT APPLICATION. (43) Date of publication: 04.10.2001 Bulletin 2001/40

*EP001139245A1* EP 1 139 245 A1 (19) (11) EP 1 139 245 A1 (12) EUROPEAN PATENT APPLICATION. (43) Date of publication: 04.10.2001 Bulletin 2001/40 (19) Europäisches Patentamt European Patent Office Office européen des brevets *EP00113924A1* (11) EP 1 139 24 A1 (12) EUROPEAN PATENT APPLICATION (43) Date of publication: 04..01 Bulletin 01/ (1) Int

More information

(51) Int Cl.: H04L 29/08 (2006.01)

(51) Int Cl.: H04L 29/08 (2006.01) (19) (12) EUROPEAN PATENT SPECIFICATION (11) EP 1 987 67 B1 (4) Date of publication and mention of the grant of the patent: 28.12.11 Bulletin 11/2 (21) Application number: 07701872.9 (22) Date of filing:

More information

(51) Int Cl.: G06F 11/20 (2006.01)

(51) Int Cl.: G06F 11/20 (2006.01) (19) TEPZZ 66_ B_T (11) EP 2 366 13 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 13.0.201 Bulletin 201/20 (21) Application number: 08878183.6 (22)

More information

SAP HANA Backup and Recovery (Overview, SPS08)

SAP HANA Backup and Recovery (Overview, SPS08) SAP HANA Backup and Recovery (Overview, SPS08) Andrea Kristen, SAP HANA Product Management October 2014 Disclaimer This presentation outlines our general product direction and should not be relied on in

More information

(51) Int Cl.: G06F 17/00 (2006.01) G06F 15/16 (2006.01) H04N 7/10 (2006.01) H04N 21/235 (2011.01) H04L 12/58 (2006.01)

(51) Int Cl.: G06F 17/00 (2006.01) G06F 15/16 (2006.01) H04N 7/10 (2006.01) H04N 21/235 (2011.01) H04L 12/58 (2006.01) (19) TEPZZ _Z_9ZB_T (11) EP 2 2 190 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 11.09.13 Bulletin 13/37 (21) Application number: 08839334.3 (22)

More information

TEPZZ_98 47ZB_T EP 1 982 470 B1 (19) (11) EP 1 982 470 B1 (12) EUROPEAN PATENT SPECIFICATION

TEPZZ_98 47ZB_T EP 1 982 470 B1 (19) (11) EP 1 982 470 B1 (12) EUROPEAN PATENT SPECIFICATION (19) TEPZZ_98 47ZB_T (11) EP 1 982 470 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent:.04.14 Bulletin 14/18 (21) Application number: 077168.0 (22)

More information

TEPZZ 5Z _9_B_T EP 2 502 191 B1 (19) (11) EP 2 502 191 B1 (12) EUROPEAN PATENT SPECIFICATION

TEPZZ 5Z _9_B_T EP 2 502 191 B1 (19) (11) EP 2 502 191 B1 (12) EUROPEAN PATENT SPECIFICATION (19) TEPZZ Z _9_B_T (11) EP 2 02 191 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 17.06.1 Bulletin 1/2 (21) Application number: 787872.0 (22) Date

More information

EUROPEAN PATENT APPLICATION. Hudson, NC 28638 (US) Chancery Lane London WC2A 1QU (GB)

EUROPEAN PATENT APPLICATION. Hudson, NC 28638 (US) Chancery Lane London WC2A 1QU (GB) (19) (12) Europaisches Patentamt European Patent Office Office europeen een des brevets EUROPEAN PATENT APPLICATION EP 0 889 344 A1 (43) Date of publication: (51) nt CI.6: G 02 B 6/44 07.01.1999 Bulletin

More information

EUROPEAN PATENT SPECIFICATION. (51) IntCL: G06F 13/10< 200B 1 > G06F 13/42( 2 OO 601 > (56) References cited: WO-A-97/19402 US-A- 6 085 265

EUROPEAN PATENT SPECIFICATION. (51) IntCL: G06F 13/10< 200B 1 > G06F 13/42( 2 OO 601 > (56) References cited: WO-A-97/19402 US-A- 6 085 265 (19) J Europäisches Patentamt European Patent Office Office européen des brevets (H) EP 1246 071 B1 (12) EUROPEAN PATENT SPECIFICATION (45) Date of publication and mention of the grant of the patent: 10.05.2006

More information

(51) Int Cl.: H04L 12/26 (2006.01)

(51) Int Cl.: H04L 12/26 (2006.01) (19) (11) EP 2 169 879 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 21.09.11 Bulletin 11/38 (1) Int Cl.: H04L 12/26 (06.01) (21) Application number:

More information

(51) Int Cl.: H04L 29/06 (2006.01) H04L 29/12 (2006.01) A63F 13/12 (2006.01) A63F 13/02 (2006.01)

(51) Int Cl.: H04L 29/06 (2006.01) H04L 29/12 (2006.01) A63F 13/12 (2006.01) A63F 13/02 (2006.01) (19) (11) EP 1 83 321 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent:.0.07 Bulletin 07/22 (1) Int Cl.: H04L 29/06 (06.01) H04L 29/12 (06.01) A63F 13/12

More information

(51) Int Cl.: G06Q 30/00 (2006.01)

(51) Int Cl.: G06Q 30/00 (2006.01) (19) (11) EP 1 016 997 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 22.07.09 Bulletin 09/ (1) Int Cl.: G06Q /00 (06.01) (21) Application number:

More information

(51) Int Cl.: G06F 17/30 (2006.01)

(51) Int Cl.: G06F 17/30 (2006.01) (19) TEPZZ 7 _B_T (11) EP 1 127 321 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 03.04.13 Bulletin 13/14 (21) Application number: 99948341. (22)

More information

TEPZZ 5 6 ZB_T EP 2 536 230 B1 (19) (11) EP 2 536 230 B1 (12) EUROPEAN PATENT SPECIFICATION. (51) Int Cl.: H04W 68/00 (2009.01)

TEPZZ 5 6 ZB_T EP 2 536 230 B1 (19) (11) EP 2 536 230 B1 (12) EUROPEAN PATENT SPECIFICATION. (51) Int Cl.: H04W 68/00 (2009.01) (19) TEPZZ 6 ZB_T (11) EP 2 36 2 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent:.04. Bulletin /16 (21) Application number: 11741879.8 (22) Date of

More information

The Advantialer and Its Advantages

The Advantialer and Its Advantages (19) TEPZZ Z B_T (11) EP 2 0 113 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 16.09.1 Bulletin 1/38 (21) Application number: 07809477.8 (22) Date

More information

Chapter 13 File and Database Systems

Chapter 13 File and Database Systems Chapter 13 File and Database Systems Outline 13.1 Introduction 13.2 Data Hierarchy 13.3 Files 13.4 File Systems 13.4.1 Directories 13.4. Metadata 13.4. Mounting 13.5 File Organization 13.6 File Allocation

More information

Chapter 13 File and Database Systems

Chapter 13 File and Database Systems Chapter 13 File and Database Systems Outline 13.1 Introduction 13.2 Data Hierarchy 13.3 Files 13.4 File Systems 13.4.1 Directories 13.4. Metadata 13.4. Mounting 13.5 File Organization 13.6 File Allocation

More information

Network Attached Storage. Jinfeng Yang Oct/19/2015

Network Attached Storage. Jinfeng Yang Oct/19/2015 Network Attached Storage Jinfeng Yang Oct/19/2015 Outline Part A 1. What is the Network Attached Storage (NAS)? 2. What are the applications of NAS? 3. The benefits of NAS. 4. NAS s performance (Reliability

More information

Connectivity. Alliance Access 7.0. Database Recovery. Information Paper

Connectivity. Alliance Access 7.0. Database Recovery. Information Paper Connectivity Alliance 7.0 Recovery Information Paper Table of Contents Preface... 3 1 Overview... 4 2 Resiliency Concepts... 6 2.1 Loss Business Impact... 6 2.2 Recovery Tools... 8 3 Manual Recovery Method...

More information

TEPZZ 799965A_T EP 2 799 965 A1 (19) (11) EP 2 799 965 A1. (12) EUROPEAN PATENT APPLICATION published in accordance with Art.

TEPZZ 799965A_T EP 2 799 965 A1 (19) (11) EP 2 799 965 A1. (12) EUROPEAN PATENT APPLICATION published in accordance with Art. (19) TEPZZ 79996A_T (11) EP 2 799 96 A1 (12) EUROPEAN PATENT APPLICATION published in accordance with Art. 13(4) EPC (43) Date of publication: 0.11.14 Bulletin 14/4 (21) Application number: 14727698.4

More information

TEPZZ 68Z Z5A_T EP 2 680 205 A1 (19) (11) EP 2 680 205 A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: G06Q 20/34 (2012.01)

TEPZZ 68Z Z5A_T EP 2 680 205 A1 (19) (11) EP 2 680 205 A1 (12) EUROPEAN PATENT APPLICATION. (51) Int Cl.: G06Q 20/34 (2012.01) (19) TEPZZ 68Z ZA_T (11) EP 2 680 A1 (12) EUROPEAN PATENT APPLICATION (43) Date of publication: 01.01.14 Bulletin 14/01 (1) Int Cl.: G06Q /34 (12.01) (21) Application number: 103183.4 (22) Date of filing:

More information

(51) Int Cl.: H04L 29/06 (2006.01) H04L 12/24 (2006.01)

(51) Int Cl.: H04L 29/06 (2006.01) H04L 12/24 (2006.01) (19) (12) EUROPEAN PATENT SPECIFICATION (11) EP 1 231 74 B1 (4) Date of publication and mention of the grant of the patent: 16.03.11 Bulletin 11/11 (1) Int Cl.: H04L 29/06 (06.01) H04L 12/24 (06.01) (21)

More information

(51) Int Cl.: G06F 15/16 (2006.01) G06F 9/44 (2006.01) G06F 12/00 (2006.01) G06F 9/48 (2006.01)

(51) Int Cl.: G06F 15/16 (2006.01) G06F 9/44 (2006.01) G06F 12/00 (2006.01) G06F 9/48 (2006.01) (19) TEPZZ 48Z4_B_T (11) EP 2 248 041 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 29.04.1 Bulletin 1/18 (21) Application number: 0971466.8 (22)

More information

Outline. Failure Types

Outline. Failure Types Outline Database Management and Tuning Johann Gamper Free University of Bozen-Bolzano Faculty of Computer Science IDSE Unit 11 1 2 Conclusion Acknowledgements: The slides are provided by Nikolaus Augsten

More information

Connectivity. Alliance Access 7.0. Database Recovery. Information Paper

Connectivity. Alliance Access 7.0. Database Recovery. Information Paper Connectivity Alliance Access 7.0 Database Recovery Information Paper Table of Contents Preface... 3 1 Overview... 4 2 Resiliency Concepts... 6 2.1 Database Loss Business Impact... 6 2.2 Database Recovery

More information

(51) Int Cl.: G06Q 20/00 (2006.01) G06F 21/00 (2006.01)

(51) Int Cl.: G06Q 20/00 (2006.01) G06F 21/00 (2006.01) (19) (12) EUROPEAN PATENT SPECIFICATION (11) EP 1 24 008 B1 (4) Date of publication and mention of the grant of the patent: 29.12. Bulletin /2 (21) Application number: 00992990.2 (22) Date of filing: 31..00

More information

Running a Workflow on a PowerCenter Grid

Running a Workflow on a PowerCenter Grid Running a Workflow on a PowerCenter Grid 2010-2014 Informatica Corporation. No part of this document may be reproduced or transmitted in any form, by any means (electronic, photocopying, recording or otherwise)

More information

(51) Int Cl.: H04M 3/51 (2006.01)

(51) Int Cl.: H04M 3/51 (2006.01) (19) TEPZZ_976 B_T (11) EP 1 976 2 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 18.03.1 Bulletin 1/12 (1) Int Cl.: H04M 3/1 (06.01) (21) Application

More information

Europaisches Patentamt European Patent Office Office europeen des brevets (11) EP 0 219 886 B2

Europaisches Patentamt European Patent Office Office europeen des brevets (11) EP 0 219 886 B2 Europaisches Patentamt European Patent Office Office europeen des brevets (11) EP 0 219 886 B2 (12) NEW EUROPEAN PATENT SPECIFICATION (45) Date of publication and mention (51) Int CI.6: G07G 1/12 of the

More information

In-memory databases and innovations in Business Intelligence

In-memory databases and innovations in Business Intelligence Database Systems Journal vol. VI, no. 1/2015 59 In-memory databases and innovations in Business Intelligence Ruxandra BĂBEANU, Marian CIOBANU University of Economic Studies, Bucharest, Romania babeanu.ruxandra@gmail.com,

More information

SAP HANA Storage Requirements

SAP HANA Storage Requirements SAP HANA Storage Requirements As an in-memory database, SAP HANA uses storage devices to save a copy of the data, for the purpose of startup and fault recovery without data loss. The choice of the specific

More information

(51) Int Cl.: G06F 17/30 (2006.01)

(51) Int Cl.: G06F 17/30 (2006.01) (19) (11) EP 1 6 23 B1 (12) EUROPEAN PATENT SPECIFICATION (4) Date of publication and mention of the grant of the patent: 2.11.09 Bulletin 09/48 (1) Int Cl.: G06F 17/ (06.01) (21) Application number: 014696.1

More information

The Hadoop Distributed File System

The Hadoop Distributed File System The Hadoop Distributed File System The Hadoop Distributed File System, Konstantin Shvachko, Hairong Kuang, Sanjay Radia, Robert Chansler, Yahoo, 2010 Agenda Topic 1: Introduction Topic 2: Architecture

More information

00 Publication number:

00 Publication number: Europaisches Patentamt European Patent Office Office europeen des brevets 00 Publication number: 0 257 901 B1 EUROPEAN PATENT SPECIFICATION Date of publication of patent specification: 28.07.93 Int. CI.5:

More information