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

1. 发明授权

US08468150B2 Accommodating gaps in database index scans 失效
标题翻译：适应数据库索引扫描的空白
公开(公告)号：US08468150B2
公开(公告)日：2013-06-18
申请号：US13285249
申请日：2011-10-31
申请人： Gopi K. Attaluri , Michael J. Winer
发明人： Gopi K. Attaluri , Michael J. Winer
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/30492
摘要： According to a present invention embodiment, a system conducts a scan on a database object index with one or more gaps. The system generates one or more combinations of values for the gaps within an index with respect to an operation. Each combination of values is generated by scanning the index based on a combination of one or more scan values, adjusting a value for a gap based on scan results, and adjusting the scan values for a succeeding scan based on the scan results to reduce a quantity of scans. The index includes at least two database object elements. One or more scans of the index utilizing the combinations of values are conducted to retrieve data from the database and accommodate each gap in the index. Present invention embodiments further include a method and computer program product for conducting the index scan.
摘要翻译：根据本发明的实施例，系统对具有一个或多个间隙的数据库对象索引进行扫描。该系统针对操作产生一个索引内的间隙的值的一个或多个组合。值的每个组合通过基于一个或多个扫描值的组合扫描索引，基于扫描结果调整间隙的值，并且基于扫描结果调整用于后续扫描的扫描值以减少数量来生成的扫描。索引包括至少两个数据库对象元素。进行使用值组合的索引的一次或多次扫描以从数据库检索数据并适应索引中的每个间隙。本发明实施例还包括用于进行索引扫描的方法和计算机程序产品。

2. 发明申请

US20130110819A1 ACCOMMODATING GAPS IN DATABASE INDEX SCANS 失效
标题翻译：数据库索引扫描中存储数据
公开(公告)号：US20130110819A1
公开(公告)日：2013-05-02
申请号：US13285249
申请日：2011-10-31
申请人： Gopi K. Attaluri , Michael J. Winer
发明人： Gopi K. Attaluri , Michael J. Winer
IPC分类号： G06F17/30
CPC分类号： G06F17/30492
摘要： According to a present invention embodiment, a system conducts a scan on a database object index with one or more gaps. The system generates one or more combinations of values for the gaps within an index with respect to an operation. Each combination of values is generated by scanning the index based on a combination of one or more scan values, adjusting a value for a gap based on scan results, and adjusting the scan values for a succeeding scan based on the scan results to reduce a quantity of scans. The index includes at least two database object elements. One or more scans of the index utilizing the combinations of values are conducted to retrieve data from the database and accommodate each gap in the index. Present invention embodiments further include a method and computer program product for conducting the index scan.
摘要翻译：根据本发明的实施例，系统对具有一个或多个间隙的数据库对象索引进行扫描。该系统针对操作产生一个索引内的间隙的值的一个或多个组合。值的每个组合通过基于一个或多个扫描值的组合扫描索引，基于扫描结果调整间隙的值，并且基于扫描结果调整用于后续扫描的扫描值以减少数量来生成的扫描。索引包括至少两个数据库对象元素。进行使用值组合的索引的一次或多次扫描以从数据库检索数据并适应索引中的每个间隙。本发明实施例还包括用于进行索引扫描的方法和计算机程序产品。

3. 发明授权

US07236974B2 System and method for a multi-level locking hierarchy in a database with multi-dimensional clustering 失效
标题翻译：具有多维聚类的数据库中多级锁定层次结构的系统和方法
公开(公告)号：US07236974B2
公开(公告)日：2007-06-26
申请号：US10425760
申请日：2003-04-29
申请人： Bishwaranjan Bhattacharjee , Leslie A. Cranston , Matthew A. Huras , Timothy R. Malkemus , Catherine S. McArthur , Sriram K. Padmanabhan , Michael J. Winer
发明人： Bishwaranjan Bhattacharjee , Leslie A. Cranston , Matthew A. Huras , Timothy R. Malkemus , Catherine S. McArthur , Sriram K. Padmanabhan , Michael J. Winer
IPC分类号： G06F17/30
CPC分类号： G06F17/30592 , G06F17/30362 , Y10S707/99932 , Y10S707/99938 , Y10S707/99939
摘要： A multi-level locking hierarchy for a relational database includes a locking level applied to a multi-dimensionally clustering table, a locking level applied to blocks within the table, and a locking level applied to rows within the blocks. The hierarchy leverages the multi-dimensional clustering of the table data for efficiency and to reduce lock overhead. Data is normally locked in order of coarser to finer granularity to limit deadlock. When data of finer granularity is locked, data of coarser granularity containing the finer granularity data is also locked. Block lock durations may be employed to ensure that a block remains locked if any contained row remains locked. Block level lock attributes may facilitate detection of at least one of a concurrent scan and a row deletion within a block. Detection of the emptying of a block during a scan of the block may bar scan completion in that block.
摘要翻译：关系数据库的多级锁定层次结构包括应用于多维聚类表的锁定级别，应用于表中块的锁定级别以及应用于块内的行的锁定级别。层次结构利用表数据的多维聚类来提高效率并减少锁定开销。数据通常以更细和更细粒度的顺序锁定，以限制死锁。当更细粒度的数据被锁定时，包含更细粒度数据的较粗粒度的数据也被锁定。可以使用块锁定持续时间来确保如果任何包含的行保持锁定，则块保持锁定。块级锁定属性可以有助于检测块内的并行扫描和行删除中的至少一个。在块的扫描期间检测块的排空可能会阻止该块中的扫描完成。

