|
>See, SQL Server breaks its queries up into chunks >based on the maximum memory in the system Now we're getting into a discussion of query optimizer design. I'm sure we can agree that _both_ Microsoft and IBM have experts that are _MUCH_ more versed in how this works than you or I. However, I would expect that both systems evaluate the where clause, open the index, lookup the keyvalue in the index, get the offset into the dataspace and then get the row from that offset. Simple enough. The index appears to store offsets into the dataspace, not addresses of the rows. (Follow the pointer trail in SST from File->Member->QDSSI row offsets around x2000 and key vales around x3FF0 working backwards) This also makes sense since we can save and restore access paths. If the address of the rows was stored they would be meaningless on a restore. So, Single-Level store or not, a database is just a byte stream. -Walden ------------ Walden H Leverich III President Tech Software (516) 627-3800 x11 (208) 692-3308 eFax WaldenL@xxxxxxxxxxxxxxx http://www.TechSoftInc.com Quiquid latine dictum sit altum viditur. (Whatever is said in Latin seems profound.)
As an Amazon Associate we earn from qualifying purchases.
This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].
Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.
midrange.com
