By Topic

An index implementation supporting fast recovery for the POSTGRES storage system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sullivan, M. ; Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA ; Olson, M.

The authors present two algorithms for maintaining B-tree index consistency in a database management system which does not use write-ahead logging (WAL). One algorithm is similar to shadow paging, but improves performance by integrating shadow meta-data with index meta-data. The other algorithm uses a two-phase page reorganization scheme to reduce the space overhead caused by shadow paging. Although designed for the POSTGRES storage system, these algorithms should also be useful in a WAL-based storage system, as support for logical logging. Measurements and analysis of a prototype implementation suggest that the algorithms will have little impact on data manager performance

Published in:

Data Engineering, 1992. Proceedings. Eighth International Conference on

Date of Conference:

2-3 Feb 1992