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

公开(公告)号：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.

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

公开(公告)号：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个错误的一个测试子片段相邻的目标序列内，则返回目标序列内的测试片段的位置。

公开(公告)号：US20070130171A1

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

申请号：US11292138

申请日：2005-12-01

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

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

IPC分类号： G06F7/00

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.

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

公开(公告)号：US06631386B1

公开(公告)日：2003-10-07

申请号：US09557923

申请日：2000-04-22

申请人： Gopalan Arun ,  Ramesh Vasudevan ,  Jayanta Banerjee

发明人： Gopalan Arun ,  Ramesh Vasudevan ,  Jayanta Banerjee

IPC分类号： G06F1730

CPC分类号： G06F17/30309 ,  Y10S707/99935 ,  Y10S707/99954

摘要： A version control system is described for use in connection with a database management system to facilitate versioning of a database table, the system including a database table and a version control module. The database table comprises a plurality of records, each record including at least one data field for storing user data and at least some of the records including a version control field including version control information. The version control module is configured to, in response to a user query related to the database table and related to a version, generate an augmented query for processing by the data base management system, the augmented query relating to the user query and the version control information. The version control module facilitates association of versions of the database with respective ones of a hierarchy of states and allows conflicts therebetween to be resolved, data to be posted from child states to respective parent states in the hierarchy, and referential constraints between tables to be preserved.

摘要翻译： 描述了与数据库管理系统结合使用的版本控制系统，以促进数据库表的版本化，该系统包括数据库表和版本控制模块。 数据库表包括多个记录，每个记录包括用于存储用户数据的至少一个数据字段，并且至少一些记录包括包括版本控制信息的版本控制字段。 版本控制模块被配置为响应于与数据库表相关并且与版本相关的用户查询，生成用于由数据库管理系统处理的增强查询，与用户查询相关的增强查询和版本控制 信息。 版本控制模块便于将数据库的版本与状态层次结构中的各个相关联，并允许其间解决冲突，从子状态发布的数据到层次结构中的相应的父状态以及要保留的表之间的引用约束 。

公开(公告)号：US06505205B1

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

申请号：US10037923

申请日：2002-01-03

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

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

IPC分类号： G06F1730

CPC分类号： G06F17/30327 ,  G06F17/30333 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99934 ,  Y10S707/99937 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99945

摘要： A system and method for indexing and storing multi-dimensional or multi-attribute data. Data items are recursively sorted in a selected dimension (e.g., the dimension having the greatest variance) and divided until each subdivision fits into a leaf node having a specified fanout. Intermediate nodes and a root node are constructed to complete the index. Each node of the index is stored in a database as a separate object or record and may include a node identifier of the unique, an identifier of a parent and/or a sibling node and an entry for each child of the node, which may be data items or other nodes. Each record entry for a child includes an associated bounding area encompassing descendant data items. Another database table or module may store information about the index, such as the dimensionality of the data, the index fanout and an identifier of a root of the index.

摘要翻译： 一种用于索引和存储多维或多属性数据的系统和方法。 数据项在所选维度（例如，具有最大方差的维度）上被递归地排序，并且被划分，直到每个细分适合于具有指定扇出的叶节点。 构建中间节点和根节点以完成索引。 索引的每个节点作为单独的对象或记录存储在数据库中，并且可以包括唯一的节点标识符，父节点和/或兄弟节点的标识符以及节点的每个子节点的条目，其可以是 数据项或其他节点。 每个儿童记录条目包括一个包含后代数据项的相关联的边界区域。 另一个数据库表或模块可以存储关于索引的信息，例如数据的维度，索引扇出和索引的根的标识符。

公开(公告)号：US06381605B1

公开(公告)日：2002-04-30

申请号：US09322901

申请日：1999-05-29

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

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

IPC分类号： G06F1730

CPC分类号： G06F17/30327 ,  G06F17/30333 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99934 ,  Y10S707/99937 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99945

摘要： A system and method for indexing and storing multi-dimensional or multi-attribute data. Data items are recursively sorted in a selected dimension (e.g., the dimension having the greatest variance) and divided until each subdivision fits into a leaf node having a specified fanout. Intermediate nodes and a root node are constructed to complete the index. Each node of the index is stored in a database as a separate object or record and may include a node identifier of the unique, an identifier of a parent and/or a sibling node and an entry for each child of the node, which may be data items or other nodes. Each record entry for a child includes an associated bounding area encompassing descendant data items. Another database table or module may store information about the index, such as the dimensionality of the data, the index fanout and an identifier of a root of the index.

摘要翻译： 一种用于索引和存储多维或多属性数据的系统和方法。 数据项在所选维度（例如，具有最大方差的维度）上被递归地排序，并且被划分，直到每个细分适合于具有指定扇出的叶节点。 构建中间节点和根节点以完成索引。 索引的每个节点作为单独的对象或记录存储在数据库中，并且可以包括唯一的节点标识符，父节点和/或兄弟节点的标识符以及节点的每个子节点的条目，其可以是 数据项或其他节点。 每个儿童记录条目包括一个包含后代数据项的相关联的边界区域。 另一个数据库表或模块可以存储关于索引的信息，例如数据的维度，索引扇出和索引的根的标识符。

公开(公告)号：US09098566B2

公开(公告)日：2015-08-04

申请号：US13114965

申请日：2011-05-24

申请人： Jagannathan Srinivasan ,  Yongmei Xie ,  Jayanta Banerjee

发明人： Jagannathan Srinivasan ,  Yongmei Xie ,  Jayanta Banerjee

IPC分类号： G06F17/30

CPC分类号： G06F17/30604 ,  G06F17/30292

摘要： Disclosed is an approach for presenting RDF data as a set of relational views. By presenting the RDF data as relational views, this permits integrated access to the RDF-based data from existing relational database tools, such as by asserting SQL queries against the relational views. One or more classes are identified within the RDF data, wherein a relational view of the set of the relational views maps properties relating to a particular class.

摘要翻译： 公开了一种将RDF数据呈现为一组关系视图的方法。 通过将RDF数据呈现为关系视图，这允许从现有关系数据库工具集成访问基于RDF的数据，例如通过针对关系视图断言SQL查询。 在RDF数据内识别一个或多个类，其中关系视图集合的关系视图映射与特定类相关的属性。

公开(公告)号：US08156083B2

公开(公告)日：2012-04-10

申请号：US11291446

申请日：2005-12-01

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

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

IPC分类号： G07F17/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.

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

公开(公告)号：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个错误的一个测试子片段相邻的目标序列内，则返回目标序列内的测试片段的位置。