公开(公告)号：US08340917B2

公开(公告)日：2012-12-25

申请号：US12634118

申请日：2009-12-09

申请人： Jayanta Banerjee ,  Seema Sundara

发明人： Jayanta Banerjee ,  Seema Sundara

IPC分类号： G01N33/48 ,  G06G7/48

CPC分类号： G06F19/22

摘要： Systems, methods, and other embodiments associated with sequence matching with no more than a number E errors are disclosed. A test fragment to be located within a target sequence with at most a number E errors is received. The test fragment is broken into E+1 test sub-fragments. If one test sub-fragment is located within the target sequence with no errors; a determination is made as to whether the other test sub-fragments are located within the target sequence adjacent to the one test sub-fragment with a total of at most E errors. If the other test sub-fragments are located within the target sequence adjacent the one test sub-fragment with at most E errors, a location of the test fragment within the target sequence is returned.

摘要翻译： 公开了与不超过E个错误的序列匹配相关联的系统，方法和其他实施例。 接收到位于目标序列内的测试片段，其最多具有数目E错误。 测试片段被分解成E + 1测试子片段。 如果一个测试子片段位于目标序列内，没有错误; 确定其他测试子片段是否位于与一个测试子片段相邻的目标序列中，总共至多为E个错误。 如果其他测试子片段位于与至多E个错误的一个测试子片段相邻的目标序列内，则返回目标序列内的测试片段的位置。

公开(公告)号：US20110136686A1

公开(公告)日：2011-06-09

申请号：US12634118

申请日：2009-12-09

申请人： Jayanta Banerjee ,  Seema Sundara

发明人： Jayanta Banerjee ,  Seema Sundara

IPC分类号： C40B30/02 ,  C40B60/12 ,  C40B40/00

CPC分类号： G06F19/22

摘要： Systems, methods, and other embodiments associated with sequence matching with no more than a number E errors are disclosed. A test fragment to be located within a target sequence with at most a number E errors is received. The test fragment is broken into E+1 test sub-fragments. If one test sub-fragment is located within the target sequence with no errors; a determination is made as to whether the other test sub-fragments are located within the target sequence adjacent to the one test sub-fragment with a total of at most E errors. If the other test sub-fragments are located within the target sequence adjacent the one test sub-fragment with at most E errors, a location of the test fragment within the target sequence is returned.

摘要翻译： 公开了与不超过E个错误的序列匹配相关联的系统，方法和其他实施例。 接收到位于目标序列内的测试片段，其最多具有数目E错误。 测试片段被分解成E + 1测试子片段。 如果一个测试子片段位于目标序列内，没有错误; 确定其他测试子片段是否位于与一个测试子片段相邻的目标序列中，总共至多为E个错误。 如果其他测试子片段位于与至多E个错误的一个测试子片段相邻的目标序列内，则返回目标序列内的测试片段的位置。

公开(公告)号：US09384222B2

公开(公告)日：2016-07-05

申请号：US13440702

申请日：2012-04-05

申请人： Jayanta Banerjee ,  Robert Hanckel ,  Siva Ravada

发明人： Jayanta Banerjee ,  Robert Hanckel ,  Siva Ravada

IPC分类号： G06F17/30

CPC分类号： G06F17/30306

摘要： Techniques for history enabling a table in a database system so that past versions of rows of the history-enabled table are available for temporal querying. The table is history enabled by adding a start time column to the table and creating a history table for the history-enabled table. The start time field's value in a row of the history-enabled table indicates when the contents of the row last changed. The rows of the history table are copies of rows of the history-enabled table that have been deleted or updated. The rows include end time fields whose values indicate when the row was updated or deleted. A history table's row thus indicates a period in which the history table's row was in the history-enabled table. Temporal queries are performed on a view which is the union of the history-enabled table and the history table.

摘要翻译： 用于历史的技术，使数据库系统中的表能够使历史启用的表的行的历史版本可用于时间查询。 通过向表中添加开始时间列并为启用历史记录的表创建历史记录表来启用表。 历史使能表中的行的起始时间字段的值指示行的内容何时更改。 历史记录表的行是已经被删除或更新的启用历史记录的表的行的副本。 这些行包括结束时间字段，其值指示行何时更新或删除。 历史表格的行因此表示历史记录表的行在启用历史记录的表中的一段时间。 时间查询是在具有历史记录功能的表和历史记录表的联合的视图上执行的。

