Forecasting the cost of processing multi-join queries via hashing for main-memory databases (Extended version)

Abstract

Database management systems (DBMSs) carefully optimize complex multi-join queries to avoid expensive disk I/O. As servers today feature tens or hundreds of gigabytes of RAM, a significant fraction of many analytic databases becomes memory-resident. Even after careful tuning for an in-memory environment, a linear disk I/O model such as the one implemented in… (More)
DOI: 10.1145/2806777.2806944

Topics

14 Figures and Tables

Statistics

050100150201520162017
Citations per Year

Citation Velocity: 25

Averaging 25 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@inproceedings{Liu2015ForecastingTC, title={Forecasting the cost of processing multi-join queries via hashing for main-memory databases (Extended version)}, author={Feilong Liu and Spyros Blanas}, booktitle={SoCC}, year={2015} }