Scientific Data Management Research Group National Energy Research Scientific Computing Center, L B N L 1 Henrik Nordberg, June 1998 Query Estimator Henrik.

Slides:



Advertisements
Similar presentations
Adam Jorgensen Pragmatic Works Performance Optimization in SQL Server Analysis Services 2008.
Advertisements

Practical Caches COMP25212 cache 3. Learning Objectives To understand: –Additional Control Bits in Cache Lines –Cache Line Size Tradeoffs –Separate I&D.
Virtual Memory Hardware Support
Aug Arie Shoshani Particle Physics Data Grid Request Management working group.
Using one level of Cache:
Grid Collector: Enabling File-Transparent Object Access For Analysis Wei-Ming Zhang Kent State University John Wu, Alex Sim, Junmin Gu and Arie Shoshani.
Virtual Memory. Why do we need VM? Program address space: 0 – 2^32 bytes –4GB of space Physical memory available –256MB or so Multiprogramming systems.
Computer-System Structures
STACS STACS: Storage Access Coordination of Tertiary Storage for High Energy Physics Applications Arie Shoshani, Alex Sim, John Wu, Luis Bernardo*, Henrik.
Module 8: Monitoring SQL Server for Performance. Overview Why to Monitor SQL Server Performance Monitoring and Tuning Tools for Monitoring SQL Server.
1 Computer System Overview Chapter 1 Review of basic hardware concepts.
Managing Multi-User Databases AIMS 3710 R. Nakatsu.
Lecture 11: DMBS Internals
July, 2001 High-dimensional indexing techniques Kesheng John Wu Ekow Otoo Arie Shoshani.
Oracle Index study for Event TAG DB M. Boschini S. Della Torre
PI Performance Monitoring James Wong OSI Software, Inc.
A User’s Introduction to the Grand Challenge Software STAR-GC Workshop Oct 1999 D. Zimmerman.
Architecture Rajesh. Components of Database Engine.
© 2005 By Prentic Hall1 1 University Of Palestine Essentials of Management Information Systems Kenneth C. Laudon, Jane P. Laudon Instructor: Mr. Ahmed.
IMDGs An essential part of your architecture. About me
DBMS Implementation Chapter 6.4 V3.0 Napier University Dr Gordon Russell.
Chapter 2: Computer-System Structures Computer System Operation I/O Structure Storage Structure Storage Hierarchy Hardware Protection Network Structure.
Computer Science Research and Development Department Computing Sciences Directorate, L B N L 1 Storage Management and Data Mining in High Energy Physics.
File Processing : Storage Media 2015, Spring Pusan National University Ki-Joune Li.
1 5th AstroGrid-D Meeting, MPE Garching Frank Breiting, AIP November 14, 2006 Status of the Dynamo Use Case as prepared by Michael Braun Frank Breitling.
September, 2002 Efficient Bitmap Indexes for Very Large Datasets John Wu Ekow Otoo Arie Shoshani Lawrence Berkeley National Laboratory.
Chapter 10 System Monitoring Issues Performance Benchmarks NT Server Services Users and Server Access Information Task Manager for Applications Ram and.
SDM-Center talk Optimizing shared access to tertiary storage Arie Shoshani Alex Sim Alex Sim July 10, 2001 Scientific Data Management Group Computing Science.
1 GCA Application in STAR GCA Collaboration Grand Challenge Architecture and its Interface to STAR Sasha Vaniachine presenting for the Grand Challenge.
DMBS Internals I. What Should a DBMS Do? Store large amounts of data Process queries efficiently Allow multiple users to access the database concurrently.
1 How will execution time grow with SIZE? int array[SIZE]; int sum = 0; for (int i = 0 ; i < ; ++ i) { for (int j = 0 ; j < SIZE ; ++ j) { sum +=
Consider the program fragment below left. Assume that the program containing this fragment executes t1() and t2() on separate threads running on separate.
STAR Collaboration, July 2004 Grid Collector Wei-Ming Zhang Kent State University John Wu, Alex Sim, Junmin Gu and Arie Shoshani Lawrence Berkeley National.
Grand Challenge in MDC2 D. Olson, LBNL 31 Jan 1999 STAR Collaboration Meeting
Lecture 10 Page 1 CS 111 Summer 2013 File Systems Control Structures A file is a named collection of information Primary roles of file system: – To store.
1 Chapter Seven. 2 Users want large and fast memories! SRAM access times are ns at cost of $100 to $250 per Mbyte. DRAM access times are ns.
Multilevel Caches Microprocessors are getting faster and including a small high speed cache on the same chip.
1 fileCatalog, tagDB and GCA A. Vaniachine Grand Challenge STAR fileCatalog, tagDB and Grand Challenge Architecture A. Vaniachine presenting for the Grand.
History & Motivations –RDBMS History & Motivations (cont’d) … … Concurrent Access Handling Failures Shared Data User.
March, 2002 Efficient Bitmap Indexing Techniques for Very Large Datasets Kesheng John Wu Ekow Otoo Arie Shoshani.
1 Chapter Seven. 2 Users want large and fast memories! SRAM access times are ns at cost of $100 to $250 per Mbyte. DRAM access times are ns.
Programming in the Context of a Typical Computer Computer Studies Created by Rex Woollard.
DMBS Internals I February 24 th, What Should a DBMS Do? Store large amounts of data Process queries efficiently Allow multiple users to access the.
DMBS Internals I. What Should a DBMS Do? Store large amounts of data Process queries efficiently Allow multiple users to access the database concurrently.
Multimedia Retrieval Architecture Electrical Communication Engineering, Indian Institute of Science, Bangalore – , India Multimedia Retrieval Architecture.
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,
1 Efficient Data Access for Distributed Computing at RHIC A. Vaniachine Efficient Data Access for Distributed Computing at RHIC A. Vaniachine Lawrence.
Memory Hierarchy and Cache Design (3). Reducing Cache Miss Penalty 1. Giving priority to read misses over writes 2. Sub-block placement for reduced miss.
نظام المحاضرات الالكترونينظام المحاضرات الالكتروني Cache Memory.
1 Components of the Virtual Memory System  Arrows indicate what happens on a lw virtual address data physical address TLB page table memory cache disk.
The HENP Grand Challenge Project and initial use in the RHIC Mock Data Challenge 1 D. Olson DM Workshop SLAC, Oct 1998.
1 Lecture 20: OOO, Memory Hierarchy Today’s topics:  Out-of-order execution  Cache basics.
QlikView Sizing Walkthru - RAM. Total RAM on the QlikView Server One or more QlikView documents (QVWs) loaded on Server Unaggregated QVW data model QlikView.
Address – 32 bits WRITE Write Cache Write Main Byte Offset Tag Index Valid Tag Data 16K entries 16.
CS2100 Computer Organization
How do Computers Work ?.
Interrupts and signals
Lecture 16: Data Storage Wednesday, November 6, 2006.
Database Management Systems (CS 564)
Usecase Dynamo Moderate Requirements:
How will execution time grow with SIZE?
Google File System CSE 454 From paper by Ghemawat, Gobioff & Leung.
File Processing : Storage Media
Lecture 11: DMBS Internals
CSCI206 - Computer Organization & Programming
File Systems Kanwar Gill July 7, 2015.
File Processing : Storage Media
Lecture 22: Cache Hierarchies, Memory
Lecture 20: OOO, Memory Hierarchy
The Gamma Database Machine Project
Presentation transcript:

Scientific Data Management Research Group National Energy Research Scientific Computing Center, L B N L 1 Henrik Nordberg, June 1998 Query Estimator Henrik Nordberg Lawrence Berkeley National Laboratory

Scientific Data Management Research Group National Energy Research Scientific Computing Center, L B N L 2 Henrik Nordberg, June 1998 Purpose of the Query Estimator Provide estimates of how “big” a query is Execute a query Primary purpose: Also needs to handle: Indexing of large amounts of data Simultaneous access

Scientific Data Management Research Group National Energy Research Scientific Computing Center, L B N L 3 Henrik Nordberg, June 1998 Query Estimator Functions Build bit-sliced index, and tag index Accept multiple asynchronous query requests Quick query estimate - use bitmap in-memory index Full query estimate & execute - use tag index Invoke Query Monitor for execution Act on “query abort” and “query done”

Scientific Data Management Research Group National Energy Research Scientific Computing Center, L B N L 4 Henrik Nordberg, June 1998 Quick Estimate (use bit-sliced index) (index in memory) no_of_events: (min,max) -- nearest bin boundaries no_of_files to be cached %_of_events_in_files that qualify for a query (max) Full Estimate - Execute (use tag index) (Index on disk) precise list_of_events that qualify set of (file: event_list) total_MBs_to_be_moved no_of_events_in_cache (also files_in_cache) time_to_process_query Estimation

Scientific Data Management Research Group National Energy Research Scientific Computing Center, L B N L 5 Henrik Nordberg, June 1998 MDC-1 RAM Requirements Assumptions: 2  100,000 events 20 properties (tags) 2 bytes per property 8 MB per index = 16 MB 2  10,000 average number of hits 100 concurrent queries 8 bytes per query 16 MB for queries Total = (code) = 42 MB