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

111. 发明授权

US06714943B1 Method and mechanism for tracking dependencies for referential integrity constrained tables 有权
标题翻译：用于跟踪参照完整性约束表的依赖关系的方法和机制
公开(公告)号：US06714943B1
公开(公告)日：2004-03-30
申请号：US09773963
申请日：2001-01-31
申请人： Amit Ganesh , Jonathan D. Klein
发明人： Amit Ganesh , Jonathan D. Klein
IPC分类号： G06F1730
CPC分类号： G06F17/3051 , G06F17/30371 , G06F17/30377 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99942 , Y10S707/99945 , Y10S707/99948
摘要： A method and mechanism for dependency tracking in a database system is disclosed. According to an embodiment, dependency tracking for a referentially constrained object is performed by tracking change or commit time values for key ranges as well as change or commit time values at various granularities in the database. The combination of various sets of change or commit values are employed to determine a single value representing all prior transactions or changes that an operation is dependent upon.
摘要翻译：公开了一种数据库系统中依赖关系跟踪的方法和机制。根据实施例，通过跟踪关键范围的改变或提交时间值以及数据库中各种粒度的改变或落实时间值来执行用于重新约束对象的依赖性跟踪。使用各种变化或提交值组合来确定表示操作依赖的所有先前事务或改变的单个值。

112. 发明授权

US06353828B1 Concurrency control for transactions that update base tables of a materialized view using different types of locks 有权
标题翻译：使用不同类型的锁更新物化视图的基表的事务的并发控制
公开(公告)号：US06353828B1
公开(公告)日：2002-03-05
申请号：US09311273
申请日：1999-05-14
申请人： Amit Ganesh , Andrew Witkowski
发明人： Amit Ganesh , Andrew Witkowski
IPC分类号： G06F1730
CPC分类号： G06F17/30383 , G06F17/30362 , Y10S707/99938 , Y10S707/99952
摘要： Concurrency control for maintenance of materialized view defined as a join on a plurality of base tables is provided by obtaining different types of locks. The base table being updated is locked with one type of lock, and the other base tables of the materialized view is locked with a different type of lock. These lock types are defined so that another process attempting to update another base table simultaneously is blocked until the update on the base table is committed. On the other hand, another process attempting to update the same base table is allowed to perform that update concurrently.
摘要翻译：通过获取不同类型的锁来提供用于维护定义为多个基表上的连接的物化视图的并发控制。正在更新的基表被锁定为一种类型的锁，并且物化视图的其他基表用不同类型的锁定锁定。定义这些锁类型，以便在基础表上的更新提交之前，阻止另一个尝试同时更新另一个基表的进程。另一方面，允许尝试更新同一基表的另一进程同时执行该更新。

113. 发明授权

US06295610B1 Recovering resources in parallel 有权
标题翻译：并行恢复资源
公开(公告)号：US06295610B1
公开(公告)日：2001-09-25
申请号：US09156551
申请日：1998-09-17
申请人： Amit Ganesh , Gary C. Ngai
发明人： Amit Ganesh , Gary C. Ngai
IPC分类号： G06F1114
CPC分类号： G06F11/1474 , G06F17/30362 , G06F17/30371 , G06F2201/80 , Y10S707/99953
摘要： A method and apparatus for removing changes made by a particular transaction is provided. According to one aspect, two or more sets of changes that were made by a particular transaction that can be removed in parallel are identified. A corresponding recovery process is assigned to each of the two or more sets of changes. Using the corresponding recovery process, the changes identified in each of the two or more sets of changes are undone in parallel.
摘要翻译：提供了一种用于去除由特定交易进行的改变的方法和装置。根据一个方面，识别由可以并行移除的特定事务进行的两组或更多组更改。相应的恢复过程被分配给两组或更多组更改中的每一个。使用相应的恢复过程，在两组或更多组更改中识别的更改被并行撤销。

114. 发明授权

