Hash indices:<\/strong> Indices are based on the values being distributed uniformly across a range of buckets. The buckets to which a value is assigned is determined by function called a hash function.<\/li>\n<\/ol>\nB+Tree indexing is a method of accessing and maintaining data. It should be used for large files that have unusual, unknown, or changing distributions because it reduces I\/O processing when files are read. Also consider B+Tree indexing for files with long overflow chains.\u00a0The prime block of the B+<\/sup>Tree index file (also called the root node) is pointed to by the header in the prime block of the B+<\/sup>Tree data file.<\/p>\n![\"\"](\"http:\/\/minervadb.com\/wp-content\/uploads\/2019\/07\/Screenshot-2019-07-25-at-1.17.00-AM-1024x402.png\")
<\/p>\n