1 / 9

Approximate range selection queries in P2P systems

This paper presents an innovative approach to approximate range selection queries in peer-to-peer (P2P) systems, built on Chord and utilizing Locality Sensitive Hashing (LSH). By hashing similar data to comparable identifiers, the method improves data representation as relational objects. The architecture ensures effective query routing within the Chord ring and significantly enhances data location efficiency across peers. The proposed hashing mechanism and process architecture aim to facilitate relational data sharing in P2P environments, paving the way for future advances in querying on multiple attributes.

mandar
Download Presentation

Approximate range selection queries in P2P systems

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Approximate range selection queries in P2P systems Abhishek Gupta, Divyakant Agrawal, Amer El Abbadi CIDR 03

  2. The main Idea • Using “Locality Sensitive Hashing” to hash data, for similar data will hash to similar identifier. • Built upon Chord • Represent data in the form of relational objects.

  3. The query

  4. The query

  5. Locality sensitive hashing • Similar ranges are hashed to the same peer with high probability • A family of hash functions H is said to be locality preserving if for all h belongs to H we have: • Where

  6. Min-wise independent permutation • A domain D, a random permutation π of D, a range set Q in D. the hash function is And satisfy this property

  7. A single process

  8. System architecture • Peer IP → [SHA-1] → NodeID • Data → [LSH] → DataID • Are both 32-bit identifier • Data was assigned to node if nodeID is min{ N | N is the set of node with NodeID >= DataID } • Query Routing • On the Ring of Chord

  9. Conclusion • An architecutre for a relational data sharing P2P • A hashing based mechanism to locate data • Future work • Query on multiple attribute

More Related