some more indexing thoughts..

[Aaron Bentley]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Robert Collins wrote:
>  - whats the win by having a topologically sorted revision graph index
> e.g. make finding a revid a linear scan then have topological data from
> there on in. This would give great locality of reference for 'recent'
> data in any index for determining merge bases and the like.

One side-effect of such an index, (compared with one that provides fast
random access to any revision) is that it becomes fairly expensive to
determine that a revision is not present in a repository.

Perhaps a bloom filter would help there?

Aaron
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.6 (GNU/Linux)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org

iD8DBQFGm61j0F+nu1YWqI0RAqpCAJ4uJGRhvQ7+N4TbZQk2PXrNeMRclgCfXjL+
SiKpW41fs0IPjaggaOOMeRc=
=BxMy
-----END PGP SIGNATURE-----