专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08712984B2 Buffer pool extension for database server 有权
标题翻译：数据库服务器的缓冲池扩展
公开(公告)号：US08712984B2
公开(公告)日：2014-04-29
申请号：US12717139
申请日：2010-03-04
申请人： Chengliang Zhang , Sadashivan Krishnamurthy , Georgiy I. Reynya , Alexandre Verbitski , Pedro Celis , Dexter Paul Bradshaw
发明人： Chengliang Zhang , Sadashivan Krishnamurthy , Georgiy I. Reynya , Alexandre Verbitski , Pedro Celis , Dexter Paul Bradshaw
IPC分类号： G06F17/30
CPC分类号： G06F3/0656 , G06F3/061 , G06F3/0653 , G06F3/0688 , G06F12/121
摘要： Aspects of the subject matter described herein relate to a buffer pool for a database system. In aspects, secondary memory such as solid state storage is used to extend the buffer pool of a database system. Thresholds such as hot, warm, and cold for classifying pages based on access history of the pages may be determined via a sampling algorithm. When a database system needs to free space in a buffer pool in main memory, a page may be evicted to the buffer pool in secondary memory or other storage based on how the page is classified and conditions of the secondary memory or other storage.
摘要翻译：本文描述的主题的方面涉及数据库系统的缓冲池。在方面，诸如固态存储的辅助存储器用于扩展数据库系统的缓冲池。可以通过采样算法来确定基于页面访问历史的用于对页面进行分类的诸如热，暖和冷等的阈值。当数据库系统需要释放主内存中的缓冲池中的空间时，可能会根据页面的分类和辅助内存或其他存储的条件，将页面逐出驱动到辅助内存或其他存储中的缓冲池。

2. 发明授权

US09235531B2 Multi-level buffer pool extensions 有权
标题翻译：多级缓冲池扩展
公开(公告)号：US09235531B2
公开(公告)日：2016-01-12
申请号：US13305670
申请日：2011-11-28
申请人： Pedro Celis , Dexter Paul Bradshaw , Sadashivan Krishnamurthy , Georgiy I. Reynya , Chengliang Zhang , Hanumantha Rao Kodavalla
发明人： Pedro Celis , Dexter Paul Bradshaw , Sadashivan Krishnamurthy , Georgiy I. Reynya , Chengliang Zhang , Hanumantha Rao Kodavalla
IPC分类号： G06F12/00 , G06F12/12 , G06F9/45 , G06F12/08
CPC分类号： G06F12/121 , G06F8/4442 , G06F12/08 , G06F12/0866 , G06F12/0893 , G06F12/0897 , G06F12/12
摘要： A buffer manager that manages blocks of memory amongst multiple levels of buffer pools. For instance, there may be a first level buffer pool for blocks in first level memory, and a second level buffer pool for blocks in second level memory. The first level buffer pool evicts blocks to the second level buffer pool if the blocks are not used above a first threshold level. The second level buffer pool evicts blocks to a yet lower level if they have not used above a second threshold level. The first level memory may be dynamic random access memory, whereas the second level memory may be storage class memory, such as a solid state disk. By using such a storage class memory, the working block set of the buffer manager may be increased without resorting to lower efficiency random block access from yet lower level memory such as disk.
摘要翻译：缓冲管理器，用于管理多级缓冲池中的内存块。例如，可能存在第一级存储器中的块的第一级缓冲池，以及用于第二级存储器中的块的第二级缓冲池。如果不在第一阈值级别以上使用块，则第一级缓冲池将块移动到第二级缓冲池。如果第二级缓冲池没有使用高于第二阈值级别，那么第二级缓冲池将块移动到较低级别。第一级存储器可以是动态随机存取存储器，而第二级存储器可以是诸如固态盘的存储类存储器。通过使用这样的存储类存储器，可以增加缓冲器管理器的工作块集，而不需要从低级存储器（例如盘）获得较低效率的随机数据块访问。

3. 发明申请

