*** 54,59 **** --- 54,63 ---- terms of both space and speed to support Bitmap Indexes rather than b-tree based data structures. + **Hash Indexes** + + When dealing with high-selectivity columns it would be useful in terms of both disk I/O and space to support Hashed Indexes rather than b-tree based data structures. A side-effect of this choice would be that _in_order_ retrieval of this column could not use the index. + **More Efficient Disk Format to Accomodate Random Access to BLOBs** SQLite currently has to read the entire BLOB into memory to manipulate
Small. Fast. Reliable.
Choose any three.
Choose any three.
|
|