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

1. 发明申请

US20070233640A1 Method and system for faster instance startup for large resource configurations 有权
标题翻译：用于更快速启动大型资源配置的方法和系统
公开(公告)号：US20070233640A1
公开(公告)日：2007-10-04
申请号：US11395613
申请日：2006-03-30
申请人： Tirthankar Lahiri , Bharat Baddepudi , Poojan Kumar
发明人： Tirthankar Lahiri , Bharat Baddepudi , Poojan Kumar
IPC分类号： G06F17/30 , G06F12/00
CPC分类号： G06F17/3048
摘要： A method for starting up a database system, comprising allocating memory spaces for three buffers; initializing two of the buffers; partially initializing the third buffer where the third buffer is larger than the other two; instructing the memory manager to initialize the remainder of the third buffer in the background process; performing recovery operations; and opening the database system for use. The database is operated in an open phase while the remainder of the third buffer is initialized in the background and ran in parallel to the recovery operation that may extend beyond the completion of opening the database. Thus opening the database prior to completion of full initialization and initializing the third buffer in the background improves the startup time of the database which becomes significant when the size of the third buffer is very large (e.g., 500 GB+).
摘要翻译：一种用于启动数据库系统的方法，包括为三个缓冲器分配存储器空间; 初始化两个缓冲区; 部分地初始化第三缓冲器，其中第三缓冲器大于其他缓冲器; 指示存储器管理器在后台进程中初始化第三缓冲器的剩余部分; 执行恢复操作; 并打开数据库系统使用。数据库处于开放阶段，而第三个缓冲区的其余部分在后台进行初始化，并且与恢复操作并行运行，该恢复操作可能超出打开数据库的完成时间。因此，在完成初始化并在后台初始化第三缓冲区之前打开数据库改善了当第三缓冲器的大小非常大（例如，500GB +））时数据库的启动时间变得显着。

2. 发明授权

US07734580B2 Readable physical storage replica and standby database system 有权
标题翻译：可读物理存储副本和备用数据库系统
公开(公告)号：US07734580B2
公开(公告)日：2010-06-08
申请号：US11818975
申请日：2007-01-29
申请人： Tirthankar Lahiri , Kiran Goyal , Jia Shi , Wei-Ming Hu , Neil MacNaughton , Jaebock Lee , Bharat Baddepudi , Yunrui Li , J. William Lee , Vipin Gokhale , Mark Dilman , Niloy Mukherjee , Vinay Srihari , Kumar Rajamani , Hochak Hung
发明人： Tirthankar Lahiri , Kiran Goyal , Jia Shi , Wei-Ming Hu , Neil MacNaughton , Jaebock Lee , Bharat Baddepudi , Yunrui Li , J. William Lee , Vipin Gokhale , Mark Dilman , Niloy Mukherjee , Vinay Srihari , Kumar Rajamani , Hochak Hung
IPC分类号： G06F17/30
CPC分类号： G06F11/2097 , G06F11/2035 , G06F11/2048 , G06F12/0815
摘要： A standby database system or another replica data system replicates changes, made to data blocks at a source database system or another primary data copy, to replicas of the data blocks at the standby database system or other replica. While replicating the changes to the data blocks thereof, the standby database system (or other replica) receives queries (or reads) issued thereto and computes the queries based on data read from the data blocks thereof.
摘要翻译：备用数据库系统或其他副本数据系统将对源数据库系统或其他主数据副本上的数据块进行的更改复制到备用数据库系统或其他副本上的数据块的副本。在对其数据块进行复制的同时，备用数据库系统（或其他副本）接收对其发出的查询（或读取），并根据从其数据块读取的数据来计算查询。

3. 发明申请

