STREAM: The Stanford Data Stream Management System Rebuttal Team Mingzhu Wei Di Yang CS525s - Fall 2006.

Slides:



Advertisements
Similar presentations
Limitations of the relational model 1. 2 Overview application areas for which the relational model is inadequate - reasons drawbacks of relational DBMSs.
Advertisements

Evaluating Window Joins over Unbounded Streams Author: Jaewoo Kang, Jeffrey F. Naughton, Stratis D. Viglas University of Wisconsin-Madison CS Dept. Presenter:
Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 5 More SQL: Complex Queries, Triggers, Views, and Schema Modification.
Semantics and Evaluation Techniques for Window Aggregates in Data Streams Jin Li, David Maier, Kristin Tufte, Vassilis Papadimos, Peter A. Tucker SIGMOD.
Supporting Top-k join Queries in Relational Databases By:Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid Presented by: Calvin R Noronha ( )
Relational Algebra, Join and QBE Yong Choi School of Business CSUB, Bakersfield.
A Paper on RANDOM SAMPLING OVER JOINS by SURAJIT CHAUDHARI RAJEEV MOTWANI VIVEK NARASAYYA PRESENTED BY, JEEVAN KUMAR GOGINENI SARANYA GOTTIPATI.
Efficient IR-Style Keyword Search over Relational Databases Vagelis Hristidis University of California, San Diego Luis Gravano Columbia University Yannis.
Supporting top-k join queries in relational databases Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid Presented by Rebecca M. Atchley Thursday, April.
Representing and Querying Correlated Tuples in Probabilistic Databases
1 11. Streaming Data Management Chapter 18 Current Issues: Streaming Data and Cloud Computing The 3rd edition of the textbook.
Maintaining Sliding Widow Skylines on Data Streams.
Relational Databases for Querying XML Documents: Limitations & Opportunities VLDB`99 Shanmugasundaram, J., Tufte, K., He, G., Zhang, C., DeWitt, D., Naughton,
Stewart Gillies The University of Queensland
Static Optimization of Conjunctive Queries with Sliding Windows over Infinite Streams Presented by: Andy Mason and Sheng Zhong Ahmed M.Ayad and Jeffrey.
Processing Sliding Window Multi-Joins in Continuous Queries over Data Streams Paper By: Lukasz Golab M. Tamer Ozsu CS 561 Presentation WPI 11 th March,
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows COMP9314 Lecture Notes.
CMPT 354, Simon Fraser University, Fall 2008, Martin Ester 52 Database Systems I Relational Algebra.
PART II The Market System: Choices Made by Households and Firms © 2012 Pearson Education, Inc. Publishing as Prentice Hall Prepared by: Fernando Quijano.
An Abstract Semantics and Concrete Language for Continuous Queries over Streams and Relations Presenter: Liyan Zhang Presentation of ICS
Evaluating Window Joins Over Unbounded Streams By Nishant Mehta and Abhishek Kumar.
Aurora Proponent Team Wei, Mingrui Liu, Mo Rebuttal Team Joshua M Lee Raghavan, Venkatesh.
Illinois Institute of Technology
1 CMSC 132: Object-Oriented Programming II Nelson Padua-Perez William Pugh Department of Computer Science University of Maryland, College Park.
Semantics and Evaluation Techniques for Window Aggregates in Data Stream Jin Li, David Maier, Kristin Tufte, Vassillis Papadimos, Peter Tucker. Presented.
Some Introductory Programming 1. Structured Query Language - used for queries. - a standard database product. 2. Visual Basic for Applications - use of.
General Equilibrium Analysis A Technological Advance: The Electronic Calculator Market Adjustment to Changes in Demand Formal Proof of a General Competitive.
1 of 22 General Equilibrium and the Efficiency of Perfect Competition General Equilibrium Analysis Allocative Efficiency and Competitive Equilibrium The.
Efficient Query Evaluation over Temporally Correlated Probabilistic Streams Bhargav Kanagal, Amol Deshpande ΗΥ-562 Advanced Topics on Databases Αλέκα Σεληνιωτάκη.
CIDR, Tuesday The Schema-Independent Database UI Eirik Bakke and Edward Benson CIDR 2011 (a proposed holy grail and some suggestions)
STREAM The Stanford Data Stream Management System.
Review “Query Languages” Algebra, Calculus, and SQL.
CSE314 Database Systems More SQL: Complex Queries, Triggers, Views, and Schema Modification Doç. Dr. Mehmet Göktürk src: Elmasri & Navanthe 6E Pearson.
Query Processing, Resource Management, and Approximation in a Data Stream Management System.
Join Synopses for Approximate Query Answering Swarup Achrya Philip B. Gibbons Viswanath Poosala Sridhar Ramaswamy Presented by Bhushan Pachpande.
Database Systems Microsoft Access Practical #3 Queries Nos 215.
EXAM 1 NEXT TUESDAY…. EXAMPLE QUESTIONS 1.Why is the notion of a “state” important in relational database technology? What does it refer to? 2.What do.
JONATHAN LESSINGER A CRITIQUE OF CQL. PLAN 1.Background (How CQL, STREAM work) 2.Issues.
Zhuo Peng, Chaokun Wang, Lu Han, Jingchao Hao and Yiyuan Ba Proceedings of the Third International Conference on Emerging Databases, Incheon, Korea (August.
1 Information Technology Web Services Projects: Current & Future Insert Photo here.
Supporting Top-k join Queries in Relational Databases Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid Presented by: Z. Joseph, CSE-UT Arlington.
SQL introduction. SWC Getting data out of databases Databases are ”just” containers of data We could – in principle – just put data in a text.
Building a Distributed Full-Text Index for the Web by Sergey Melnik, Sriram Raghavan, Beverly Yang and Hector Garcia-Molina from Stanford University Presented.
Effective Keyword-Based Selection of Relational Databases By Bei Yu, Guoliang Li, Karen Sollins & Anthony K. H. Tung Presented by Deborah Kallina.
CS 1120: Computer Science II Software Life Cycle Slides courtesy of: Prof. Ajay Gupta and Prof. James Yang (format and other minor modifications by by.
Research Methodology For Information Technology Students [cf. Martin Olivier 1997] Created by Piet Boonzaier Chapter 2 Designing your project.
Evaluating Window Joins over Unbounded Streams Jaewoo Kang Jeffrey F. Naughton Stratis D. Viglas {jaewoo, naughton, Univ. of Wisconsin-Madison.
Triggers and Streams Zachary G. Ives University of Pennsylvania CIS 650 – Database & Information Systems March 28, 2005.
03/02/20061 Evaluating Top-k Queries Over Web-Accessible Databases Amelie Marian Nicolas Bruno Luis Gravano Presented By: Archana and Muhammed.
Enumerating XML Data for Dynamic Updating L.Kit and V.Ng, Hong Kong Polytechnique University Sang-Ho Nah Lily Daniel Yun Hee Lee.
Recent Exam Connections to Study Techniques Biology.
SLIDE 1IS 257 – Fall 2006 Normalization Normalization theory is based on the observation that relations with certain properties are more effective.
Warm-up Solve by linear combination
A Music Search Engine for Plagiarism Detection
More SQL: Complex Queries, Triggers, Views, and Schema Modification
Using Collaborative Filtering to Weave an Information Tapestry
CASE FAIR OSTER ECONOMICS P R I N C I P L E S O F
S. Sudarshan CS632 Course, Mar 2004 IIT Bombay
The Object-Oriented Database System Manifesto
Relational Algebra - Part 1
Relational Algebra 461 The slides for this text are organized into chapters. This lecture covers relational algebra, from Chapter 4. The relational calculus.
Deco: Declarative Crowdsourcing
Clustering DNS Problems
Clustering DNS Problems
مفاهیم بهره وري.
Chapter 2: Designing your project
Tuning the top-k view update process
CLUSTER BY: A NEW SQL EXTENSION FOR SPATIAL DATA AGGREGATION
OCR GCSE Computing © Hodder Education 2013 Slide 1
Azure Stream Analytics
Presentation transcript:

STREAM: The Stanford Data Stream Management System Rebuttal Team Mingzhu Wei Di Yang CS525s - Fall 2006

Rebuttal Areas Foundation Windows Joins Full Recalculation Strategy Language Issues

Foundation Rebuttal  No proof provided to guarantee correctness or completeness of query plans resulting from the combination of operators, queues, and synopses Analysis  STREAM is based on relation database theory  Relational databases have been around for a long time  Proofs exist that demonstrate their correctness  CQL is a minor extension to SQL  More effort could have been put into providing a more formal proof of CQL

Windows Rebuttal  Stream does not provide value-based windows  For example, without a value-based window the system cannot process a query such as:  Give me the name of the students who have the top 10 exam scores, efficiently Analysis  Feature not supported by STREAM

Joins Rebuttal  STREAM only uses the self-purge mechanism when performing a window-based join Analysis  STREAM’s criteria for judging when a tuple (in the state of the window) has expired is determined by comparison of its timestamp with that of the new incoming tuples in the same stream  Cross-purge might be more efficient in some cases Cross-purge = Compare timestamps across two streams

Full Recalculation Strategy Rebuttal  Stream uses a full recalculation strategy for result updating  Could be very inefficient with big window sizes  Example: We are trying to join two windows each of size 1000 If both windows only slide 10 at each time, recalculation for the whole result would be much more expensive, than incremental result updating Analysis  Using an Incremental Result Update Strategy might be more efficient in some cases Keep most of the joined result and only calculate those for newly arrived tuples

Language Issues Rebuttal  Stream does not provide the stream to stream operator Analysis  The absence of a stream-to-stream operator is not explicitly justified in the paper  It’s absence is reasonable because STREAM operators treat all input as relations  STREAM does provide operators for converting streams to relations and for converting relations to streams

Language Issues (cont) Rebuttal  Stream uses an append-only model  It does not provide an operator for updating data value in stream Analysis  Although not perfect, this is a common assumption in current stream processing papers

Conclusion Foundation Windows Joins Full Recalculation Strategy Language Issues