What types of index data structures can you have?

Question :

What types of index data structures can you have?

An index helps to faster search values in tables. The three most commonly used index-types are: - B-Tree: builds a tree of possible values with a list of row IDs that have the leaf value. Needs a lot of space and is the default index type for most databases. - Bitmap: string of bits for each possible value of the column. Each bit string has one bit for each row. Needs only few space and is very fast.(however, domain of value cannot be large, e.g. SEX(m,f); degree(BS,MS,PHD) - Hash: A hashing algorithm is used to assign a set of characters to represent a text string such as a composite of keys or partial keys, and compresses the underlying data. Takes longer to build and is supported by relatively few databases.

Similar Questions

•  What is Django's middleware and how is it used?
  

• What are comments? Name the different types of comments used in Java.
• What are syntax errors? Give two examples.
• What are the different type of errors that may occur in a Java program?
• What is a bug? What is debugging?
• What is an accumulator?
• What is an expression?
• What is an operator? How is the classification of operators based upon?
• What is Type Conversion? Name the two type conversions in Java.
• What are separators?
• How are Decimal, Octal and Hexadecimal integer literals represented in Java?
• State two conventions you should follow while naming a class.
• What two conventions you should follow naming a class?
• State two rules you should follow for naming a class
• Why is a class called an object factory?
• What is an access specifier? Which two access specifier is used in a class declaration?
• Why is a class called a user defined data type?
• State two differences between a class and an object.
• State two differences between fundamental and user-defined data type.
• Explain the statement “Byte code is the object code for the JVM”