Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
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
iDistance: An adaptive B+-tree based indexing method for nearest neighbor search
ACM Transactions on Database Systems (TODS)
Multi-agent Interaction Based Collaborative P2P System for Fighting Spam
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
DHTnil: An Approach to Publish and Lookup Nilsimsa Digests in DHT
HPCC '08 Proceedings of the 2008 10th IEEE International Conference on High Performance Computing and Communications
Identifying almost identical files using context triggered piecewise hashing
Digital Investigation: The International Journal of Digital Forensics & Incident Response
| Hi-index | 0.00 |
In digest-based distributed anti-spam technology, the research concentrates on how to publish and lookup digests efficiently. Based on the deep study of CTPH and DHT, we propose an approach to publish and lookup CTPH digests in Chord: iCTPH, in which the high-dimensional CTPH digests are mapped into one-dimensional Chord identifiers by iDistance method. Simulation experiments demonstrate that iCTPH has good publishing and looking up performance. For random generated digests, iCTPH can publish 500 similar digests to less than 5.6% nodes and recall 85% of the similar digests by querying no more than 4% nodes.