Adaptive Multi-Grained Buffer Management for Database Systems
The traditional page-grained buffer manager in database systems has a low hit ratio when only a few tuples within a page are frequently accessed. To handle this issue, this paper proposes a new buffering scheme called the AMG-Buffer (Adaptive Multi-Grained Buffer). AMG-Buffer proposes to use two pag...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-11-01
|
| Series: | Future Internet |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1999-5903/13/12/303 |
| _version_ | 1797504504480923648 |
|---|---|
| author | Xiaoliang Wang Peiquan Jin |
| author_facet | Xiaoliang Wang Peiquan Jin |
| author_sort | Xiaoliang Wang |
| collection | DOAJ |
| description | The traditional page-grained buffer manager in database systems has a low hit ratio when only a few tuples within a page are frequently accessed. To handle this issue, this paper proposes a new buffering scheme called the AMG-Buffer (Adaptive Multi-Grained Buffer). AMG-Buffer proposes to use two page buffers and a tuple buffer to organize the whole buffer. In this way, the AMG-Buffer can hold more hot tuples than a single page-grained buffer. Further, we notice that the tuple buffer may cause additional read I/Os when writing dirty tuples into disks. Thus, we introduce a new metric named <i>clustering rate</i> to quantify the hot-tuple rate in a page. The use of the tuple buffer is determined by the clustering rate, allowing the AMG-Buffer to adapt to different workloads. We conduct experiments on various workloads to compare the AMG-Buffer with several existing schemes, including LRU, LIRS, CFLRU, CFDC, and MG-Buffer. The results show that AMG-Buffer can significantly improve the hit ratio and reduce I/Os compared to its competitors. Moreover, the AMG-Buffer achieves the best performance on a dynamic workload as well as on a large data set, suggesting its adaptivity and scalability to changing workloads. |
| first_indexed | 2024-03-10T04:05:31Z |
| format | Article |
| id | doaj.art-8f478ff0e2034eb6b4ecf01da86dc37d |
| institution | Directory Open Access Journal |
| issn | 1999-5903 |
| language | English |
| last_indexed | 2024-03-10T04:05:31Z |
| publishDate | 2021-11-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Future Internet |
| spelling | doaj.art-8f478ff0e2034eb6b4ecf01da86dc37d2023-11-23T08:25:02ZengMDPI AGFuture Internet1999-59032021-11-01131230310.3390/fi13120303Adaptive Multi-Grained Buffer Management for Database SystemsXiaoliang Wang0Peiquan Jin1School of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, ChinaSchool of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, ChinaThe traditional page-grained buffer manager in database systems has a low hit ratio when only a few tuples within a page are frequently accessed. To handle this issue, this paper proposes a new buffering scheme called the AMG-Buffer (Adaptive Multi-Grained Buffer). AMG-Buffer proposes to use two page buffers and a tuple buffer to organize the whole buffer. In this way, the AMG-Buffer can hold more hot tuples than a single page-grained buffer. Further, we notice that the tuple buffer may cause additional read I/Os when writing dirty tuples into disks. Thus, we introduce a new metric named <i>clustering rate</i> to quantify the hot-tuple rate in a page. The use of the tuple buffer is determined by the clustering rate, allowing the AMG-Buffer to adapt to different workloads. We conduct experiments on various workloads to compare the AMG-Buffer with several existing schemes, including LRU, LIRS, CFLRU, CFDC, and MG-Buffer. The results show that AMG-Buffer can significantly improve the hit ratio and reduce I/Os compared to its competitors. Moreover, the AMG-Buffer achieves the best performance on a dynamic workload as well as on a large data set, suggesting its adaptivity and scalability to changing workloads.https://www.mdpi.com/1999-5903/13/12/303buffer managementreplacement algorithmmulti-grained bufferadaptive buffer |
| spellingShingle | Xiaoliang Wang Peiquan Jin Adaptive Multi-Grained Buffer Management for Database Systems Future Internet buffer management replacement algorithm multi-grained buffer adaptive buffer |
| title | Adaptive Multi-Grained Buffer Management for Database Systems |
| title_full | Adaptive Multi-Grained Buffer Management for Database Systems |
| title_fullStr | Adaptive Multi-Grained Buffer Management for Database Systems |
| title_full_unstemmed | Adaptive Multi-Grained Buffer Management for Database Systems |
| title_short | Adaptive Multi-Grained Buffer Management for Database Systems |
| title_sort | adaptive multi grained buffer management for database systems |
| topic | buffer management replacement algorithm multi-grained buffer adaptive buffer |
| url | https://www.mdpi.com/1999-5903/13/12/303 |
| work_keys_str_mv | AT xiaoliangwang adaptivemultigrainedbuffermanagementfordatabasesystems AT peiquanjin adaptivemultigrainedbuffermanagementfordatabasesystems |