Log in

No account? Create an account

(no subject)

« previous entry | next entry »
May. 3rd, 2001 | 06:15 pm

"If a file of records is updated frequently and sorted access is important, maintaining a B+ tree index with data records stored as data entries is almost always superior to maintaining a sorted file. For the space overhead of storing the index entries, we obtain all the advantages of a sorted file plus efficient insertion and deletion algorithms. B+ trees typically maintain a 67% space occupancy and are usually preferable to ISAM indexing because inserts are handled gracefully without overflow chains. However, if the dataset size and distribution remain fairly static, overflow chains may not be a major problem."


db class blows.

Link | Leave a comment |

Comments {0}