4. 发明授权

US07103587B2 Efficient index-data fetch via callback for table data 失效
标题翻译：通过表格数据的回调有效的索引数据提取
公开(公告)号：US07103587B2
公开(公告)日：2006-09-05
申请号：US09757431
申请日：2001-01-10
申请人： Bruce G. Lindsay , Catherine S. McArthur , Michael J. Winer
发明人： Bruce G. Lindsay , Catherine S. McArthur , Michael J. Winer
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30492 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933
摘要： A callback to a data manager is carried out from an index manager in a query processing system for an index-data fetch to enable an index page held stabilized by an index manager to remain stabilized during predicate checking or data consumption operations. The index manager locates a data identifier in an index and calls back to a data manager to access the data indicated by the data identifier. The data manager may carry out a predicate check or a data consuming operation on the data and if this is the case the index manager may access the next data identifier in the index when the data manager callback is complete. The index page need not be destabilized in such a case.
摘要翻译：在索引数据提取的查询处理系统中从索引管理器执行对数据管理器的回调，以使由索引管理器保持的索引页在谓词检查或数据消耗操作期间保持稳定。索引管理器将数据标识符定位在索引中，并且回拨给数据管理器以访问由数据标识符指示的数据。数据管理器可以对数据执行谓词检查或数据消耗操作，如果是这种情况，索引管理器可以在数据管理器回调完成时访问索引中的下一个数据标识符。在这种情况下，索引页不需要不稳定。

5. 发明授权

US07010552B2 Optimizing command execution in database systems that provide support for updatable scrollable cursors 有权
标题翻译：优化在可更新的可滚动游标中提供支持的数据库系统中的命令执行
公开(公告)号：US07010552B2
公开(公告)日：2006-03-07
申请号：US09872827
申请日：2001-05-31
申请人： Iqbal A. Goralwalla , Michael J. Winer , David C. Sharpe , Matthew A. Huras
发明人： Iqbal A. Goralwalla , Michael J. Winer , David C. Sharpe , Matthew A. Huras
IPC分类号： G06F17/30
CPC分类号： G06F17/30351 , G06F17/30353 , G06F17/30356 , Y10S707/99943 , Y10S707/99954
摘要： A procedure optimizes command execution in a database system. According to one embodiment, the database system stores data records on data pages, and provides an identifier for each data page. The identifier indicates when any of the data records contained in the data page were last modified. A data record is selected from a data page and copied to a second storage area. Verification that the selected data record has not been modified since the time that is was copied to the second storage area is based upon the identifier, and then the command is executed.
摘要翻译：一个过程优化数据库系统中的命令执行。根据一个实施例，数据库系统将数据记录存储在数据页上，并为每个数据页提供标识符。标识符表示最后一次修改数据页中包含的任何数据记录。从数据页面选择数据记录并复制到第二存储区域。验证所选择的数据记录自被复制到第二存储区域的时间以来未被修改是基于标识符，然后执行该命令。

6. 发明授权

US08005872B2 Method for fast deletion of physically clustered data 失效
标题翻译：快速删除物理聚类数据的方法
公开(公告)号：US08005872B2
公开(公告)日：2011-08-23
申请号：US12125717
申请日：2008-05-22
申请人： Bishwaranjan Bhattacharjee , Leslie A. Buback , Timothy Ray Malkemus , Michael J. Winer
发明人： Bishwaranjan Bhattacharjee , Leslie A. Buback , Timothy Ray Malkemus , Michael J. Winer
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30492 , G06F17/30368 , G06F17/30377 , Y10S707/953 , Y10S707/99942 , Y10S707/99943 , Y10S707/99945 , Y10S707/99948
摘要： A computer implemented method, apparatus, and computer usable program code for deleting rows in a multidimensionally clustering database. A multidimensional clustering processor receives a request to delete a set of multidimensionally clustering data. The multidimensional clustering processor determines whether all multidimensionally clustering data is located in a block. Responsive to all multidimensionally clustered data qualifying for deletion, the multidimensional clustering processor deletes all data in the block to delete the set of multidimensionally clustered data.
摘要翻译：用于删除多维聚类数据库中的行的计算机实现的方法，装置和计算机可用程序代码。多维聚类处理器接收删除一组多维聚类数据的请求。多维聚类处理器确定所有多维聚类数据是否位于块中。响应于符合要删除的所有多维聚类数据，多维聚类处理器将删除块中的所有数据以删除多维集群数据集。