US20120072652A1 MULTI-LEVEL BUFFER POOL EXTENSIONS 有权
标题翻译：多级缓冲池扩展
公开(公告)号：US20120072652A1
公开(公告)日：2012-03-22
申请号：US13305670
申请日：2011-11-28
申请人： Pedro Celis , Dexter Paul Bradshaw , Sadashivan Krishnamurthy , Georgiy I. Reynya , Chengliang Zhang , Hanumantha Rao Kodavalla
发明人： Pedro Celis , Dexter Paul Bradshaw , Sadashivan Krishnamurthy , Georgiy I. Reynya , Chengliang Zhang , Hanumantha Rao Kodavalla
IPC分类号： G06F12/00
CPC分类号： G06F12/121 , G06F8/4442 , G06F12/08 , G06F12/0866 , G06F12/0893 , G06F12/0897 , G06F12/12
摘要： A buffer manager that manages blocks of memory amongst multiple levels of buffer pools. For instance, there may be a first level buffer pool for blocks in first level memory, and a second level buffer pool for blocks in second level memory. The first level buffer pool evicts blocks to the second level buffer pool if the blocks are not used above a first threshold level. The second level buffer pool evicts blocks to a yet lower level if they have not used above a second threshold level. The first level memory may be dynamic random access memory, whereas the second level memory may be storage class memory, such as a solid state disk. By using such a storage class memory, the working block set of the buffer manager may be increased without resorting to lower efficiency random block access from yet lower level memory such as disk.
摘要翻译：缓冲管理器，用于管理多级缓冲池中的内存块。例如，可能存在第一级存储器中的块的第一级缓冲池，以及用于第二级存储器中的块的第二级缓冲池。如果不在第一阈值级别以上使用块，则第一级缓冲池将块移动到第二级缓冲池。如果第二级缓冲池没有使用高于第二阈值级别，那么第二级缓冲池将块移动到较低级别。第一级存储器可以是动态随机存取存储器，而第二级存储器可以是诸如固态盘的存储类存储器。通过使用这样的存储类存储器，可以增加缓冲器管理器的工作块集，而不需要从低级存储器（例如盘）获得较低效率的随机数据块访问。

4. 发明申请

US20110219169A1 Buffer Pool Extension for Database Server 有权
标题翻译：数据库服务器缓冲池扩展
公开(公告)号：US20110219169A1
公开(公告)日：2011-09-08
申请号：US12717139
申请日：2010-03-04
申请人： Chengliang Zhang , Sadashivan krishnamurthy , Georgiy I. Reynya , Alexandre Verbitski
发明人： Chengliang Zhang , Sadashivan krishnamurthy , Georgiy I. Reynya , Alexandre Verbitski
IPC分类号： G06F12/00 , G06F12/02 , G06F17/00
CPC分类号： G06F3/0656 , G06F3/061 , G06F3/0653 , G06F3/0688 , G06F12/121
摘要： Aspects of the subject matter described herein relate to a buffer pool for a database system. In aspects, secondary memory such as solid state storage is used to extend the buffer pool of a database system. Thresholds such as hot, warm, and cold for classifying pages based on access history of the pages may be determined via a sampling algorithm. When a database system needs to free space in a buffer pool in main memory, a page may be evicted to the buffer pool in secondary memory or other storage based on how the page is classified and conditions of the secondary memory or other storage.
摘要翻译：本文描述的主题的方面涉及数据库系统的缓冲池。在方面，诸如固态存储的辅助存储器用于扩展数据库系统的缓冲池。可以通过采样算法来确定基于页面访问历史的用于对页面进行分类的诸如热，暖和冷等的阈值。当数据库系统需要释放主内存中的缓冲池中的空间时，可能会根据页面的分类和辅助内存或其他存储的条件，将页面逐出驱动到辅助内存或其他存储中的缓冲池。

5. 发明授权

US08352684B2 Optimal cache replacement scheme using a training operation 失效
标题翻译：使用训练操作的最优缓存替换方案
公开(公告)号：US08352684B2
公开(公告)日：2013-01-08
申请号：US12236188
申请日：2008-09-23
申请人： Roch Georges Archambault , Shimin Cui , Chen Ding , Yaoqing Gao , Xiaoming Gu , Raul Esteban Silvera , Chengliang Zhang
发明人： Roch Georges Archambault , Shimin Cui , Chen Ding , Yaoqing Gao , Xiaoming Gu , Raul Esteban Silvera , Chengliang Zhang
IPC分类号： G06F12/00
CPC分类号： G06F12/123 , G06F2212/502
摘要： Computer implemented method, system and computer usable program code for cache management. A cache is provided, wherein the cache is viewed as a sorted array of data elements, wherein a top position of the array is a most recently used position of the array and a bottom position of the array is a least recently used position of the array. A memory access sequence is provided, and a training operation is performed with respect to a memory access of the memory access sequence to determine a type of memory access operation to be performed with respect to the memory access. Responsive to a result of the training operation, a cache replacement operation is performed using the determined memory access operation with respect to the memory access.
摘要翻译：计算机实现方法，系统和计算机可用程序代码进行缓存管理。提供了缓存，其中高速缓存被视为数据元素的排序数组，其中阵列的顶部位置是阵列的最近使用的位置，并且阵列的底部位置是阵列的最近最近使用的位置。提供存储器访问序列，并且针对存储器访问序列的存储器访问执行训练操作，以确定要针对存储器访问执行的存储器访问操作的类型。响应于训练操作的结果，使用关于存储器访问的确定的存储器访问操作来执行高速缓存替换操作。

6. 发明申请

