> -----Original Message----- > From: D. Richard Hipp [mailto:[EMAIL PROTECTED] > > You can step straight through the index in linear time. But > for each index entry you encounter, you have to look up a > record in the main table in order to get the data. It's the > second step, the table lookup, that takes O(logN).
This makes me wonder something - I had always assumed that once you had the OID for a row in a table, looking up the data was an O(1) operation, not O(logN). I'm probably displaying my ignorance of database implementation principles (feel free to point me to a reference if so), but is it not possible to store the table in a compacted-by-OID form that would make row-by-OID lookups O(1) operations? -Ken --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
