Supporting Complex Multi-dimensional Queries in P2P Systems Bin Liu, Wang-Chien Lee Hong Kong University of Science and Technology ICDCS ‘05 Dik Lun Lee.

Slides:

Advertisements

Similar presentations

SkipNet: A Scalable Overlay Network with Practical Locality Properties Nick Harvey, Mike Jones, Stefan Saroiu, Marvin Theimer, Alec Wolman Microsoft Research.

Advertisements

P2PR-tree: An R-tree-based Spatial Index for P2P Environments ANIRBAN MONDAL YI LIFU MASARU KITSUREGAWA University of Tokyo.

Efficient Event-based Resource Discovery Wei Yan*, Songlin Hu*, Vinod Muthusamy +, Hans-Arno Jacobsen +, Li Zha* * Chinese Academy of Sciences, Beijing.

Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT and Berkeley presented by Daniel Figueiredo Chord: A Scalable Peer-to-peer.

Peer to Peer and Distributed Hash Tables

Data Currency in Replicated DHTs Reza Akbarinia, Esther Pacitti and Patrick Valduriez University of Nantes, France, INIRA ACM SIGMOD 2007 Presenter Jerry.

Scalable Content-Addressable Network Lintao Liu

Peer-to-Peer Systems Chapter 25. What is Peer-to-Peer (P2P)? Napster? Gnutella? Most people think of P2P as music sharing.

Topologically-Aware Overlay Construction and Server Selection Sylvia Ratnasamy, Mark Handly, Richard Karp and Scott Shenker Presented by Shreeram Sahasrabudhe.

CHORD – peer to peer lookup protocol Shankar Karthik Vaithianathan & Aravind Sivaraman University of Central Florida.

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.

Distributed hash tables Protocols and applications Jinyang Li.

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

CSc 461/561 CSc 461/561 Peer-to-Peer Streaming. CSc 461/561 Summary (1) Service Models (2) P2P challenges (3) Service Discovery (4) P2P Streaming (5)

Efficient, Proximity-Aware Load Balancing for DHT-Based P2P Systems Yingwu Zhu, Yiming Hu Appeared on IEEE Trans. on Parallel and Distributed Systems,

1 Introduction to Load Balancing: l Definition of Distributed systems. Collection of independent loosely coupled computing resources. l Load Balancing.

XtreemOS IP project is funded by the European Commission under contract IST-FP XtreemOS WP3.2 - T3.2.3 Scalable Directory Service Design State.

Object Naming & Content based Object Search 2/3/2003.

Chord-over-Chord Overlay Sudhindra Rao Ph.D Qualifier Exam Department of ECECS.

Topics in Reliable Distributed Systems Fall Dr. Idit Keidar.

1 CS 194: Distributed Systems Distributed Hash Tables Scott Shenker and Ion Stoica Computer Science Division Department of Electrical Engineering and Computer.

Tapestry: Finding Nearby Objects in Peer-to-Peer Networks Joint with: Ling Huang Anthony Joseph Robert Krauthgamer John Kubiatowicz Satish Rao Sean Rhea.

Peer-to-Peer Networks Slides largely adopted from Ion Stoica’s lecture at UCB.

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

Focus on Distributed Hash Tables Distributed hash tables (DHT) provide resource locating and routing in peer-to-peer networks –But, more than object locating.

Introduction to Peer-to-Peer Networks. What is a P2P network Uses the vast resource of the machines at the edge of the Internet to build a network that.

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.

Symmetric Replication in Structured Peer-to-Peer Systems Ali Ghodsi, Luc Onana Alima, Seif Haridi.

Other Structured P2P Systems CAN, BATON Lecture 4 1.

PNear Combining Content Clustering and Distributed Hash-Tables Ronny Siebes Vrije Universiteit, Amsterdam The netherlands

Introduction to Peer-to-Peer Networks. What is a P2P network A P2P network is a large distributed system. It uses the vast resource of PCs distributed.

Document retrieval Similarity –Vector space model –Multi dimension Search –Range query –KNN query Query processing example.

Super-peer Network. Motivation: Search in P2P Centralised (Napster) Flooding (Gnutella)  Essentially a breadth-first search using TTLs Distributed Hash.

An IP Address Based Caching Scheme for Peer-to-Peer Networks Ronaldo Alves Ferreira Joint work with Ananth Grama and Suresh Jagannathan Department of Computer.

Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications.

SIGCOMM 2001 Lecture slides by Dr. Yingwu Zhu Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications.

National Institute of Advanced Industrial Science and Technology Query Processing for Distributed RDF Databases Using a Three-dimensional Hash Index Akiyoshi.

1 Peer-to-Peer Technologies Seminar by: Kunal Goswami (05IT6006) School of Information Technology Guided by: Prof. C.R.Mandal, School of Information Technology.