7. 发明申请

US20080228793A1 SYSTEM AND PROGRAM FOR APPEND MODE INSERTION OF ROWS INTO TABLES IN DATABASE MANAGEMENT SYSTEMS 有权
标题翻译：系统和程序，用于在数据库管理系统中将表单插入表中
公开(公告)号：US20080228793A1
公开(公告)日：2008-09-18
申请号：US12115310
申请日：2008-05-05
申请人： Nelson Hop HING , Matthew J. Spilchen , Michael J. Winer
发明人： Nelson Hop HING , Matthew J. Spilchen , Michael J. Winer
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30587 , G06F17/30377 , Y10S707/99931 , Y10S707/99932 , Y10S707/99939 , Y10S707/99942 , Y10S707/99956
摘要： Implementation of append mode concurrent insert operations in tables in a page-based concurrent relational database management system is carried out by defining a set of last pages as a current cache into which rows may be inserted by appenders. Append mode insert operations for each page in the current cache are serialized. Appenders seek to access the pages in the current cache using a two-pass process in which latches are sought to be acquired conditionally in the first pass and unconditionally in the second pass. A shared data structure is provided to define a current cache and a next cache for a table supporting append mode inserts in the relational database. The shared data structure includes information reflecting the unused space for each page in the current cache.
摘要翻译：在基于页面的并发关系数据库管理系统中的表中执行附加模式并发插入操作是通过将最后一页的集合定义为可由追加者插入行的当前高速缓存来执行的。序列化当前缓存中每个页面的附加模式插入操作。追加者寻求使用两遍处理来访问当前高速缓存中的页面，其中寻求在第一遍中有条件地获取锁存器，并且在第二遍中无条件地获取。提供共享数据结构以定义当前缓存和用于支持在关系数据库中的附加模式插入的表的下一个高速缓存。共享数据结构包括反映当前缓存中每个页面的未使用空间的信息。

8. 发明授权

US06668263B1 Method and system for efficiently searching for free space in a table of a relational database having a clustering index 有权
标题翻译：用于有效搜索具有聚类索引的关系数据库的表中的可用空间的方法和系统
公开(公告)号：US06668263B1
公开(公告)日：2003-12-23
申请号：US09651884
申请日：2000-08-30
申请人： Leslie A. Cranston , Nelson Hop Hing , Matthew A. Huras , Bruce G. Lindsay , Michael J. Winer
发明人： Leslie A. Cranston , Nelson Hop Hing , Matthew A. Huras , Bruce G. Lindsay , Michael J. Winer
IPC分类号： G06F1730
CPC分类号： G06F17/30595 , Y10S707/99933 , Y10S707/99956
摘要： A method of searching a table in a database management system for free space for inserting a new record into the table. The table resides in a storage media, and includes a series of pages capable of storing a plurality of records. The table has a clustering index defined in a column of the table. The new record has a new record attribute for storing in the column of the table when the new record is stored in the table. The method comprises searching for a target page in the series of pages, the target page being selected to maintain clustering when the new record is inserted thereon. Once the target page has been located, it is searched for sufficient free space to accommodate the new record. If sufficient free space is found on the target page, then the new record is inserted on the target page. If sufficient free space is not found on the target page, then a target neighborhood of pages in the series of pages is searched for sufficient free space to accommodate the new record. The target neighborhood of pages surrounds the target page. If sufficient free space is found on a page in a target neighborhood of pages, then the new record is inserted on to this page in the target neighborhood of pages. If sufficient free space is not found in the target neighborhood of pages, then the method further comprises searching for sufficient free space to accommodate the new record outside the target neighborhood of pages. If sufficient free space is found outside the target neighborhood of pages, then the new record is inserted on a non-neighboring page outside the target neighborhood of pages. If sufficient free space is not found outside the target neighborhood of pages, then a new page having the new record is appended to the end of table.
摘要翻译：在数据库管理系统中搜索用于将新记录插入表的可用空间的表的方法。该表位于存储介质中，并且包括能够存储多个记录的一系列页面。该表具有在表的列中定义的聚簇索引。当新记录存储在表中时，新记录具有用于存储在表的列中的新记录属性。所述方法包括搜索所述一系列页面中的目标页面，所述目标页面被选择以在新记录被插入时保持聚类。找到目标页面后，将搜索足够的可用空间以容纳新记录。如果在目标页面上找到足够的可用空间，则新记录将插入到目标页面上。如果在目标页面上没有找到足够的可用空间，则搜索一系列页面中的页面的目标邻域以获得足够的可用空间以容纳新记录。页面的目标邻域包围目标页面。如果在页面的目标邻域中的页面上找到足够的可用空间，则将新记录插入到页面的目标邻域中的该页面上。如果在页面的目标邻域中没有找到足够的可用空间，则该方法还包括搜索足够的可用空间以容纳目标页面附近的新记录。如果在目标邻域之外找到足够的可用空间，则新记录被插入到目标邻域之外的非邻近页面上。如果在目标邻域之外没有找到足够的可用空间，则在表的末尾附加具有新记录的新页面。

