Michael A. Bender, Erik D. Demaine, Martin Farach-Colton  Home/Search
Context Related
| sunysb.edu/~bender/pub/Btreefull.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: sunysb.edu/~bender/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents two dynamic search trees attaining near-optimal performance on any hierarchical memory. The data structures are independent of the parameters of the memory hierarchy, e.g., the number of memory levels, the block-transfer size at each level, and the relative speeds of memory levels. The performance is analyzed in terms of the number of memory transfers between two memory levels with an arbitrary block-transfer size of B; this analysis can then be applied to every... (Update)
Cited by: More
Algorithmic Support for Commodity-Based Parallel Computing.. - Leung, Phillips, al. (2003) (Correct)
INSERTION SORT is O(n log n) - Michael Bender Mart (Correct)
Cache-conscious Frequent Pattern Mining on a Modern - Processor Amol Ghoting (2005) (Correct)
Similar documents (at the sentence level):
11.9%: Cache-Oblivious B-Trees - Bender, Demaine, Farach-Colton (2000) (Correct)
Active bibliography (related documents): More All
2.0: The Cost of Cache-Oblivious Searching - Bender, Brodal, Fagerberg, Ge.. (2003) (Correct)
1.5: Efficient Tree Layout in a Multilevel Memory Hierarchy - Alstrup, Bender, Demaine, .. (2002) (Correct)
1.1: Scanning and Traversing: Maintaining Data for.. - Bender, Cole.. (2002) (Correct)
Similar documents based on text: More All
0.3: Optimal Covering Tours with Turn Costs - Arkin, Bender, Demaine, Fekete.. (2000) (Correct)
0.3: A Locality-Preserving Cache-Oblivious Dynamic Dictionary - Bender, Duan, Iacono, Wu (2002) (Correct)
0.2: Two Simplified Algorithms for Maintaining Order in a List - Bender, Cole, Demaine.. (2002) (Correct)
Related documents from co-citation: More All
23: A locality-preserving cache-oblivious dynamic dictionary - Bender, Duan et al. - 2002
19: Organization and maintenance of large ordered indexes (context) - Bayer, McCreight - 1972
19: Cache-oblivious algorithms (context) - Frigo, Leiserson et al. - 1999
BibTeX entry: (Update)
M. A. Bender, E. D. Demaine, and M. Farach-Colton. Cache-Oblivious B-Trees. In Proceedings of the 41st IEEE FOCS, pages 399--409, Nov. 2000. http://citeseer.ist.psu.edu/article/bender00cacheoblivious.html More
@inproceedings{ bender00cacheoblivious,
author = "Michael A. Bender and Erik D. Demaine and Martin Farach-Colton",
title = "Cache-Oblivious B-Trees",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "399-409",
year = "2000",
url = "citeseer.ist.psu.edu/article/bender00cacheoblivious.html" }
Citations (may not include all citations):284 An introduction to disk drive modeling - Ruemmler, Wilkes - 1994
198 Organization and maintenance of large ordered indexes (context) - Bayer, McCreight - 1972
182 Skip lists: a probabilistic alternative to balanced trees - Pugh - 1989
109 inputoutput complexity sorting and related problem (context) - Aggarwal, Scott et al. - 1988
99 Two algorithms for maintaining order in a list (context) - Dietz, Sleator - 1987
82 Hierarchical memory with block transfer (context) - Aggarwal, Chandra et al. - 1987
82 A model for hierarchical memory (context) - Aggarwal, Alpern et al. - 1987
62 Optimal dynamic interval management in external memory - Arge, rey - 1996
54 complexity: The red-blue pebble game (context) - Hong, Kung - 1981
46 Preserving order in a forest in less than logarithmic time (context) - Boas - 1975
38 Locality of reference in LU decomposition with partial pivot.. - Toledo - 1997
33 Binary search trees of bounded balance (context) - Nievergelt, Reingold - 1973
30 Algorithms for parallel memory I: Two-level memories - rey, Elizabeth et al. - 1994
29 Design and implementation of an ecient priority queue (context) - Boas, Kaas et al. - 1977
28 A locality-preserving cacheoblivious dynamic dictionary - Bender, Duan et al. - 2002
28 volume 156 of Lecture Notes in Computer Science (context) - Overmars, of et al. - 1983
25 Massachusetts Institute of Technology (context) - Prokop, Master's - 1999
22 New algorithms for the disk scheduling problem - Andrews, Bender et al. - 1996
22 New algorithms for the disk scheduling problem - Andrews, Bender et al. - 2002
19 A sparse table implementation of priority queues (context) - Itai, Konheim et al. - 1981
15 Deterministic skip lists (context) - Munro, Papadakis et al. - 1992
13 Good worst-case algorithms for inserting and deleting record.. (context) - Willard - 1986
12 A density control algorithm for doing insertions and deletio.. (context) - Willard - 1992
11 in uence of caches on the performance of sorting (context) - LaMarca, Ladner - 1997
9 Scanning and traversing: Maintaining data for traversals in .. - Bender, Cole et al. - 2002
8 The uniform memory hierarchy model of computation (context) - Alpern, Carter et al. - 1994
8 Towards a theory of cache-ecient algorithms (context) - Sen, Chatterjee - 2000
7 Algorithms for parallel memory II: Hierarchical multilevel m.. - rey, Elizabeth et al. - 1994
7 Extending the Hong-Kung model to memory hierachies (context) - Savage - 1995
6 Two simpli ed algorithms for maintaining order in a list (context) - Bender, Cole et al. - 2002
5 A theoretical framework for memory-adaptive algorithms - Barve, rey - 1999
5 Maintaining dense sequential les in a dynamic environment (context) - Willard - 1982
5 A comparison of cache aware and cache oblivious static searc.. - Ladner, Fortna et al. - 2002
4 Ecient tree layout in a multilevel memory hierarchy (context) - Bender, Demaine et al. - 2002
4 Optimised predecessor data structures for internal memory (context) - Rahman, Cole et al. - 2001
4 Exponential structures for ecient cache-oblivious algorithms (context) - Bender, Cole et al. - 2002
3 and Sridhar Ramachandran (context) - Frigo, Leiserson et al. - 1999
3 External memory algorithms and data structures: Dealing with.. (context) - rey - 2001
3 Optimal worst-case operations for implicit cacheoblivious se.. (context) - Franceschini, Grossi - 2003
2 Optimal cache-oblivious implicit dictionaries (context) - Franceschini, Grossi - 2003
2 ecient construction of Voronoi diagrams (context) - Kumar, Ramos et al. - 2003
2 compubDigitalinfosemiconductorliterature dsc library (context) - http, com et al. - 1999
2 Cache oblivious search trees via binary trees of small heigh.. (context) - St, Brodal et al. - 2002
1 a cache oblivious priority queue (context) - St, Brodal et al. - 2002
1 Cache oblivious distribution sweeping - St, Brodal et al. - 2002
1 and Martin Farach-Colton (context) - Bender, Demaine - 2000
1 The cost of cache-oblivious searching - Bender, St et al. - 2003
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.sunysb.edu/~bender/): More
Performance Guarantees for the TSP with a Parameterized.. - Bender, Chekuri (1999) (Correct)
New Algorithms for the Disk Scheduling Problem - Andrews, al. (1998) (Correct)
The Lazy Bureaucrat Scheduling Problem - Arkin, Bender, Mitchell, Skiena (1999) (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