US09141609B2 Reducing sequence cache latch contention in a database system 有权
标题翻译：减少数据库系统中的序列缓存锁定争用
公开(公告)号：US09141609B2
公开(公告)日：2015-09-22
申请号：US13309394
申请日：2011-12-01
申请人： Fulu Li , Vineet Marwah , Amit Ganesh
发明人： Fulu Li , Vineet Marwah , Amit Ganesh
IPC分类号： G06F17/30
CPC分类号： G06F17/30 , G06F17/30348
摘要： In a database system having a plurality of concurrently executing session processes, the method commences by establishing a master list of sequences, the master list comprising a plurality of sequence objects which in turn define a sequence of values used for numbering and other identification within the database system. To reduce sequence cache latch access contention, multiple tiers of latches are provided. Methods of the system provide a first tier having a first tier “global” latch to serialize access to the master list. A second tier of latches is provided, the second tier having multiple second tier latches to serialize access to corresponding allocated sequences of values such that at any point in time, only one of the concurrently executing session processes is granted access to the allocated sequence.
摘要翻译：在具有多个同时执行的会话处理的数据库系统中，该方法通过建立序列的主列表开始，主列表包括多个序列对象，这些序列对象又定义用于数据库中的编号和其他识别的值序列系统。为了减少序列高速缓存锁存器访问争用，提供多层锁存器。系统的方法提供具有第一层“全局”锁存器的第一层以串行化对主列表的访问。提供了第二层锁存器，第二层具有多个第二层锁存器，以串行化对相应分配的值序列的访问，使得在任何时间点，只允许一个并发执行的会话进程访问所分配的序列。

115. 发明授权

US08935223B2 Structure of hierarchical compressed data structure for tabular data 有权
标题翻译：表格数据的分层压缩数据结构的结构
公开(公告)号：US08935223B2
公开(公告)日：2015-01-13
申请号：US12617669
申请日：2009-11-12
申请人： Amit Ganesh , Vikram Kapoor , Vineet Marwah , Kam Shergill , Roger MacNicol , Sachin Kulkarni , Jesse Kamp
发明人： Amit Ganesh , Vikram Kapoor , Vineet Marwah , Kam Shergill , Roger MacNicol , Sachin Kulkarni , Jesse Kamp
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/30315
摘要： A highly flexible and extensible structure is provided for physically storing tabular data. The structure, referred to as a compression unit, may be used to store tabular data that logically resides in any type of table-like structure. According to one embodiment, compression units are recursive. Thus, a compression unit may have a “parent” compression unit to which it belongs, and may have one or more “child” compression units that belong to it. In one embodiment, compression units include metadata that indicates how the tabular data is stored within them. The metadata for a compression unit may indicate, for example, whether the data is stored in row-major or column major-format, the order of the columns within the compression unit (which may differ from the logical order of the columns dictated by the definition of their logical container), a compression technique for the compression unit, the child compression units (if any), etc.
摘要翻译：提供了高度灵活和可扩展的结构，用于物理存储表格数据。称为压缩单元的结构可用于存储逻辑上位于任何类型的类似桌面结构的表格数据。根据一个实施例，压缩单元是递归的。因此，压缩单元可以具有它所属的“父”压缩单元，并且可以具有属于它的一个或多个“子”压缩单元。在一个实施例中，压缩单元包括指示表格数据如何被存储在其中的元数据。压缩单元的元数据例如可以指示数据是以主要还是列主格式存储的，压缩单元内的列的顺序（其可以不同于由其逻辑容器的定义），压缩单元的压缩技术，子压缩单元（如果有的话）等等

116. 发明授权

US08635194B2 System and method for data compression 有权
标题翻译：用于数据压缩的系统和方法
公开(公告)号：US08635194B2
公开(公告)日：2014-01-21
申请号：US11584415
申请日：2006-10-19
申请人： Dheeraj Pandey , Bharath Aleti , Joy Forsythe , Amit Ganesh
发明人： Dheeraj Pandey , Bharath Aleti , Joy Forsythe , Amit Ganesh
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30943 , H03M7/30
摘要： A method of processing data from a file includes obtaining a first portion of the file, creating a first compression unit by compressing at least the first portion of the file, obtaining a second portion of the file, creating a second compression unit by compressing at least the second portion of the file, and storing the first and second compression unit such that each of the first and the second compression units can be individually accessed. A method of processing data from a file includes receiving a request to access a portion of the file, determining one or more sub-units that include compressed data associated with the portion of the file, de-compressing the compressed data in the one or more sub-units to obtain de-compressed data, and transmitting the de-compressed data in response to the request.
摘要翻译：一种从文件处理数据的方法包括获取文件的第一部分，通过至少压缩文件的第一部分来创建第一压缩单元，获得文件的第二部分，通过至少压缩来创建第二压缩单元文件的第二部分，并且存储第一和第二压缩单元，使得可以单独访问第一和第二压缩单元中的每一个。一种从文件处理数据的方法包括接收访问该文件的一部分的请求，确定一个或多个子单元，该子单元包括与该文件的该部分相关联的压缩数据，对该一个或多个文件中的压缩数据进行解压缩子单元以获得解压缩数据，以及响应于该请求发送解压缩数据。

