Back to Results
First PageMeta Content
B-tree / Data structures / Computing / R-tree / Rope / Persistent data structure / Trie / Segment tree / B+ tree / Binary trees / Graph theory / Data management


I/O-efficient Point Location using Persistent B-Trees Lars Arge∗ Andrew Danner† Sha-Mayn Teh
Add to Reading List

Document Date: 2003-01-06 11:49:03


Open Document

File Size: 290,63 KB

Share Result on Facebook

Company

Geographic Information Systems / Bayer / Geographical Information Systems / Goodrich / Intel / /

Country

United States / /

/

Facility

Duke University / store N / /

IndustryTerm

persistent search tree idea / range search / balanced search tree / construction algorithm / search tree / grid algorithm / persistent search tree / grid construction algorithm / software distribution / tree construction algorithm / sort algorithm / /

OperatingSystem

FreeBSD / /

Organization

Duke University / National Science Foundation / Department of Computer Science Duke University Abstract We / /

Person

Jan Vahrenhold / /

/

Position

disk controller / /

ProgrammingLanguage

C++ / /

ProvinceOrState

Minnesota / Maine / Manitoba / Florida / Washington / /

PublishedMedium

Communications of the ACM / /

Technology

RAM / sort algorithm / Externalmemory algorithms / grid construction algorithm / persistent B-tree algorithm / grid algorithm / tree construction algorithm / caching / construction algorithm / SCSI / /

URL

http /

SocialTag