2005/11/09 Continuous Queries in P2P Networks. Motivation.

Slides:



Advertisements
Similar presentations
Costas Busch Louisiana State University CCW08. Becomes an issue when designing algorithms The output of the algorithms may affect the energy efficiency.
Advertisements

P2P-DIET: One-time and Continuous Queries in Super-Peer Networks By Stratos Idreos, Manolis Koubarakis and Christos Tryfonopoulos Intelligent Systems Laboratory.
Best-Effort Top-k Query Processing Under Budgetary Constraints
TI: An Efficient Indexing Mechanism for Real-Time Search on Tweets Chun Chen 1, Feng Li 2, Beng Chin Ooi 2, and Sai Wu 2 1 Zhejiang University, 2 National.
Towards Estimating the Number of Distinct Value Combinations for a Set of Attributes Xiaohui Yu 1, Calisto Zuzarte 2, Ken Sevcik 1 1 University of Toronto.
On Large-Scale Peer-to-Peer Streaming Systems with Network Coding Chen Feng, Baochun Li Dept. of Electrical and Computer Engineering University of Toronto.
Routing Indices For Peer-to-Peer Systems Arturo Crespo, Hector Garcia-Molina Stanford ICDCS 2002.
Expediting Searching Processes via Long Paths in P2P Systems 05/30 IDEA Lab.
Efficient Processing of Top-k Spatial Keyword Queries João B. Rocha-Junior, Orestis Gkorgkas, Simon Jonassen, and Kjetil Nørvåg 1 SSTD 2011.
1 Peer-To-Peer-Based Resource Discovery In Global Grids: A Tutorial Rajiv Ranjan, Aaron Harwood And Rajkumar Buyya, The University Of Melbbourne IEEE Communications.
Communication-Efficient Distributed Monitoring of Thresholded Counts Ram Keralapura, UC-Davis Graham Cormode, Bell Labs Jai Ramamirtham, Bell Labs.
Continuous Data Stream Processing MAKE Lab Date: 2006/03/07 Post-Excellence Project Subproject 6.
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.
Continuous Data Stream Processing MAKE Lab Date: 2006/03/07 Post-Excellence Project Subproject 6.
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.
Cloud based linked data platform for Structural Engineering Experiment Xiaohui Zhang
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.
Other Structured P2P Systems CAN, BATON Lecture 4 1.
Link Recommendation In P2P Social Networks Yusuf Aytaş, Hakan Ferhatosmanoğlu, Özgür Ulusoy Bilkent University, Ankara, Turkey.
Ontology Alignment/Matching Prafulla Palwe. Agenda ► Introduction  Being serious about the semantic web  Living with heterogeneity  Heterogeneity problem.
Page 1 Semantic Data Compression Techniques for NASA and Mobile Computing Databases Principal Investigators: G. Ozsoyoglu, Z.M. Ozsoyoglu Case Western.
Sensor Network Databases1 Overview: Chapter 6  Sensor Network Databases  Sensor networks are conceptually a distributed DB  Store collected data  Indexes.
Towards Robust Indexing for Ranked Queries Dong Xin, Chen Chen, Jiawei Han Department of Computer Science University of Illinois at Urbana-Champaign VLDB.
1 Security on Social Networks Or some clues about Access Control in Web Data Management with Privacy, Time and Provenance Serge Abiteboul, Alban Galland.
Benjamin AraiUniversity of California, Riverside Reliable Hierarchical Data Storage in Sensor Networks Song Lin – Benjamin.
Super-peer Network. Motivation: Search in P2P Centralised (Napster) Flooding (Gnutella)  Essentially a breadth-first search using TTLs Distributed Hash.
A Collaborative and Semantic Data Management Framework for Ubiquitous Computing Environment International Conference of Embedded and Ubiquitous Computing.
Fast Searching in Peer-to-Peer Networks Self-Organizing Parallel Search Clusters Rocky Dunlap.
Computer Science and Engineering Efficiently Monitoring Top-k Pairs over Sliding Windows Presented By: Zhitao Shen 1 Joint work with Muhammad Aamir Cheema.
The Haar + Tree: A Refined Synopsis Data Structure Panagiotis Karras HKU, September 7 th, 2006.
Kaleidoscope – Adding Colors to Kademlia Gil Einziger, Roy Friedman, Eyal Kibbar Computer Science, Technion 1.
1 Peer-to-Peer Technologies Seminar by: Kunal Goswami (05IT6006) School of Information Technology Guided by: Prof. C.R.Mandal, School of Information Technology.
Efficient Processing of Top-k Spatial Preference Queries
Peer to Peer A Survey and comparison of peer-to-peer overlay network schemes And so on… Chulhyun Park
Date : 2013/03/18 Author : Jeffrey Pound, Alexander K. Hudek, Ihab F. Ilyas, Grant Weddell Source : CIKM’12 Speaker : Er-Gang Liu Advisor : Prof. Jia-Ling.
Ranking objects based on relationships Computing Top-K over Aggregation Sigmod 2006 Kaushik Chakrabarti et al.
The Semantic Logger: Supporting Service Building from Personal Context Mischa M Tuffield et al. Intelligence, Agents, Multimedia Group University of Southampton.
Supporting Top-k join Queries in Relational Databases Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid Presented by: Z. Joseph, CSE-UT Arlington.
Answering Top-k Queries Using Views Gautam Das (Univ. of Texas), Dimitrios Gunopulos (Univ. of California Riverside), Nick Koudas (Univ. of Toronto), Dimitris.
Semantic Overlay Networks in P2P systems A. Crespo, H. Garcia-Molina Speaker: Pavel Serdyukov Tutor: Jens Graupmann.
1 WS-GIS: Towards a SOA-Based SDI Federation Fábio Luiz Leite Júnior Information System Laboratory University of Campina Grande
Resource Allocation in Network Virtualization Jie Wu Computer and Information Sciences Temple University.
BATON A Balanced Tree Structure for Peer-to-Peer Networks H. V. Jagadish, Beng Chin Ooi, Quang Hieu Vu.
Ranking of Database Query Results Nitesh Maan, Arujn Saraswat, Nishant Kapoor.
Optimal Aggregation Algorithms for Middleware By Ronald Fagin, Amnon Lotem, and Moni Naor.
Algorithms and Techniques in Structured Scalable Peer-to-Peer Networks
@ Carnegie Mellon Databases 1 Finding Frequent Items in Distributed Data Streams Amit Manjhi V. Shkapenyuk, K. Dhamdhere, C. Olston Carnegie Mellon University.
A Unified Approach to Ranking in Probabilistic Databases Jian Li, Barna Saha, Amol Deshpande University of Maryland, College Park, USA VLDB
P2P Content Search: Give the Web Back to the People Matthias Bender Sebastin Michel Peter Triantafillou Gerhard Weikum Christian Zimmer Mariam John CSE.
Toward Entity Retrieval over Structured and Text Data Mayssam Sayyadian, Azadeh Shakery, AnHai Doan, ChengXiang Zhai Department of Computer Science University.
Efficient Semantic Web Service Discovery in Centralized and P2P Environments Dimitrios Skoutas 1,2 Dimitris Sacharidis.
Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window MADALGO – Center for Massive Data Algorithmics, a Center of the Danish.
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications * CS587x Lecture Department of Computer Science Iowa State University *I. Stoica,
Composing Web Services and P2P Infrastructure. PRESENTATION FLOW Related Works Paper Idea Our Project Infrastructure.
Spatial Approximate String Search. Abstract This work deals with the approximate string search in large spatial databases. Specifically, we investigate.
NASA Space Communications Symposium
Cloud based linked data platform for Structural Engineering Experiment
Primack et al. “Content analysis of tobacco, alcohol and other drugs in popular music” (1008)
EE 122: Peer-to-Peer (P2P) Networks
DISTRIBUTED CLUSTERING OF UBIQUITOUS DATA STREAMS
Network-Wide Routing Oblivious Heavy Hitters
Heavy Hitters in Streams and Sliding Windows
By: Ran Ben Basat, Technion, Israel
Efficient Processing of Top-k Spatial Preference Queries
Course Instructor: Supriya Gupta Asstt. Prof
Presentation transcript:

