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

71. 发明申请

US20100278446A1 STRUCTURE OF HIERARCHICAL COMPRESSED DATA STRUCTURE FOR TABULAR DATA 有权
标题翻译：用于数据数据的分层压缩数据结构的结构
公开(公告)号：US20100278446A1
公开(公告)日：2010-11-04
申请号：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分类号： G06K9/36
CPC分类号： G06F17/30315
摘要： A highly flexible and extensible structure is provided for physically storing tabular data. The structure, is referred to as a compression unit, and may be used to physically 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 within the compression unit is stored in row-major or column major-format (or some combination thereof), 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.
摘要翻译：提供了高度灵活和可扩展的结构，用于物理存储表格数据。该结构被称为压缩单元，并且可以用于物理地存储逻辑上驻留在任何类型的表状结构中的表格数据。根据一个实施例，压缩单元是递归的。因此，压缩单元可以具有它所属的“父”压缩单元，并且可以具有属于它的一个或多个“子”压缩单元。在一个实施例中，压缩单元包括指示表格数据如何被存储在其中的元数据。压缩单元的元数据例如可以指示压缩单元内的数据是以主要或列主格式（或其某种组合）存储的，压缩单元中的列的顺序（其可以不同从逻辑容器的定义指定的列的逻辑顺序），压缩单元的压缩技术，子压缩单元（如果有的话）等等

72. 发明申请

US20100030781A1 METHOD AND APPARATUS FOR AUTOMATICALLY CLASSIFYING DATA 有权
标题翻译：用于自动分类数据的方法和装置
公开(公告)号：US20100030781A1
公开(公告)日：2010-02-04
申请号：US11933756
申请日：2007-11-01
申请人： Daniel ManHung Wong , Amit Ganesh , Bipul Sinha , Chi Ching Chui
发明人： Daniel ManHung Wong , Amit Ganesh , Bipul Sinha , Chi Ching Chui
IPC分类号： G06F17/30
CPC分类号： G06F21/6227
摘要： One embodiment of the present invention provides a system for automatically classifying data in a database. During operation, the system receives and executes a database operation. Next, the system automatically determines if any data was modified as a result of executing the database operation. If so, for each data item that was modified, the system automatically determines if the data item is associated with a classification-rule. If so, the system automatically reclassifies the data item according to the classification-rule. If not, the system leaves a classification of the data item unchanged.
摘要翻译：本发明的一个实施例提供一种用于在数据库中自动分类数据的系统。在运行期间，系统接收并执行数据库操作。接下来，由于执行数据库操作，系统会自动确定是否修改了任何数据。如果是，对于修改的每个数据项，系统自动确定数据项是否与分类规则相关联。如果是这样，系统会根据分类规则自动重新分类数据项。如果没有，系统会保留数据项的分类。

73. 发明申请

US20090292947A1 CASCADING INDEX COMPRESSION 有权
公开(公告)号：US20090292947A1
公开(公告)日：2009-11-26
申请号：US12469637
申请日：2009-05-20
申请人： Amit Ganesh , Juan R. Loaiza , Krishna Kunchithapadam
发明人： Amit Ganesh , Juan R. Loaiza , Krishna Kunchithapadam
IPC分类号： G06F11/07 , G06F17/30
CPC分类号： G06F11/1474 , G06F17/30
摘要： Techniques for maintaining a cascading index are provided. In one approach, one or more branch node compression techniques are applied to the main index of a cascading index. In an approach, a Bloom filter is generated and associated with, e.g., a branch node in the main index. The Bloom filter is used to determine whether, without accessing any leaf blocks, a particular key value exists, e.g., in leaf blocks associated with the branch node. In an approach, a new redo record is generated in response to a merge operation between two levels of the cascading index. The new redo record comprises (a) one or more addresses of blocks that are affected by the merge operation, (b) data is that being “pushed down” to a lower level of the cascading index, and (c) one or more addresses of blocks that are written to disk storage as a result of the merge operation.
摘要翻译：提供了维护级联索引的技术。在一种方法中，一个或多个分支节点压缩技术被应用于级联索引的主索引。在一种方法中，生成Bloom过滤器并与例如主索引中的分支节点相关联。 Bloom过滤器用于确定在不访问任何叶片块的情况下是否存在特定的键值，例如在与分支节点相关联的叶片块中。在一种方法中，响应于级联索引的两个级别之间的合并操作，生成新的重做记录。新的重做记录包括（a）受合并操作影响的块的一个或多个地址，（b）数据被“下推”到级联索引的较低级，以及（c）一个或多个地址作为合并操作的结果写入磁盘存储的块。

