Www.neresc.ac.uk A Peer-to-Peer Database Server based on BitTorrent John Colquhoun Paul Watson John Colquhoun Paul Watson.

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

Experiences with Converting my Grid Web Services to Grid Services Savas Parastatidis & Paul Watson
Dynasoar Dynamic Deployment of Web Services on a Grid or the Internet or Why its good to be Jobless Paul Watson School of Computing Science.
George Anadiotis, Spyros Kotoulas and Ronny Siebes VU University Amsterdam.
Chapter 10: Designing Databases
A Prototype Implementation of a Framework for Organising Virtual Exhibitions over the Web Ali Elbekai, Nick Rossiter School of Computing, Engineering and.
The BitTorrent protocol A peer-to-peer file sharing protocol.
Query Processing in Databases Dr. M. Gavrilova.  Introduction  I/O algorithms for large databases  Complex geometric operations in graphical querying.
Paul Solomine Security of P2P Systems. P2P Systems Used to download copyrighted files illegally. The RIAA is watching you… Spyware! General users become.
Kyushu University Graduate School of Information Science and Electrical Engineering Department of Advanced Information Technology Supervisor: Professor.
Multiple Tiers in Action
Distributed and Streaming Evaluation of Batch Queries for Data-Intensive Computational Turbulence Kalin Kanov Department of Computer Science Johns Hopkins.
1 CS6320 – Why Servlets? L. Grewe 2 What is a Servlet? Servlets are Java programs that can be run dynamically from a Web Server Servlets are Java programs.
Parallel and Distributed IR
Introduction to client/server architecture
Electronic Commerce Last Week Internet utility programs
1 Chapter Overview Introduction to Windows XP Professional Printing Setting Up Network Printers Connecting to Network Printers Configuring Network Printers.
Session-01. Hibernate Framework ? Why we use Hibernate ?
Segmentation CS 537 – Introduction to Operating Systems.
Managing Large RDF Graphs (Infinite Graph) Vaibhav Khadilkar Department of Computer Science, The University of Texas at Dallas FEARLESS engineering.
INTRODUCTION TO WEB DATABASE PROGRAMMING
October 30, 2008 Extensible Workflow Management for Simmod ESUG32, Frankfurt, Oct 30, 2008 Alexander Scharnweber (DLR) October 30, 2008 Slide 1 > Extensible.
Oracle8 JDBC Drivers Section 2. Common Features of Oracle JDBC Drivers The server-side and client-side Oracle JDBC drivers provide the same basic functionality.
Professor OKAMURA Laboratory. Othman Othman M.M. 1.
DNA REASSEMBLY Using Javaspace Sung-Ho Maeung Laura Neureuter.
MySQL. Dept. of Computing Science, University of Aberdeen2 In this lecture you will learn The main subsystems in MySQL architecture The different storage.
1 Applying Collaborative Filtering Techniques to Movie Search for Better Ranking and Browsing Seung-Taek Park and David M. Pennock (ACM SIGKDD 2007)
Java Naming and Directory Interfaces. A naming service is an entity that performs the following tasks:  It associates names with objects. Similar to.
1 Wenguang WangRichard B. Bunt Department of Computer Science University of Saskatchewan November 14, 2000 Simulating DB2 Buffer Pool Management.
The Replica Location Service The Globus Project™ And The DataGrid Project Copyright (c) 2002 University of Chicago and The University of Southern California.
Client Server Network Model:
A P2P-Based Architecture for Secure Software Delivery Using Volunteer Assistance Purvi Shah, Jehan-François Pâris, Jeffrey Morgan and John Schettino IEEE.
11 CLUSTERING AND AVAILABILITY Chapter 11. Chapter 11: CLUSTERING AND AVAILABILITY2 OVERVIEW  Describe the clustering capabilities of Microsoft Windows.
Algorithms and Techniques in Structured Scalable Peer-to-Peer Networks
Two Peer-to-Peer Networking Approaches Ken Calvert Net Seminar, 23 October 2001 Note: Many slides “borrowed” from S. Ratnasamy’s Qualifying Exam talk.
T3 data access via BitTorrent Charles G Waldman USATLAS/University of Chicago USATLAS T2/T3 Workshop Aug
INTERNET TECHNOLOGIES Week 10 Peer to Peer Paradigm 1.
An overlay for latency gradated multicasting Anwitaman Datta SCE, NTU Singapore Ion Stoica, Mike Franklin EECS, UC Berkeley
Representing Block & Record Addresses
Multimedia Retrieval Architecture Electrical Communication Engineering, Indian Institute of Science, Bangalore – , India Multimedia Retrieval Architecture.
1 Design and Implementation of a High-Performance Distributed Web Crawler Polytechnic University Vladislav Shkapenyuk, Torsten Suel 06/13/2006 석사 2 학기.
November 19, 2016 Guide:- Mrs. Kale J. S. Presented By:- Hamand Amol Sambhaji. Hamand Amol Sambhaji. Pardeshi Dhananjay Rajendra. Pardeshi Dhananjay Rajendra.
BAHIR DAR UNIVERSITY Institute of technology Faculty of Computing Department of information technology Msc program Distributed Database Article Review.
Outline Introduction and motivation, The architecture of Tycho,
Introduction to Partitioning in SQL Server
DCS Status and Amanda News
Introduction to BitTorrent
CS422 Principles of Database Systems Course Overview
Database Management System
The Improvement of PaaS Platform ZENG Shu-Qing, Xu Jie-Bin 2010 First International Conference on Networking and Distributed Computing SQUARE.
Introduction to client/server architecture
SQL Server 2016 Hybrid HyperScale Offer.
Prof. Leonardo Mostarda University of Camerino
CS 440 Database Management Systems
SCHOOL OF ELECTRICAL ENGINEERING AND TELECOMMUNICATIONS
Admission Control and Request Scheduling in E-Commerce Web Sites
Lecture 2- Query Processing (continued)
Java Database Connectivity
5 × 7 = × 7 = 70 9 × 7 = CONNECTIONS IN 7 × TABLE
5 × 8 = 40 4 × 8 = 32 9 × 8 = CONNECTIONS IN 8 × TABLE
Overview of Query Evaluation
4 × 6 = 24 8 × 6 = 48 7 × 6 = CONNECTIONS IN 6 × TABLE
5 × 6 = 30 2 × 6 = 12 7 × 6 = CONNECTIONS IN 6 × TABLE
10 × 8 = 80 5 × 8 = 40 6 × 8 = CONNECTIONS IN 8 × TABLE MULTIPLICATION.
3 × 12 = 36 6 × 12 = 72 7 × 12 = CONNECTIONS IN 12 × TABLE
Creating and Managing Folders
5 × 12 = × 12 = × 12 = CONNECTIONS IN 12 × TABLE MULTIPLICATION.
5 × 9 = 45 6 × 9 = 54 7 × 9 = CONNECTIONS IN 9 × TABLE
3 × 7 = 21 6 × 7 = 42 7 × 7 = CONNECTIONS IN 7 × TABLE
Presentation transcript:

