Creation of indexes, Database Management System

Assignment Help:

Creation of Indexes

Automatically: When a primary key or Unique constraint is show in a table definition then a unique index is formed automatically.

Manually: User can form non-unique indexes on columns to speed up access time to rows.

Example: The following commands produce index on employee name and employee name + department number respectively.

CREATE INDEX EMP_ENAME_IDX ON EMP (ENAME);

CREATE INDEX EMP_MULTI_IDX ON EMP (ENAME, DEPTNO);

Finding facts about created indexes: The data dictionary have the name of index, table name and column names. For instance, in Oracle a user-indexes and user-ind-columns see contains the details about user formed indexes.

Remove an index from the data dictionary:

DROP INDEX EMP_ENAME_IDX;

Indexes cannot be modified.


Related Discussions:- Creation of indexes

Define single value and multivalued attribute, Define Single Value and Mult...

Define Single Value and Multivalued attribute Single value attribute comprise a single atomic value for an entity and multivalued attribute may have much more than one value f

Define atomicity and aggregation, Atomicity : Either all functions are lai...

Atomicity : Either all functions are laid out or none are. Users could not have to think about the effect of incomplete operations. DBMS ensures this by undoing the functions

Write a program within embedded sql to associative relation, Write a progra...

Write a program within embedded SQL to associative the total trip expenses of the salesman named ‘John' for the relations. EXEC SQL BEGIN DECLARE SECTION; long total_expenses;

Design a database table, A database named yourusernameFMA has been set up f...

A database named yourusernameFMA has been set up for you to use for this assignment.  For the FMA you must create the required tables and run the queries using this database.  If y

Describe hashing in dbms, Describe Hashing in DBMS? Hashing: Hashing ...

Describe Hashing in DBMS? Hashing: Hashing is a technique to store data within an array so which storing, searching, inserting and deleting data is fast (in theory it's O(1))

Abstract data structures, The C_Artist  application will be developed using...

The C_Artist  application will be developed using the C language (C99 standards) and will be able to compile without warnings and link and run in the Swinburne computer laboratorie

Design an algorithm to implement operations, Design an algorithm to impleme...

Design an algorithm to implement operations  Each and every operation specified in the functional model could be formulated as an algorithm. The algorithm indicates how operat

How does query tree represent relational algebra expression, How does a que...

How does a query tree represent a relational algebra expression?  Discuss any three rules for query optimisation, giving example as to when should each rule be applied.     Ans

What is a query tree, What is a query tree?     Ans:  A query tree, as ...

What is a query tree?     Ans:  A query tree, as well known as operator graph, is a tree data structure that corresponds to a relational algebra expression. It denotes the inpu

Data definition language, Data Definition Language It organises the dat...

Data Definition Language It organises the data in the form of columns and rows. But what does the data field column of table accumulate? How do you describe it using SQL? Th

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