Oracle Measurement Results

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.
Arjun Suresh S7, R College of Engineering Trivandrum.
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.
1 HYRISE – A Main Memory Hybrid Storage Engine By: Martin Grund, Jens Krüger, Hasso Plattner, Alexander Zeier, Philippe Cudre-Mauroux, Samuel Madden, VLDB.
®  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.
Who Wants An A?. Put the following in order from smallest to largest A. gigabyte B. megabyte C. kilobyte D. terabyte.
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:
Cache Conscious Indexing for Decision-Support in Main Memory Pradip Dhara.
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 –
Query Execution Chapter 15 Section 15.1 Presented by Khadke, Suvarna CS 257 (Section II) Id
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)--
Buying a Laptop. 3 Main Components The 3 main components to consider when buying a laptop or computer are Processor – The Bigger the Ghz the faster the.
Baydel Founded in 1972 Headquarters: Surrey, England North American Headquarters: San Jose, CA Engineering Driven Organization Specialize in Computer Storage.
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.
© 1998 FORWISS FORWISS Oracle Measurement Results Prof. Bayer, PhD Dipl.-Inform. Volker Markl Roland Pieringer.
© 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.
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:
©Richard L. Goldman 1 Microprocessors (Animated Presentation) ©Richard L. Goldman April 25, 2002.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition File System Implementation.
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,
Personal Computers: in the 1990’s Presenter: Michael Verhaart Use [PageDown] to proceed or in Full screen mode (right click for menu) use Left click mouse.
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
Query Execution Chapter 15 Section 15.1 Presented by Khadke, Suvarna CS 257 (Section II) Id
CPS216: Data-intensive Computing Systems
Microprocessors (Animated Presentation)
Computer Organization
Filesystems.
RAM Chapter 5.
הכרת המחשב האישי PC - Personal Computer
EECE-276 Fall 2003 Microprocessors & Microcontrollers II
Query Execution Presented by Khadke, Suvarna CS 257
Native Multidimensional Indexing in Relational Databases
SQL Server 2008 By Sam Nasr March 25, 2008.
מבוא לטכנולוגיית מידע בארגון
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
What is Computer Architecture?
Prof. R. Bayer, Ph.D. Dr. Volker Markl
Algorithms Lecture # 02 Dr. Sohail Aslam.
Presentation transcript:

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

Contents Environment of the benchmark suite 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 Future Work

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

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

Kinds of benchmarks Q20% Q40% Q60% Q80% c% measurements: Q = (I1,...,In) Ik = 1 % ..100 % I1, ..., Ik-1, Ik+1, In = c % random starting point Cube measurements: Q=(I1,...,In) Ii = 0% .. 100%, for i = 1,...,n fix starting point 20% 40% 60% 80%

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

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

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

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

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

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

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

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

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

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

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

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