Spatial DBMS issues OTB Research Institute for Housing, Urban and Mobility Studies 2007-04-13 1 Spatial DBMS Research GISt lunch meeting Wilko Quak.

Slides:



Advertisements
Similar presentations
Database System Concepts and Architecture
Advertisements

Distributed DBMSPage © 1998 M. Tamer Özsu & Patrick Valduriez Outline Introduction Background Distributed DBMS Architecture Distributed Database.
Distributed DBMS© M. T. Özsu & P. Valduriez Ch.6/1 Outline Introduction Background Distributed Database Design Database Integration Semantic Data Control.
Min LuTIMBER: A Native XML DB1 TIMBER: A Native XML Database Author: H.V. Jagadish, etc. Presenter: Min Lu Date: Apr 5, 2005.
UNIT 15 Query Optimization Wei-Pang Yang, Information Management, NDHU Contents  15.1 Introduction to Query Optimization  15.2 The Optimization.
Database: A collection of related data [Elmasri]. A database represents some aspect of real world called “miniworld” [Elmasri] or “enterprise” [Ramakrishnan].
GI Systems and Science January 30, Points to Cover  Recap of what we covered so far  A concept of database Database Management System (DBMS) 
Query Execution Professor: Dr T.Y. Lin Prepared by, Mudra Patel Class id: 113.
CS263 Lecture 19 Query Optimisation.  Motivation for Query Optimisation  Phases of Query Processing  Query Trees  RA Transformation Rules  Heuristic.
Physical design. Stage 6 - Physical Design Retrieve the target physical environment Create physical data design Create function component implementation.
ICS (072)Query Processing and Optimization 1 Chapter 15 Algorithms for Query Processing and Optimization ICS 424 Advanced Database Systems Dr.
Database Systems: Design, Implementation, and Management Eighth Edition Chapter 11 Database Performance Tuning and Query Optimization.
Query Optimization. General Overview Relational model - SQL  Formal & commercial query languages Functional Dependencies Normalization Physical Design.
ICS (072)Database Systems Background Review 1 Database Systems Background Review Dr. Muhammad Shafique.
16.5 Introduction to Cost- based plan selection Amith KC Student Id: 109.
Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 2 Overview of Database Languages and Architectures.
Database System Concepts and Architecture Dr. Ali Obaidi.
Query Optimization CS 157B Ch. 14 Mien Siao. Outline Introduction Steps in Cost-based query optimization- Query Flow Projection Example Query Interaction.
Chapter 2 Database System Concepts and Architecture
Query Processing Presented by Aung S. Win.
Mobile Mapping Systems (MMS) for infrastructural monitoring and mapping are becoming more prevalent as the availability and affordability of solutions.
Information storage: Introduction of database 10/7/2004 Xiangming Mu.
Database Systems: Design, Implementation, and Management Tenth Edition Chapter 11 Database Performance Tuning and Query Optimization.
Database Systems Design, Implementation, and Management Coronel | Morris 11e ©2015 Cengage Learning. All Rights Reserved. May not be scanned, copied or.
Database Systems: Design, Implementation, and Management Eighth Edition Chapter 10 Database Performance Tuning and Query Optimization.
Physical Database Design & Performance. Optimizing for Query Performance For DBs with high retrieval traffic as compared to maintenance traffic, optimizing.
DBSQL 14-1 Copyright © Genetic Computer School 2009 Chapter 14 Microsoft SQL Server.
Introduction to Database Systems Fundamental Concepts Irvanizam Zamanhuri, M.Sc Computer Science Study Program Syiah Kuala University Website:
Query optimization in relational DBs Leveraging the mathematical formal underpinnings of the relational model.
Dr. Mohamed Osman Hegazi 1 Database Systems Concepts Database Systems Concepts Course Outlines: Introduction to Databases and DBMS. Database System Concepts.
RELATIONAL FAULT TOLERANT INTERFACE TO HETEROGENEOUS DISTRIBUTED DATABASES Prof. Osama Abulnaja Afraa Khalifah
10/16/2015 1Yan Huang - Introduction Chapter 1: Introduction What is a DBMS? What is a DBMS? A little history of DB A little history of DB Major Components.
Query Optimization Chap. 19. Evaluation of SQL Conceptual order of evaluation – Cartesian product of all tables in from clause – Rows not satisfying where.
Academic Year 2014 Spring. MODULE CC3005NI: Advanced Database Systems “QUERY OPTIMIZATION” Academic Year 2014 Spring.
Spatial DBMS Buyer's Guide OTB Research Institute for Housing, Urban and Mobility Studies FOSS4G Cape Town 1 A spatial DBMS buyer’s guide Wim.
Moving Point Type OTB Research Institute for Housing, Urban and Mobility Studies Dagstuhl 1 A ‘movingpoint’ type for a DBMS Wilko Quak - TUDelft.
PMIT-6102 Advanced Database Systems By- Jesmin Akhter Assistant Professor, IIT, Jahangirnagar University.
Switch off your Mobiles Phones or Change Profile to Silent Mode.
1 Sem-ODB: Semantic Object DBMS FIU High Performance Database Research Center Dr. Naphtali Rishe, Director.
Spatial Query Processing Spatial DBs do not have a set of operators that are considered to be basic elements in a query evaluation. Spatial DBs handle.
Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 2 Database System Concepts and Architecture.
Chapter 18 Query Processing. 2 Chapter - Objectives u Objectives of query processing and optimization. u Static versus dynamic query optimization. u How.
GISt lunch meeting OTB Research Institute for Housing, Urban and Mobility Studies Writing a DBMS buyers guide Wim de Haas Wilko Quak Based.
Chapter 1 Introduction Yonsei University 1 st Semester, 2014 Sanghyun Park.
Query Processing – Query Trees. Evaluation of SQL Conceptual order of evaluation – Cartesian product of all tables in from clause – Rows not satisfying.
Big traffic data processing framework for intelligent monitoring and recording systems 學生 : 賴弘偉 教授 : 許毅然 作者 : Yingjie Xia a, JinlongChen a,b,n, XindaiLu.
ICOM 6005 – Database Management Systems Design Dr. Manuel Rodríguez-Martínez Electrical and Computer Engineering Department Lecture 15 – Query Optimization.
Rate-Based Query Optimization for Streaming Information Sources Stratis D. Viglas Jeffrey F. Naughton.
2) Database System Concepts and Architecture. Slide 2- 2 Outline Data Models and Their Categories Schemas, Instances, and States Three-Schema Architecture.
Chapter 18 Query Processing and Optimization. Chapter Outline u Introduction. u Using Heuristics in Query Optimization –Query Trees and Query Graphs –Transformation.
Chapter 13: Query Processing
1 Minggu 6, Pertemuan 12 Query Processing Matakuliah: T0206-Sistem Basisdata Tahun: 2005 Versi: 1.0/0.0.
The Database Project a starting work by Arnauld Albert, Cristiano Bozza.
Relational Algebra COMP3211 Advanced Databases Nicholas Gibbins
ISC321 Database Systems I Chapter 2: Overview of Database Languages and Architectures Fall 2015 Dr. Abdullah Almutairi.
Christoph F. Eick: Final Words COSC Topics Covered in COSC 3480  Data models (ER, Relational, XML)  Using data models; learning how to store real.
 INDEX  Overview.  Introduction.  System Requirement.  Features Of SQL.  Development Process.  System Design (SDLC).  Implementation.  Future.
