Share Email Print

Proceedings Paper

Buffering of index structures
Author(s): Tuba Yavuz; Tamer Kahveci; Ambuj K. Singh
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Buffering the index structures is an important problem, because disk I/O dominates the cost of queries. In this paper, we compare existing algorithms for uniform, nonuniform static and nonuniform dynamic access patterns. We experimentally show that the LRU-2 method is better than the other methods. We also propose an efficient implementation of the LRU-2 algorithm. In the second part of the paper, we propose a new buffering algorithm for a distributed system where each machine has its own buffer. We show experimentally that this method performs better than other buffering techniques.

Paper Details

Date Published: 11 October 2000
PDF: 9 pages
Proc. SPIE 4210, Internet Multimedia Management Systems, (11 October 2000); doi: 10.1117/12.403806
Show Author Affiliations
Tuba Yavuz, Univ. of California/Santa Barbara (United States)
Tamer Kahveci, Univ. of California/Santa Barbara (United States)
Ambuj K. Singh, Univ. of California/Santa Barbara (United States)

Published in SPIE Proceedings Vol. 4210:
Internet Multimedia Management Systems
John R. Smith; Chinh Le; Sethuraman Panchanathan; C.-C. Jay Kuo, Editor(s)

© SPIE. Terms of Use
Back to Top