Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo!

Slides:

Advertisements

Similar presentations

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

Advertisements

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

MPAC 2004Rae Harbird 1 RUBI Adaptive Resource Discovery for Ubiquitous Computing Rae Harbird Stephen Hailes

Farnoush Banaei-Kashani and Cyrus Shahabi Criticality-based Analysis and Design of Unstructured P2P Networks as “ Complex Systems ” Mohammad Al-Rifai.

Expediting Searching Processes via Long Paths in P2P Systems 05/30 IDEA Lab.

PeerDB: A P2P-based System for Distributed Data Sharing Wee Siong Ng, Beng Chin Ooi, Kian-Lee Tan, Aoying Zhou Shawn Jeffery CS294-4 Peer-to-Peer Systems.

Peer-to-Peer Networks as a Distribution and Publishing Model Jorn De Boever (june 14, 2007)

--Presented By Sudheer Chelluboina. Professor: Dr.Maggie Dunham.

P2p, Spring 05 1 Topics in Database Systems: Data Management in Peer-to-Peer Systems March 29, 2005.

Sharing Aggregate Computation for Distributed Queries Ryan Huebsch, UC Berkeley Minos Garofalakis, Yahoo! Research † Joe Hellerstein, UC Berkeley Ion Stoica,

1 Learning to Detect Objects in Images via a Sparse, Part-Based Representation S. Agarwal, A. Awan and D. Roth IEEE Transactions on Pattern Analysis and.

An efficient and effective region-based image retrieval framework Reporter: Francis 2005/5/12.

Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang IEEE Transactions on Multimedia, Vol. 6, No. 2, April.

1 Replication Strategies in Unstructured Peer-to-Peer Networks Edith Cohen, Scott Shenker ACM SIGCOMM Computer Communication Review, Proceedings of the.

1998/5/21by Chang I-Ning1 ImageRover: A Content-Based Image Browser for the World Wide Web Introduction Approach Image Collection Subsystem Image Query.

Exploiting Content Localities for Efficient Search in P2P Systems Lei Guo 1 Song Jiang 2 Li Xiao 3 and Xiaodong Zhang 1 1 College of William and Mary,

A New Point Access Method based on Wavelet Trees Nieves R. Brisaboa, Miguel R. Luaces, Diego Seco Database Laboratory University of A Coruña A Coruña,

LSDS-IR’08, October 30, Peer-to-Peer Similarity Search over Widely Distributed Document Collections Christos Doulkeridis 1, Kjetil Nørvåg 2, Michalis.

Aggregating Information in Peer-to-Peer Systems for Improved Join and Leave Distributed Computing Group Keno Albrecht Ruedi Arnold Michael Gähwiler Roger.

Count / Top-k Continuous Queries on P2P Networks 01/11/2006.

Vassilios V. Dimakopoulos and Evaggelia Pitoura Distributed Data Management Lab Dept. of Computer Science, Univ. of Ioannina, Greece

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

Optimizing Lifetime for Continuous Data Aggregation With Precision Guarantees in Wireless Sensor Networks Xueyan Tang and Jianliang Xu IEEE/ACM TRANSACTIONS.

Searching in Unstructured Networks Joining Theory with P-P2P.

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

On-Demand Media Streaming Over the Internet Mohamed M. Hefeeda, Bharat K. Bhargava Presented by Sam Distributed Computing Systems, FTDCS Proceedings.

1 Indexing Large Trajectory Data Sets With SETI V.Prasad Chakka Adam C.Everspaugh Jignesh M.Patel University of Michigan Presented by Guangyue Jia.

Sensor Networks Storage Sanket Totala Sudarshan Jagannathan.

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

IR Techniques For P2P Networks1 Information Retrieval Techniques For Peer-To-Peer Networks Demetrios Zeinalipour-Yazti, Vana Kalogeraki and Dimitrios Gunopulos.

Sensor Positioning in Wireless Ad-hoc Sensor Networks Using Multidimensional Scaling Xiang Ji and Hongyuan Zha Dept. of Computer Science and Engineering,

1 SD-Rtree: A Scalable Distributed Rtree Witold Litwin & Cédric du Mouza & Philippe Rigaux.

