Hi all I read and debug sqlite4 codes for several days, the use of factional cascading pointer will reduce the overall key comparison numbers in the point query, but it wouldn't decease the numbers of accessed pages. In other words, say, we have L levels in the LSM tree, we will access L Pages to find the searched key in the worst case (assume all btree index pages are in memory).* It means we have to do L random IOs in the worst case*. If i understand correct about page ios, why don't use bloom filter to reduce random io?Thanks
-- View this message in context: http://sqlite.1065341.n5.nabble.com/sqlite4-LSM-storage-how-many-pages-will-be-read-in-point-search-tp71343.html Sent from the SQLite mailing list archive at Nabble.com. _______________________________________________ sqlite-users mailing list sqlite-users@sqlite.org http://sqlite.org:8080/cgi-bin/mailman/listinfo/sqlite-users
