| 摘要 |
In a database system that stores database objects in partitioned mode using bins to represent storage locations at which individual records of an object are stored, after they have been partitioned into logical buckets, a cascaded round-robin mapping method assigns buckets to bins evenly, while minimizing the movement of buckets when new bins are added and while minimizing memory overhead requirements. The method includes entering a do loop for an index counter variable j=m to 0 by -1, wherein "m" is the number of times new bins have been added since the last database reorganization. A variable y is set equal to x modulo nj, wherein nj is the number of bins after the jth database expansion. If y>/=nj-1, y is established to be the bin identification. Buckets are moved to populate new bins based on modulo n+k, wherein k is the number of bins added in the current expansion.
|