Peer to Peer Research survey TingYang Chang. Intro. Of P2P Computers of the system was known as peers which sharing data files with each other. Build.

Using the Small-World Model to Improve Freenet Performance Hui Zhang Ashish Goel Ramesh Govindan USC.

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

CCAN: Cache-based CAN Using the Small World Model Shanghai Jiaotong University Internet Computing R&D Center.

HPCLatAm 2013 HPCLatAm 2013 Permutation Index and GPU to Solve efficiently Many Queries AUTORES  Mariela Lopresti  Natalia Miranda  Fabiana Piccoli.

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

Quantitative Evaluation of Unstructured Peer-to-Peer Architectures Fabrício Benevenuto José Ismael Jr. Jussara M. Almeida Department of Computer Science.

1 A Distributed Architecture for Multimedia in Dynamic Wireless Networks By UCLA C.R. Lin and M. Gerla IEEE GLOBECOM'95.

The Application of The Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem International Conference on Future Computer and Communication,

A Peer-to-Peer Approach to Resource Discovery in Grid Environments (in HPDC’02, by U of Chicago) Gisik Kwon Nov. 18, 2002.

An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle Presented by Yu Wang.

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

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.

The Sweet Spot between Inverted Indices and Metric-Space Indexing for Top-K–List Similarity Search Evica Milchevski , Avishek Anand ★ and Sebastian Michel.

Efficient Semantic Based Content Search in P2P Network Heng Tao Shen, Yan Feng Shu, and Bei Yu.

Peer to Peer A Survey and comparison of peer-to-peer overlay network schemes And so on… Chulhyun Park

Efficient P2P Search by Exploiting Localities in Peer Community and Individual Peers A DISC’04 paper Lei Guo 1 Song Jiang 2 Li Xiao 3 and Xiaodong Zhang.

Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.

1 University of California, Irvine Done By : Ala Khalifeh (Note : Not Presented)

Building a Distributed Full-Text Index for the Web by Sergey Melnik, Sriram Raghavan, Beverly Yang and Hector Garcia-Molina from Stanford University Presented.

Universitatea Politehnica Bucureşti - Facultatea de Automatică şi Calculatoare TOWARDS A SECURE DATA SHARING PEER-TO-PEER NETWORK BASED ON GEOMETRIC AND.

Coverage and Energy Tradeoff in Density Control on Sensor Networks Yi Shang and Hongchi Shi University of Missouri-Columbia ICPADS’05.

Evaluation GUESS and Non-Forwarding Peer-to-Peer search ICDCS paper Beverly Yang Patrick Vinograd Hector Garcia-Molina Computer Science Department, Stanford.

Algorithms and Techniques in Structured Scalable Peer-to-Peer Networks

Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design Authors: Matei Ripeanu Ian Foster Adriana.

INTERNET TECHNOLOGIES Week 10 Peer to Peer Paradigm 1.

1 DCMP: A Distributed Cycle Minimization Protocol for Peer- to-Peer Networks Authors: Zhenzhou Zhu, Panos Kalnis and Spiridon Bakiras Source: IEEE Transactions.

Presenters: Amool Gupta Amit Sharma. MOTIVATION Basic problem that it addresses?(Why) Other techniques to solve same problem and how this one is step.

On Improving the Performance Dependability of Unstructured P2P Systems via Replication ANIRBAN MONDAL YI LIFU MASARU KITSUREGAWA Institute of Industrial.

Universitatea Politehnica Bucureşti - Facultatea de Automatică şi Calculatoare Towards a Peer-to-Peer Recommender System Based on Collaborative Filtering.

Relevant Document Distribution Estimation Method for Resource Selection Luo Si and Jamie Callan School of Computer Science Carnegie Mellon University

Incrementally Improving Lookup Latency in Distributed Hash Table Systems Hui Zhang 1, Ashish Goel 2, Ramesh Govindan 1 1 University of Southern California.

Distributed Caching and Adaptive Search in Multilayer P2P Networks Chen Wang, Li Xiao, Yunhao Liu, Pei Zheng The 24th International Conference on Distributed.

