The design and implementation of an intentional naming system
Proceedings of the seventeenth ACM symposium on Operating systems principles
Design and evaluation of a wide-area event notification service
ACM Transactions on Computer Systems (TOCS)
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Brief announcement: prefix hash tree
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
An Adaptive Protocol for Efficient Support of Range Queries in DHT-Based Systems
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
A case study in building layered DHT applications
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Mining Sequential Association-Rule for Improving WEB Document Prediction
ICCIMA '05 Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications
Using a distributed quadtree index in peer-to-peer networks
The VLDB Journal — The International Journal on Very Large Data Bases
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
LIGHT: A Query-Efficient Yet Low-Maintenance Indexing Scheme over DHTs
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
Distributed hash tables (DHT for short) schemes are the core techniques to locate and search resources in structured P2P system. But DHT only support exact-match search, cannot support complex search due to that its hash methods destroy data locality. A simple and flexible solution has been built to tackle the problem which is known as over-DHT paradigm without modifying existing DHT infrastructures. One of the well known over-DHT paradigms now is LIGHT which provides more efficient complex query methods than other paradigms and also reduces the paradigm maintenance cost. However, LIGHT takes more than one steps (a step means a DHT-lookup operation) to search single data record in P2P system, while traditional DHT schemes only take one step. In this paper, we propose a improved lookup algorithm, Nearest Upper Boundary Lookup (NUBL for short) to reduce the DHT-lookup times during single data record searching procedure in LIGHT. We also proved the effectiveness of NUBL by simulating experiments.