公开(公告)号：US20100169966A1

公开(公告)日：2010-07-01

申请号：US12317858

申请日：2008-12-30

申请人： Aravind Yalamanchi ,  Souripriya Das ,  Jayanta Banerjee ,  John Thomas

发明人： Aravind Yalamanchi ,  Souripriya Das ,  Jayanta Banerjee ,  John Thomas

IPC分类号： G06F17/30 ,  G06F17/00 ,  G06F21/00

CPC分类号： G06F17/30507 ,  G06F21/6245

摘要： Systems, methods, and other embodiments associated with resource description framework (RDF) security are described. One example method includes generating, based on sensitivity labels associated with the contents of a triple in an RDF record, a sensitivity label. The example method may also include comparing the sensitivity label to an access label associated with an entity requesting an action associated with the record to be performed. The example method may also include performing the action upon determining that the entity has sufficient permission to request the action.

摘要翻译： 描述了与资源描述框架（RDF）安全性相关联的系统，方法和其他实施例。 一个示例性方法包括基于与RDF记录中的三元组的内容相关联的灵敏度标签来生成灵敏度标签。 示例性方法还可以包括将灵敏度标签与与请求与要执行的记录相关联的动作的实体相关联的访问标签进行比较。 该示例方法还可以包括在确定该实体具有足够的请求该动作的许可之后执行该动作。

公开(公告)号：US20070130226A1

公开(公告)日：2007-06-07

申请号：US11291446

申请日：2005-12-01

申请人： Jayanta Banerjee ,  Robert Hanckel ,  Siva Ravada

发明人： Jayanta Banerjee ,  Robert Hanckel ,  Siva Ravada

IPC分类号： G06F17/30

CPC分类号： G06F17/30306

摘要： Techniques for history enabling a table in a database system so that past versions of rows of the history-enabled table are available for temporal querying. The table is history enabled by adding a start time column to the table and creating a history table for the history-enabled table. The start time field's value in a row of the history-enabled table indicates when the contents of the row last changed. The rows of the history table are copies of rows of the history-enabled table that have been deleted or updated. The rows include end time fields whose values indicate when the row was updated or deleted. A history table's row thus indicates a period in which the history table's row was in the history-enabled table. Temporal queries are performed on a view which is the union of the history-enabled table and the history table.

摘要翻译： 用于历史的技术，使数据库系统中的表能够使历史启用的表的行的历史版本可用于时间查询。 通过向表中添加开始时间列并为启用历史记录的表创建历史记录表来启用表。 历史使能表中的行的起始时间字段的值指示行的内容何时更改。 历史记录表的行是已经被删除或更新的启用历史记录的表的行的副本。 这些行包括结束时间字段，其值指示行何时更新或删除。 历史表格的行因此表示历史记录表的行在启用历史记录的表中的一段时间。 时间查询是在具有历史记录功能的表和历史记录表的联合的视图上执行的。

公开(公告)号：US06470344B1

公开(公告)日：2002-10-22

申请号：US09384648

申请日：1999-08-27

申请人： Ravi Kothuri ,  Siva Ravada ,  Jayant Sharma ,  Jayanta Banerjee ,  Ambuj Singh

发明人： Ravi Kothuri ,  Siva Ravada ,  Jayant Sharma ,  Jayanta Banerjee ,  Ambuj Singh

IPC分类号： G06F1730

CPC分类号： G06F17/30327 ,  G06F17/30333 ,  G06F17/30592 ,  Y10S707/957 ,  Y10S707/99945

