I’m aware that there probably isn’t a “perfect” solution to my question (this sounds like a variation of the knapsack or the bin packing problem), but here’s my scenario:
I want to divide a list of SQL database tables into n (let’s say 7) roughly equally-sized piles (so I can spread some maintenance tasks roughly equally across an entire week).
Let’s say I have 100 tables (this could be higher or lower, but not likely higher than 5000), ranging from size 1 to size 10,000,000 (larger tables are much less common, of course).
My original idea was to sort the tables alphabetically (pseudo-randomly) then walk through from the beginning, moving to the next group when the total exceeds Sum(Size)/7. For some databases, this will probably work fine, but if two giant tables are right next to each other, then this makes for very unequal groups. (This isn’t as unlikely as it sounds, consider two huge tables, Account_History and Account_History_Archive).
Are there any generally accepted techniques for this, that give “good” results with a variety of source data? I’d lean toward a simpler technique rather than a more precise grouping (if the maintenance runs slightly longer on some days than others, its not that big of deal).
How about sorting the tables by size, then for each table, put it into the day that currently has the smallest total number of rows in it? This means the biggest 7 tables will first spread across the days. Then the 8th biggest will go with the smallest of the first 7, etc. You’ll continue to fill in the day with the least amount of work scheduled to it.
Where the little reference tables end up finally probably does not make much difference.
You could invent scenarios where this is no good, but I expect it will work in practice without being too complicated.