Back to Results
First PageMeta Content
B-tree / K-d tree / Bin / R-tree / Binary trees / R+ tree / Tango tree / Data management / Computing / Graph theory


CCCG 2006, Kingston, Ontario, August 14–16, 2006 The P KD-tree for Orthogonal d-dimensional Range Search Bradford G. Nickerson Abstract
Add to Reading List

Document Date: 2008-10-27 22:59:11

Open Document

File Size: 363,53 KB

Share Result on Facebook

City

Fredericton / Kalnis / Kingston / Seattle / Dallas / /

Company

Sun Microsystems / Database Systems / /

Country

United States / Canada / /

/

Facility

square W / University of New Brunswick / College Park / University of Maryland / University of California / /

IndustryTerm

orthogonal range search / query processing / orthogonal range search algorithm / range search / range search performance / orthogonal range search query / range search time / range search problem / /

OperatingSystem

Solaris / /

Organization

University of Maryland / College Park / University of California / Irvine / University of New Brunswick / /

ProvinceOrState

South Dakota / Texas / New Brunswick / Maryland / British Columbia / California / Washington / Ontario / /

Technology

orthogonal range search algorithm / Intersection algorithm / Interval algorithm / /

URL

http /

SocialTag