Welcome to the InfoSci Platform
Stochastically Balancing Trees for File and Database Systems

Stochastically Balancing Trees for File and Database Systems

Aziz Barbar, Anis Ismail
Copyright: © 2013 |Volume: 4 |Issue: 1 |Pages: 13
ISSN: 1948-5018|EISSN: 1948-5026|EISBN13: 9781466631267|DOI: 10.4018/jgc.2013010104
Cite Article Cite Article

MLA

Barbar, Aziz, and Anis Ismail. "Stochastically Balancing Trees for File and Database Systems." IJGC vol.4, no.1 2013: pp.58-70. http://doi.org/10.4018/jgc.2013010104

APA

Barbar, A. & Ismail, A. (2013). Stochastically Balancing Trees for File and Database Systems. International Journal of Green Computing (IJGC), 4(1), 58-70. http://doi.org/10.4018/jgc.2013010104

Chicago

Barbar, Aziz, and Anis Ismail. "Stochastically Balancing Trees for File and Database Systems," International Journal of Green Computing (IJGC) 4, no.1: 58-70. http://doi.org/10.4018/jgc.2013010104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

With the constant improvement in data storage technologies, a new generation of indexing mechanisms is to be created to exploit the improvements in disk access speeds that were previously impractical. The self-balancing tree B-Tree, has long been the indexing structure of choice for reducing the amount of disk access at the expense of size of data block to be read or written. A new technique based on a dynamically growing multilevel list structure, which is stochastically balanced rather than self balanced, is discussed and compared to the B-Tree. An analogy between the technique and the structures is established to better compare the computational complexities.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.