Re: Git's database structure
- From
Jon Smirl <jonsmirl@gmail.com>
- Date
- Sep 4, 2007, 16:47 UTC
- Message-ID
- <9e4733910709040947ia32bda4i6e30efb2d7848308@mail.gmail.com>
- In-Reply-To
- <46DD887D.3090508@op5.se>
On 9/4/07, Andreas Ericsson <ae@op5.se> wrote:
Show 12 quoted lines
> Jon Smirl wrote: > > Another way of looking at the problem, > > > > Let's build a full-text index for git. You put a string into the index > > and it returns the SHAs of all the file nodes that contain the string. > > How do I recover the path names of these SHAs? > > > > I wouldn't know, but presumably any table can have more than one column. > > Is this a problem you face with git so often that it requires a complete > re-design of its very core?
That's the whole point. We need to discuss the impact of merging a field (path names) with an index (tree nodes) has on future things we may want to do with the data stored in git.
Databases don't usually blend fields/indexes without also duplicating the field in the table. You need all the fields in the table so that it is possible to create indexes on other fields.
Show 6 quoted lines
> > -- > Andreas Ericsson andreas.ericsson@op5.se > OP5 AB www.op5.se > Tel: +46 8-230225 Fax: +46 8-230231 >
-- Jon Smirl jonsmirl@gmail.com