EP0249090B1 - Eintragung eines Datenbasisindex in das Journal zur verbesserten Rückstellung - Google Patents

Eintragung eines Datenbasisindex in das Journal zur verbesserten Rückstellung Download PDF

Info

Publication number
EP0249090B1
EP0249090B1 EP87107665A EP87107665A EP0249090B1 EP 0249090 B1 EP0249090 B1 EP 0249090B1 EP 87107665 A EP87107665 A EP 87107665A EP 87107665 A EP87107665 A EP 87107665A EP 0249090 B1 EP0249090 B1 EP 0249090B1
Authority
EP
European Patent Office
Prior art keywords
index
data space
journaling
pages
changes
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
EP87107665A
Other languages
English (en)
French (fr)
Other versions
EP0249090A2 (de
EP0249090A3 (en
Inventor
Dennis Steven Delorme
Peter Bernard Passe
Mark Larry Holm
Gary Ross Ricard
Wilson Douglas Lee
George David Timms, Jr.
Larry William Youngren
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
International Business Machines Corp
Original Assignee
International Business Machines Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by International Business Machines Corp filed Critical International Business Machines Corp
Publication of EP0249090A2 publication Critical patent/EP0249090A2/de
Publication of EP0249090A3 publication Critical patent/EP0249090A3/en
Application granted granted Critical
Publication of EP0249090B1 publication Critical patent/EP0249090B1/de
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/14—Error detection or correction of the data by redundancy in operation
    • G06F11/1402—Saving, restoring, recovering or retrying
    • G06F11/1471—Saving, restoring, recovering or retrying involving logging of persistent data for recovery

Definitions

  • the invention relates to computer system recovery, and in particular to synchronization of database indexes to the data spaces which they cover.
  • Databases may be comprised of data spaces that contain data space entries, or records, and database indexes that provide ordered lists of data space entries, based on key values contained in the data space entries.
  • database indexes over the data space may need to be updated, in order to keep the indexes synchronized with respect to the data space they cover.
  • the changes to the database index(es) are made first, followed by the changes to the data space. This order of changes is chosen to allow any conditions that would prevent the updating of the database indexes to surface before a data space is changed. The attempt to insert a duplicate key into a unique index is one such condition.
  • the data spaces and the database indexes relating thereto may not be synchronized. Some transactions may have caused database index(es) to be updated, but the associated data space entries may not have been updated at the time the system terminated.
  • the paging routine may not have written the changed pages for either the data space or the associated database index(es) to nonvolatile storage, or it may have only written some of the changed pages for either the data space or the database index(es) to nonvolatile storage at the time of a failure.
  • the logical structure of the index that is available from nonvolatile storage after termination may be sufficiently inconsistent so as to preclude use of the index, even as a starting point for forward recovery (using a journal of data space entry changes).
  • U.S. Patent No. 4,507,751 describes a computing apparatus and method for maintaining a journal log.
  • the computing apparatus includes volatile storage for storing a log buffer and a non-volatile storage for storing a journal log.
  • Non-volatile storage means are provided for storing in a write-ahead data set a plurality of short data blocks.
  • the log buffer contents are written to the write-ahead data set responsive to a process epoch occurring before the log buffer is filled.
  • the log buffer contents are written to the journal log upon the log buffer being filed.
  • the redoing or undoing of data base changes is made with reference to the write ahead data set only in the case of a system failure resulting in loss of log buffer data not yet written to the journal log; otherwise data base changes are redone or undone with reference to the log buffer or journal log.
  • Journaling transactions to a database works well for recovery of the data space, because it is only necessary to journal the image of each data space entry before and after each change.
  • Each data space entry is localized at a fixed position within the data space, so few pages are changed when a data space entry is updated.
  • EP-A-0118 861 describes a word processing system in which a text stream is stored on a direct access storage device (DASD) for recall and editing.
  • the text stream is organized into a document, which is stored on the DASD as a data set.
  • the data set consists of an index portion and a portion containing text records.
  • the index portion is divided into nodes, of which the primary node is called the root node. Redundant recording of critical index nodes protects those index nodes the loss of which would mean significant loss of data to the system operator.
  • Journaling the changes to the database indexes relating to a data space is more complex because, depending on the type of data structure used for the index, a change to a single entry in an index may require changes to many logical pages in the index.
  • Many popular index structures such as binary radix trees and B-trees, exhibit the characteristic that a change to a single entry can require changes distributed through many logical pages of the index.
  • An approach of journaling all changes to a database index may require so many pages to be journaled for each change of a data space entry that the technique cannot be used because of the very large storage requirements for the journal or because the performance cost of the required journal activity may be prohibitive.
  • the principal object of the invention is to provide a method of journaling indexes as in claims 1.
  • a quick recovery of a database index is provided by journaling unchanged index pages (once) before the pages are changed for the first time, and also journaling transactions consisting of the changed and unchanged images of data space entries for all data spaces covered by the index.
  • the index is first restored to its original state by copying the image of the unchanged pages from the journal to the index.
  • the index is then updated by re-processing the index changes associated with all journaled changes for entries in the data space(s) covered by the index.
  • the unchanged image of each data space entry is required to locate the associated entry in the original database index.
  • the changed data space entry image is used to provide the updated index entry information, and also to recover the data space by copying the changed entry from the journal to the data space (for all changed data space entries that may not have been written to nonvolatile storage before the termination).
  • the database indexes comprise binary radix tree indexes defined over data spaces. Journaling of unchanged index pages is also beneficial with other implementations of database indexes, such as B-Trees.
  • a write-ahead journal is used to reflect all changes to a data space before the data space entries are actually changed. Changed index pages are not allowed to be written to auxiliary storage until their corresponding unchanged page images have been written to a journal on auxiliary storage.
  • the journal on auxiliary storage always contains information that corresponds to the most recent changes to the journaled database indexes and data spaces, even before the indexes and data spaces are changed on auxiliary storage.
  • the unchanged database index pages are copied to a buffer in main storage before they are written to the journal on auxiliary storage.
  • the buffer in main storage is not forced to be written to auxiliary storage until all unchanged database index pages and the changed and unchanged data space entry changes are added to the buffer. Allowing the journal information to accumulate in a main storage buffer reduces the number of I/O operations necessary to write the information to auxiliary storage, which can improve performance. Because this procedure allows the database index pages to be changed in main storage before the unchanged index pages are written to the journal on auxiliary storage, it is necessary to provide a mechanism to make sure that the write operation(s) for the journal are completed before the write operation(s) for the database index(es) are initiated.
  • the database indexes, data spaces, and journal reside on pages in a virtual storage environment.
  • the storage management mechanism of the system is not allowed to write the page to auxiliary storage or to re-assign the mainstore page frame to a different virtual page.
  • the write operations to auxiliary storage are ordered by pinning any pages in a database index from just before the page is changed for the first time (in main storage) until after the unchanged page image is written to the journal on auxiliary storage.
  • Other mechanisms are possible to ensure that the journal is updated before the database index on auxiliary storage, and such mechanisms are considered to be within the scope of this invention.
  • a journal sync point is a marker, or pointer, which is associated with a particular journaled database index or data space, and which identifies the oldest entry in the journal that is needed to recover the associated journaled object after an abnormal termination.
  • Each journaled database index and data space has its own sync point.
  • the sync point can be viewed as the position in the journal that corresponds to the last (most recent) time when the state of the journaled database index or data space on auxiliary storage was known to be at a completely reliable and consistent state.
  • the sync point for a journaled object is updated to reference a different journal entry whenever all pending changes for the object (database index or data space) are forced to be written from main storage to auxiliary storage.
  • journal sync point for a database index identifies a point where the index is in a consistent state
  • the recovery process needs to restore the state of the index at the time when the associated journal sync point was last updated.
  • the journal In order to return the index to its state at the last sync point, the journal must contain at least the unchanged images of every database index page that was changed in response to a change in one of the data spaces the index covers.
  • the preferred embodiment only the images of unchanged database index pages are saved in the journal. Once the image of an unchanged page in a database index has been added to the journal, no additional journal entries are required for that page until after the next sync point update, regardless of how many times an individual page is updated. Thus, if multiple changes occur between sync point updates to the same pages of the database index, there is no need to gather and save the contents of index pages that may contain complex and redundant changes. Other techniques are possible, such as saving the image of every database index page before every change. The preferred embodiment reduces the number of auxiliary storage I/O operations and the amount of auxiliary storage required, if multiple changes are made between sync point updates to the same database index page(s).
  • a mechanism is required to record which index pages remain unchanged since the last sync point, and which pages have had their unchanged images journaled before they were changed.
  • a bit map is associated with the database index to determine which pages have been journaled and changed since the last sync point update.
  • Each bit in the map represents a single logical page in the index, and there is a separate bit map for each journaled database index. All the bits in the map for a journaled index are cleared (set to zero) when the index sync point is updated.
  • the unchanged image of a database index page that has not been changed since the last sync point update is called a "virgin" page image. Before a page in the index is changed, the corresponding bit is tested to determine whether the page is still a virgin page.
  • bit is reset (zero)
  • the virgin image of the page is added to the journal, the bit is set (to one), the page is pinned in mainstore, and then the page is changed. If the bit is already set (to one) when a page must be changed, the page is just updated (without journaling or pinning it in mainstore). Other techniques are possible to distinguish between virgin pages and index pages that have been changed since the last sync point.
  • a list of all the database index pages that are currently pinned is updated to add an entry every time an index page is pinned (before it is updated in main storage). After unchanged and changed images of the associated data space entry are added to the journal and the journal is forced to be written to auxiliary storage, all the pages in the list are unpinned (which allows the pages to be written by the system storage management means to auxiliary storage), and all entries are removed from the list of pinned pages.
  • journal sync point for a database index is updated occasionally, in order to limit the number of journal entries that must be used to recover after an abnormal termination.
  • the more journal entries allowed between sync point updates for database indexes the more journal entries that may need to be read from auxiliary storage and processed after an abnormal termination, and the longer recovery may take.
  • a parameter is provided to allow the database user to control how frequently the sync points for database indexes are updated.
  • journal entries appearing after sync points for each object are applied to the indexes and data spaces.
  • the sync points for indexes need not be the same as for data spaces. This is beneficial because it allows the system to avoid writing to auxiliary storage, at the same time, all the changed pages for database indexes and the data spaces they cover.
  • the I/O operations required to write multiple objects to auxiliary storage could have severe performance impacts on the rest of the system. All objects in the set of database indexes and the data spaces they cover need not be synchronized (written to auxiliary storage) in unison in order to synchronize any one object.
  • the entries on the journal are applied to the appropriate data space or index.
  • the first step is to apply all journaled virgin images to the database index, to return the index to the consistent state that existed for the last sync point.
  • the next step is to apply all journaled changes to the data space(s), and to record index changes that will be required to bring the database index-(es) up to date.
  • the final step is to apply the recorded changes to the index, which updates the index from its state at the last sync point to the state that corresponds with the last (newest) entry in the journal.
  • the preferred embodiment performs the first two steps in a single pass that reads and processes journal entries.
  • the index is not restored to its state at the last sync point until all journaled virgin page images are processed, but the recording technique allows the system to defer referencing the index to update, remove, or change entries until it is completely restored to its state at the last sync point.
  • a clone, or duplicate of the index is made on auxiliary storage to avoid clogging the journal.
  • An entry is added to the journal and the sync point for the index is updated when the clone is created.
  • the clone is written to auxiliary storage. If an abnormal termination occurs, the clone is used to restore the index to its state at the last sync point. Recovery then proceeds in the same manner described above, after the index state at the last sync point is restored from the close. The clone is destroyed when the transaction is completed.
  • Cloning provides a method of capturing the virgin images before reorganization without journaling each change as it occurs.
  • a database index journaling mechanism is indicated generally at 10 in Fig. 1.
  • the mechanism 10 comprises a main storage area 12 for storing pages of data.
  • the pages of data comprise 512 byte pages of data which are paged in and out of volatile main storage 12 by a processor 14 which implements well known paging routines.
  • the pages are stored on nonvolatile auxiliary storage units 16, 18, 20, and 22, which are usually disk drive devices.
  • the data residing in main storage 12 and on disk drives 16-22 comprises a plurality of databases, consisting of a combination of data spaces and logical files.
  • the logical files implemented as indexes in the preferred embodiment provide different views of the data spaces.
  • Data spaces and logical files are also both referred to as objects.
  • Data space pages residing in main storage 12 are represented at 24. While shown pictorally in one block, physically they reside in multiple pages of main storage 12. Similarly, index pages represented by block 26 span multiple pages of main storage.
  • the index pages 26 contain keys relating to data on data space pages 24.
  • the keys are organized in a binary radix tree in the preferred embodiment. Several examples of the keys will be illustrated below. Further information on keys and binary radix trees is found in Howard and Borgendale, "System/38 Machine Indexing Support", IBM System/38 Technical Developments, 1978. (IBM Form G580-0237) Mapping between the data space pages 24 and the index pages 26 is provided by a key mapping block 28 which contains information necessary to transform data from a record in the data space into a corresponding key in the index.
  • journal buffer 30 Copies of changes to be made to the data space pages are buffered in a journal buffer 30.
  • the journaled changes in the buffer are written out to auxiliary storage 16-22 prior to the changes being made on the data space pages. This is commonly known as a write-ahead journal.
  • a sync point is marked on the journal for that data space.
  • a sync point is a marker representing a point in time at which all previously altered pages of the journaled object have been written from volatile main storage to non-volatile auxiliary store.
  • the recovery processing mechanism can limit processing time by ignoring previous journaled deposits on behalf of the synchronized object. Consequently, this mechanism ensures that recent changes to the data space pages can be recovered in the event of system termination by merely employing the journaled images recorded subsequent to the sync point.
  • Pages to be changed are identified as follows. Every index operation that changes an index (either an insert or remove) provides a key to be inserted or deleted. This key is used to search the index to find the point of change in the index. Thus after an initial search of the index, the page(s) which change in response to a data space change are located. Journaling the changes is accomplished by sending the page image to the journal if it is a virgin image.
  • bit map 32 which contains a separate distinct bit position for each index page. If more changes are to be made to the index page before a sync point occurs for the index page, the corresponding bit position in the bit map 32 is examined. If the bit is on, the index changes are made without journaling the index page again.
  • journal buffer 30 The changes to the data spaces are reflected on the journal buffer 30 and are then written synchronously via a storage management function to auxiliary storage.
  • the virgin index pages are also written at the same time. They piggyback out to auxiliary storage with the changes to the data spaces.
  • the pins on the now changed virgin index pages are pulled (the pinned page list 34 is used to identify these pages), via a request to storage management. This allows the altered index page images to again participate in normal paging activity.
  • the pages are also removed from the pinned page list 34.
  • the changes to the data spaces are also made following the synchronous write of the journal buffer. The above order is important in that it ensures that any time the system crashes with loss of main storage content, the data spaces and indexes can be reconstructed purely from images resident on the journal.
  • Periodically objects being journaled are synchronized.
  • a selection mechanism forces the object with the oldest (earliest) sync point to auxiliary storage every n journal entries.
  • n is a value selected to strike a balance between recovery time and performance overhead accompanying the sync point mechanism. It is referred to as a recovery constant.
  • Synchronization of the oldest object serves to limit the length of the recovery time by ensuring that during recovery (after a machine failure) the journal need not be processed further back than the final n entries residing on the journal.
  • the recovery constant insures that no object has a sync point more than n entries from the end of the journal.
  • journal every virgin index page affected by the manipulations since doing so would dramatically increase the rate of making journal deposits.
  • Operations of this sort require the alteration of practically every page in any index overlying the data base and, consequently, would require the journaling of all these virgin pages. If the indexes involved are large, the journal could rapidly become extremely large as well. Instead, all journaled indexes that will be affected by the operation are totally replicated (cloned) prior to starting the operation and a single entry containing a pointer to the clone is placed on the journal.
  • the actual cloning process involves the following steps as indicated in Fig. 2.
  • the data base network is quiesced; seizes (indications prohibiting use by another process) are acquired to prohibit any index changes so that a consistent view of the index and the underlying data base pages is obtained for the cloning process. Since a clone is about to be made of the entire index (thereby capturing all the virgin images) there is no longer a need to subsequently journal the virgin pages affected by an index change.
  • the index is marked to indicate that it need no longer journal its virgin pages as shown at 212.
  • the marking is similar to the function provided by bit map 32 in Fig. 1.
  • the database index clone is created and forced to auxiliary storage at 214.
  • Box 216 places a sync point on the journal and produces a journal entry which identifies the clone.
  • Box 218 releases any seizes acquired at box 210 and allows changes to occur on the index once again.
  • the index clone referenced from the journal replaces the original index. Recovery then proceeds exactly as that for logicals with journaled virgin pages; any data base key alterations are placed in a log and applied to the index.
  • the sync point for a data space identifies the starting point for recovery. For data spaces, all AFTER-images journaled after the last checkpoint (synch point) are applied to the file. Before data space indexes (DSls) are recovered, an area called a log is created for the index. All keys removed or added during recovery processing are deposited in this log rather than directly updating the binary radix tree. Once recovery is complete, these logged changes are applied to the tree structure of the index. This logging mechanism, which refrains from altering the binary radix tree directly, allows recovery to be restartable, that is, to be tolerant of a machine failure during the recovery operations themselves.
  • journal entries are applied to the binary radix tree. All entries residing beyond the index's sync point are examined to determine if they are before images for a data space entry (DSE), after images for a DSE, or virgin index page images. Virgin index page images encountered on the journal, however, are applied directly to the tree rather than to the loggin area. Keys constructed from all before images are identified as keys to be eventually removed from the tree. However, rather than being applied directly to the tree, these keys are deposited in the logging area. Simiarly, keys derived from the after-images of the DSE are logged as well and scheduled to be eventually inserted into the tree.
  • DSE data space entry
  • Virgin index page images encountered on the journal are applied directly to the tree rather than to the loggin area. Keys constructed from all before images are identified as keys to be eventually removed from the tree. However, rather than being applied directly to the tree, these keys are deposited in the logging area. Simiarly, keys derived from the after-images of the DSE are logged as
  • journal entry When an after image of a DSE is encountered on the journal and this journal entry is more recent than the data space's sync point, as determined by comparing the sequence number of the journal entry to be applied with the sync point of the data space, the journal entry is applied directly to the data space.
  • the appropriate key image for the index is logged by depositing a key image in a separate special container in main store belonging to the index.
  • This container known as a logging area, serves as a collection point for pending key changes.
  • journal entry is a virgin index page image, it is applied directly to the binary radix tree. Information is contained in each such journal entry identifying which page of the binary tree is to be affected. For a clone entry on the journal, recovery consists of replacing the entire binary radix tree with its clone.
  • Figs. 7a-d describe the above description of recovery of indexes and data spaces.
  • FIG. 3-5 A simple example of selected pages of an index is shown in Figs. 3-5.
  • Decision nodes represented by circles define the direction (ie, to the right or to the left) in which a search should proceed. Each decision node contains forward and backward linkage information. They also contain information defining the type of node, and identify a compare bit which is tested in the desired key to provide search direction (e.g., if the bit is zero, the search proceeds left; if the bit is one, the search proceeds right).
  • Page pointers represented by triangles, contain a pointer to the next page in a search path. When a page pointer is encountered, if the page it addresses is not resident in fast access or main storage, the reference page must be brought (retrieved) from auxiliary storage into main storage.
  • Terminal text elements represented by rectangles contain the remaining part of an entry or key stored in the index.
  • a cluster is defined as any two elements, such as two nodes, or a node and a page pointer, or terminal text and a node to name a few possibilities.
  • a page 1 indicated at 110 and a page 2 indicated at 112 in Fig. 3 are index pages containing entries corresponding to a data space record having a definition of: where the ordinal number is the relative position of the data space entry in the data space. The relative address is defined by the data space number and the ordinal number assigned to the entry of interest in that data space. The record chirp has a relative address of 1,2 correspond-ing to the data space number, and the ordinal number respectively.
  • Field 2 is the key field.
  • the record meow has a relative address of 1,4; moo, 1,1; and whinney, 1,3.
  • the index key corresponding to the second data space entry is indicated at a cluster 114 with its relative address encoded at the tail of the index entry.
  • Meow is located at a cluster 116 on page one.
  • Cluster 116 also has a page pointer 118 pointing to page 2 at 112.
  • the records moo and whinney are both located at a node 120 on page 2.
  • journaling of data space 1 had started just before records 3 and 4 has been inserted into the data space, the journal would contain the following entries for records 3 and 4.
  • the sync point for data space 1 is journal entry number 16.
  • journaling of the data space index is started after data space entry number 4 had been inserted in the data space. Since there are no entries for the data space index yet, its sync point is zero. This means the index is in sync with the journal.
  • Index page 2 will be changed by the data space entry "duck quack" as indicated in Fig. 4 for the first entry.
  • Fig. 4 is numbered consistently with Fig. 3.
  • the page is first journaled and pinned, since the bit corresponding to this page in the bit map is zero.
  • the journal now contains:
  • the sync point for the data space index is now entry number 18.
  • the bit map is updated for the index page 2 just journaled.
  • the bit map becomes: 010000 ... 0.
  • the first bit position of the map corresponds to the first page of the index 110.
  • the second bit position corresponds to the second page of the index 112.
  • Index page 2 is put on the pinned page list for the data space index.
  • the pinned page list consists of an area used to address the pages currently pinned.
  • the data space index is then changed. Note that a new cluster 122 (Fig. 4) is created which contains both the records quack and whinney. Cluster 120 now contains a node which points to node 122. Once all index changes are complete, the data space change is journaled as journal entry number 20. The journal now contains the following entries:
  • journal entries since the force point following entry number 17 are written to auxiliary storage when entry number 20 is made.
  • the pins are pulled from all the pages referenced in the pinned page list of the data space index, since it is known that the journal entries corresponding to the pinned pages have been forced to auxiliary storage. In this example, the pin is pulled on page 2 (Fig. 4 112) of the index.
  • the changes to the data space are then made.
  • the data space now contains:
  • the bit map is updated to read 1100000...0.
  • Page 1 is put on the pinned page list for the data space index.
  • the data space index is changed as shown in Fig. 5 110 wherein the numbering is consistent with Fig. 3.
  • Node 114 now contains no text, but instead points to node 124 which contains both the keys bark and chirp.
  • the data space change is journaled so that the journal now contains:
  • journal force point is just prior to entry number 21, so entries 21 and 22 now are written to auxiliary storage when entry 22 is made.
  • the pin is then pulled from page 1, and the data space now contains:
  • journal entry 23 is written to auxiliary storage. No pins need be pulled, and the data space is then changed.
  • the data space now contains:
  • Pinning is used to insure that the changed index page does not get written to disk ahead of the journal image of the page's virgin image.
  • a storage management function may be used to specify an order of page writes. In this case, the journal image, then the changed index page would be written.
  • a further embodiment of this invention uses a circular buffer logging area for index virgin pages instead of depositing them on the journal being used to deposit the data space entry images.
  • the algorithm requires that the data space changes be journaled, but the index virgin pages be written to a circular buffer separate from the journal associated with the data space.
  • This circular buffer concept reduces the amount of auxiliary storage required to house the index virgin pages and eliminates the journal being bloated with many index virgin pages.
  • a circular buffer at 810 in Fig. 8, to house index virgin pages is defined and referenced by two pointers, START, indicated at 812 and AVAIL, indicated at 814 which identify the area first used and the next available area in the buffer respectively.
  • a bit map is also defined which identifies each virgin page of the index file which has already been deposited in the circular buffer. Since the virgin pages of the index are written to the circular buffer 810, once a virgin is in the buffer it need not be deposited in the buffer again unless the index is completely written to auxiliary storage and a new sync point is indicated in the journal. There is a distinct bit map for each index but the circular buffer could be used to deposit virgin pages from multiple indexes on a system.
  • the bit map for the index is inspected to see if the virgin images of any of these pages have already been deposited in the circular buffer. If the virgin page has been deposited then no further action is necessary and that index page is modified. If the virgin page has not been deposited then it is deposited to the circular buffer and an asynchronous write (page written to auxiliary storage) is initiated on the new deposit. The virgin page in the index is then pinned and modified. The pin remains on the modified index page until the deposit of the virgin page in the circular buffer has been written to auxiliary storage. This order must be followed so recovery has the necessary information to replace the modified index page with the original virgin page. Once the buffer is written to auxiliary storage, the real index page can be unpinned and is allowed to again participate in normal paging activity.
  • the key to the circular buffer journal algorithm is the management of the circular buffer. To illustrate this, an example will be presented in which changes to two indexes occur concurrently.
  • the buffer is empty but allocated to an implementation dependent size.
  • START at 812 and AVAIL at 814 both reference the first byte of the allocated space.
  • a data space entry change causes page 1 of index No.1 at 815 to be changed (as indicated in Fig. 8).
  • the view of the circular buffer after the change is shown at 816.
  • START, at 818 will remain positioned at the beginning of the buffer but AVAIL 820 moves forward in the buffer as the virgin index page is deposited to the buffer.
  • the newly used buffer space for the page is now written to auxiliary storage asychronously, the changed index page is pinned, and the actual changes are made.
  • the appropriate bit map bit is set to indicate that the virgin of this index page is in the buffer.
  • index whose pages are next in the buffer is written to auxiliary storage. This frees all the pages associated with that index since they are no longer required for recovery and causes the START pointer at 828 (in the fourth version of the buffer 830) to advance to the next used area.
  • the size of the buffer must be chosen such that forces of the indexes do not occur very often. However, if the buffer is too large, the recovery time can become unreasonable since many virgin pages must be applied to the index. A compromise between these two factors where both the number of run time writes to auxiliary storage and the recovery time are acceptable, is necessary. The user is given an option to select the buffer size.
  • the indexes are restored to their virgin state by reading the circular buffer beginning at START and ending at AVAIL and replacing the index pages with their virgin images as they exist in the circular buffer. After this is complete the index appears as it did before the last force.
  • the journal is then inspected and the changes to the data spaces are made with changes also applied to the indexes as appropriate. Since the indexes are in their virgin state the changes can be made directly to the indexes. Once the journal is applied, the data base network is ready to be used with no further processing.
  • Fig. 9 illustrates the basic procedure used to deposit virgin images in the circular buffer.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Claims (9)

1. Verfahren zum Eintragen von Indizes, die zu einem Datenraum eines Computersystems führen, das Daten in Seiten aus einem bzw. in einen Hauptspeicher und aus einem bzw. in einen Hilfsspeicher überträgt, wobei das Verfahren dadurch gekennzeichnet ist, daß es die folgenden Schritte aufweist:
a. Bestimmen welche Indexseiten eine Änderung erfordern, in Abhängigkeit von angeforderten Änderungen im Datenraum;
b. Festhalten solcher Indexseiten, um zu verhindern, daß sie in den Hilfsspeicher geschrieben werden;
c. Eintragen ungeänderter Seiten von Indizes, welche Änderungen aufweisen, die das Ergebnis der im Datenraum durchzuführenden Änderungen sind, sodaß die Indizes an einem gewünschten Punkt der Einträge mit dem Datenraum synchronisiert sind;
d. Ändern dieser Indizes;
e. Eintragen der Änderungen an dem Datenraum vor dem Ändern des Datenraums;
f. Schreiben der Einträge in den Hilfsspeicher;
g. Loslassen der Indexseiten, sodaß sie in den Hilfsspeicher fließen können und
h. Ändern des Datenraums.
2. Eintragungsvorrichtung zum Ausführen des Verfahrens nach Anspruch 1 in einem Computersystem, welches das Übertragen von Seiten zwischen einem Hauptspeicher (12) und einem Hilfsspeicher (16, 18, 26, 20, 22) benützt und nichtflüchtige Speichermittel (30) zum Speichern von Einträgeinformation aufweist, wobei das Computersystem Datenräume (24) und Indizes (26) besitzt, die zu diesen Datenräumen führen, und die Vorrichtung zum Eintragen dadurch gekennzeichnet ist, daß sie folgendes aufweist:
Mittel zum Eintragen von Einträgeinformation in den Datenraum, die zu den durchzuführenden Änderungen in Datenräumen des Speichermittels führt und
Mittel zum Eintragen von Indizes, um unveränderte Seiten mit Indizes einzutragen, die von den in einem Datenraum eines Speichermittels durchzuführenden Änderungen betroffen sind, sodaß das Speichermittel Information enthält, aus welcher der Datenraum und die Indizes zu einem selben Zeitpunkt wiederhergestellt werden können.
3. Eintragungsvorrichtung nach Anspruch 2, dadurch gekennzeichnet, daß die Einträgeinformation sowohl für den Datenraum als auch für die dazu führenden unveränderten Indexseiten im selben Arbeitsgang in das nichtflüchtige Speichermittel geschrieben wird.
4. Eintragungsvorrichtung nach Anspruch 2 oder 3, dadurch gekennzeichnet, daß die Einträgeinformation in das nichtflüchtige Speichermittel geschrieben wird, bevor im Hilfsspeicher sowohl im Bild des Datenraums als auch an dem Index permanente Änderungen herbeigeführt werden.
5. Eintragungsvorrichtung nach einem der Ansprüche 2 bis 4, dadurch gekennzeichnet, daß das Speichermittel im Hauptspeicher einen Bereich (34) aufweist und bei welcher Indexseiten, die im Hauptspeicher eingetragen wurden, aber noch nicht in den nichtflüchtigen Speicher geschrieben wurden, festgehalten werden, um zu verhindern, daß Änderungen an diesen in den Hilfsspeicher geschrieben werden.
6. Eintragungsvorrichtung nach einem der Ansprüche 2 bis 5, dadurch gekennzeichnet, daß sie weiters Mittel zum Wiederherstellen aufweist, die an das Speichermittel gekoppelt sind, um die nach einem Systemfehler zu einem Datenraum führenden Indizes zurückzuholen und die im Datenraum eingetragene Information dazu verwenden, um an den zurückgeholten Indizes Änderungen zu bewirken, sodaß diese mit dem Datenraum synchronisiert werden.
7. Eintragungsvorrichtung nach einem der Ansprüche 1 bis 6, dadurch gekennzeichnet, daß sie weiters aufweist:
an die Mittel zum Eintragen von Indizes gekoppelte Detektionsmittel zum Erfassen der Indexseiten, die von den im Datenraum durchzuführenden Änderungen betroffen sind.
8. Eintragungsvorrichtung nach einem der Ansprüche 2 bis 6, dadurch gekennzeichnet, daß sie weiters aufweist:
an die Mittel zum Eintragen der Indizes gekoppelte Mittel zum Klonen, um alle ungeänderten Seiten an dem Index in den Hilfsspeicher zu kopieren, wenn das Detektionsmittel feststellt, daß ein vorbestimmtes Verhältnis von Seiten an dem Index geändert werden.
9. Eintragungsvorrichtung nach Anspruch 8, dadurch gekennzeichnet, daß die Mittel zum Eintragen ein Anzeichen einträgt, daß eine Kopie eines Index angefertigt wurde, wobei diese Anzeige den Standort dieser Kopie angibt.
EP87107665A 1986-06-13 1987-05-26 Eintragung eines Datenbasisindex in das Journal zur verbesserten Rückstellung Expired - Lifetime EP0249090B1 (de)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US06/874,316 US4819156A (en) 1986-06-13 1986-06-13 Database index journaling for enhanced recovery
US874316 1992-04-27

Publications (3)

Publication Number Publication Date
EP0249090A2 EP0249090A2 (de) 1987-12-16
EP0249090A3 EP0249090A3 (en) 1989-10-25
EP0249090B1 true EP0249090B1 (de) 1993-02-17

Family

ID=25363483

Family Applications (1)

Application Number Title Priority Date Filing Date
EP87107665A Expired - Lifetime EP0249090B1 (de) 1986-06-13 1987-05-26 Eintragung eines Datenbasisindex in das Journal zur verbesserten Rückstellung

Country Status (4)

Country Link
US (1) US4819156A (de)
EP (1) EP0249090B1 (de)
JP (1) JPS62297950A (de)
DE (1) DE3784190T2 (de)

Families Citing this family (124)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5123103A (en) * 1986-10-17 1992-06-16 Hitachi, Ltd. Method and system of retrieving program specification and linking the specification by concept to retrieval request for reusing program parts
JPH0833857B2 (ja) * 1987-02-18 1996-03-29 株式会社日立製作所 システム間デ−タベ−ス共用システムジヤ−ナルマ−ジ方式
US5065311A (en) * 1987-04-20 1991-11-12 Hitachi, Ltd. Distributed data base system of composite subsystem type, and method fault recovery for the system
JPH01147727A (ja) * 1987-12-04 1989-06-09 Hitachi Ltd オンラインプログラムの障害回復方法
US4945474A (en) * 1988-04-08 1990-07-31 Internatinal Business Machines Corporation Method for restoring a database after I/O error employing write-ahead logging protocols
US5043866A (en) * 1988-04-08 1991-08-27 International Business Machines Corporation Soft checkpointing system using log sequence numbers derived from stored data pages and log records for database recovery
US4941059A (en) * 1988-09-13 1990-07-10 Compaq Computer Corporation Method for restoring computer files, including improved steps for location of head clusters of files
GB8915875D0 (en) * 1989-07-11 1989-08-31 Intelligence Quotient United K A method of operating a data processing system
US5179662A (en) * 1989-08-31 1993-01-12 International Business Machines Corporation Optimized i/o buffers having the ability to increase or decrease in size to meet system requirements
JPH03188528A (ja) * 1989-09-27 1991-08-16 Hitachi Ltd ジョブ実行管理方法およびシステム
US5193162A (en) * 1989-11-06 1993-03-09 Unisys Corporation Cache memory with data compaction for use in the audit trail of a data processing system having record locking capabilities
US5317733A (en) * 1990-01-26 1994-05-31 Cisgem Technologies, Inc. Office automation system for data base management and forms generation
US5222235A (en) * 1990-02-01 1993-06-22 Bmc Software, Inc. Databases system for permitting concurrent indexing and reloading of data by early simulating the reload process to determine final locations of the data
US5129082A (en) * 1990-03-27 1992-07-07 Sun Microsystems, Inc. Method and apparatus for searching database component files to retrieve information from modified files
US5319774A (en) * 1990-05-16 1994-06-07 International Business Machines Corporation Recovery facility for incomplete sync points for distributed application
US5261089A (en) * 1990-05-16 1993-11-09 International Business Machines Corporation Optimization of commit procedures by utilizing a two-phase commit procedure only when necessary
US5319773A (en) * 1990-05-16 1994-06-07 International Business Machines Corporation Asynchronous resynchronization of a commit procedure
JP2691081B2 (ja) * 1990-05-16 1997-12-17 インターナショナル・ビジネス・マシーンズ・コーポレイション コンピュータ・ネットワーク
US5276876A (en) * 1990-05-16 1994-01-04 International Business Machines Corporation Registration of resources for commit procedures
US5165031A (en) * 1990-05-16 1992-11-17 International Business Machines Corporation Coordinated handling of error codes and information describing errors in a commit procedure
US5327532A (en) * 1990-05-16 1994-07-05 International Business Machines Corporation Coordinated sync point management of protected resources
JP3293839B2 (ja) * 1990-05-16 2002-06-17 インターナショナル・ビジネス・マシーンズ・コーポレーション 作業ユニットに合わせてコミット範囲を調整するコンピュータ・システム
JP2667039B2 (ja) * 1990-05-18 1997-10-22 株式会社東芝 データ管理システムおよびデータ管理方法
US5129152A (en) * 1990-12-20 1992-07-14 Hughes Aircraft Company Fast contact measuring machine
US5241672A (en) * 1991-04-01 1993-08-31 Xerox Corporation System using the storage level of file updates in nonvolatile memory to trigger saving of RAM to disk and using the file updates to reboot after crash
US5261094A (en) * 1991-04-08 1993-11-09 International Business Machines Corporation Asynchronous replication of data changes by distributed update requests
CA2055295C (en) * 1991-11-12 2000-05-23 Jean Gilles Fecteau Logical mapping of data objects using data spaces
US5440727A (en) * 1991-12-18 1995-08-08 International Business Machines Corporation Asynchronous replica management in shared nothing architectures
US7299240B1 (en) 1992-04-10 2007-11-20 Intellisync Corporation Method for translating computer data from one record structure to another
JPH0827754B2 (ja) * 1992-05-21 1996-03-21 インターナショナル・ビジネス・マシーンズ・コーポレイション コンピュータシステムにおけるファイル管理方法及びファイル管理システム
US5574897A (en) * 1992-09-30 1996-11-12 International Business Machines Corporation System managed logging of objects to speed recovery processing
SE500599C2 (sv) * 1992-12-08 1994-07-25 Ellemtel Utvecklings Ab Sätt att optimera minnesutrymme i en databas
SE500656C2 (sv) * 1992-12-08 1994-08-01 Ellemtel Utvecklings Ab System för backuptagning i en distribuerad databas
US5685003A (en) * 1992-12-23 1997-11-04 Microsoft Corporation Method and system for automatically indexing data in a document using a fresh index table
GB2273802A (en) * 1992-12-24 1994-06-29 Cambrel Limited Memory utilisation for data processing
US5303146A (en) 1993-03-11 1994-04-12 Borland International, Inc. System and methods for improved scenario management in an electronic spreadsheet
JPH06324928A (ja) * 1993-05-14 1994-11-25 Mitsubishi Electric Corp ログ生成装置とファイルの異なるバージョンの調停のための装置及び異なる場所にあるコンピュータファイルの異なるバージョンを調停するための装置
US5692176A (en) * 1993-11-22 1997-11-25 Reed Elsevier Inc. Associative text search and retrieval system
GB9406564D0 (en) * 1994-03-31 1994-05-25 Int Computers Ltd Database management system
JP2679674B2 (ja) * 1994-05-02 1997-11-19 日本電気株式会社 半導体製造ライン制御装置
US5561795A (en) * 1994-05-13 1996-10-01 Unisys Corporation Method and apparatus for audit trail logging and data base recovery
US5435004A (en) * 1994-07-21 1995-07-18 International Business Machines Corporation Computerized system and method for data backup
US5778443A (en) * 1994-12-14 1998-07-07 International Business Machines Corp. Method and apparatus for conserving power and system resources in a computer system employing a virtual memory
US5684990A (en) * 1995-01-11 1997-11-04 Puma Technology, Inc. Synchronization of disparate databases
US5689705A (en) * 1995-02-13 1997-11-18 Pulte Home Corporation System for facilitating home construction and sales
US5864654A (en) * 1995-03-31 1999-01-26 Nec Electronics, Inc. Systems and methods for fault tolerant information processing
JPH11508070A (ja) * 1995-06-16 1999-07-13 ルーセント テクノロジーズ 実行制御のためのチェックポイント復旧システム
US6105148A (en) * 1995-06-16 2000-08-15 Lucent Technologies Inc. Persistent state checkpoint and restoration systems
WO1997000476A1 (en) * 1995-06-16 1997-01-03 Lucent Technologies Persistent state checkpoint and restoration systems
US6044475A (en) * 1995-06-16 2000-03-28 Lucent Technologies, Inc. Checkpoint and restoration systems for execution control
US5826262A (en) * 1996-03-22 1998-10-20 International Business Machines Corporation Parallel bottom-up construction of radix trees
US5829005A (en) * 1996-07-03 1998-10-27 Sun Microsystems, Inc. Circular size-bounded file technique for a computer operating system
US5832499A (en) * 1996-07-10 1998-11-03 Survivors Of The Shoah Visual History Foundation Digital library system
US6321234B1 (en) * 1996-09-18 2001-11-20 Sybase, Inc. Database server system with improved methods for logging transactions
US6212529B1 (en) 1996-11-13 2001-04-03 Puma Technology, Inc. Synchronization of databases using filters
US6330568B1 (en) 1996-11-13 2001-12-11 Pumatech, Inc. Synchronization of databases
US5943676A (en) * 1996-11-13 1999-08-24 Puma Technology, Inc. Synchronization of recurring records in incompatible databases
US6141664A (en) 1996-11-13 2000-10-31 Puma Technology, Inc. Synchronization of databases with date range
US6405218B1 (en) 1996-11-13 2002-06-11 Pumatech, Inc. Synchronizing databases
US6044381A (en) * 1997-09-11 2000-03-28 Puma Technology, Inc. Using distributed history files in synchronizing databases
US7302446B1 (en) 1996-11-13 2007-11-27 Intellisync Corporation Synchronizing databases
US7013315B1 (en) 1996-11-13 2006-03-14 Intellisync Corporation Synchronization of databases with record sanitizing and intelligent comparison
US6014674A (en) * 1996-11-14 2000-01-11 Sybase, Inc. Method for maintaining log compatibility in database systems
US6253228B1 (en) * 1997-03-31 2001-06-26 Apple Computer, Inc. Method and apparatus for updating and synchronizing information between a client and a server
SE9701895L (sv) * 1997-05-21 1998-11-22 Ericsson Telefon Ab L M Metod och anordning för datorsystem
US5931955A (en) * 1997-12-15 1999-08-03 At&T Corp Method and generic automatic database recovery
US6298342B1 (en) 1998-03-16 2001-10-02 Microsoft Corporation Electronic database operations for perspective transformations on relational tables using pivot and unpivot columns
US6925477B1 (en) 1998-03-31 2005-08-02 Intellisync Corporation Transferring records between two databases
US6052696A (en) * 1998-04-27 2000-04-18 International Business Machines Corporation Adaptive time-based journal bundling
US6216051B1 (en) 1998-05-04 2001-04-10 Nec Electronics, Inc. Manufacturing backup system
US6189016B1 (en) * 1998-06-12 2001-02-13 Microsoft Corporation Journaling ordered changes in a storage volume
US6253212B1 (en) * 1998-06-23 2001-06-26 Oracle Corporation Method and system for maintaining checkpoint values
US6351754B1 (en) 1998-06-23 2002-02-26 Oracle Corporation Method and system for controlling recovery downtime
US6298345B1 (en) * 1998-07-10 2001-10-02 International Business Machines Corporation Database journal mechanism and method that supports multiple simultaneous deposits
US6353831B1 (en) 1998-11-02 2002-03-05 Survivors Of The Shoah Visual History Foundation Digital library system
US7007003B1 (en) 1998-12-04 2006-02-28 Intellisync Corporation Notification protocol for establishing synchronization mode for use in synchronizing databases
JP3016230B1 (ja) * 1999-04-01 2000-03-06 株式会社ビーコンインフォメーションテクノロジー デ―タ管理方法及び装置、記録媒体
US7337360B2 (en) * 1999-10-19 2008-02-26 Idocrase Investments Llc Stored memory recovery system
US6594780B1 (en) * 1999-10-19 2003-07-15 Inasoft, Inc. Operating system and data protection
US6658596B1 (en) 2000-03-13 2003-12-02 International Business Machines Corporation Automated queue recovery using element- based journaling
US6985915B2 (en) 2001-02-28 2006-01-10 Kiran Somalwar Application independent write monitoring method for fast backup and synchronization of files
US6847983B2 (en) 2001-02-28 2005-01-25 Kiran Somalwar Application independent write monitoring method for fast backup and synchronization of open files
US7359920B1 (en) 2001-04-18 2008-04-15 Intellisync Corporation Communication protocol for synchronization of personal information management databases
US7249193B1 (en) * 2001-08-28 2007-07-24 Emc Corporation SRDF assist
US6820217B2 (en) * 2001-10-29 2004-11-16 International Business Machines Corporation Method and apparatus for data recovery optimization in a logically partitioned computer system
US6947956B2 (en) * 2002-06-06 2005-09-20 International Business Machines Corporation Method and apparatus for selective caching of transactions in a computer system
US7308456B2 (en) * 2002-12-19 2007-12-11 International Business Machines Corporation Method and apparatus for building one or more indexes on data concurrent with manipulation of data
JP4165747B2 (ja) * 2003-03-20 2008-10-15 株式会社日立製作所 記憶システム、制御装置及び制御装置のプログラム
US7398422B2 (en) * 2003-06-26 2008-07-08 Hitachi, Ltd. Method and apparatus for data recovery system using storage based journaling
US7111136B2 (en) 2003-06-26 2006-09-19 Hitachi, Ltd. Method and apparatus for backup and recovery system using storage based journaling
JP4551096B2 (ja) * 2004-02-03 2010-09-22 株式会社日立製作所 ストレージサブシステム
US7606793B2 (en) 2004-09-27 2009-10-20 Microsoft Corporation System and method for scoping searches using index keys
US7644107B2 (en) * 2004-09-30 2010-01-05 Microsoft Corporation System and method for batched indexing of network documents
US7752181B2 (en) * 2004-11-08 2010-07-06 Oracle International Corporation System and method for performing a data uniqueness check in a sorted data set
US7653244B2 (en) * 2005-02-22 2010-01-26 Potts Wesley F Intelligent importation of information from foreign applications user interface
EP2013709A4 (de) * 2006-04-14 2012-07-18 Vertafore Inc Verfahren, system und computerlesbares medium zur bewahrung und/oder löschung von dateien eines dokumentverwaltungssystems
US8184798B2 (en) * 2006-06-13 2012-05-22 Tekelec Methods, systems and computer program products for accessing number portability (NP) and E.164 number (ENUM) data using a common NP/ENUM data locator structure
US20070294317A1 (en) * 2006-06-15 2007-12-20 Dan Allan Christy Apparatus and Method for Journaling and Recovering Indexes that Cannot be Fully Recovered During Initial Program Load
US7787445B2 (en) * 2006-07-20 2010-08-31 Tekelec Methods, systems, and computer program products for routing and processing ENUM queries
US7953698B2 (en) * 2006-08-03 2011-05-31 Sybase, Inc. Replication system with methodology for replicating stored procedure calls
US8745005B1 (en) * 2006-09-29 2014-06-03 Emc Corporation Checkpoint recovery using a B-tree intent log with syncpoints
US8254551B2 (en) * 2006-12-07 2012-08-28 Tekelec, Inc. Methods, systems, and computer program products for providing quality of service using E.164 number mapping (ENUM) data in a communications network
US8538000B2 (en) * 2007-08-10 2013-09-17 Tekelec, Inc. Methods, systems, and computer program products for performing message deposit transaction screening
US9348912B2 (en) 2007-10-18 2016-05-24 Microsoft Technology Licensing, Llc Document length as a static relevance feature for ranking search results
EP2258128B1 (de) * 2008-03-07 2017-01-11 Tekelec Global, Inc. Verfahren, system und computerlesbare medien zum routen einer nachrichtendienstnachricht durch ein kommunikationsnetz
US8200627B2 (en) * 2008-10-30 2012-06-12 International Business Machines Corporation Journaling database changes using a bit map for zones defined in each page
US9584959B2 (en) 2008-11-24 2017-02-28 Tekelec Global, Inc. Systems, methods, and computer readable media for location-sensitive called-party number translation in a telecommunications network
US8452325B2 (en) * 2009-05-11 2013-05-28 Tekelec, Inc. Methods, systems, and computer readable media for providing scalable number portability (NP) home location register (HLR)
US9063932B2 (en) * 2009-12-18 2015-06-23 Vertafore, Inc. Apparatus, method and article to manage electronic or digital documents in a networked environment
US8700682B2 (en) * 2009-12-24 2014-04-15 Vertafore, Inc. Systems, methods and articles for template based generation of markup documents to access back office systems
US9384198B2 (en) 2010-12-10 2016-07-05 Vertafore, Inc. Agency management system and content management system integration
US8731973B2 (en) 2011-04-19 2014-05-20 Vertafore, Inc. Overlaying images in automated insurance policy form generation
US9495462B2 (en) 2012-01-27 2016-11-15 Microsoft Technology Licensing, Llc Re-ranking search results
JP5337916B1 (ja) * 2012-09-25 2013-11-06 株式会社東芝 情報処理システム
KR101477017B1 (ko) * 2013-03-29 2014-12-29 주식회사 알티베이스 공유메모리 내의 인덱스 운용 장치 및 방법
US9880926B1 (en) * 2013-08-20 2018-01-30 Seagate Technology Llc Log structured reserved zone for a data storage device
US9507814B2 (en) 2013-12-10 2016-11-29 Vertafore, Inc. Bit level comparator systems and methods
US9367435B2 (en) 2013-12-12 2016-06-14 Vertafore, Inc. Integration testing method and system for web services
US9747556B2 (en) 2014-08-20 2017-08-29 Vertafore, Inc. Automated customized web portal template generation systems and methods
US9600400B1 (en) 2015-10-29 2017-03-21 Vertafore, Inc. Performance testing of web application components using image differentiation
US10671586B2 (en) * 2017-07-25 2020-06-02 Sap Se Optimal sort key compression and index rebuilding
US10866869B2 (en) * 2019-01-16 2020-12-15 Vmware, Inc. Method to perform crash and failure recovery for a virtualized checkpoint protected storage system
US12019620B2 (en) 2022-01-27 2024-06-25 Hewlett Packard Enterprise Development Lp Journal groups for metadata housekeeping operation
US20230315712A1 (en) * 2022-03-31 2023-10-05 Unisys Corporation Method of making a file containing a secondary index recoverable during processing

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4507751A (en) * 1982-06-21 1985-03-26 International Business Machines Corporation Method and apparatus for logging journal data using a log write ahead data set

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1984002784A1 (en) * 1982-12-30 1984-07-19 Ibm Virtual memory address translation mechanism with controlled data persistence
JPS59165162A (ja) * 1983-03-11 1984-09-18 インタ−ナシヨナル　ビジネス　マシ−ンズ　コ−ポレ−シヨン ボリューム回復方法

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4507751A (en) * 1982-06-21 1985-03-26 International Business Machines Corporation Method and apparatus for logging journal data using a log write ahead data set

Also Published As

Publication number Publication date
EP0249090A2 (de) 1987-12-16
JPS62297950A (ja) 1987-12-25
DE3784190D1 (de) 1993-03-25
EP0249090A3 (en) 1989-10-25
DE3784190T2 (de) 1993-08-19
US4819156A (en) 1989-04-04

Similar Documents

Publication Publication Date Title
EP0249090B1 (de) Eintragung eines Datenbasisindex in das Journal zur verbesserten Rückstellung
EP0351387B1 (de) Verriegelungs- und Lese-Minimierung in einem segmentierten Speicherraum
US6567928B1 (en) Method and apparatus for efficiently recovering from a failure in a database that includes unlogged objects
US6651073B1 (en) Method and apparatus for insuring database data integrity without data recovery logging
US8200627B2 (en) Journaling database changes using a bit map for zones defined in each page
US6892211B2 (en) Copy on write file system consistency and block usage
US7962531B2 (en) Multiple concurrent active file systems
US6023710A (en) System and method for long-term administration of archival storage
JP3751018B2 (ja) ライトエニウエアファイルシステムレイアウト
US8255371B2 (en) Methods and apparatuses for data protection
US6604118B2 (en) File system image transfer
US6311193B1 (en) Computer system
US5369757A (en) Recovery logging in the presence of snapshot files by ordering of buffer pool flushing
US8484172B2 (en) Efficient search for migration and purge candidates
US5561795A (en) Method and apparatus for audit trail logging and data base recovery
US6665815B1 (en) Physical incremental backup using snapshots
JP2531776B2 (ja) デ―タベ―スを回復する方法
US20020049718A1 (en) File system image transfer
US20090006500A1 (en) Namespace replication program, namespace replication device, and namespace replication method
EP2983093A1 (de) Vorrichtung und verfahren für ein dateisystem auf hardwarebasis
Eich Mars: The design of a main memory database machine
JPH05502747A (ja) 大容量データベースシステムにおける回復
US8640136B2 (en) Sharing objects between computer systems
JPS62245348A (ja) データベース更新方法
Srinivasan et al. Recoverable file system for microprocessor systems

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): DE FR GB IT

17P Request for examination filed

Effective date: 19880426

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): DE FR GB IT

17Q First examination report despatched

Effective date: 19910527

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR GB IT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT;WARNING: LAPSES OF ITALIAN PATENTS WITH EFFECTIVE DATE BEFORE 2007 MAY HAVE OCCURRED AT ANY TIME BEFORE 2007. THE CORRECT EFFECTIVE DATE MAY BE DIFFERENT FROM THE ONE RECORDED.

Effective date: 19930217

REF Corresponds to:

Ref document number: 3784190

Country of ref document: DE

Date of ref document: 19930325

ET Fr: translation filed
PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed
PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 19950413

Year of fee payment: 9

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 19950427

Year of fee payment: 9

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 19950524

Year of fee payment: 9

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Effective date: 19960526

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 19960526

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Effective date: 19970131

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Effective date: 19970201

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST