Kenneth Oksanen, Lauri Malmi  Home/Search
Context
Related
| cs.hut.fi/~cessu/paper...hellreport.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.hut.fi/~cessu/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Memory reference locality is widely known to have an increasingly important effect on the performance of algorithms. We demonstrate and explain why the performance of the binary tree search algorithm varies considerably depending on how the tree is laid out in the main memory. We present an algorithm which relocates a binary tree so that maximal performance can be achieved and discuss how updates degrade the locality of the tree. 1 Introduction Binary search trees are widely used index... (Update)
Similar documents (at the sentence level):
73.5%: Memory Reference Locality and Periodic Relocation in Main.. - Kenneth Oksanen Lauri (Correct)
18.8%: Memory Reference Locality in Binary Search Trees - Oksanen (1995) (Correct)
Active bibliography (related documents): More All
0.2: An Evaluation of Self-adjusting Binary Search Tree Techniques - Bell, Gupta (1993) (Correct)
0.1: ISA[k] Trees: a Class of Binary Search Trees with Minimal.. - Abuali, Wainwright (1993) (Correct)
0.1: General Balanced Trees - Andersson (1999) (Correct)
Similar documents based on text: More All
0.1: Algorithm Animation and Simulation - Korhonen (2000) (Correct)
0.1: Numerical Comparison of two Communication Algorithms - Apel, Haase, al. (1995) (Correct)
0.1: Is Large Mixing Angle MSW the Solution of the Solar Neutrino .. - Bahcall School Of (Correct)
BibTeX entry: (Update)
@misc{ oksanen-memory,
author = "Kenneth Oksanen and Lauri Malmi",
title = "Memory Reference Locality and Periodic Relocation in Main Memory Search
Trees",
url = "citeseer.ist.psu.edu/260169.html" }
Citations (may not include all citations):2003 The Art of Computer Programming (context) - Knuth - 1973
1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
234 Cache Memories (context) - Smith - 1982
192 Self-adjusting Binary Search Trees (context) - Sleator, Tarjan - 1985
70 Design Tradeoffs for SoftwareManaged TLBs - Nagle, Ulig et al. - 1993
65 Surpassing the TLB Performance of Superpages with Less Opera.. (context) - Talluri, Hill - 1994
64 Computing Surveys (context) - Comer, B-tree - 1979
52 A Simulation Based Study of TLB Performance - Chen, Borg et al. - 1992
33 Binary Search Trees of Bounded Balance (context) - Nievergelt, Reingold - 1973
23 An Algorithm for the Organisation of Information (context) - Adel'son-Vel'skii, Landis - 1962
22 Static-graph (context) - Wilson, Lam et al. - 1991
13 Tree Rebalancing in Optimal Time and Space (context) - Stout, Warren - 1986
11 Efficient Algorithms to Globally Balance a Binary Search Tre.. (context) - Chang, Iyengar - 1984
2 Memory Reference Locality in Binary Search Trees - Oksanen - 1995
2 of the 19th Symposium on Foundations of Computer Science (context) - Guibas, Sedgewick et al. - 1983
2 Numerical Linear Algebra and Computer Architecture: An Evolv.. - Hedayat
2 Maximally Parallel Algorithms to Balancing Binary Search Tre.. (context) - Moitra, Iyengar - 1985
Documents on the same site (http://www.cs.hut.fi/~cessu/):
Memory Reference Locality in Binary Search Trees - Oksanen (1995) (Correct)
Memory Reference Locality and Periodic Relocation in Main.. - Kenneth Oksanen Lauri (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC