Sciweavers

14 search results - page 2 / 3
» P-ring: an efficient and robust P2P range index structure
Sort
View
GIR
2006
ACM
13 years 11 months ago
Range-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
Alessandro Soro, Cristian Lai
TKDE
2010
218views more  TKDE 2010»
12 years 11 months ago
LIGHT: A Query-Efficient Yet Low-Maintenance Indexing Scheme over DHTs
DHT is a widely used building block for scalable P2P systems. However, as uniform hashing employed in DHTs destroys data locality, it is not a trivial task to support complex queri...
Yuzhe Tang, Shuigeng Zhou, Jianliang Xu
COMCOM
2008
83views more  COMCOM 2008»
13 years 5 months ago
Hierarchical multidimensional search in peer-to-peer networks
We propose a P2P search solution, called EZSearch, that enables efficient multidimensional search for remotely located contents that best match the search criteria. EZSearch is a h...
Duc A. Tran, T. Nguyen
COMPSAC
2004
IEEE
13 years 8 months ago
Spatial Data Query Support in Peer-to-Peer Systems
Recently distributed hash table (DHT) mechanisms have been proposed to manage data in very large, structured peer-to-peer (P2P) systems. DHT algorithms provide efficient exact-mat...
Roger Zimmermann, Wei-Shinn Ku, Haojun Wang
ITCC
2005
IEEE
13 years 10 months ago
NIPPERS: Network of InterPolated PeERS for Web Service Discovery
Web services are becoming an important enabler of the Semantic Web. Besides the need for a rich description mechanism, Web Service information should be made available in an acces...
Christos Makris, Evangelos Sakkopoulos, Spyros Sio...