74. 发明申请

US20090037366A1 ONLINE INDEX BUILDS AND REBUILDS WITHOUT BLOCKING LOCKS 有权
标题翻译：在线索引建立和重建，没有阻塞锁
公开(公告)号：US20090037366A1
公开(公告)日：2009-02-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语句的索引。

75. 发明申请

US20070288529A1 Framework to optimize delete all rows operations on database objects 有权
标题翻译：优化框架来删除数据库对象上的所有行操作
公开(公告)号：US20070288529A1
公开(公告)日：2007-12-13
申请号：US11450092
申请日：2006-06-09
申请人： Amit Ganesh , Niloy Mukherjee , Manosiz Bhattacharyya , Bipul Sinha
发明人： Amit Ganesh , Niloy Mukherjee , Manosiz Bhattacharyya , Bipul Sinha
IPC分类号： G06F17/30
CPC分类号： G06F17/30442
摘要： A bulk delete operation with reduced latency allows for retrieval of deleted data. Each database object holds a Delete SCN indicating when a bulk delete operation was last performed. Each row in the database object holds a Row Modification SCN indicating when the row was last updated. A bulk delete is performed by writing the old value of the Delete SCN to the undo tablespace and updating the Delete SCN. No undo information is stored for the rows. A write is performed by finding a deleted row, storing undo information for the deleted row and writing over the deleted row. To read from the database object, a rollback operation is performed, if necessary. Those rows are then retrieved for which the Row Modification SCN is higher than the Delete SCN and is less than or equal to the timestamp for the requested data.
摘要翻译：减少延迟的批量删除操作允许检索已删除的数据。每个数据库对象保存一个删除SCN，指示上次执行批量删除操作的时间。数据库对象中的每一行都保存一行行修改SCN，指示行何时上次更新。通过将删除SCN的旧值写入undo表空间并更新删除SCN来执行批量删除。没有为行存储撤消信息。通过查找删除的行，存储删除的行的撤消信息并写入被删除的行来执行写入。要从数据库对象读取，必要时执行回滚操作。然后检索行修改SCN高于删除SCN并且小于或等于所请求数据的时间戳的那些行。

76. 发明申请

US20060149791A1 Database-driven distributed recovery 审中-公开
标题翻译：数据库驱动的分布式恢复
公开(公告)号：US20060149791A1
公开(公告)日：2006-07-06
申请号：US11031275
申请日：2005-01-06
申请人： Bipul Sinha , Amit Ganesh , Vivekanandhan Raja
发明人： Bipul Sinha , Amit Ganesh , Vivekanandhan Raja
IPC分类号： G06F17/30
CPC分类号： G06F9/466 , G06F16/2365
摘要： A method and apparatus for database-driven distributed recovery is provided. According to one aspect, a transaction manager sends, to one or more resource managers, connection information that indicates how to connect to the transaction manager. A resource manager that receives the connection information establishes an association between the connection information and the distributed transaction for which the connection information was received. If the resource manager is ever in doubt concerning whether the distributed transaction should be committed, the resource manager uses the associated connection information to send, to the transaction manager, a request for status information. The transaction manager maintains status information that indicates whether the distributed transaction should be committed, and responds to the resource manager with the requested status information. The resource manager receives the status information and, based on the status information, either commits or rolls back its portion of the distributed transaction.
摘要翻译：提供了一种用于数据库驱动的分布式恢复的方法和装置。根据一个方面，事务管理器向一个或多个资源管理器发送指示如何连接到事务管理器的连接信息。接收连接信息的资源管理器建立连接信息和接收到连接信息的分布式事务之间的关联。如果资源管理器对于是否应该提交分布式事务是有疑问的，则资源管理器使用关联的连接信息向事务管理器发送状态信息请求。事务管理器维护状态信息，指示是否应该提交分布式事务，并使用所请求的状态信息来响应资源管理器。资源管理器接收状态信息，并根据状态信息提交或回滚其分布式事务的部分。

77. 发明申请

US20050256849A1 Automatic tuning of undo retention 有权
标题翻译：自动调整撤销保留
公开(公告)号：US20050256849A1
公开(公告)日：2005-11-17
申请号：US10846099
申请日：2004-05-13
申请人： Vasudha Krishnaswamy , Amit Ganesh
发明人： Vasudha Krishnaswamy , Amit Ganesh
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30377 , Y10S707/99931 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： A method and apparatus for data recovery are disclosed. A plurality of queries executing in a database system are tracked. A query with a longest duration is selected and undo retention duration is calculated for supporting the longest query.
摘要翻译：公开了一种用于数据恢复的方法和装置。跟踪在数据库系统中执行的多个查询。选择具有最长持续时间的查询，并计算撤销保留期限以支持最长查询。

