On Thu, 11 Sep 2008, Stephen R. van den Berg wrote:Did you try it? I don't particularly buy this performance argument, and the bulk of my contributions to git so far were about performances. It is quite easy to load a flat file with sorted commit SHA1s, and given that origin links are the result of a rare operation, then there shouldn't be too many entries to search through. Hell, doing 213647 lookups (and many other things like inflating zlib deflated data) with each of them for commit objects in my Linux repository which has 1355167 total entries takes only 6 seconds here, or about a quarter of a milisecond for each lookup. I doubt doing an extra lookup in a much smaller table would show on the radar. Nicolas -- To unsubscribe from this list: send the line "unsubscribe git" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html
| debian developer | Re: Dual-Licensing Linux Kernel with GPL V2 and GPL V3 |
| Greg KH | [GIT PATCH] driver core patches against 2.6.24 |
| H. Peter Anvin | Re: [PATCH] x86: Construct 32 bit boot time page tables in native format. |
| Christoph Lameter | Re: [RFC 00/15] x86_64: Optimize percpu accesses |
git: | |
| Christoph Hellwig | Re: [PATCH 06/32] IGET: Mark iget() and read_inode() as being obsolete [try #2] |
| Jarek Poplawski | Re: [PATCH] pkt_sched: Destroy gen estimators under rtnl_lock(). |
| Gerrit Renker | [PATCH 27/37] dccp: Integration of dynamic feature activation - part 2 (server side) |
| David Miller | [GIT]: Networking |
