loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 Ninth IEEE International Conference on Computer and Information Technology
Yarqs: Yet Another Range Queries Schema in DHT Based P2P Network
Xiamen, China
October 11-October 14
ISBN: 978-0-7695-3836-5
ASCII Text
x 
 
Hao Zhang, Hai Jin, Qin Zhang, "Yarqs: Yet Another Range Queries Schema in DHT Based P2P Network," Computer and Information Technology, International Conference on, vol. 1, pp. 51-56, 2009 Ninth IEEE International Conference on Computer and Information Technology, 2009.
 
 
BibTex
x
 
@article{ 10.1109/CIT.2009.78,
author = {Hao Zhang and Hai Jin and Qin Zhang},
title = {Yarqs: Yet Another Range Queries Schema in DHT Based P2P Network},
journal ={Computer and Information Technology, International Conference on},
volume = {1},
year = {2009},
isbn = {978-0-7695-3836-5},
pages = {51-56},
doi = {http://doi.ieeecomputersociety.org/10.1109/CIT.2009.78},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer and Information Technology, International Conference on
TI - Yarqs: Yet Another Range Queries Schema in DHT Based P2P Network
SN - 978-0-7695-3836-5
SP51
EP56
A1 - Hao Zhang,
A1 - Hai Jin,
A1 - Qin Zhang,
PY - 2009
KW - range queries; distributed hash table; peer to peer
VL - 1
JA - Computer and Information Technology, International Conference on
ER -
 
Range query in DHT based P2P network is a hot topic in recent researches. The hashing function in DHT protocols makes the data hard to keep their original order relationship. Hence range queries for such networks become difficult. This paper presents the design of Yarqs—a new schema to achieve range queries in DHT based P2P networks. By using the inherent characteristics of DHT based networks, Yarqs catches the data pass the nodes and organizes them as a cache network. The range queries are deployed over the cache network. Yarqs does not change the design of the DHT overlay and builds the architecture for range queries by using the historical DHT queries data. Yarqs supports inherent load balancing. We also study the performance of Yarqs in evaluation section. The experiments to check the influences of different parameters of Yarqs are deployed and analyzed.
Index Terms:
range queries; distributed hash table; peer to peer
Citation:
Hao Zhang, Hai Jin, Qin Zhang, "Yarqs: Yet Another Range Queries Schema in DHT Based P2P Network," cit, vol. 1, pp.51-56, 2009 Ninth IEEE International Conference on Computer and Information Technology, 2009
Usage of this product signifies your acceptance of the Terms of Use.