117. 发明授权

US08392382B2 On-line transaction processing (OLTP) compression and re-compression of database data 有权
公开(公告)号：US08392382B2
公开(公告)日：2013-03-05
申请号：US11875642
申请日：2007-10-19
申请人： Vineet Marwah , Valentin G. Stredie , Dheeraj Pandey , Amit Ganesh
发明人： Vineet Marwah , Valentin G. Stredie , Dheeraj Pandey , Amit Ganesh
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： G06F17/30563 , G06F17/30315 , G06F17/30377 , G06F17/30592 , G06F2212/401 , H03M7/30
摘要： A computer is programmed to compress data of a database in response to database modification language (DML) statements generated by on-line transaction processing (OLTP) systems. In several embodiments, data that is initially added to a database block is left uncompressed until a predetermined condition is satisfied, which happens infrequently (relative to OLTP transactions on the block). When satisfied, the computer automatically compresses all uncompressed data in the block, which increases the amount of unused space in the block. New data is thereafter added uncompressed to the partially compressed block, until satisfaction of a predetermined condition whereby the partially compressed block is again compressed, i.e. re-compressed. Adding of new data to a partially compressed block and its compression are repeated unless another predetermined condition is met, in response to which the block is not further re-compressed, thereby to recognize a limit on the benefit from compression.

118. 发明授权

US08195702B2 Online index builds and rebuilds without blocking locks 有权
标题翻译：在线索引构建和重建而不阻止锁定
公开(公告)号：US08195702B2
公开(公告)日：2012-06-05
申请号：US11830545
申请日：2007-07-30
申请人： Shrikanth Shankar , Ramesh Kumar , Krishna Kunchithapadam , Ananth Raghavan , Dheeraj Pandey , Amit Ganesh , Joy M. Forsythe
发明人： Shrikanth Shankar , Ramesh Kumar , Krishna Kunchithapadam , Ananth Raghavan , Dheeraj Pandey , Amit Ganesh , Joy M. Forsythe
IPC分类号： G06F17/30
CPC分类号： G06F17/30336
摘要： Techniques are provided for processing a CREATE INDEX statement that avoids one or more locks on the underlying table. The processing of such a statement may be divided into a build phase and a cooperation phase. During the build phase, a journal table is created and published. A snapshot of the table is obtained after the last DML transaction (that was pending at the time the journal table was published) commits. The index is built based on the state of the table as of the snapshot. Any changes to the table while the index is built are recorded in the journal table. During the cooperation phase, the index is partially published. A subsequent DML statement determines whether any changes in the journal table affect the same data as the subsequent DML statement. If so, then those changes are applied to the index followed by the subsequent DML statement.
摘要翻译：提供了技术来处理CREATE INDEX语句，以避免基础表上的一个或多个锁。这种陈述的处理可分为建立阶段和合作阶段。在构建阶段，创建并发布日志表。该表的快照是在最后一个DML事务（在发布日志表时挂起的）提交之后获得的。索引是基于快照的表的状态构建的。索引构建时对表的任何更改记录在日记表中。在合作阶段，该指数部分公布。随后的DML语句确定日记表表中的任何更改是否会影响与后续DML语句相同的数据。如果是这样，那么这些更改将应用于后面跟随的DML语句的索引。

119. 发明申请

