SVN performance after many revisions

by

What type of repo do you have? FSFS or BDB?

(Let’s assume FSFS for now, since that’s the default.)

In the case of FSFS, each revision is stored as a diff against the previous. So, you would think that yes, after many revisions, it would be very slow.

However, this isn’t the case. FSFS uses what are called “skip deltas” to avoid having to do too many lookups on previous revs.

(So, if you are using an FSFS repo, Brad Wilson’s answer is wrong.)

In the case of a BDB repo, the HEAD (latest) revision is full-text, but the earlier revisions are built as a series of diffs against the head. This means the previous revs have to be re-calculated after each commit.

For more info: http://svn.apache.org/repos/asf/subversion/trunk/notes/skip-deltas

P.S. Our repo is about 20GB, with about 35,000 revisions, and we have not noticed any performance degradation.

More Related Contents:

  1. How exactly does subversion store files in the repository?
  2. High-performance merging of ordered sets
  3. Google app script timeout ~ 5 minutes?
  4. What is the best approach to encapsulate blocking I/O in future-rs?
  5. Why does breaking the “output dependency” of LZCNT matter?
  6. What is the purpose of the EBP frame pointer register?
  7. Algorithm to calculate the number of divisors of a given number
  8. Why are difference lists more efficient than regular concatenation in Haskell?
  9. Analyzing Code for Efficiency?
  10. Apache Spark: map vs mapPartitions?
  11. Reading GHC Core
  12. CSS3 Transitions: Is “transition: all” slower than “transition: x”?
  13. Size of store buffers on Intel hardware? What exactly is a store buffer?
  14. Avoid stalling pipeline by calculating conditional early
  15. What’s the fastest way to merge/join data.frames in R?
  16. How to optimize vlookup for high search count ? (alternatives to VLOOKUP)
  17. Android studio takes too much memory
  18. Most efficient list to data.frame method?
  19. Tools to measure MPI communication costs [closed]
  20. Has anyone actually implemented a Fibonacci-Heap efficiently?
  21. Order of the code and performance
  22. In SQLite, do prepared statements really improve performance?
  23. MongoDB ranged pagination
  24. Why is appending to a list bad?
  25. Why is putImageData so slow?
  26. How can the rep stosb instruction execute faster than the equivalent loop?
  27. Performance of function slice parameter vs global variable?
  28. How to find Cumulative Layout Shift problems if Page Speed Insights says one thing and Search Console says another
  29. SET vs. SELECT – What’s the difference?
  30. SET vs. SELECT – What’s the difference?

Leave a Comment