توضیحات
ABSTRACT
When a working set fits into memory, the overhead imposed by the buffer pool renders traditional databases noncompetitive with in-memory designs that sacrifice the benefits of a buffer pool. However, despite the large memory available with modern hardware, data skew, shifting workloads, and complex mixed workloads make it diffcult to guarantee that a working set will fit in memory. Hence, some recent work has focused on enabling in-memory databases to protect performance when the working data set almost fits in memory. Contrary to those prior efforts, we enable buffer pool designs to match in-memory performance while supporting the “big data” workloads that continue to require secondary storage, thus providing the best of both worlds. We introduce here a novel buffer pool design that adapts pointer swizzling for references between system objects (as opposed to application objects), and uses it to practically eliminate buffer pool overheads for memoryresident data. Our implementation and experimental evaluation demonstrate that we achieve graceful performance degradation when the working set grows to exceed the buffer pool size, and graceful improvement when the working set shrinks towards and below the memory and buffer pool sizes
INTRODUCTION
Database systems that use a buer pool to hold in-memory copies of the working data enjoy a number of benets. They can very eciently manage working sets that far exceed available memory. They oer natural support for writeahead logging They are somewhat insulated from cache coherence issues. However, a buer pool imposes a layer of indirection that incurs a signicant performance cost. In particular, page identiers are required to locate the page regardless of whether it is in memory or on disk
Year : 2014
By : Goetz Graefe , Haris Volos ,Hideaki Kimura
Publisher : Article
File Information : English Language /12 Page / Size : 1.6 M
Download : click
سال : 2014
کاری از : Goetz Graefe , Haris Volos ,Hideaki Kimura
ناشر : Article
اطلاعات فایل : زبان انگلیسی / 12 صفحه /حجم : 1.6 M
لینک دانلود : روی همین لینک کلیک کنید
نقد و بررسیها
هنوز بررسیای ثبت نشده است.