Back to Results
First PageMeta Content
Skip graph / Distributed hash table / Skip list / Connectivity / Linked list / Node / Chord / Bin / Koorde / Distributed data storage / Computing / Computer programming


CCCG 2011, Toronto ON, August 10–12, 2011 Orthogonal Range Search using a Distributed Computing Model Pouya Bisadi∗ Abstract
Add to Reading List

Document Date: 2011-08-06 04:11:12

Open Document

File Size: 2,18 MB

Share Result on Facebook

City

Philadelphia / New York / /

Company

CRC Press Inc. / Goodrich / /

Country

United States / Canada / /

/

Facility

University of New Brunswick / /

IndustryTerm

physical network / internet applications / orthogonal range search / within-node search / rectangular range-search / database systems / content-addressable network / range search / orthogonal range search structure / Range search complexity / point search costs / rainbow skip graph search algorithm / optimum solutions / distributed orthogonal range search data structure / worst case search complexity / Internet Technologies / point search / parallel algorithm / range search cost / point search cost / distributed computing model / overlay network / search algorithm / search time / distributed orthogonal range search / normal routing algorithm / supporting range search / /

Organization

Faculty of Computer Science / Society for Industrial and Applied Mathematics / Natural Sciences and Engineering Research Council / V / USENIX Association / UNB Faculty of Computer Science / University of New Brunswick / /

Person

L. Arge / V / Bradford G. Nickerson / /

Position

level representative / representative / /

ProvinceOrState

New Brunswick / New York / /

PublishedMedium

Communications of the ACM / /

Technology

RAM / normal routing algorithm / 3-d / search algorithm / peer-to-peer / p2p / Random Access / Simulation / shared memory / rainbow skip graph search algorithm / /

URL

http /

SocialTag