| 摘要 |
<p>Methods, systems, and computer program products are provided to efficiently allocate extremely large storage spaces for use by dynamic hash tables. A contiguous storage space is designated from which dynamic hash tables can be created. These dynamic hash tables benefit from rapid allocation by being able to reserve many allocation units (each potentially comprising a large number of pages, e.g., 256 pages) within a short span of time, rather than resorting to reserving individual pages. The efficiency from allocation and the contiguous space significantly improves performance for databases in the 50 GB-100 GB size range.</p> |
