Buffering of index structures

Tuba Yavuz; Tamer Kahveci; Ambuj K. Singh

doi:10.1117/12.403806

11 October 2000 Buffering of index structures

Tuba Yavuz, Tamer Kahveci, Ambuj K. Singh

Proceedings Volume 4210, Internet Multimedia Management Systems; (2000) https://doi.org/10.1117/12.403806
Event: Information Technologies 2000, 2000, Boston, MA, United States

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.

Citation Download Citation

Tuba Yavuz, Tamer Kahveci, and Ambuj K. Singh "Buffering of index structures", Proc. SPIE 4210, Internet Multimedia Management Systems, (11 October 2000); https://doi.org/10.1117/12.403806

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available