CHAPTER 19 Query Optimization. CHAPTER 19 Query Optimization.
Databases (CS507) CHAPTER 2.
Query Processing and Optimization, and Database Tuning
Query Optimization Heuristic Optimization
COMP3017 Advanced Databases
UNIT 11 Query Optimization
Query Optimization Phases of query processing
Database Performance Tuning and Query Optimization
Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 2 Database System Concepts and Architecture.
Outline Introduction Background Distributed DBMS Architecture
Query Processing CSD305 Advanced Databases.
Chapter 11 Database Performance Tuning and Query Optimization
Query Processing.
Presentation transcript:

Spatial DBMS issues OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS Research GISt lunch meeting Wilko Quak

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues Overview Introduction to DBMS Query Processing Benchmarking a spatial DBMS The GeoInfoNed project MonetDB Discussion

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues Introduction to DBMS query processing Slides borrowed from Dr. Yang He

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues Query processing overview Review relational algebra Query processing introduction stages of query processing query optimisation relational algebra tree

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues Relational algebra (1) a relational languages proposed by Codd implementable basis of high-level (SQL) query execution a collection of simple, 'low-level’ operations used to manipulate relations input is one or more relations output is one relation

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues Relational algebra (2) Relational operations unary operators Restrict (Select)  Project  binary operators Cartesian productX Union  Intersection  Difference- Join Divide  P

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues e.g. two relations Student and Registration Example relations Student ( SID, Name, Gender ) Registration ( SID, CID, Mark ) SIDNameGender S1KateF S2JohnM S3KateF S4FredM Student SIDCIDMark S1C165 S1C245 S2C280 S2C460 S3C150 S3C275 S4C370 Registration

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues e.g. “Identify all male students” in SQL in relational algebra  (Gender= ‘ M ’ ) ( Student ) Queries examples (1) Select SIDNameGender S2JohnM S4FredM SELECT SID, Name, Gender FROM Student WHERE Gender=′M′;

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues e.g. “List student’s name and gender.” in SQL In relational algebra  Name, Gender ( Student ) Queries examples (2) Project NameGender KateF JohnM FredM SELECT Name, Gender FROM Student;

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues Queries examples (3) e.g. “Show student ID, name, their course ID and marks” in SQL in relational algebra SELECT s.SID, Name, CID, Mark FROM Student s, Registration r WHERE s.SID = r.SID; (  SID, Name ( Student) ) (  (Registration) ) SID,CID,Mark  SID, Name, CID, Mark ( Student Registration ) or ProjectNatural Join

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues A user query may require several operations to be performed relational algebra is a procedural language so query operations are evaluated in the order specified a complex query can be executed in different ways, so an efficient one should be used as efficiency is an important DBMS requirement – query optimisation Queries in relational algebra

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues Query processing Four stages involved in query processing query decomposition or parsing query optimization code generation runtime query execution

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues Query optimization (1) refers to the activity of choosing an efficient execution strategy or plan for processing a query rule-based and cost-based strategies database statistics in system catalog used for cost estimation is a prime objective of the query processing

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues Query optimization (3) In a query processing, disk access takes most time The main objective of the query optimisation is to minimize the number of disk accesses Many DBMSs use heuristic rules for query optimization e.g. “Perform selection and projection operations as early as possible to reduce the cardinality of the relation and the subsequent process of that relation”

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues Query processing – an example e.g. “Show student ID, name, their course ID and marks” in SQL it can be transformed into relational algebra query SELECT s.SID, Name, CID, Mark FROM Student s, Registration r WHERE s.SID = r.SID; (  SID, Name ( Student) ) (  (Registration) ) SID,CID,Mark  SID, Name, CID, Mark ( Student Registration ) or The first one is better: much less disk access than the second

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues e.g. Relational algebra query tree (2) Student Registration  SID, Name  SID,CID,Marke Leaf nodes Intermediate nodes Root (  SID, Name ( Student) ) (  (Registration) ) SID,CID,Mark

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues Spatial Query processing In spatial query processing the operator is a spatial operator, for the rest it is the same as non-spatial query processing: Spatial Select Find all objects within given rectangle [99.99%] Spatial Join (overlay in GIS terms) Find all restaurants within national parks

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues DBMS Benchmarking Categorization of DBMS usage Implications for benchmarking benchmark choices

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues Categories of DBMS users Static usage: Predefined queries with changing parameters Queries can be hand optimized Dynamic usage (browsing): Many different queries Query optimizer is important Access via object-relational mapping (e.g. Hibernate) Not discussed here All categories need different benchmarking

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues Benchmarking static DBMS usage Notes: Critical factor is testing the ‘query processor’. Query optimizer is not important Benchmark: Make small set of simple queries that test one operation

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues Benchmarking dynamic DBMS usage Notes: Critical factor is testing the ‘query optimizer’. Very hard to get quality reproducible results. It is very hard to assess the quality of the query optimizer but a small testset might give some insight: select city.name,river.name from city,river where city.inhabitants > X and distance(city.geometry,river.geometry) < Y;

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues Other benchmarking considerations Functionality Usability update behaviour

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues GeoInfoNed – RGI-232

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues GeoInfoNed -- What and Why Build a spatially enabled DBMS because: A DBMS is at the core of many system. If you improve the core the whole system improves. There is a need for an (open source) experimentation platform for Geo DBMS research.

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues Who CWI – Leading DBMS experts with MonetDB TUDelft/OTB – Knowledge of spatial processes CycloMedia – Huge dataset and interesting problems RWS/AGI – Large and diverse datasets and interesting problems

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues How At CWI there is the MonetDB DBMS. First we will extend it with basic spatial types (According to OpenGIS). Together with our ‘Problem Holder’ partners we will find directions for more extensions. MonetDB already has support for: Image Data, XML storage and querying etc.

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues Example Is there a relationship between traffic accidents and objects near the road? GeoInfoNed

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues MonetDB Introduction* Hardware trends MonetDB design considerations MonetDB architecture *Slides borrowed from CWI

OTB Research Institute for Housing, Urban and Mobility Studies Hardware Trends 50% p/year: - cpu speed - mem size - mem bandwidth - disk bandwidth 1% p/year: - mem latency 10% p/year: - disk latency

OTB Research Institute for Housing, Urban and Mobility Studies Latency is the enemy! Commercial DBMS products (oracle, DB2, SQLserver) stem from OLTP roots focus on minimizing random I/Os => depend on latency! MonetDB: built for bulk access optimize CPU and memory performance Latency is one of the killing factors in Friso’s simplicial homology implementation

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues MonetDB design considerations Multi-model database kernel support Extensible data types, operators, accelerators Database hot-set is memory resident Simple data structures are better Index management should be automatic Do not replicate the operating system Optimize when you know the situation Cooperative transaction management

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues Monet kernels MAPI protocol JDBC C-mapi lib Perl End-user application ODBC PHP Python SQL XQuery MonetDB product family Here a MATLAB interface and Frank’s life would be easier

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues MonetDB - Physical data organization Binary Association Tables

OTB Research Institute for Housing, Urban and Mobility Studies Spatial DBMS issues Discussion