20. B+ Tree
The B-tree is a generalization of a binary
search tree in that a node can have more than
two children
Order of B-Tree= max no of child nodes
The left subtree of a node contains only nodes
with keys less than the node's key.
he right subtree of a node contains only nodes
with keys greater than the node's key.
21.
22. A database index improves data
retrieval operations but they come up
with the cost.
slower writes and the use of more
storage space.
3 Gigabytes of collection, if you have 1 index,
approx it uses 500 Mb for that index
29. TAKE AWAY...
Index Datastructure
Index Cardinality
Indexing is not the only solution to improve the
performance
30. Points to consider while creating
index
Keys (columns) frequently involved in search
conditions of a query
Indexes can be created on Array, Sub-
documents and also Embedded Fields
Use Indexes to Sort Query Results
Queries that return a range of values using
operators such as $gt,$lt
Negation: Inequality queries are inefficient with
respect to indexes