Back to Results
First PageMeta Content
Data management / B-tree / Trie / B+ tree / R-tree / T-tree / Tree traversal / Tree / Search tree / Binary trees / Graph theory / Computing


Cache-Oblivious String B-trees Michael A. Bender Martin Farach-Colton Bradley C. Kuszmaul
Add to Reading List

Document Date: 2010-06-16 06:40:28


Open Document

File Size: 150,68 KB

Share Result on Facebook

City

San Francisco / Tucson / New York / Las Vegas / Redondo Beach / Berlin / Rome / Haifa / Miami / Reading / Chicago / /

Company

IBM / Bayer / Subsequent CO / /

Country

Italy / Israel / /

Currency

pence / USD / /

/

Facility

store D / /

IndustryTerm

disk system services / local search works / use disk hardware / search proceeds / randomized dictionary matching algorithms / memoryoptimal search / database applications / Real memory systems / file systems / oblivious search trees / prefix search / search structures / randomized pattern-matching algorithms / search key / layout algorithm / search keys / internal-memory algorithm / cache-oblivious data-structure tools / CO algorithms / search tree / prefix-search operation / search space / /

OperatingSystem

Linux / L3 / SUSE Linux / /

Organization

Rutgers / National Science Foundation / MIT / Singapore-MIT Alliance / Technion / /

Person

O. Rabin / Clark IV / Michael A. Bender Martin / /

Position

General / too far forward / /

ProvinceOrState

New York / Florida / California / Arizona / Massachusetts / /

PublishedMedium

Theory of Computing / /

Technology

RAM / Two simplified algorithms / Linux / Cache-oblivious algorithms / J. Algorithms / ESA / layout algorithm / randomized pattern-matching algorithms / operating system / disk cache / Two algorithms / http / internal-memory algorithm / randomized dictionary matching algorithms / CO algorithms / SCSI / /

URL

http /

SocialTag