Composing Web Services and P2P Infrastructure. PRESENTATION FLOW Related Works Paper Idea Our Project Infrastructure.

Presented by Edith Ngai MPhil Term 3 Presentation

Paraskevi Raftopoulou, Euripides G.M. Petrakis

Course Outline Introduction in algorithms and applications

A Semantic Peer-to-Peer Overlay for Web Services Discovery

Presentation transcript:

Dynamic P2P Indexing and Search based on Compact Clustering Mauricio Marin Veronica Gil-Costa Cecilia Hernandez UNSL, Argentina Universidad de Chile Yahoo! Research Latin America

Outline Introduction Data Structure Index P2P Networks SimPeer P2P Bottom-up Experiments Conclusions and Future Work

Introduction Similarity search over a collection of metric-space database objects distributed on a large and dynamic set of small computers forming a Peer-to-Peer (P2P) network has been widely studied in recent years. Currently there are efficient solutions for structured networks like those based on the general purpose CAN and Chord protocols.

Introduction Super-peer systems are believed to represent a good tradeoff between centralized and distributed architectures. They are also considered a reasonable tradeoff between unstructured and structured P2P networks. In this case the network is seen as a collection of stable peers called super-peers to which normal peers can connect and initiate queries.

Previous Work KM (SimPeers) is the state of the arte strategy for peers and super-peers. Its main drawback is that it employs local indexing in a bottom-up fashion. This work (LC) employs global indexing in a top-down fashion.

List of Cluster (LC) I3I3 (c 3, r 3, I 3 ) I2I2 (c 2, r 2, I 2 ) E2E2 I1I1 (c 1, r 1, I 1 ) E1E1 c1c1 r1r1 c2c2 c3c3 r2r2 r3r3 Clusters of fixed size

List of Cluster (LC) c r q r d(c,q) c r q r c r q r

LC-SSS (c 1, r 1, I 1 ) Sparse Spatial Selection Algorithm

P2P Hierarchical system of peers and super-peers Super-peer peers

Bottom-up NpNp NpNp NpNp 1 … M (c i,r i ) M*Np 1… M LC-SSS semi-global centers 1… M

Bottom-up NpNp NpNp NpNp 1 … M LC-SSS semi-global centers … (i,c sp,sp,r’ m,r’ x )* (i,c sp,sp,r’ m,r’ x )* (i,p,r m,r x ) … (i,p,r m,r x )

Searching NpNp … (i,c sp,sp,r’ m,r’ x )* (i,c sp,sp,r’ m,r’ x )* (i,p,r m,r x ) … (i,p,r m,r x ) q r tp ts r x r m q d(q,c)-r ≤ r x q d(q,c)+r  r m

Updates requerimiento Sends M semi-global centers (c i,r i ) Overflow area New centersIntersectiondegree M

c2c2 Updates: Intersection Degree c1c1 r1r1 c2c2 r2r2 If (d(c 1, c 2 ) ≤ r 1 + r 2 ) S 1,2 = 1 Else S 1,2 = 0 c1c1 c2c2 S 1,2 = 1+r 2 /r 1 c1c1 S 1,2 = (r 1 /r 2 ) ·S 1,2 S 1,2 = (|r 1 − r 2 |/d(c 1, c 2 ) ) · S 1,2 c1c1 c2c2 All centers k for which S k,1 is 0 are considered candidates to become new global centers (c k, r k )

Experimental Results Metric Spaces Library SISAP ( Uniform Gauss NASA super-peers and peers M = 10 centers

Constant Number of Peers Total number of distance evaluations and messages for global and local indexing by using the LC strategy.

PERCENTAGE OF EFFECTIVENESS: Percentage of objects that are compared with the query and become part of the query answer.

Increasing the Number of Peers As new peers join to the network the algorithms require more distance evaluations to processes queries, Further experiments in the paper

Conclusions The paper has shown that by approximating global but resumed information about the indexed data in each peer, the average amount of computation and communication performed to solve range queries can be significantly reduced.

Future Work Currently we are studying different cache techniques to optimize similar searches and reduce queries response time.

Contact Information Mauricio Marin Veronica Gil-Costa Cecilia Hernandez