ppt课件-i s a m indexed- sequential- access- method（我是个索引顺序-访问方法）.pptVIP

ISAM: Indexed-Sequential-Access-Method A Note of Caution ISAM is an old-fashioned idea B+-trees are usually better, as we’ll see Though not always But, it’s a good place to start Simpler than B+-tree, but many of the same ideas Upshot Don’t brag about being an ISAM expert on your resume Do understand how they work, and tradeoffs with B+-trees Range Searches ``Find all students with gpa 3.0’’ If data is in sorted file, do binary search to find first such student, then scan to find others. Cost of binary search can be quite high. Simple idea: Create an `index’ file. Level of indirection again