摘要： Methods are provided for buffering nodes of a hierarchical index (e.g., R-tree, bang file, hB-tree) during operations on multi-dimensional data represented by the index. The methods are particularly suited for query operations, and a different method may be more suitable for one pattern of queries than another. Where queries are distributed in a relatively uniform manner across the domain or dataspace of an index, a node-area buffering method is provided. In this method nodes are cached or buffered in order of their respective areas (e.g., their minimum bounding areas), and a node having a smaller area will be replaced in cache before a node having a larger area. When, however, queries are not uniformly distributed, then a least frequently accessed buffering technique may be applied. According to this method statistics are maintained concerning the frequency with which individual index nodes are accessed. Those accessed less frequently are replaced in cache before those accessed more frequently. Yet another, generic, buffering strategy is provided that is suitable for all patterns of query distribution. In accordance with this method, whenever a node must be removed from cache in order to make room for a newly accessed node, cached nodes are compared to each other to determine which provides the least caching benefit and may therefore be ejected. A comparison may involve three factors—the difference in the nodes' areas, the difference in the frequency with which they have been accessed and the difference between their latest access times. These factors may be weighted to give them more or less effect in relation to each other.

摘要翻译： 提供了用于在由索引表示的多维数据的操作期间缓冲分层索引（例如，R-tree，bang文件，hB-树）的节点的方法。 这些方法特别适用于查询操作，并且不同的方法可能比另一种更适合于一种查询模式。 在索引的域或数据空间中以相对均匀的方式分布查询的情况下，提供了节点区域缓冲方法。 在这种方法中，节点按照它们各自的区域（例如，它们的最小边界区域）的顺序进行缓存或缓冲，并且具有较小区域的节点将在具有较大面积的节点之前在高速缓存中被替换。 然而，当查询不是均匀分布时，则可以应用最不频繁访问的缓冲技术。 根据该方法，关于访问各个索引节点的频率来维持统计。 访问次数较少的用户在更频繁访问的缓存中被替换。 提供了另一种适用于所有查询分发模式的通用缓冲策略。 根据该方法，每当节点必须从高速缓存中移除以便为新访问的节点腾出空间时，将缓存的节点彼此进行比较，以确定哪个节点提供最小的缓存优点并且因此可以被弹出。 比较可能涉及三个因素 - 节点区域的差异，访问频率的差异以及其最新访问时间之间的差异。 这些因素可能被加权，以使他们或多或少相互影响。

公开(公告)号：US6128610A

公开(公告)日：2000-10-03

申请号：US139526

申请日：1998-08-25

申请人： Jagannathan Srinivasan ,  Samuel De Fazio ,  Anil Nori ,  Souripriya Das ,  Chuck Freiwald ,  Jayanta Banerjee

发明人： Jagannathan Srinivasan ,  Samuel De Fazio ,  Anil Nori ,  Souripriya Das ,  Chuck Freiwald ,  Jayanta Banerjee

IPC分类号： G06F17/30

CPC分类号： G06F17/30321 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99943

摘要： A method and apparatus for efficiently storing and retrieving data in a database using index-only tables is disclosed. Storing a row of data in a database using index-only tables involves storing in a leaf node an index entry that includes a key value along with all other values in the row of data. If the row of data exceeds a predetermined size, then a portion of the row of data is stored in a user specified overflow area. Retrieving a row of data from an index-only table for a user-supplied key involves identifying a leaf node for the key, and reading a row of data from the index entry and any remaining portion from the overflow area when the row exceeds the predetermined size.

摘要翻译： 公开了一种使用仅索引表在数据库中有效地存储和检索数据的方法和装置。 使用仅索引表存储数据库中的一行数据涉及在叶节点中存储包含键值的索引条目以及数据行中的所有其他值。 如果该数据行超过预定大小，则该行数据的一部分被存储在用户指定的溢出区域中。 从用户提供的密钥的仅索引表中检索一行数据涉及识别密钥的叶节点，并且当该行超过预定的值时从索引条目读取一行数据和来自溢出区域的剩余部分 尺寸。

公开(公告)号：US09244981B2

公开(公告)日：2016-01-26

申请号：US12317858

申请日：2008-12-30

申请人： Aravind Yalamanchi ,  Souripriya Das ,  Jayanta Banerjee ,  John Thomas

发明人： Aravind Yalamanchi ,  Souripriya Das ,  Jayanta Banerjee ,  John Thomas

IPC分类号： G06F17/30 ,  G06F21/62

