Relational database management, Database Management System

Assignment Help:

For this application, we will consider IBM DB2 catalog data (i.e., metadata) for IBM's enterprise-class servers running the z/OS (formerly OS/390 or MVS) operating system.  One of the outcomes of this question is to give you some experience in actually exploring the contents of what's in an RDBMS catalog.  This will also  give us a head start in thinking about query optimization-a major part of this course.

Go to this Web site: 

SYSIBM.SYSCOLUMNS

SYSIBM.SYSCOPY

SYSIBM.SYSDATABASE

SYSIBM.SYSDBRM

SYSIBM.SYSINDEXES

SYSIBM.SYSINDEXPART

SYSIBM.SYSPLAN

SYSIBM.SYSTABLEPART

SYSIBM.SYSTABLES

SYSIBM.SYSTABLESPACE

SYSIBM.SYSTABLESPACESTATS

In this course, we will frequently encounter a program that is a crucial component of an RDBMS.  That program is called an optimizer.  It tries to determine the optimal access path when accessing (e.g., retrieving) data in a database.  An optimizer obtains statistics or metadata (i.e., data about data) from a data repository in the DBMS called a catalog.  The catalog will have information about the columns of tables and indices; the number of rows in a table; the numbers, types, and (possibly) distribution of values for columns in  the tables; and literally hundreds of other pieces of information.


Related Discussions:- Relational database management

find a non-redundant cover and canonical cove, Given the following set of ...

Given the following set of functional dependencies {cf→ bg, g → d, cdg → f, b → de, d → c} defined on R(b,c,d,e,f,g) a. Is cf→ e implied by the FDs? b. Is dg a superkey?

Give some encryption techniques, Give some encryption techniques? A)  D...

Give some encryption techniques? A)  DES  B) AES  C) Public key encryption

Explain candidate key and super key, Explain Candidate Key and Super Key ...

Explain Candidate Key and Super Key A super key is a set of one or more than attributes that, taken collectively, permits us to identify uniquely a tuple in the relation. Wher

Define outer union operation of the relational algebra, Define outer union ...

Define outer union operation of the relational algebra. Compute the outer union for the relations R and S given below. Outer Join - If there are any values in one tabl

Two approaches to store relations in distributed database, What are the two...

What are the two approaches to store relations in distributed database? a) Replication b) Fragmentation

Sql, example of embedded SQL query

example of embedded SQL query

A b-tree of order how much children m has maximum, A B-tree of order how mu...

A B-tree of order how much children m has maximum ? m has maximum m mchildren in a B tree.

What is disadvantage of multiple inheritances, What is disadvantage of mult...

What is disadvantage of multiple inheritances? There is potential ambiguity if the similar variable or method can be inherited from more than one superclass.eg: student class m

Define the immediate update, Define the Immediate Update The immediate...

Define the Immediate Update The immediate update methods may apply changes to the database on disk before the transaction arrives a successful conclusion. Though, these change

What are partial and natural key, What are partial, alternate,, artificial,...

What are partial, alternate,, artificial, compound and natural key? Partial Key: It is a set of attributes that can uniquely recognize weak entities and that are related to s

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd