Different structures are used in peer-to-peer networks to represent their inherently distributed, self-organized, and decentralized memory structure. In this paper, a simple range-queriable distributed data structure, called RAQ, is proposed to efficiently support exact match and range queries over multi-dimensional data. In RAQ, the key space is partitioned among the network with n nodes, in which each element has links to O n(log ) other elements. We will show that the look-up query for a specified key can be done via O n(log )message passing. Also, RAQ handles range-queries in at most O n(log ) communication steps.
Nazerzadeh,H. and Ghodsi,M. (2009). RAQ: A Range-Queriable Distributed Data Structure. (e216014). The CSI Journal on Computer Science and Engineering, 6(2), e216014
MLA
Nazerzadeh,H. , and Ghodsi,M. . "RAQ: A Range-Queriable Distributed Data Structure" .e216014 , The CSI Journal on Computer Science and Engineering, 6, 2, 2009, e216014.
HARVARD
Nazerzadeh H., Ghodsi M. (2009). 'RAQ: A Range-Queriable Distributed Data Structure', The CSI Journal on Computer Science and Engineering, 6(2), e216014.
CHICAGO
H. Nazerzadeh and M. Ghodsi, "RAQ: A Range-Queriable Distributed Data Structure," The CSI Journal on Computer Science and Engineering, 6 2 (2009): e216014,
VANCOUVER
Nazerzadeh H., Ghodsi M. RAQ: A Range-Queriable Distributed Data Structure. CSIonJCSE, 2009; 6(2): e216014.
The CSI Journal on Computer Science and Engineering