Multi-dimensional Queries in P2P Systems. Applications Photo-sharing (photographs tagged with metadata) Multi-player online games (locate objects and.

Slides:

Advertisements

Similar presentations

Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.

Advertisements

Scalable Content-Addressable Network Lintao Liu

Multidimensional Indexing

SKIP GRAPHS Slides adapted from the original slides by James Aspnes Gauri Shah.

TOPOLOGIES FOR POWER EFFICIENT WIRELESS SENSOR NETWORKS ---KRISHNA JETTI.

Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Schenker Presented by Greg Nims.

Locality Aware Dynamic Load Management for Massively Multiplayer Games Written by Jin Chen 1, Baohua Wu 2, Margaret Delap 2, Bjorn Knutsson 2, Honghui.

Locality Aware Dynamic Load Management for Massively Multiplayer Games Jin Chen, Baohua Wu, Margaret Delap, Bjorn Knutson, Honghui Lu and Cristina Amza.

Common approach 1. Define space: assign random ID (160-bit) to each node and key 2. Define a metric topology in this space,  that is, the space of keys.

Spatial Indexing I Point Access Methods. PAMs Point Access Methods Multidimensional Hashing: Grid File Exponential growth of the directory Hierarchical.

1 One Torus to Rule Them All: Multi-dimensional Queries in P2P Systems Prasanna Ganesan Beverly Yang Hector Garcia-Molina Stanford University.

Data Warehousing: Data Marting and Metadata DATA WAREHOUSING IN THE REAL WORLDChapters 6 – 9 Sam Anahory Dennis Murray Presented by Lance Kelson10/25/00.

HyperCuP – P2P Network Boyko Syarov. 2 Outline  HyperCup: What is it?  Basic Concepts  Broadcasting Algorithm  Topology Construction  Ontology Based.

Mercury: Scalable Routing for Range Queries Ashwin R. Bharambe Carnegie Mellon University With Mukesh Agrawal, Srinivasan Seshan.

1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.

Chapter 3: Data Storage and Access Methods

1 A Scalable Content- Addressable Network S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker Proceedings of ACM SIGCOMM ’01 Sections: 3.5 & 3.7.

1 Online Balancing of Range-Partitioned Data with Applications to P2P Systems Prasanna Ganesan Mayank Bawa Hector Garcia-Molina Stanford University.

Peer To Peer Distributed Systems Pete Keleher. Why Distributed Systems? l Aggregate resources! –memory –disk –CPU cycles l Proximity to physical stuff.

Beacon Vector Routing: Scalable Point-to-Point Routing in Wireless Sensornets.

P2P Course, Structured systems 1 Introduction (26/10/05)

Spatial Indexing I Point Access Methods. Spatial Indexing Point Access Methods (PAMs) vs Spatial Access Methods (SAMs) PAM: index only point data Hierarchical.

ICDE A Peer-to-peer Framework for Caching Range Queries Ozgur D. Sahin Abhishek Gupta Divyakant Agrawal Amr El Abbadi Department of Computer Science.

Spatial Indexing I Point Access Methods. Spatial Indexing Point Access Methods (PAMs) vs Spatial Access Methods (SAMs) PAM: index only point data Hierarchical.

1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.

INTRODUCTION TO PEER TO PEER NETWORKS Z.M. Joseph CSE 6392 – DB Exploration Spring 2006 CSE, UT Arlington.

Roger ZimmermannCOMPSAC 2004, September 30 Spatial Data Query Support in Peer-to-Peer Systems Roger Zimmermann, Wei-Shinn Ku, and Haojun Wang Computer.

Other Structured P2P Systems CAN, BATON Lecture 4 1.

1 CS 4396 Computer Networks Lab Dynamic Routing Protocols - II OSPF.

Application-specific Topology-aware Mapping for Three Dimensional Topologies Abhinav Bhatelé Laxmikant V. Kalé.

A Delaunay Triangulation Architecture Supporting Churn and User Mobility in MMVEs Mohsen Ghaffari, Behnoosh Hariri and Shervin Shirmohammadi Advanced Communications.

GeoGrid: A scalable Location Service Network Authors: J.Zhang, G.Zhang, L.Liu Georgia Institute of Technology presented by Olga Weiss Com S 587x, Fall.

A website or program that collects related items of content and displays them or links to them. Website- Aggregator.

SEMILARITY JOIN COP6731 Advanced Database Systems.

PIMA-motivation PIMA: Partition Improvement using Mesh Adjacencies  Parallel simulation requires that the mesh be distributed with equal work-load and.

Multidimensional Indexes Applications: geographical databases, data cubes. Types of queries: –partial match (give only a subset of the dimensions) –range.

Locality Aware Dynamic Load Management for Massively Multiplayer Games Jin Chen, Baohua Wu, Margaret Delap, Bjorn Knutsson, Margaret Delap, Bjorn Knutsson,

Fast Searching in Peer-to-Peer Networks Self-Organizing Parallel Search Clusters Rocky Dunlap.

DIST: A Distributed Spatio-temporal Index Structure for Sensor Networks Anand Meka and Ambuj Singh UCSB, 2005.

Zone Sharing: A Hot-Spots Decomposition Scheme for Data-Centric Storage in Sensor Networks Mohamed Aly, Nicholas Morsillo, Panos K. Chrysanthis, and Kirk.

Content Addressable Networks CAN is a distributed infrastructure, that provides hash table-like functionality on Internet-like scales. Keys hashed into.

MobiQuitous 2007 Towards Scalable and Robust Service Discovery in Ubiquitous Computing Environments via Multi-hop Clustering Wei Gao.

P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,

Efficient AOI-Cast for Peer-to-Peer Networked Virtual Environments.

Iso-Contour Queries and Gradient Descent with Guaranteed Delivery in Sensor Networks Rik Sarkar, Xianjin Zhu, Jie Gao, Joseph S. B. Micchell, Leonidas.

Data Structures and Algorithms in Parallel Computing Lecture 7.

BATON A Balanced Tree Structure for Peer-to-Peer Networks H. V. Jagadish, Beng Chin Ooi, Quang Hieu Vu.

A Framework for Reliable Routing in Mobile Ad Hoc Networks Zhenqiang Ye Srikanth V. Krishnamurthy Satish K. Tripathi.

Two Peer-to-Peer Networking Approaches Ken Calvert Net Seminar, 23 October 2001 Note: Many slides “borrowed” from S. Ratnasamy’s Qualifying Exam talk.

P2P Search COP P2P Search Techniques Centralized P2P systems  e.g. Napster, Decentralized & unstructured P2P systems  e.g. Gnutella.

NCLAB 1 Supporting complex queries in a distributed manner without using DHT NodeWiz: Peer-to-Peer Resource Discovery for Grids Sujoy Basu, Sujata Banerjee,

Malugo – a scalable peer-to-peer storage system..

1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.

Dynamic Routing Protocols II OSPF

Distributed voting application for handheld devices

SKIP GRAPHS James Aspnes Gauri Shah SODA 2003.

Mapping the Data Warehouse to a Multiprocessor Architecture

Dynamic Routing Protocols II OSPF

SKIP LIST & SKIP GRAPH James Aspnes Gauri Shah

Reporting (1-D) Given a set of points S on the line, preprocess them to build structure that allows efficient queries of the from: Given an interval I=[x1,x2]

Coverage and Connectivity in Sensor Networks

Multidimensional Indexes

Distributed Probabilistic Range-Aggregate Query on Uncertain Data

Reading Report 11 Yin Chen 1 Apr 2004

Multidimensional Search Structures

SKIP GRAPHS (continued)

Online Pogo Game Customer Service

Pogo Game Customer Care Helpline Number

Call Pogo Contact Phone Number and Enjoy Pogo Game

Presentation transcript:

Multi-dimensional Queries in P2P Systems

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

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

SCRAP: SPACE-FILLING CURVES WITH RANGE PARTITIONING

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

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)

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

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

Questions?