© 1998 FORWISS FORWISS Oracle Measurement Results Prof. Bayer, PhD Dipl.-Inform. Volker Markl Roland Pieringer.

Slides:



Advertisements
Similar presentations
Status of the Status of the MONARC Testbed in Padova Massimo Sgaravatto INFN Padova May Monarc Workshop.
Advertisements

Vorlesung Datawarehousing Table of Contents Prof. Rudolf Bayer, Ph.D. Institut für Informatik, TUM SS 2002.
Equality Join R X R.A=S.B S : : Relation R M PagesN Pages Relation S Pr records per page Ps records per page.
By Daniela Floresu Donald Kossmann
Query Processing and Optimizing on SSDs Flash Group Qingling Cao
Accelerating Your Success™ Oracle on Oracle for NHS 1.
Outline What is a data warehouse? A multi-dimensional data model Data warehouse architecture Data warehouse implementation Further development of data.
Benchmarking Parallel Code. Benchmarking2 What are the performance characteristics of a parallel code? What should be measured?
1 HYRISE – A Main Memory Hybrid Storage Engine By: Martin Grund, Jens Krüger, Hasso Plattner, Alexander Zeier, Philippe Cudre-Mauroux, Samuel Madden, VLDB.
ICS 624 Spring 2011 Multi-Dimensional Clustering Asst. Prof. Lipyeow Lim Information & Computer Science Department University of Hawaii at Manoa 1/24/20111Lipyeow.
®  SAP AG 1998 Memory Based Computing (Gemma F. Durany) / 1 Gemma F. Durany SAP AG Memory Based Computing.
CS 284a, 7 October 97Copyright (c) , John Thornley1 CS 284a Lecture Tuesday, 7 October 1997.
File Systems Topics –File –Directory –File System Implementation Reference: Chapter 5: File Systems Operating Systems Design and Implementation (Second.
Last Time –Main memory indexing (T trees) and a real system. –Optimize for CPU, space, and logging. But things have changed drastically! Hardware trend:
Computer Organization Cs 147 Prof. Lee Azita Keshmiri.
Query Execution Professor: Dr T.Y. Lin Prepared by, Mudra Patel Class id: 113.
Buying A Computer By: Chris Piligian Bobby Lepori Jon Monga.
1 External Sorting for Query Processing Yanlei Diao UMass Amherst Feb 27, 2007 Slides Courtesy of R. Ramakrishnan and J. Gehrke.
IT Systems Memory EN230-1 Justin Champion C208 –
1 Chapter 4 The Central Processing Unit and Memory.
February 11, 2003Ninth International Symposium on High Performance Computer Architecture Memory System Behavior of Java-Based Middleware Martin Karlsson,
Lecture 6 Indexing Part 2 Column Stores. Indexes Recap Heap FileBitmapHash FileB+Tree InsertO(1) O( log B n ) DeleteO(P)O(1) O( log B n ) Range Scan O(P)--
Computer Organization Hardware and Software. Computing Systems Computers have two kinds of components: Hardware, consisting of its physical devices (CPU,
What is a Computer ? Computers are Electronic Machines that process (performs calculation and manipulation) Data under the control of Set of Instructions.
Which Computer Is Best for You? By Jason Ardery. ACERPOWER 6100 P gb $ Intel® Pentium® III processor 550MHz, 128MB RAM, 13GB 56K, Advent.
OBJECTIVES  Explain why a computer represents data in the form of binary  Explain the terms related to data storage: bit, byte, character, word  Calculate.
© 1999 FORWISS FORWISS MISTRAL und DWH 6-2 Processing Relational Queries Using the Multidimensional Access Method UB-Tree Prof. R. Bayer, Ph.D. Dr. Volker.
Swarup Acharya Phillip B. Gibbons Viswanath Poosala Sridhar Ramaswamy Presented By Vinay Hoskere.
© 2000 FORWISS, 1 MISTRAL Processing Relational Queries Using a Multidimensional Access Method.
© 1999 FORWISS FORWISS MISTRAL Performance of TPC-D Benchmark and Datawarehouses Prof. R. Bayer, Ph.D. Dr. Volker Markl Dept. of Computer Science, Technical.
What is the best laptop configuration? Video Ability.
Computer Organization & Assembly Language © by DR. M. Amer.
Prof. Bayer, DWH, Ch.5, SS Chapter 5. Indexing for DWH D1Facts D2.
On the Performance of Window-Based Contention Managers for Transactional Memory Gokarna Sharma and Costas Busch Louisiana State University.
© 1999 FORWISS General Research Report Implementation and Optimization Issues of the ROLAP Algebra F. Ramsak, M.S. (UIUC) Dr. V. Markl Prof. R. Bayer,
COMPUTER COMPARISON Period 4 By : Matthew Walker Joseph Deahn Philip Wymer Joshua Deloraya.
CS 257 Chapter – 15.9 Summary of Query Execution Database Systems: The Complete Book Krishna Vellanki 124.
CSU - DCE Webmaster I Scaling Issues - Fort Collins, CO Copyright © XTR Systems, LLC Web Site Scaling Issues (or Size Really Does Matter) Instructor:
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition File System Implementation.
Multilevel Caches Microprocessors are getting faster and including a small high speed cache on the same chip.
Relational Operator Evaluation. Overview Application Programmer (e.g., business analyst, Data architect) Sophisticated Application Programmer (e.g.,
Excellence Publication Co. Ltd. Volume Volume 1.
Baum, Boyett, & Garrison Comparing Intel C++ and Microsoft Visual C++ Compilers Michael Baum David Boyett Holly Garrison.
Prof. Bayer, DWH, Ch.7, SS20021 Chapt. 7 Multidimensional Hierarchical Clustering Fig. 3.1 Hierarchies in the `Juice and More´ schema Year (3) Month (12)
Scaling up from local DB to distributed DB Cristiano Bozza European Emulsion Group Nagoya, Jan 2004 Presented by Giuseppe Grella.
Bigtable : A Distributed Storage System for Structured Data Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach Mike Burrows,
Moses Local Experts Friday, 18 June Build Upgrades l MOSES staff view now uses Oracle 9i and PowerBuilder 9 Recommended system needs: 500Mhz.
Lab Activities 1, 2. Some of the Lab Server Specifications CPU: 2 Quad(4) Core Intel Xeon 5400 processors CPU Speed: 2.5 GHz Cache : Each 2 cores share.
Computer Performance. Hard Drive - HDD Stores your files, programs, and information. If it gets full, you can’t save any more. Measured in bytes (KB,
Presentation on SIRIUS B Pocket PC NAME : MD. ALIUM BASIR ID : CSE 341 Sec : 05.
G058 - Lecture XX Example Upgrade Mr C Johnston ICT Teacher
CPS216: Data-intensive Computing Systems
Computer Organization
Filesystems.
RAM Chapter 5.
הכרת המחשב האישי PC - Personal Computer
Native Multidimensional Indexing in Relational Databases
Jewels, Himalayas and Fireworks, Extending Methods for
מבוא לטכנולוגיית מידע בארגון
Native Multidimensional Indexing in Relational Databases
Comparisons in advance processors
By: Chris Piligian Bobby Lepori Jon Monga
Query Execution Presented by Jiten Oswal CS 257 Chapter 15
Chap 2. Computer Fundamentals
Jewels, Himalayas and Fireworks, Extending Methods for
What is Computer Architecture?
Prof. R. Bayer, Ph.D. Dr. Volker Markl
Algorithms Lecture # 02 Dr. Sohail Aslam.
Chapt. 7 Multidimensional Hierarchical Clustering
Oracle Measurement Results
Presentation transcript:

© 1998 FORWISS FORWISS Oracle Measurement Results Prof. Bayer, PhD Dipl.-Inform. Volker Markl Roland Pieringer

© 1998 FORWISS FORWISS Contents l Environment of the benchmark suite l Results of the measurements – Example measurement suite – Comparison of the operating systems SUN Solaris and Windows NT – Variation of the sizes of the tuples – Variation of the number of tuples – Variation of the number of restricted dimensions l Future Work

© 1998 FORWISS FORWISS Environment of the benchmark suite l Measures on two machines: – Compaq PC (4 Intel Processors, 200 MHz, 512 MB RAM) with Oracle – SUN Ultra 2 (2 Ultra Sparc Processors, 200 MHz, 1 GB RAM) with Oracle l Data uniformly distributed and created by a program l Elimination of cache side effects by NOCACHE

© 1998 FORWISS FORWISS Used indexes l UB: UB Tree (index that causes this meeting) l COMPOUND: concatenation of several indexes to get a multi dimensional index in Oracle as index only table implemented l MULT: secondary indexes on all index attributes l SCAN: no index, relation scan, in Oracle as full table scan

© 1998 FORWISS FORWISS Kinds of benchmarks l c% measurements: Q = (I 1,...,I n ) I k = 1 %..100 % I 1,..., I k-1, I k+1, I n = c % random starting point l Cube measurements: Q=(I 1,...,I n ) I i = 0%.. 100%, for i = 1,...,n fix starting point 20% 40% 60% 80% Q 20% Q 40% Q 60% Q 80%

© 1998 FORWISS FORWISS Results of the measurements l Complete benchmarks suite l Comparison of Windows NT and SUN Solaris l Variation of the size of tuples l Variation of the number of tuples l Variation of the number of restricted dimensions

© 1998 FORWISS FORWISS 20% measure with 5 restricted dimensions (250K tuples, tuple size 428 Byte)

© 1998 FORWISS FORWISS 35% measure with 5 restricted dimensions (250K tuples, tuple size 428 Byte)

© 1998 FORWISS FORWISS Cube measure (250K tuples, tuple size 428 Byte)

© 1998 FORWISS FORWISS Solaris - NT: 35% measure (125K tuples, 428 Byte tuple size) with SUN

© 1998 FORWISS FORWISS Solaris - NT: 35% measure (125K tuples, 428 Byte tuple size) with NT

© 1998 FORWISS FORWISS Comparison of tuple size l Intersection of compound and relation scan: – small tuples: about 10% – large tuples: about 8% l Intersection UB Tree and relation scan: – small tuples: about 65% – large tuples: about 47% l Decrease of performance of the relation scan: – small tuples: factor 4 – large tuples: factor 1.4

© 1998 FORWISS FORWISS Comparison of the number of tuples Cube measure (1M tuples, 228 Byte tuple size)

© 1998 FORWISS FORWISS Comparison of the number of tuples Cube measure (2M tuples, 228 Byte tuple size)

© 1998 FORWISS FORWISS Comparison of the number of tuples Cube measure (4M tuples, 228 Byte tuple size)

© 1998 FORWISS FORWISS Variation of the number of restricted dimensions Cube measure (250K tuples, 428 Byte tuple size)

© 1998 FORWISS FORWISS Variation of the number of restricted dimensions 35% measure (250K tuples, 428 Byte tuple size)