1 / 9

Efficient Range Query Routing in P2P Networks Using Space-Filling Curves

This paper explores a novel approach to addressing multi-dimensional queries in P2P systems, with applications in photo-sharing and multiplayer online games. The system's components include a partitioning strategy that distributes data across nodes using space-filling curves with range partitioning. The routing strategy ensures efficient query transmission to relevant nodes by converting multi-dimensional queries into a series of 1-dimensional range queries. Key desiderata such as locality, load balance, minimal metadata, low state, and efficient query routing are achieved through innovative techniques like skip graphs. This paper provides insights into building scalable and optimized P2P systems for diverse applications.

mariepope
Download Presentation

Efficient Range Query Routing in P2P Networks Using Space-Filling Curves

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. Multi-dimensional Queries in P2P Systems

  2. Applications • Photo-sharing (photographs tagged with metadata) • Multi-player online games (locate objects and other users)

  3. System’s Components • Partitioning Strategy (distribute data across nodes) • Routing Strategy (transmit a query to the relevant nodes)

  4. SCRAP: SPACE-FILLING CURVES WITH RANGE PARTITIONING

  5. Partitioning Strategy • Data are mapped into a single dimension e.g. (0100,0101) -> 01000101 • Single-dimensional data are range-partitioned across a dynamic set of nodes

  6. Routing Strategy • Multi-dimensional range query is converted to a set of 1-d range queries • Route each of 1-d range queries (Skip graph: A Chord-like connection between the nodes, which promises O(logn) messages)

  7. Desiderata • Locality: Nearby data points in the multi-dimensional space are also adjacent in the single dimension • Load Balance: • Management of neighboring ranges • Node with empty partition splits the range of heavily loaded node

  8. Desiderata • Minimal metadata : Each node knows only partition boundaries of itself and its neighbors • Low state : O(logn) links per node • Routing load balance : Achieved due to the symmetric nature of skip graphs • Query routing : O(logn) hops for each 1-d

  9. Questions?

More Related