US20080235291A1 Readable physical storage replica and standby database system 有权
标题翻译：可读物理存储副本和备用数据库系统
公开(公告)号：US20080235291A1
公开(公告)日：2008-09-25
申请号：US11818975
申请日：2007-01-29
申请人： Tirthankar Lahiri , Kiran Goyal , Jia Shi , Wei-Ming Hu , Neil MacNaughton , Jaebock Lee , Bharat Baddepudi , Yunrui Li , J. William Lee , Vipin Gokhale , Mark Dilman , Niloy Mukherjee , Vinay Srihari , Kumar Rajamani , Hochak Hung
发明人： Tirthankar Lahiri , Kiran Goyal , Jia Shi , Wei-Ming Hu , Neil MacNaughton , Jaebock Lee , Bharat Baddepudi , Yunrui Li , J. William Lee , Vipin Gokhale , Mark Dilman , Niloy Mukherjee , Vinay Srihari , Kumar Rajamani , Hochak Hung
IPC分类号： G06F17/30
CPC分类号： G06F11/2097 , G06F11/2035 , G06F11/2048 , G06F12/0815
摘要： A standby database system or another replica data system replicates changes, made to data blocks at a source database system or another primary data copy, to replicas of the data blocks at the standby database system or other replica. While replicating the changes to the data blocks thereof, the standby database system (or other replica) receives queries (or reads) issued thereto and computes the queries based on data read from the data blocks thereof.
摘要翻译：备用数据库系统或其他副本数据系统将对源数据库系统或其他主数据副本上的数据块进行的更改复制到备用数据库系统或其他副本上的数据块的副本。在对其数据块进行复制的同时，备用数据库系统（或其他副本）接收对其发出的查询（或读取），并根据从其数据块读取的数据来计算查询。

4. 发明授权

US07467279B2 Method and system for faster instance startup for large resource configurations 有权
标题翻译：用于更快速启动大型资源配置的方法和系统
公开(公告)号：US07467279B2
公开(公告)日：2008-12-16
申请号：US11395613
申请日：2006-03-30
申请人： Tirthankar Lahiri , Bharat C V Baddepudi , Poojan Kumar
发明人： Tirthankar Lahiri , Bharat C V Baddepudi , Poojan Kumar
IPC分类号： G06F12/06
CPC分类号： G06F17/3048
摘要： A method for starting up a database system, comprising allocating memory spaces for three buffers; initializing two of the buffers; partially initializing the third buffer where the third buffer is larger than the other two; instructing the memory manager to initialize the remainder of the third buffer in the background process; performing recovery operations; and opening the database system for use. The database is operated in an open phase while the remainder of the third buffer is initialized in the background and ran in parallel to the recovery operation that may extend beyond the completion of opening the database. Thus opening the database prior to completion of full initialization and initializing the third buffer in the background improves the startup time of the database which becomes significant when the size of the third buffer is very large (e.g., 500 GB+).
摘要翻译：一种用于启动数据库系统的方法，包括为三个缓冲器分配存储器空间; 初始化两个缓冲区; 部分地初始化第三缓冲器，其中第三缓冲器大于其他缓冲器; 指示存储器管理器在后台进程中初始化第三缓冲器的剩余部分; 执行恢复操作; 并打开数据库系统使用。数据库处于开放阶段，而第三个缓冲区的其余部分在后台进行初始化，并且与恢复操作并行运行，该恢复操作可能超出打开数据库的完成时间。因此，在完成初始化并在后台初始化第三缓冲区之前打开数据库改善了当第三缓冲器的大小非常大（例如，500GB +））时数据库的启动时间变得显着。

5. 发明授权

US07783852B2 Techniques for automated allocation of memory among a plurality of pools 有权
标题翻译：在多个池中自动分配存储器的技术
公开(公告)号：US07783852B2
公开(公告)日：2010-08-24
申请号：US10746471
申请日：2003-12-23
申请人： Tirthankar Lahiri , Poojan Kumar , Brian Hirano , Arvind Nithrakashyap , Kant Patel , Kiran Goyal , Juan R. Loaiza
发明人： Tirthankar Lahiri , Poojan Kumar , Brian Hirano , Arvind Nithrakashyap , Kant Patel , Kiran Goyal , Juan R. Loaiza
IPC分类号： G06F12/00
CPC分类号： G06F9/5016 , G06F12/023
摘要： Allocation of memory is optimized across multiple pools of memory, based on minimizing the time it takes to successfully retrieve a given data item from each of the multiple pools. First data is generated that indicates a hit rate per pool size for each of multiple memory pools. In an embodiment, the generating step includes continuously monitoring attempts to access, or retrieve a data item from, each of the memory pools. The first data is converted to second data that accounts for a cost of a miss with respect to each of the memory pools. In an embodiment, the second data accounts for the cost of a miss in terms of time. How much of the memory to allocate to each of the memory pools is determined, based on the second data. In an embodiment, the steps of converting and determining are automatically performed, on a periodic basis.
摘要翻译：基于最小化从多个池中的每一个成功检索给定数据项所需的时间，内存分配在多个内存池之间进行了优化。生成第一个数据，指示每个多个内存池的每个池大小的命中率。在一个实施例中，生成步骤包括连续地监视从每个存储器池访问或检索数据项的尝试。第一个数据被转换成相对于每个存储器池来计算缺失成本的第二数据。在一个实施例中，第二数据考虑到时间方面的错过的成本。基于第二数据确定分配给每个存储器池的存储器的多少。在一个实施例中，周期性地自动执行转换和确定的步骤。

