Semantic Scholar Open Access 2019 25 sitasi

Interpolation-friendly B-trees: Bridging the Gap Between Algorithmic and Learned Indexes

A. Hadian T. Heinis

Lihat Sumber DOI

Topik & Kata Kunci

Computer Science

Penulis (2)

A. Hadian

T. Heinis

Format Sitasi

APA MLA BibTeX

Hadian, A., Heinis, T. (2019). Interpolation-friendly B-trees: Bridging the Gap Between Algorithmic and Learned Indexes. https://doi.org/10.5441/002/edbt.2019.93

Akses Cepat

PDF tidak tersedia langsung

Cek di sumber asli →

Lihat di Sumber doi.org/10.5441/002/edbt.2019.93

Informasi Jurnal

Tahun Terbit: 2019
Bahasa: en
Total Sitasi: 25×
Sumber Database: Semantic Scholar
DOI: 10.5441/002/edbt.2019.93
Akses: Open Access ✓