US20100077153A1 Optimal Cache Management Scheme 失效
标题翻译：最优缓存管理方案
公开(公告)号：US20100077153A1
公开(公告)日：2010-03-25
申请号：US12236188
申请日：2008-09-23
申请人： Roch Georges Archambault , Shimin Cui , Chen Ding , Yaoqing Gao , Xiaoming Gu , Raul Esteban Silvera , Chengliang Zhang
发明人： Roch Georges Archambault , Shimin Cui , Chen Ding , Yaoqing Gao , Xiaoming Gu , Raul Esteban Silvera , Chengliang Zhang
IPC分类号： G06F12/08
CPC分类号： G06F12/123 , G06F2212/502
摘要： Computer implemented method, system and computer usable program code for cache management. A cache is provided, wherein the cache is viewed as a sorted array of data elements, wherein a top position of the array is a most recently used position of the array and a bottom position of the array is a least recently used position of the array. A memory access sequence is provided, and a training operation is performed with respect to a memory access of the memory access sequence to determine a type of memory access operation to be performed with respect to the memory access. Responsive to a result of the training operation, a cache replacement operation is performed using the determined memory access operation with respect to the memory access.
摘要翻译：计算机实现方法，系统和计算机可用程序代码进行缓存管理。提供了缓存，其中高速缓存被视为数据元素的排序数组，其中阵列的顶部位置是阵列的最近使用的位置，并且阵列的底部位置是阵列的最近最近使用的位置。提供存储器访问序列，并且针对存储器访问序列的存储器访问执行训练操作，以确定要针对存储器访问执行的存储器访问操作的类型。响应于训练操作的结果，使用关于存储器访问的确定的存储器访问操作来执行高速缓存替换操作。

7. 发明申请

US20080168249A1 METHOD AND SYSTEM FOR DETERMINING OPTIMAL DATA LAYOUT USING BLIND JUSTICE 有权
标题翻译：使用BLIND JUSTICE确定最佳数据布局的方法和系统
公开(公告)号：US20080168249A1
公开(公告)日：2008-07-10
申请号：US11620818
申请日：2007-01-08
申请人： Martin Hirzel , Chengliang Zhang
发明人： Martin Hirzel , Chengliang Zhang
IPC分类号： G06F12/02
CPC分类号： G06F12/0253
摘要： Disclosed are a method and system for finding an optimal data layout. The approach of the present invention is to try one of several data layouts in the memory, measure the impact of said one data layout on a performance of a program, and decide which of said several data layouts to try next. The trying and measuring steps are repeated, and one of said several data layouts is selected as best or optimal based on the measurings. The preferred embodiment of the invention provides layout auditing, a framework for picking the best data layout online without requiring any user input. Layout auditing optimizes data layouts with a try-measure-decide feedback loop: use a data reorganizer to try one of several data layouts, use a profiler to measure the impact of the data layout on performance, and use a controller to decide which data layout to try next.
摘要翻译：公开了一种用于找到最佳数据布局的方法和系统。本发明的方法是尝试存储器中的几个数据布局中的一个，测量所述一个数据布局对程序的性能的影响，并且决定接下来要尝试的几个数据布局中的哪一个。重复尝试和测量步骤，并且基于测量将所述多个数据布局中的一个选择为最佳或最佳。本发明的优选实施例提供布局审核，用于在线选择最佳数据布局的框架，而不需要任何用户输入。布局审核通过测试决定反馈循环优化数据布局：使用数据重组器尝试几个数据布局之一，使用分析器来衡量数据布局对性能的影响，并使用控制器来决定哪些数据布局尝试下一个

8. 发明授权

US07805580B2 Method and system for determining optimal data layout using blind justice 有权
标题翻译：使用盲目正义确定最佳数据布局的方法和系统
公开(公告)号：US07805580B2
公开(公告)日：2010-09-28
申请号：US11620818
申请日：2007-01-08
申请人： Martin Hirzel , Chengliang Zhang
发明人： Martin Hirzel , Chengliang Zhang
IPC分类号： G06F12/00
CPC分类号： G06F12/0253
摘要： Disclosed are a method and system for finding an optimal data layout. The approach of the present invention is to try one of several data layouts in the memory, measure the impact of said one data layout on a performance of a program, and decide which of said several data layouts to try next. The trying and measuring steps are repeated, and one of said several data layouts is selected as best or optimal based on the measurings. The preferred embodiment of the invention provides layout auditing, a framework for picking the best data layout online without requiring any user input. Layout auditing optimizes data layouts with a try-measure-decide feedback loop: use a data reorganizer to try one of several data layouts, use a profiler to measure the impact of the data layout on performance, and use a controller to decide which data layout to try next.
摘要翻译：公开了一种用于找到最佳数据布局的方法和系统。本发明的方法是尝试存储器中的几个数据布局中的一个，测量所述一个数据布局对程序的性能的影响，并且决定接下来要尝试的几个数据布局中的哪一个。重复尝试和测量步骤，并且基于测量将所述多个数据布局中的一个选择为最佳或最佳。本发明的优选实施例提供布局审核，用于在线选择最佳数据布局的框架，而不需要任何用户输入。布局审核通过测试决定反馈循环优化数据布局：使用数据重组器尝试几个数据布局之一，使用分析器来衡量数据布局对性能的影响，并使用控制器来决定哪些数据布局尝试下一个

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式