US20120117038A1 LAZY OPERATIONS ON HIERARCHICAL COMPRESSED DATA STRUCTURE FOR TABULAR DATA 审中-公开
标题翻译：用于数据数据的分层压缩数据结构的LAZY操作
公开(公告)号：US20120117038A1
公开(公告)日：2012-05-10
申请号：US13296435
申请日：2011-11-15
申请人： Amit Ganesh , Vikram Kapoor , Vineet Marwah , Kam Shergill , Roger MacNicol , Sachin Kulkarni , Jesse Kamp
发明人： Amit Ganesh , Vikram Kapoor , Vineet Marwah , Kam Shergill , Roger MacNicol , Sachin Kulkarni , Jesse Kamp
IPC分类号： G06F7/00
CPC分类号： G06F16/221
摘要： A highly flexible and extensible structure is provided for physically storing tabular data. The structure, referred to as a compression unit, may be used to physically store tabular data that logically resides in any type of table-like structure. Techniques are employed to avoid changing tabular data within existing compression units. Deleting tabular data within compression units is avoided by merely tracking deletion requests, without actually deleting the data. Inserting new tabular data into existing compression units is avoided by storing the new data external to the compression units. If the number of deletions exceeds a threshold, and/or the number of new inserts exceeds a threshold, new compression units may be generated. When new compression units are generated, the previously-existing compression units may be discarded to reclaim storage, or retained to allow reconstruction of prior states of the tabular data.
摘要翻译：提供了高度灵活和可扩展的结构，用于物理存储表格数据。称为压缩单元的结构可以用于物理地存储逻辑上驻留在任何类型的类似桌面结构中的表格数据。采用技术来避免在现有压缩单元内改变表格数据。只有跟踪删除请求才能避免在压缩单元内删除表格数据，而不会实际删除数据。通过将新的数据存储在压缩单元外部来避免将新的表格数据插入现有的压缩单元。如果删除的数量超过阈值，和/或新插入的数量超过阈值，则可能产生新的压缩单元。当生成新的压缩单元时，先前存在的压缩单元可能被丢弃以回收存储，或保留以允许重建表格数据的先前状态。

120. 发明申请

US20100281079A1 COMPRESSION ANALYZER 有权
标题翻译：压缩分析仪
公开(公告)号：US20100281079A1
公开(公告)日：2010-11-04
申请号：US12769508
申请日：2010-04-28
申请人： Vineet Marwah , Vikram Kapoor , Amit Ganesh , Jesse Kamp , Sachin Kulkarni , Roger Macnicol , Kam Shergill , Manosiz Bhattacharyya
发明人： Vineet Marwah , Vikram Kapoor , Amit Ganesh , Jesse Kamp , Sachin Kulkarni , Roger Macnicol , Kam Shergill , Manosiz Bhattacharyya
IPC分类号： G06F17/30
CPC分类号： H03M7/30 , G06F17/30595
摘要： Techniques are described herein for automatically selecting the compression techniques to be used on tabular data. A compression analyzer gives users high-level control over the selection process without requiring the user to know details about the specific compression techniques that are available to the compression analyzer. Users are able to specify, for a given set of data, a “balance point” along the spectrum between “maximum performance” and “maximum compression”. The point thus selected is used by the compression analyzer in a variety of ways. For example, in one embodiment, the compression analyzer uses the user-specified balance point to determine which of the available compression techniques qualify as “candidate techniques” for the given set of data. The compression analyzer selects the compression technique to use on a set of data by actually testing the candidate compression techniques against samples from the set of data. After testing the candidate compression techniques against the samples, the resulting compression ratios are compared. The compression technique to use on the set of data is then selected based, in part, on the compression ratios achieved during the compression tests performed on the sample data.
摘要翻译：这里描述了用于自动选择要在表格数据上使用的压缩技术的技术。压缩分析仪为用户提供了对选择过程的高级控制，而不需要用户了解有关压缩分析器可用的特定压缩技术的细节。用户可以为给定的数据集指定沿“最大性能”和“最大压缩”之间的“平衡点”。所选择的点由压缩分析器以各种方式使用。例如，在一个实施例中，压缩分析器使用用户指定的平衡点来确定哪个可用的压缩技术符合给定的数据集合的“候选技术”。压缩分析仪通过对来自该组数据的样本实际测试候选压缩技术来选择对一组数据使用的压缩技术。在针对样品测试候选压缩技术之后，比较所得到的压缩比。然后，部分地基于在对样本数据执行的压缩测试期间实现的压缩比来选择在该组数据上使用的压缩技术。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式