Skip Navigation

The Computer Journal 1997 40(4):183-193; doi:10.1093/comjnl/40.4.183
© 1997 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Delis, A.
Right arrow Articles by LeViet, Q.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Contemporary Access Structures Under Mixed Workloads

A. Delis1 and Q. LeViet2

1 Department of Computer and Information Science, Polytechnic University, Brooklyn, NY 11201, USA Email: ad{at}naxos.poly.edu, 2 School of Information Systems, Queensland University of Technology, Brisbane, QLD 4001, Australia

Modern high-performance computing systems and databases are implemented under the assumption that a very large proportion of the data used can now be maintained in volatile memory. In this paper, we compare experimentally two recently proposed self-adjusting access structures that can be used to organize data in such settings, namely, the Skip-List (SL) and the Binary B-Tree (BB-Tree). We examine the scalability of these two methods against both mixed and pure-query workloads. Our experiments reveal the behaviour of SLs and BB-Trees under diverse environments and varying data requirements.

Received May 9, 1996. revised July 28, 1997.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.