Back to Results
First PageMeta Content
R-tree / Trie / Radix tree / Bin / Suffix tree / Range searching / Search algorithms / Hashing / K-d tree / Data management / Computing / Computer programming


Approximate Orthogonal Range Search using Patricia Tries Bradford G. Nickerson ∗ range
Add to Reading List

Document Date: 2005-07-31 13:55:55


Open Document

File Size: 143,62 KB

Share Result on Facebook

City

Fredericton / Boca Raton / Reading / /

Company

CRC Press LLC / Sun Microsystems / /

Country

Canada / /

/

Facility

U store / University of New Brunswick / /

IndustryTerm

search space volume / range search stops / approximate range search query / orthogonal range search / approximate range counting algorithm / search proceeds / approximate orthogonal range search / insertion algorithm / range search / textual and spatial data approximate range search / database applications / Approximate orthogonal range search using patricia tries / partial match search / approximate orthogonal range search time / k-d range search / search space / orthogonal range search queries / approximate range search / geographical information systems / dynamic k-d range reporting algorithm / /

NaturalFeature

Arya mountain / S. mountain / S. Arya mountain / D. mountain / /

OperatingSystem

Solaris / /

Organization

Faculty of Computer Science / University of New Brunswick / /

Person

Bradford G. Nickerson / /

ProvinceOrState

New Brunswick / Florida / Massachusetts / /

PublishedMedium

Journal of the ACM / /

Technology

approximate range counting algorithm / dynamic k-d range reporting algorithm / ARC algorithm / insertion algorithm / /

SocialTag