CPC分类号： G06F17/30507 ,  G06F21/6245

摘要： Systems, methods, and other embodiments associated with resource description framework (RDF) security are described. One example method includes generating, based on sensitivity labels associated with the contents of a triple in an RDF record, a sensitivity label. The example method may also include comparing the sensitivity label to an access label associated with an entity requesting an action associated with the record to be performed. The example method may also include performing the action upon determining that the entity has sufficient permission to request the action.

摘要翻译： 描述了与资源描述框架（RDF）安全性相关联的系统，方法和其他实施例。 一个示例性方法包括基于与RDF记录中的三元组的内容相关联的灵敏度标签来生成灵敏度标签。 示例性方法还可以包括将灵敏度标签与与请求与要执行的记录相关联的动作的实体相关联的访问标签进行比较。 该示例方法还可以包括在确定该实体具有足够的请求该动作的许可之后执行该动作。

公开(公告)号：US07970742B2

公开(公告)日：2011-06-28

申请号：US11292138

申请日：2005-12-01

申请人： Robert Hanckel ,  Jayanta Banerjee ,  Siva Ravada

发明人： Robert Hanckel ,  Jayanta Banerjee ,  Siva Ravada

IPC分类号： G06F17/30

CPC分类号： G06F17/30551

摘要： Techniques for history enabling a table in a database system so that past versions of rows of the history-enabled table are available for temporal querying. The table is history enabled by adding a start time column to the table and creating a history table for the history-enabled table. The history table's rows are copies of rows of the history-enabled table that have changed and include start time and end time fields whose values indicate a period in which the history table's row was in the history-enabled table. Temporal queries are performed on a view which is the union of the history-enabled table and the history table. The temporal queries are speeded up by period of time indexes in which the leaves are grouped based on time period size, identifiers are assigned to the groups, and the keys of the index include the group identifiers.

摘要翻译： 用于历史的技术，使数据库系统中的表能够使历史启用的表的行的历史版本可用于时间查询。 通过向表中添加开始时间列并为启用历史记录的表创建历史记录表，可以启用历史记录。 历史记录表的行是已更改的历史记录表的行的副本，并且包含起始时间和结束时间字段，其值表示历史记录表的行在启用历史记录的表中的一段时间。 时间查询是在具有历史记录功能的表和历史记录表的联合的视图上执行的。 时间查询通过基于时间段大小对叶片进行分组的时间段索引进行加速，标识符被分配给组，索引的密钥包括组标识符。

公开(公告)号：US20090077135A1

公开(公告)日：2009-03-19

申请号：US12102831

申请日：2008-04-14

申请人： Aravind Yalamanchi ,  Dieter Gawlick ,  Jayanta Banerjee

发明人： Aravind Yalamanchi ,  Dieter Gawlick ,  Jayanta Banerjee

IPC分类号： G06F17/30

CPC分类号： G06F17/30359

摘要： Techniques are provided for freeing up resources before operations that change the resources have successfully completed. Resources are freed up by committing database transactions that perform portions of operations before the operations themselves have successfully completed. If the operations fail to complete successfully, then “compensation information” is used to remove the effects of the committed changes that were performed as part of the operation. Techniques are also provided for allowing database transactions to update values without retaining exclusive locks on those values. Operational constraints set forth conditions that must be satisfied before an update is allowed to proceed. If an attempt is made to update a particular value that has changes that may be undone, then the database server determines a plurality of “possible result values” for the particular value. If the possible result values satisfy the operational constraint conditions, then the update is allowed to proceed.

摘要翻译： 提供了在更改资源成功完成的操作之前释放资源的技术。 通过在操作本身已经成功完成之前提交执行部分操作的数据库事务来释放资源。 如果操作无法成功完成，则使用“补偿信息”来消除作为操作一部分而执行的所作出的更改的影响。 还提供了允许数据库事务更新值而不保留这些值的排他锁的技术。 操作约束规定了允许进行更新之前必须满足的条件。 如果尝试更新具有可以被撤销的变化的特定值，则数据库服务器确定特定值的多个“可能的结果值”。 如果可能的结果值满足操作约束条件，则允许进行更新。