A Cache Consistency Control for B - Tree Indices in a Database Sharing System 


Vol. 8,  No. 5, pp. 593-604, Oct.  2001
10.3745/KIPSTD.2001.8.5.593


PDF
  Abstract

A database sharing system (DSS) refers to a system for high performance transaction processing. In the DSS, the processing nodes are coupled via a high speed network and share a common database at the disk level. Each node has a local memory and a separate copy of operating system. To reduce the number of disk accesses, the node caches data pages and index pages in its memory buffer. In general, B-tree index pages are accessed more often and thus cached at more processing nodes, than their corresponding data pages. There are also complicated operations in the B-tree such as Fetch, Fetch Next, Insertion and Deletion. Therefore, an efficient cache consistency scheme supporting high level concurrency is required. In this paper, we propose cache consistency schemes using identifiers of index pages and page_LSN of leaf page. The proposed schemes can improve the system throughput by reducing the required message traffic between nodes and index re-traversal.

  Statistics
  Cite this article

[IEEE Style]

K. O. Ohn and H. R. Cho, "A Cache Consistency Control for B - Tree Indices in a Database Sharing System," The KIPS Transactions:PartD, vol. 8, no. 5, pp. 593-604, 2001. DOI: 10.3745/KIPSTD.2001.8.5.593.

[ACM Style]

Kyung Oh Ohn and Haeng Rae Cho. 2001. A Cache Consistency Control for B - Tree Indices in a Database Sharing System. The KIPS Transactions:PartD, 8, 5, (2001), 593-604. DOI: 10.3745/KIPSTD.2001.8.5.593.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals