PPT-Relational Query Processing

on OpenCLbased FPGAs Zeke Wang Johns Paul Hui Yan Cheah NTU Singapore Bingsheng He NUS Singapore Wei Zhang HKUST Hong Kong 1 Outline Background and Problem Challenges. Relational Databases and Enterprise Systems. Copyright © 2014 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill . Education.. A query is stated using SQL or other languages, ideally natural languages. After query parsing, each query is essentially treated as a . relational algebra expression. Query optimizer . Enumerates . the possible plans to evaluate expression,. Relational Algebra (Using SQL DML Syntax):. Data Manipulation Language For Relations. Relational Algebra And SQL. SQL is based on relational algebra with many extensions. Some necessary. Some unnecessary. Chapter 1. The Worlds of Database Systems. Section 1.1 . Evolution of Database Systems . The DBMS is expected to :. 1 . Allow users to create new databases and specify their schemas ( logical structure of the data ) , using a specialized data - definition language.. Processing . on OpenCL-based FPGAs. Zeke Wang. , Johns Paul, Hui Yan Cheah . (. NTU,. . Singapore), . Bingsheng He (. NUS,. Singapore), . Wei Zhang (HKUST, Hong Kong). 1. Outline. Background and Problem. IDOL Under . the . Hood. Techniques and algorithms. #. SeizeTheData. Read the presenter notes before presenting.. Most of the content of this presentation is contained therein.. IDOL knowledge flow. Acquisition. SpatialHadoop. Type: Research Paper (Experimental evaluation). Authors: Ahmed . Eldawy. , . Louai. . Alarabi. , Mohamed F. . Mokbel. Presented by: Siddhant Kulkarni. Term: Fall 2015. Motivation. John . Sirmon. Senior Escalation Engineer – Microsoft Corporation. Microsoft CSS at PASS 2009. Session Objectives And Takeaways. Processing issues . When good cubes go bad. Troubleshooting processing simplified . of Massive Trajectory Data based on MapReduce. Qiang. Ma, Bin Yang (. Fudan. University). Weining. . Qian. , . Aoying. Zhou (ECNU). Presented By: . Xin. Cao (Aalborg University). Outline. Introduction . Deliverable #2. Jonggun Park . Haotian. He. Maria . Antoniak. Ron Lockwood. System architecture. Two modules:. Indexing. Querying . query processing. p. assage retrieval. answer processing/ranking. CSE 8330. Conventional Query Processing. Statistics generation. Query optimization. Query execution. Unreliable cardinality . e. stimates. Complex queries. Changes in the runtime environment. Query interactivity. A query is stated using SQL or other languages, ideally natural languages. After query parsing, each query is essentially treated as a . relational algebra expression. Query optimizer . Enumerates . the possible plans to evaluate expression,. Query Processing. Document-at-a-time. Calculates complete scores for documents by processing all term lists, one document at a time. Term-at-a-time. Accumulates scores for documents by processing term lists one at a time. Serge Abiteboul. INRIA Saclay, Collège de France et ENS Cachan. 3/20/12. 1. 3/20/12. 1. 3/20/12. 1. 3/20/12. 1. Recall for first lecture:. Always . question . everything. In industry: to challenge the well established guys .