A survey of P2P multidimensional indexing structures
Ewout Bongers, Johan Pouwelse

TL;DR
This survey reviews various P2P multidimensional indexing structures, analyzing their designs, implementations, and vulnerabilities, highlighting the need for addressing security issues before practical deployment.
Contribution
It provides a comprehensive analysis of existing P2P multidimensional index proposals, identifying promising designs and critical security flaws.
Findings
Znet and VBI-tree are the most promising designs
All proposals assume honest nodes, exposing security vulnerabilities
No existing designs have been implemented in real-world systems
Abstract
Traditional databases have long since reaped the benefits of multidimensional indexes. Numerous proposals in the literature describe multidimensional index designs for P2P systems. However, none of these designs have had real world implementations. Several proposals for P2P multidimensional indexes are reviewed and analyzed. Znet and VBI-tree are the most promising from a technical standpoint. All of the proposed designs assume honest nodes and are thus open to abuse. This is a critical flaw that must be solved before any of the proposed systems can be used.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPeer-to-Peer Network Technologies · Data Management and Algorithms · Data Mining Algorithms and Applications
