B-tree indexes and CPU caches

被引：38

作者：

Graefe, G ^{[1
]}

Larson, PÅ ^{[1
]}

机构：

[1] Microsoft Corp, Redmond, WA 98052 USA

来源：

17TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS | 2001年

关键词：

D O I：

10.1109/ICDE.2001.914847

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Since many existing techniques for exploiting CPU caches in the implementation of B-tree indexes have not been discussed in the literature, most of them are surveyed hel-e. Rather than providing a detailed performance evaluation for one or two Of them on some specific contemporary! hardware, the purpose here is to survey and to make widely available this heretofore-folkloric knowledge in order to enable, structure, and hopefully stimulate future research.

引用

页码：349 / 358

页数：10

共 18 条

[1]

Ailamaki A, 1999, PROCEEDINGS OF THE TWENTY-FIFTH INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES, P266

[2] Order preserving string compression [J].

Antoshenkov, G ;

Lomet, D ;

Murray, J .

PROCEEDINGS OF THE TWELFTH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, 1996, :655-663

[3] Dictionary-based order-preserving string compression [J].

Antoshenkov G. .

The VLDB Journal, 1997, 6 (1) :26-39

[4]

Bayer R., 1977, ACM Transactions on Database Systems, V2, P11, DOI 10.1145/320521.320530

[5]

Bayer R., 1972, Acta Informatica, V1, P173, DOI 10.1007/BF00288683

[6]

Boncz P, 1999, PROCEEDINGS OF THE TWENTY-FIFTH INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES, P54

[7]

CHILIMBI TM, 1999, P ACM SIGPLAN 1999 C, P13

[8]

Knuth D. E., 1998, ART COMPUTER PROGRAM, V3

[9]

Nyberg C., 1995, VLDB J., V4, P603

[10]

Rao J, 1999, PROCEEDINGS OF THE TWENTY-FIFTH INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES, P78

← 1 2 →