Thank you for your replys, but I am still not sure I understand how a Query is executed on (page) encrypted data wihout either indexing the data prior to encrption, creating a secondary hash column of the data or simply decrypting every page to get at the underlying data?
Would greatly appreciate a detailed explanation. Cory Nelson <[EMAIL PROTECTED]> wrote: On Sun, Aug 24, 2008 at 12:36 AM, Derek Developer wrote: > Well that implies that the "parsing" decrypts each page in the database for > each query. How else would it traverse a key that is encypted? > > Isn't that going to be very slow? > Are you thinking it needs to decrypt the entire database for each query? If so - that's not the case. XTS (or some method like it) is used, where each page can be decrypted by itself so you end up with the exact same amount of I/O as a non-encrypted DB. > > Cory Nelson wrote: On Sun, Aug 24, 2008 at 12:07 AM, Derek Developer > wrote: >> I am still not clear if page level encryption permits equality searches and >> range searches? >> Intuitively it would seem that these searches would require every page to be >> decrypted to access the column data for each record... >> > > no functionality is lost. pages already need to be parsed - > encryption can just be thought of as another phase of this parsing. > -- Cory Nelson _______________________________________________ sqlite-users mailing list sqlite-users@sqlite.org http://sqlite.org:8080/cgi-bin/mailman/listinfo/sqlite-users _______________________________________________ sqlite-users mailing list sqlite-users@sqlite.org http://sqlite.org:8080/cgi-bin/mailman/listinfo/sqlite-users