6. 发明申请

US20050114621A1 Techniques for automated allocation of memory among a plurality of pools 有权
标题翻译：在多个池中自动分配存储器的技术
公开(公告)号：US20050114621A1
公开(公告)日：2005-05-26
申请号：US10746471
申请日：2003-12-23
申请人： Tirthankar Lahiri , Poojan Kumar , Brian Hirano , Arvind Nithrakashyap , Kant Patel , Kiran Goyal , Juan Loaiza
发明人： Tirthankar Lahiri , Poojan Kumar , Brian Hirano , Arvind Nithrakashyap , Kant Patel , Kiran Goyal , Juan Loaiza
IPC分类号： G06F9/50 , G06F12/02 , G06F12/00
CPC分类号： G06F9/5016 , G06F12/023
摘要： Allocation of memory is optimized across multiple pools of memory, based on minimizing the time it takes to successfully retrieve a given data item from each of the multiple pools. First data is generated that indicates a hit rate per pool size for each of multiple memory pools. In an embodiment, the generating step includes continuously monitoring attempts to access, or retrieve a data item from, each of the memory pools. The first data is converted to second data that accounts for a cost of a miss with respect to each of the memory pools. In an embodiment, the second data accounts for the cost of a miss in terms of time. How much of the memory to allocate to each of the memory pools is determined, based on the second data. In an embodiment, the steps of converting and determining are automatically performed, on a periodic basis.
摘要翻译：基于最小化从多个池中的每一个成功检索给定数据项所需的时间，内存分配在多个内存池之间进行了优化。生成第一个数据，指示每个多个内存池的每个池大小的命中率。在一个实施例中，生成步骤包括连续地监视从每个存储器池访问或检索数据项的尝试。第一个数据被转换成相对于每个存储器池来计算缺失成本的第二数据。在一个实施例中，第二数据考虑到时间方面的错过的成本。基于第二数据确定分配给每个存储器池的存储器的多少。在一个实施例中，周期性地自动执行转换和确定的步骤。

7. 发明授权

US10756759B2 Column domain dictionary compression 有权
公开(公告)号：US10756759B2
公开(公告)日：2020-08-25
申请号：US13224327
申请日：2011-09-02
申请人： Tirthankar Lahiri , Chi-Kim Hoang , Dina Thomas , Kirk Meredith Edson , Subhradyuti Sarkar , Mark McAuliffe , Marie-Anne Neimat , Chih-Ping Wang
发明人： Tirthankar Lahiri , Chi-Kim Hoang , Dina Thomas , Kirk Meredith Edson , Subhradyuti Sarkar , Mark McAuliffe , Marie-Anne Neimat , Chih-Ping Wang
IPC分类号： H03M7/42 , H03M7/30 , G06F16/22
摘要： In column domain dictionary compression, column values in one or more columns are tokenized by a single dictionary. The domain of the dictionary is the entire set of columns. A dictionary may not only map a token to a tokenized value, but also to a count (“token count”) of the number of occurrences of the token and corresponding tokenized value in the dictionary's domain. Such information may be used to compute queries on the base table.

8. 发明授权

