GeekInterview.com
  I am new, Sign me up!
 
GeekInterview.com  >  Interview Questions  >  Database
Go To First  |  Previous Question  |  Next Question 
 Database  |  Question 24 of 69    Print  
What are the different kind of indexes other than bitmap and normal index?

  
Total Answers and Comments: 2 Last Update: October 11, 2006     Asked by: Ruchir 
  
 Sponsored Links

 
 Best Rated Answer

No best answer available. Please pick the good answer available or submit your answer.
September 23, 2006 01:39:27   #1  
opbang Member Since: March 2006   Contribution: 46    

RE: What are the different kind of indexes other than ...

Types of Indexes

There are different types of indexes that can be created on tables in a database all of which serve the same goal to improve database performance by expediting data retrieval.

Indexes can be created during table creation in some implementations. Most implementations accommodate a command aside from the CREATE TABLE command used to create indexes. You must check your particular implementation for the exact syntax for the command if any that is available to create an index.

Single-Column Indexes

Indexing on a single column of a table is the simplest and most common manifestation of an index. Obviously a single-column index is one that is created based on only one table column.

Single-column indexes are most effective when used on columns that are frequently used alone in the WHERE clause as query conditions. Good candidates for a single-column index are an individual identification number a serial number or a system-assigned key.

Unique Indexes

Unique indexes are used not only for performance but also for data integrity. A unique index does not allow any duplicate values to be inserted into the table. Otherwise the unique index performs the same way a regular index performs.

A unique index can only be created on a column in a table whose values are unique. In other words you cannot create a unique index on an existing table with data that already contains records on the indexed key.

Composite Indexes

A composite index is an index on two or more columns of a table. You should consider performance when creating a composite index because the order of columns in the index has a measurable effect on data retrieval speed. Generally the most restrictive value should be placed first for optimum performance. However the columns that will always be specified should be placed first.

Composite indexes are most effective on table columns that are used together frequently as conditions in a query's WHERE clause.

Single-Column Versus Composite Indexes

In deciding whether to create a single-column index or a composite index take into consideration the column(s) that you may use very frequently in a query's WHERE clause as filter conditions. Should there be only one column used a single-column index should be the choice. Should there be two or more columns that are frequently used in the WHERE clause as filters a composite index would be the best choice.

Implicit Indexes

Implicit indexes are indexes that are automatically created by the database server when an object is created. Indexes are automatically created for primary key constraints and unique constraints. Why are indexes automatically created for these constraints? Imagine that you are the database server. A user adds a new product to the database. The product identification is the primary key on the table which means that it must be a unique value. To efficiently check to make sure the new value is unique among hundreds or thousands of records the product identifications in the table must be indexed. Therefore when you create a primary key or unique constraint an index is automatically created for you.


 
Is this answer useful? Yes | No
October 11, 2006 02:03:52   #2  
Sri        

RE: What are the different kind of indexes other than ...

Other than those mentioned above the different indexes are

1)Clustered

Requires the date to be sorted

we can create 1 clustered

2)Non-Clustered

doesnt require the data to be sorted

We can create 249 non-clustered indexes


 
Is this answer useful? Yes | No

 Related Questions

Latest Answer : Normalization is based on the functional dependency and primary key.1NF- Attribute should be atomic value and there must be no composite attribute, no multivalued attribute and no relation with in relation. By default what ever relation we are creating ...
Read Answers (7) | Asked by : anandm

Latest Answer : For Indexes you can use :DBA_INDEXESALL_INDEXESUSER_INDEXESFor Constraint you can use :DBA_CONSTRAINTSALL_CONSTRAINTSUSER_CONSTRAINTSFor index upon which table and which column you can query on:DBA_CONS_COLUMNSALL_CONS_COLUMNSUSER_CONS_COLUMNS ...
Read Answers (1) | Asked by : Arti Gupta

Latest Answer : These answers are probably all correct---if it's SQLServer or Sybase. I don't think the DBMS was identified and for sure the data dictionary/relational catalog/system tables are not standard in naming or contents.For instance in DB2 it's SYSIBM.SYSINDEXES ...
Read Answers (5) | Asked by : vcppvenkat

