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


I/O-efficient Point Location using Persistent B-Trees Lars Arge, Andrew Danner, and Sha-Mayn Teh Department of Computer Science, Duke University We present an external planar point location data structure that is I/O-eff
Add to Reading List

Document Date: 2004-01-23 10:39:23

Open Document

File Size: 370,88 KB

Share Result on Facebook

City

Durham / New York / /

Company

Geographic Information Systems / Goodrich / ACM Inc. / /

Country

United States / /

/

Facility

store N / /

/

IndustryTerm

search tree / persistent search tree idea / persistent search tree / range search / balanced search tree / sort algorithm / /

Organization

Duke University / Sha-Mayn Teh Department of Computer Science / National Science Foundation / Department of Computer Science / /

Person

Andrew Danner / RAY-SHOOTING USING PERSISTENT / /

Position

Author / /

ProgrammingLanguage

C++ / /

ProvinceOrState

New York / /

Technology

RAM / sort algorithm / /

SocialTag