Managing Query Compilation Memory Consumption to Improve DBMS Throughput

Boris Baryshnikov; Cipri Clinciu; Conor Cunningham; Leo Giakoumakis; Slava Oks; Stefano Stefani

REVIEW

Managing Query Compilation Memory Consumption to Improve DBMS Throughput

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv cs/0612112 v1 pith:ZFX3BOYR submitted 2006-12-21 cs.DB

Managing Query Compilation Memory Consumption to Improve DBMS Throughput

Boris Baryshnikov , Cipri Clinciu , Conor Cunningham , Leo Giakoumakis , Slava Oks , Stefano Stefani This is my paper

classification cs.DB

keywords memoryquerythroughputcompilationdatabasedbmsrequestssolution

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

While there are known performance trade-offs between database page buffer pool and query execution memory allocation policies, little has been written on the impact of query compilation memory use on overall throughput of the database management system (DBMS). We present a new aspect of the query optimization problem and offer a solution implemented in Microsoft SQL Server 2005. The solution provides stable throughput for a range of workloads even when memory requests outstrip the ability of the hardware to service those requests.

Managing Query Compilation Memory Consumption to Improve DBMS Throughput

discussion (0)