Quickly generating billion-record synthetic databases
Authors:
Open Access
- 24 May 1994
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 23 (2) , 243-252
Abstract
Evaluating database system performance often requires generating synthetic databases—ones having certain statistical properties but filled with dummy information. When evaluating different database designs, it is often necessary to generate several databases and evaluate each design. As database sizes grow to terabytes, generation often takes longer than evaluation. This paper presents several database generation techniques. In particular it discusses: (1) Parallelism to get generation speedup and scaleup. (2) Congruential generators to get dense unique uniform distributions. (3) Special-case discrete logarithms to generate indices concurrent to the base table generation. (4) Modification of (2) to get exponential, normal, and self-similar distributions. The discussion is in terms of generating billion-record SQL databases using C programs running on a shared-nothing computer system consisting of a hundred processors, with a thousand discs. The ideas apply to smaller databases, but large databases present the more difficult problems.Keywords
This publication has 7 references indexed in Scilit:
- Limits to low-latency communication on high-speed networksACM Transactions on Computer Systems, 1993
- The Gamma database machine projectIEEE Transactions on Knowledge and Data Engineering, 1990
- A benchmark of NonStop SQL release 2 demonstrating near-linear speedup and scaleup on large databases1990
- Stochastic Simulation1987
- Discrete logarithms inGF(p)Algorithmica, 1986
- Synchronized Disk InterleavingIEEE Transactions on Computers, 1986
- A More Portable Fortran Random Number GeneratorACM Transactions on Mathematical Software, 1979