78. 发明申请

US20050240633A1 Online recovery of user tables using flashback table 有权
标题翻译：使用闪回表在线恢复用户表
公开(公告)号：US20050240633A1
公开(公告)日：2005-10-27
申请号：US10831449
申请日：2004-04-23
申请人： Vasudha Krishnaswamy , Amit Ganesh
发明人： Vasudha Krishnaswamy , Amit Ganesh
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30377 , G06F11/1458 , G06F11/1469 , G06F17/30067 , Y10S707/99933 , Y10S707/99942 , Y10S707/99953
摘要： A method and apparatus for updating databases are disclosed. In response to a flashback request, a database object is restored to a state as of a specified flashback time. The changes introduced into the database object are reversed in a sequence starting with a change introduced into the database object immediately before issuance of the flashback request and ending with a change introduced into the database object immediately after the specified flashback time.
摘要翻译：公开了一种用于更新数据库的方法和装置。响应闪回请求，数据库对象恢复到指定闪回时间的状态。引入到数据库对象中的更改在序列中颠倒，从在发出闪回请求之前立即引入到数据库对象中的更改开始，并在指定的闪回时间之后立即引入到数据库对象中的更改结束。

79. 发明申请

US20050120062A1 System, structure, interface, and semantics for implementing row versions: accessing past versions of a data item 有权
标题翻译：用于实现行版本的系统，结构，接口和语义：访问数据项的过去版本
公开(公告)号：US20050120062A1
公开(公告)日：2005-06-02
申请号：US10934079
申请日：2004-09-03
申请人： Bipul Sinha , Vivekanandhan Raja , Amit Ganesh , Kenneth Jacobs
发明人： Bipul Sinha , Vivekanandhan Raja , Amit Ganesh , Kenneth Jacobs
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30309
摘要： Disclosed is a mechanism, system, interface, and process to allow specification of a new table decoration clause to obtain one or more past version of one or more data items. The version query provides for a direct interface to get multiple versions of the row(s). In addition, information about the past versions can be retrieved and displayed along with the past versions. Also disclosed are algorithms, mechanisms, and processes that are employed to implement a query upon past versions. In one approach, the version query can be defined as either “rowid”-based access or non-rowid based access. With rowid based access, a given rowid is used to identify the data for which past versions are desired. Also disclosed is a process for determining one or more life intervals when given a key.
摘要翻译：公开了允许指定新的表装饰子句以获得一个或多个数据项的一个或多个过去版本的机制，系统，接口和过程。版本查询提供了一个直接接口来获取多个版本的行。此外，可以检索和显示过去版本的信息以及过去的版本。还公开了用于在过去版本上实现查询的算法，机制和过程。在一种方法中，版本查询可以被定义为基于“rowid”的访问或基于非rowid的访问。使用基于rowid的访问，给定的rowid用于标识需要过去版本的数据。还公开了当给予钥匙时确定一个或多个生命间隔的过程。

80. 发明申请

US20050055384A1 Query based invalidation subscription 有权
标题翻译：基于查询的无效订阅
公开(公告)号：US20050055384A1
公开(公告)日：2005-03-10
申请号：US10866344
申请日：2004-06-10
申请人： Amit Ganesh , Bipul Sinha , Michael De Groot , Eric Bing , Srinivas Vemuri
发明人： Amit Ganesh , Bipul Sinha , Michael De Groot , Eric Bing , Srinivas Vemuri
IPC分类号： G06F17/30
CPC分类号： G06F17/3048 , G06F17/30516
摘要： A query result set is an example of a type of body of data whose content is defined by a query. Modifications to a database can change the result of a query and therefore what the content of such a body of data, such as a result set, should be. Active Queries is an approach that enables a database server to detect database changes that alter the result of a query registered for a client and to notify a client of those changes. The notifications may be sent to, for example, a cache manager responsible for maintaining coherency of a result set cache generated by the query. The notification notifies the cache manager of when and/or what changes are needed to maintain the coherency of the cache.
摘要翻译：查询结果集是其内容由查询定义的数据主体类型的示例。对数据库的修改可以改变查询的结果，因此这样一个数据体的内容，比如结果集，应该是什么。活动查询是一种使数据库服务器能够检测数据库更改的方法，可更改为客户端注册的查询结果，并通知客户端这些更改。通知可以被发送到例如负责维护由查询生成的结果集缓存的一致性的高速缓存管理器。该通知通知高速缓存管理器需要什么时候和/或需要什么改变来维持高速缓存的一致性。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式