From: Nguyen Thai Ngoc Duy Date: Wed, 21 Mar 2012 10:34:15 GMT Subject: Re: [GSoC] Designing a faster index format Message-ID: In-Reply-To: <8D287169-1AD9-4586-BDBC-F820220328FC@gmail.com> On Wed, Mar 21, 2012 at 4:22 PM, Thomas Gummerer wrote: > > On Mar 21, 2012, at 2:29 AM, Nguyen Thai Ngoc Duy wrote: > >> On Wed, Mar 21, 2012 at 4:17 AM, Thomas Gummerer wrote: >>> There are some questions I would have about the project. >>> Has there already been any development or thoughts in that direction? >> >> Tree-based format seems to be favored by core developers, for example >> in the footnote in [1]. But there have been no attempts to realize it. >> You may want to search mail archive for more. >> > > Thanks for your answer, so I would probably implement a tree based structure. There may be a better approach, maybe a simple database format that we could immitate. It's up to you to find out :) > However I got one more question, since I'm not yet really familiar with the > code and internal structure of git, what exactly does the SHA1 over the > index exactly achieve? Is it only for checking if the index is still correct > for the next time it is used and has not been changed or is there a more > important function of it? It makes sure the index is not corrupt (by disk faults for example). I don't think it is used for anything else. Cheaper checksum can be used if good enough for the index. See http://thread.gmane.org/gmane.comp.version-control.git/190016 and the following reply. -- Duy