Paper Survey of DHT Distributed Hash Table. Usages Directory service  Very little amount of information, such as URI, metadata, … Storage  Data, such.

1 Towards Taxonomy-based Routing in P2P Networks Alexander L¨oser 指導老師 : 許子衝老師學生 : 羅英辰學號 :M97G0216.

1. Efficient Peer-to-Peer Lookup Based on a Distributed Trie 2. Complex Queries in DHT-based Peer-to-Peer Networks Lintao Liu 5/21/2002.

INTERNET TECHNOLOGIES Week 10 Peer to Peer Paradigm 1.

A Sybil-Proof Distributed Hash Table Chris Lesniewski-LaasM. Frans Kaashoek MIT 28 April 2010 NSDI

CS 347Notes081 CS 347: Parallel and Distributed Data Management Notes 08: P2P Systems.

P2P Search COP6731 Advanced Database Systems. P2P Computing  Powerful personal computer Share computing resources P2P Computing  Advantages: Shared.

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,

WIRELESS SENSOR NETWORK 1 ASIS KUMAR TRIPATHY Department of Information Technology

Peer-to-Peer File Sharing Systems Group Meeting Speaker: Dr. Xiaowen Chu April 2, 2004 Centre for E-transformation Research Department of Computer Science.

Peer-to-Peer Information Systems Week 12: Naming

Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M

Introduction to Load Balancing:

CS 268: Lecture 22 (Peer-to-Peer Networks)

Distributed Hash Tables

(slides by Nick Feamster)

PROGRAM STUDI TEKNIK INFORMATIKA FAKULTAS ILMU KOMPUTER

Pervasive Data Access (PDA) Research Group

Early Measurements of a Cluster-based Architecture for P2P Systems

EE 122: Peer-to-Peer (P2P) Networks

DHT Routing Geometries and Chord

A Scalable content-addressable network

Fast Nearest Neighbor Search on Road Networks

Building Peer-to-Peer Systems with Chord, a Distributed Lookup Service

CS 162: P2P Networks Computer Science Division

Peer-to-Peer Information Systems Week 6: Performance

Distributed Hash Tables

Deterministic and Semantically Organized Network Topology

P2P: Distributed Hash Tables

Peer-to-Peer Information Systems Week 12: Naming

Presentation transcript:

Supporting Complex Multi-dimensional Queries in P2P Systems Bin Liu, Wang-Chien Lee Hong Kong University of Science and Technology ICDCS ‘05 Dik Lun Lee Pennsylvania State University

One line comment The system supports multi-dimensional range and kNN queries in P2P network considering peer heterogeneity

Motivation Complex Queries for emerging P2P applications  E.g. P2P auction network for real estate - Find available buildings at most 10km from the airport (range) - Select three available buildings closest to the airport (kNN)

Problem Existing P2P systems cannot support such complex queries  Can, Chord, Pastry, Tapestry, etc – not for range queries  Mercury, Squid, etc – only for range queries

Solution Approach CAN w/o hashing NR-tree indexing Range Query, kNN Query DHT: routing P2P system Queries

Solution Approach S1 P1 P2

Indexing in a Cluster abcdefghijkE4E5E6E7E8 E1E2 y-axis x-axis P2 E1 E2 E5 E4 E6 E7 E8 a b c d e g h i j k f NR-tree (residing in S1) S1

Join (Leave/Failure) abcdefghijkE4E5E6E7E8 E1E2E3 y-axis x-axis P2 E1 E2 E5 E4 E6 E7 E8 a b c d e g h i j k f E3 NR-tree (residing in S1) S1 P3 S1 P2 P3 P4 S2

Query Processing – Range query abcdefghijkE4E5E6E7E8 E1E2E3 y-axis x-axis P2 E1 E2 E5 E4 E6 E7 E8 a b c d e g h i j k f E3 NR-tree (residing in S1) S1 P3 query q S1 S3 S2 S4 S5

Query Processing – kNN query abcdefghijkE4E5E6E7E8 E1E2E3 y-axis x-axis P2 E1 E2 E5 E4 E6 E7 E8 a b c d e g h i j k f E3 NR-tree (residing in S1) S1 P3 query q S1 S3 S2 S4 S5 E2E1E3

Analysis of the system Routing cost Dynamic load balancing is difficult Join 할 때 한 peer 가 관리하는 data 에 locality 가 있다는 가 정이 현실성 부족 Not efficient kNN query support Query result correctness 를 100% 보장 못함 Node heterogeneity 를 고려했지만 어떠한 보장도 못함

Experiment Parameters clusters 12 nodes

Experiment – cost vs. distribution per query per node join/leave

Experiment – cost vs. query size

Experiment – cost vs. cluster size

Experiment – TTL

Experiment - # of backup super-peers