What is the difference between a stored procedure and a view? why do we use views from SQL Server point of view? What are mutating triggers? How is the structure of a bit map index, clustered, Non clustered and B Tree What re mutating triggers? Can a stored procedure a record set? Can we use DTS on a client machine to schedule jobs and consolidate data to a sql tables? Can we have an update trigger within another update trigger?
Read Answers (5) | Asked by : mak1600

Latest Answer : There are restrictions on indexed views in SQL server such as the columns are not nullable. ...
Read Answers (2) | Asked by : Ruchir Jain

Latest Answer : Other than those mentioned above the different indexes are1)ClusteredRequires the date to be sortedwe can create 1 clustered2)Non-Clustereddoesnt require the data to be sortedWe can create 249 non-clustered indexes ...
Read Answers (2) | Asked by : Ruchir

Latest Answer : A  Hash index stores key value pairs based on a pseudo randomizing function called hash functionA B+- Tree is a balanced tree whose leaves contain a sequence of key pointer pairs.- Use a hash index for point queries only. Use a B- Tree if multipoint ...
Read Answers (1) | Asked by : KPIZME

Latest Answer : no up to 3nf it is not sufficient to normilize...coz 3nf contains redundancy problem....that can be removed by BCNF...so up to BCNF it is sufficient..... ...
Read Answers (2) | Asked by :


 Sponsored Links

 
Related Articles

Using XMLType for Handling XML Data in the Database

Using XMLType for Handling XML Data in the Database Being an object type XMLType can not only be used to store XML data in the database but also to operate on that data via its built in methods Regardless of the storage model you choose XMLType provides a set of XML specific methods to operate on XM
 

Using Oracle Database for Storing, Modifying, and Retrieving XML Data

Using Oracle Database for Storing Modifying and Retrieving XML Data With Oracle XML DB you have various XML storage and XML processing options allowing you to achieve the required level of performance and scalability One of the most interesting things about Oracle XML DB is that it allows you to per
 

Performing XSLT Transformations inside the Database

Performing XSLT Transformations inside the Database Now that you have the employees XSL stylesheet stored in the database and the xmlusr schema is permitted to access the hr employees table you can create a script that will instruct the database to build an HTML page based on the data stored in hr e
 

Moving All the XML Processing into the Database

Moving All the XML Processing into the Database In the preceding example the database server performs only a part of the XML processing while the rest is still performed by the PHP engine Specifically the database server generates an employees XML document based on the records from the hr employees
 

Performing XML Processing inside the Database

Performing XML Processing inside the Database When building XML enabled applications on top of Oracle there are many advantages to performing the XML processing inside the database when compared to performing it on the client The key advantages to perform XML processing inside the database are as fo
 

What is Bit Mapped Index

Bit Map Indexing is a technique commonly used in relational databases where the application uses binary coding in representing data. This technique was originally used for low cardinality data but recent applications like the Sybase IQ have used this technique efficiently. The word cardinality is
 

What is Operational Database

Operational Database is the database-of-record, consisting of system-specific reference data and event data belonging to a transaction-update system. It may also contain system control data such as indicators, flags, and counters. The operational database is the source of data for the data warehouse
 

Evolution of database systems

The Evolution of Database systems File Management System Hierarchical database System  Network Database System  Relational Database System File Management System: The file management system also called as FMS in short is one in which all data is stored on a singl
 

Database Concurrency and Reliability

Database Concurrency and Reliability Overview Concurrency and reliability have long been “hot topics” of discussion among developers and users of distributed systems. The fundamental problem can be seen in a simple example, as follows. Suppose two users are working on the same
 

Database Interaction

Database Interaction Efficient interaction, efficient storage, and efficient processing are the three key properties of a successful database platform. In this article, we explore the first: efficient interaction. Interaction Category 1: Command Line Clients Many database platforms are shipped with
 

About Us -  Privacy Policy -  Terms and Conditions -  Contact -  Ask Question -  Propose Category -  Site Updates 

Copyright © 2005 - 2009 GeekInterview.com. All Rights Reserved

Page copy protected against web site content infringement by Copyscape