US09697253B2 Consistent client-side cache 有权
公开(公告)号：US09697253B2
公开(公告)日：2017-07-04
申请号：US11875782
申请日：2007-10-19
申请人： Lakshminarayanan Chidambaran , Mehul Dilip Bastawala , Srinath Krishnaswamy , Tirthankar Lahiri , Juan R. Loaiza , Bipul Sinha , Srinivas S. Vemuri
发明人： Lakshminarayanan Chidambaran , Mehul Dilip Bastawala , Srinath Krishnaswamy , Tirthankar Lahiri , Juan R. Loaiza , Bipul Sinha , Srinivas S. Vemuri
IPC分类号： G06F17/30
CPC分类号： G06F17/3048
摘要： A method, system, and computer program product is disclosed for caching results in a client-side cache. Embodiments of a method, a system, and a computer program product are disclosed that associate a first snapshot of a database with a client that indicates a state of the database after a last database request by the client, and indicate any number of invalid cached results in the client cache for the client based upon the first snapshot. In some embodiments, the method further includes receiving a second snapshot that indicates a state of the database upon receipt of a database server request by the client, and updating the first snapshot with the second snapshot.

9. 发明授权

US08401994B2 Distributed consistent grid of in-memory database caches 有权
标题翻译：分布式一致的内存数据库缓存网格
公开(公告)号：US08401994B2
公开(公告)日：2013-03-19
申请号：US12562928
申请日：2009-09-18
申请人： Chi Hoang , Tirthankar Lahiri , Marie-Anne Neimat , Chih-Ping Wang , John Miller , Dilys Thomas , Nagender Bandi , Susan Cheng
发明人： Chi Hoang , Tirthankar Lahiri , Marie-Anne Neimat , Chih-Ping Wang , John Miller , Dilys Thomas , Nagender Bandi , Susan Cheng
IPC分类号： G06F17/00
CPC分类号： G06F17/30312 , G06F12/084
摘要： A plurality of mid-tier databases form a single, consistent cache grid for data in a one or more backend data sources, such as a database system. The mid-tier databases may be standard relational databases. Cache agents at each mid-tier database swap in data from the backend database as needed. Consistency in the cache grid is maintained by ownership locks. Cache agents prevent database operations that will modify cached data in a mid-tier database unless and until ownership of the cached data can be acquired for the mid-tier database. Cache groups define what backend data may be cached, as well as a general structure in which the backend data is to be cached. Metadata for cache groups is shared to ensure that data is cached in the same form throughout the entire grid. Ownership of cached data can then be tracked through a mapping of cached instances of data to particular mid-tier databases.
摘要翻译：多个中间层数据库形成用于一个或多个后端数据源（例如数据库系统）中的数据的单一，一致的高速缓存网格。中间层数据库可以是标准关系数据库。每个中间层数据库的缓存代理根据需要从后端数据库交换数据。高速缓存网格中的一致性由所有权锁定维护。高速缓存代理阻止数据库操作，将修改中间层数据库中的缓存数据，除非可以为中间层数据库获取缓存数据的所有权。缓存组定义可以缓存哪些后端数据，以及要缓存后端数据的一般结构。共享缓存组的元数据，以确保数据在整个网格中以相同的格式缓存。然后可以通过将缓存的数据实例映射到特定中间层数据库来跟踪缓存数据的所有权。

10. 发明申请

US20080098169A1 Cost based analysis of direct I/O access 有权
标题翻译：直接I / O访问的基于成本的分析
公开(公告)号：US20080098169A1
公开(公告)日：2008-04-24
申请号：US11584255
申请日：2006-10-20
申请人： Sanjay Kaluskar , Varun Malhotra , Tirthankar Lahiri , Juan Loaiza , Sumanta Chatterjee , Dmitry Potapov , Margaret Susairaj , Hakan Jakobsson
发明人： Sanjay Kaluskar , Varun Malhotra , Tirthankar Lahiri , Juan Loaiza , Sumanta Chatterjee , Dmitry Potapov , Margaret Susairaj , Hakan Jakobsson
IPC分类号： G06F12/00
CPC分类号： G06F12/0866 , G06F17/30306
摘要： A method, system, and computer program product forcost based analysis for data access in a database management system. In one approach, the method, system, and computer program productperforms identifying data to access, determining a first cost for direct I/O storage access and a second cost for cache access, performing a comparison between the first cost and the second cost, and accessing a first portion of identified data based upon the comparison.
摘要翻译：一种用于数据库管理系统中数据访问的方法，系统和计算机程序产品forcost based analysis。在一种方法中，方法，系统和计算机程序产品实现识别要访问的数据，确定用于直接I / O存储访问的第一成本和用于高速缓存访问的第二成本，执行第一成本和第二成本之间的比较，以及基于比较来访问所识别的数据的第一部分。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式