(Enter summary)
Abstract: This paper proposes and evaluates Prefetching B
+
-Trees
(pB
+
-Trees), which use prefetching to accelerate two important
operations on B
+
-Tree indices: searches and range
scans. To accelerate searches, pB
+
-Trees use prefetching to
effectively create wider nodes than the natural data transfer
size: e.g., eight vs. one cache lines or disk pages. These
wider nodes reduce the height of the B
+
-Tree, thereby decreasing
the number of expensive misses when going from
parent to child... (Update)
Cited by: More
School of Computer Science - Carnegie Mellon University (1992)
(Correct)
StagedDB: Designing Database Servers for Modern Hardware - Stavros Harizopoulos.. (2005)
(Correct)
Cache-conscious Frequent Pattern Mining on a Modern - Processor Amol Ghoting (2005)
(Correct)
Similar documents (at the sentence level):
61.4%: Improving Index Performance through Prefetching - Chen, Gibbons, Todd (2001)
(Correct)
Active bibliography (related documents): More All
0.8: Improving Hash Join Performance through Prefetching - Shimin Chen Anastassia (2003)
(Correct)
0.7: Fractal Prefetching B+-Trees: Optimizing Both Cache.. - Chen, Gibbonst..
(Correct)
0.3: Databases and Finite-Model Theory - Vianu (1997)
(Correct)
Similar documents based on text: More All
2.4: Unknown -
(Correct)
1.7: Sorting - Chen
(Correct)
0.4: Effectively Sharing a Cache Among Threads - Guy Blelloch Carnegie
(Correct)
Related documents from co-citation: More All
12: DBMSs on a modern processor: Where does time go
- Ailamaki - 1999
9: trees cache conscious in main memory (context) - Rao, Ross - 2000
8: Cache conscious indexing for decision-support in main memory
- Rao, Ross - 1999
BibTeX entry: (Update)
S. Chen, P. B. Gibbons, and T. C. Mowry. Improving Index Performance through Prefetching. Technical Report CMU-CS-00-177, School of Computer Science, Carnegie Mellon University, Dec. 2000. http://citeseer.ist.psu.edu/article/chen00improving.html More
@inproceedings{ chen01improving,
author = "Shimin Chen and Phillip B. Gibbons and Todd C. Mowry",
title = "Improving Index Performance through Prefetching",
booktitle = "{SIGMOD} Conference",
year = "2001",
url = "citeseer.ist.psu.edu/article/chen00improving.html" }
Citations (may not include all citations):
344
Design and Evaluation of a Compiler Algorithm for Prefetchin..
- Mowry, Lam et al. - 1992
107
Memory System Characterization of Commercial Workloads
- Barroso, Gharachorloo et al. - 1998
104
Compiler-Based Prefetching for Recursive Data Structures
- Luk, Mowry - 1996
72
Performance Characterization of a Quad Pentium Pro SMP using..
- Keeton, Patterson et al. - 1998
61
AlphaSort: A RISC Machine Sort (context) - Nyberg, Barclay et al. - 1994
52
DBMSs on a Modern Processor: Where Does Time Go
- Ailamaki, DeWitt et al. - 1999
43
A Study of Index Structures for Main Memory Database Managem.. (context) - Lehman, Carey - 1986
35
Cache-Oblivious B-Trees
- Bender, Demaine et al. - 2000
30
Performance of Database Workloads on Shared-Memory Systems w..
- Ranganathan, Gharachorloo et al. - 1998
26
Cache Conscious Indexing for Decision-Support in Main Memory
- Rao, Ross
20
Compressing Relations and Indexes
- Goldstein, Ramakrishnan et al. - 1998
19
Query Processing in Main Memory Database Management Systems (context) - Lehman, Carey - 1986
17
Improving Index Performance through Prefetching
- Chen, Gibbons et al. - 2000
10
Impact of Chip-Level Integration on Performance of OLTP Work..
- Barroso, Gharachorloo et al. - 2000
9
Automatic Compiler-Inserted Prefetching for Pointer-Based Ap..
- Luk, Mowry - 1999
6
Technical Report WRL Technical Note TN (context) - McFarling, Predictors - 1993
5
Performance Analysis of the Alpha 21264-Based Compaq ES40 Sy.. (context) - Cvetanovic, Kessler - 2000
5
Improving Main-Memory Index Performance with Partial Key Inf.. (context) - Bohannon, McIlroy et al. - 2001
3
on Database Systems (context) - Bayer, Unterauer et al. - 1977
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.bell-labs.com/user/pbgibbons/recent.html): More
Provably Efficient Scheduling for Languages with.. - Blelloch, Gibbons.. (1995)
(Correct)
The Queue-Read Queue-Write Asynchronous PRAM Model - Gibbons, Matias, al. (1998)
(Correct)
The Queue-Read Queue-Write PRAM Model: Accounting for Contention. .. - Gibbons (1996)
(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