Quickly generating billion-record synthetic databases

Author:

Gray Jim1,Sundaresan Prakash1,Englert Susanne2,Baclawski Ken3,Weinberger Peter J.4

Affiliation:

1. Digital Equipment Corporation, 455 Market, San Francisco, CA

2. Tandem Computers Inc., 19333 Vallco Parkway, Cupertino, CA

3. Computer Science, Northeastern University, 360 Huntington Av. Boston, MA

4. Bell Laboratories, 600 Mountain Ave, Murry Hill, NJ

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Information Systems,Software

Reference25 articles.

1. Bitton D. DeWitt. D Turbyfill C. Source code for Wisconsin Database Generator distributed on the "Wisconsin Benchmark 'rape" Computer Science U. Wisconsin Madison wi. i984 Bitton D. DeWitt. D Turbyfill C. Source code for Wisconsin Database Generator distributed on the "Wisconsin Benchmark 'rape" Computer Science U. Wisconsin Madison wi. i984

2. Coppersmith D. et. al. "Discrete Logarithms in GF(p)" Algorithmica 1(l) 1986 pp. 1-15. 10.1007/BF01840433 Coppersmith D. et. al. "Discrete Logarithms in GF(p)" Algorithmica 1(l) 1986 pp. 1-15. 10.1007/BF01840433

3. The Gamma database machine project

Cited by 121 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. OptimusPrime: Unleash Dataplane Programmability through a Transformable Architecture;Proceedings of the ACM SIGCOMM 2024 Conference;2024-08-04

2. FlexpushdownDB: rethinking computation pushdown for cloud OLAP DBMSs;The VLDB Journal;2024-07-10

3. A Three-Tier Buffer Manager Integrating CXL Device Memory for Database Systems;2024 IEEE 40th International Conference on Data Engineering Workshops (ICDEW);2024-05-13

4. Accelerating Aggregation Using a Real Processing-in-Memory System;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

5. Scaling Up Memory Disaggregated Applications with SMART;Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 1;2024-04-17

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3