Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
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
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Peer-to-peer information retrieval using self-organizing semantic overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Multi-dimensional range queries in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
LSH forest: self-tuning indexes for similarity search
WWW '05 Proceedings of the 14th international conference on World Wide Web
Keyword Search in DHT-Based Peer-to-Peer Networks
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Implementing declarative overlays
Proceedings of the twentieth ACM symposium on Operating systems principles
Efficient Query Evaluation on Large Textual Collections in a Peer-to-Peer Environment
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Hybrid global-local indexing for effcient peer-to-peer information retrieval
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Debunking some myths about structured and unstructured overlays
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Efficient peer-to-peer keyword searching
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
The case for a hybrid p2p search infrastructure
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Making peer-to-peer keyword searching feasible using multi-level partitioning
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
| Hi-index | 0.00 |
We present a novel keyword search scheme for file sharing applications based on content distance addressing (CDA). Through CDA, we are able to associate node IDs with content distances and thus reduce several complex keyword queries to routing problems on structured overlays. Unlike traditional approaches, we require neither set intersection process nor replication for query processing as a result of content distance addressing. In this paper, we present the design and theoretical analysis of CDA for keyword search as well as simulation results using real world parameters.