9. 发明授权

US07765211B2 System and method for space management of multidimensionally clustered tables 失效
标题翻译：多维集群表的空间管理系统和方法
公开(公告)号：US07765211B2
公开(公告)日：2010-07-27
申请号：US10425781
申请日：2003-04-29
申请人： Bishwaranjan Bhattacharjee , Leslie A. Cranston , Matthew A. Huras , Bruce G. Lindsay , Timothy R. Malkemus , Catherine S. McArthur , Sriram K. Padmanabhan , Michael J. Winer
发明人： Bishwaranjan Bhattacharjee , Leslie A. Cranston , Matthew A. Huras , Bruce G. Lindsay , Timothy R. Malkemus , Catherine S. McArthur , Sriram K. Padmanabhan , Michael J. Winer
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30592
摘要： An information retrieval system and method are provided for minimizing the number of blocks searched in a cell before recording a new record in the table and determining which block can be assigned if a table has space available to store a new record in the case an additional block should be associated with a cell. Dimensions for a table are identified, and at least one block in the table is associated with a dimension value for each dimension, where each block comprises contiguous storage pages. The block can be further associated with a cell; this associated cell has a unique combination of dimension values comprising an dimension value for each of the dimensions. A unique associated bit list for each dimension value for each dimension has a unique corresponding list entry for each block associated with that dimension value, and a unique associated bit list for each cell has a unique corresponding list entry for each block associated with that cell.
摘要翻译：提供了一种信息检索系统和方法，用于在记录表中的新记录之前最小化在小区中搜索的块的数量，并且如果在具有可用于存储新记录的空间的情况下确定可以分配哪个块的附加块应该与一个单元格相关联。识别表的尺寸，并且表中的至少一个块与每个维的维度值相关联，其中每个块包括连续的存储页。该块可以进一步与细胞相关联; 该相关联的单元格具有维度值的唯一组合，其包括每个维度的维度值。每个维度的每个维度值的唯一关联位列具有与该维度值相关联的每个块的唯一对应列表条目，并且每个单元的唯一关联位列表具有与该单元相关联的每个块的唯一对应列表条目。

10. 发明申请

US20080222182A1 Method for Fast Deletion of Physically Clustered Data 失效
标题翻译：快速删除物理聚类数据的方法
公开(公告)号：US20080222182A1
公开(公告)日：2008-09-11
申请号：US12125717
申请日：2008-05-22
申请人： Bishwaranjan Bhattacharjee , Leslie A. Buback , Timothy Ray Malkemus , Michael J. Winer
发明人： Bishwaranjan Bhattacharjee , Leslie A. Buback , Timothy Ray Malkemus , Michael J. Winer
IPC分类号： G06F17/30
CPC分类号： G06F17/30492 , G06F17/30368 , G06F17/30377 , Y10S707/953 , Y10S707/99942 , Y10S707/99943 , Y10S707/99945 , Y10S707/99948
摘要： A computer implemented method, apparatus, and computer usable program code for deleting rows in a multidimensional clustering database. A multidimensional clustering processor receives a request to delete a set of multidimensionally clustered data. The multidimensional clustering processor determines whether all multidimensionally clustered data is located in a block. Responsive to all multidimensionally clustered data qualifying for deletion, the multidimensional clustering processor deletes all data in the block to delete the set of multidimensionally clustered data.
摘要翻译：用于删除多维聚类数据库中的行的计算机实现的方法，装置和计算机可用程序代码。多维聚类处理器接收删除一组多维聚类数据的请求。多维聚类处理器确定所有多维聚类数据是否位于块中。响应于符合要删除的所有多维聚类数据，多维聚类处理器将删除块中的所有数据以删除多维集群数据集。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式