A Peer-to-Peer Database Server based on BitTorrent John Colquhoun Paul Watson John Colquhoun Paul Watson

2 Introduction If a database server receives queries faster than it can process them, performance becomes unacceptable Similar problems have been addressed in the domain of file-sharing by the use of Peer-to-Peer (P2P) technologies Can we utilise the combined processing power, disk space and memory of individual clients to reduce the load on the server? We examine how P2P techniques could be applied within a database environment and introduce the Wigan P2P database, derived from the BitTorrent file-sharing protocol Potential applications in e-Science and e-Commerce

3 System Architecture Advertise: SELECT * FROM t Advertise: SELECT id, value FROM t WHERE t.Id < 100 Query: SELECT id, value FROM t WHERE t.Id < 100 Advertise: SELECT id, value FROM t WHERE t.id < 100 Query: SELECT id, value FROM t WHERE t.Id < 10 Advertise: SELECT id, value FROM t WHERE t.Id < 10 Query: SELECT id, value FROM t WHERE t.id < 100 Tracker

4 Implementation A simulator of Wigan The TPC-H benchmark database was used to evaluate the design Identified cases where Wigan offered a performance advantage over a Client-Server database and those areas where it did not Experiment results – a busy system where peers submitted one of a choice of five queries, however some submitted an entirely random query over a table of 10,000 tuples

5 Simulator Results

6 Current work Live Wigan system Currently under development, using algorithms developed for the simulator Written in Java and uses OGSA-DAI Also uses the TPC-H benchmark database Experiments are ongoing; in the future the live version will be used to investigate extensions to the Wigan system

7 Live System Results (1) Initial experiments with the live system involved comparing Wigan against accessing data directly from SQLServer via JDBC One of the TPC-H tables is large (approx 6 million tuples) and hence SQLServer takes some time to evaluate queries on this table, regardless of the result set size However, in Wigan, connecting to a peer that already has the query results reduces the response time In this experiment, all peers submitted the same query

8 Live System Results (2)

9 Summary We designed, implemented & evaluated the Wigan Peer-to-Peer Database System Derived from the popular BitTorrent file-sharing protocol The first database server that uses P2P to scale over multiple peers Simulator shows Wigan can outperform client-server db when: There are enough peers available to reduce the load on the seed There is sufficient overlap between the queries The system is sufficiently busy so a traditional database server would become overloaded