2005/11/09 Continuous Queries in P2P Networks

Motivation

Motivation - Cardinality How many people are currently listening POP music? Rock Classic POP Result =2

Motivation – Top-K “Because of you” by Kelly Clarkson What is the Top-2 Songs? “Because of you” by Kelly Clarkson “Wake Me Up When September Ends” by Green Day “Wake Me Up When September Ends” by Green Day “Shake It Off” by Mariah Carey

Motivation – Top-K “Because of you” by Kelly Clarkson What is the Top-2 Songs? “Because of you” by Kelly Clarkson “Wake Me Up When September Ends” by Green Day “Wake Me Up When September Ends” by Green Day “Shake It Off” by Mariah Carey

Motivation – Social Network Rock Classic POP I want to make friends who have similar interests as I have

Motivation – Social Network Rock Classic POP I want to make friends who have similar interests as I have

Motivation – Social Network Rock Classic POP I want to make friends who have similar interests as I have

Motivation – Social Network Rock Classic POP I want to make friends who have similar interests as I have

Motivation - Ontology Search “Shake Your Bon Bon” by Ricky Martin

Motivation - Ontology Search “Shake Your Bon Bon” by Ricky Martin Sorry, I have none I have “Shake Your Bon Bon” Dude, get away from me I do have this song but its name is “Martin’s Ass”

Motivation - Ontology Search “Shake Your Bon Bon” by Ricky Martin The result of exact matching = 1 By we want to get the actual result 2 Ontolog y

Continuous Queries Cardinality Top-K Social network Ontology

Cardinality The state-of-the-art  Aggregation in P2P system Montresor et al. DSN'04  Epidemic, adaptive  Aggregation with streaming data Das et al. VLDB04  Global knowledge of frequent items

Cardinality (Cont’d.) As far as we know, there is no study focus on this issue in P2P environment with streaming data Progress after our summer presentation  Use statistics distribution to estimate changes

Top-K The state-of-the-art  Traditional Top-K problem Combine information for database systems [Fagin]  Approximation on data streams Proposed for data streams under guaranteed tolerance, but can’t be deployed to P2P.  Super peer based Top-k in P2P Iteratively query  Locality was mentioned, but the method is straight-forward

Top-K (Cont’d.) Assumptions  Based on superpeer-structured P2P networks due to the heterogeneity of peers  Each super-peer would maintain a routing table and some metadata for Top-k query P P P P P P P P SP 2 SP 1 SP 3 SP 4

Top-K (Cont’d.) Problem  Query whom? →Locality space Interest  Query routing (routing table)  Reduce the size of table  Minimize the communication peer’s update occurs load balance T2T2 SP 4 T1T1 SP 3 T1T1 SP 2 TypeNode

Social network + Ontology The state-of-the-art  Similarity computing Compute the similarity between two nodes/peers, and fix-point scores will be assigned 

Social network + Ontology  Our thoughts  Using some hierarchical domain structures  Ontology / classification Avril Lavigne A: a1, a2 B: a3, a4 C: a1, b1, b2 Rock Bon Jovi a1a2a3a4b1b2b3

Thank You!

What is ontology A formal, explicit specification of a shared conceptualization Object attribute Object relation Class Back

Example

Ballet Swim Kung Fu

Example Ballet Swim Kung Fu Back