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

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

公开(公告)号：US20060155679A1

公开(公告)日：2006-07-13

申请号：US11030303

申请日：2005-01-07

申请人： Ravikanth Kothuri ,  Siva Ravada

发明人： Ravikanth Kothuri ,  Siva Ravada

IPC分类号： G06F17/30

CPC分类号： G06F17/30333 ,  G06F17/30241 ,  Y10S707/99933 ,  Y10S707/99939

摘要： A method, system, and computer program product provides improved performance for queries on local partitioned indexes. A method of performing a database query comprises receiving a query of spatial data in a database, the database comprising at least one partitioned spatial index, obtaining metadata relating to all partitions of the spatial index using array-fetching techniques, determining, for each partition, whether the partition is relevant to the query by comparing with “footprint” (root_mbr) information stored in the metadata for the partition, and processing the query on each relevant partition.

摘要翻译： 方法，系统和计算机程序产品为本地分区索引的查询提供了改进的性能。 执行数据库查询的方法包括：在数据库中接收空间数据的查询，所述数据库包括至少一个分区的空间索引，使用数组提取技术获得与空间索引的所有分区有关的元数据， 通过与存储在分区的元数据中的“footprint”（root_mbr）信息进行比较，以及在每个相关分区上处理查询，分区是否与查询相关。

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

公开(公告)号：US08269764B2

公开(公告)日：2012-09-18

申请号：US11906785

申请日：2007-10-03

申请人： Siva Ravada ,  Ravi Kothuri ,  Baris M. Kazar

发明人： Siva Ravada ,  Ravi Kothuri ,  Baris M. Kazar

IPC分类号： G06T15/00

CPC分类号： G06F17/30241 ,  G06F17/30592

摘要： Systems, methodologies, media, and other embodiments associated with a three dimensional spatial engine in an RDBMS are described. One example system includes logic to receive and store data representing a set of spatial features of a three dimensional geometry object. The example system may also include logic to validate the three dimensional geometry object and to provide a signal concerning the validity of the object.

摘要翻译： 描述了与RDBMS中的三维空间引擎相关联的系统，方法，介质和其他实施例。 一个示例系统包括用于接收和存储表示三维几何对象的一组空间特征的数据的逻辑。 示例系统还可以包括用于验证三维几何对象并提供关于对象的有效性的信号的逻辑。

公开(公告)号：US08248409B2

公开(公告)日：2012-08-21

申请号：US12287835

申请日：2008-10-14

申请人： Baris M. Kazar ,  Siva Ravada ,  Ravi Kothuri

发明人： Baris M. Kazar ,  Siva Ravada ,  Ravi Kothuri

IPC分类号： G06T17/00 ,  G06T15/40 ,  G06F7/00 ,  G06F17/30

CPC分类号： G06T19/00 ,  G06T15/06 ,  G06T17/10

摘要： Systems, methods, and other embodiments associated with determining whether a point is located in a polyhedron are described. One example method includes identifying a ray that connects a query point to a second point located outside a minimum bounding volume of a solid polyhedron without intersecting a vertex of the solid polyhedron. The method includes counting crossings of planar faces of the solid polyhedron by the ray. The crossings may be mid-face crossings, edge crossings, and/or coplanar crossings. The crossings are selectively counted based on whether the ray actually crosses a face, grazes a face without crossing it, or runs coplanar with a face without crossing another face. The method includes controlling an automated process based on whether first point is inside the solid polyhedron.

摘要翻译： 描述与确定点是否位于多面体中相关联的系统，方法和其他实施例。 一个示例性方法包括识别将查询点连接到位于固体多面体的最小界限体积之外的第二点而不与实心多面体的顶点相交的光线。 该方法包括通过射线计算固体多面体的平面的交叉。 过境点可能是中间交叉口，边缘交叉口和/或共面交叉口。 根据射线是否实际穿过脸部，掠过脸部而不穿过脸部，或者与脸部共面而不穿过另一面部，来选择过路点。 该方法包括基于第一点是否在固体多面体内部来控制自动化过程。

公开(公告)号：US20120191682A1

公开(公告)日：2012-07-26

申请号：US13440702

申请日：2012-04-05

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

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

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

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.

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

公开(公告)号：US08224871B2

公开(公告)日：2012-07-17

申请号：US12852670

申请日：2010-08-09

申请人： Ravi Kothuri ,  Siva Ravada ,  Edward Fisher

发明人： Ravi Kothuri ,  Siva Ravada ,  Edward Fisher

IPC分类号： G06F17/30 ,  G06F9/44

CPC分类号： G06T17/20

摘要： Methods and other embodiments associated with performing an in-memory triangulation of a large data set are described. One example method for performing in-memory triangulation of a large data set includes partitioning a large geographical information data set into a set of stripes and generating, in-memory, a set of local triangulated irregular networks (TINs) corresponding to members of the set of stripes. Information associated with triangles associated with the set of local TINs are stored.

摘要翻译： 描述了与执行大型数据集的存储器内三角测量相关联的方法和其他实施例。 用于执行大数据集的存储器内三角测量的一个示例性方法包括将大的地理信息数据集划分成一组条带，并且在存储器中生成对应于该集合的成员的一组局部三角形不规则网络（TIN） 的条纹。 存储与与该组局部TIN相关联的三角形相关联的信息。

公开(公告)号：US08145641B2

公开(公告)日：2012-03-27

申请号：US12009456

申请日：2008-01-18

申请人： Raja Chatterjee ,  Siva Ravada

发明人： Raja Chatterjee ,  Siva Ravada

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

CPC分类号： G06F17/30241 ,  G06F17/30312 ,  G06F17/3087

摘要： Systems, methods, and other embodiments associated with registering a WFS feature type are described. One example method includes creating a feature instance table and a set of collection item tables to register the WFS feature type. Elements in the feature instance table and a collection item table may be related by a feature instance primary key value. The example method may also include producing an r-tree based spatial index for spatial content collection items stored in the set of collection item tables. The method may also include selectively processing a WFS request to manipulate (e.g., insert, delete, update) a WFS feature instance based, at least in part, on the feature instance table and the set of collection item tables. The method may also include selectively processing a WFS query associated with a WFS feature instance based, at least in part, on the r-tree based spatial index.

摘要翻译： 描述了与注册WFS特征类型相关联的系统，方法和其他实施例。 一个示例性方法包括创建特征实例表和一组收集项表以注册WFS特征类型。 要素实例表和集合项表中的元素可能与要素实例主键值相关。 示例性方法还可以包括为存储在集合项目表集合中的空间内容收集项目生成基于r-tree的空间索引。 该方法还可以包括至少部分地基于特征实例表和集合项表的集合选择性地处理WFS请求以操纵（例如，插入，删除，更新）WFS特征实例。 该方法还可以包括至少部分地基于基于r-tree的空间索引选择性地处理与WFS特征实例相关联的WFS查询。

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

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

公开(公告)号：US07877405B2

公开(公告)日：2011-01-25

申请号：US11030303

申请日：2005-01-07

申请人： Ravikanth V. Kothuri ,  Siva Ravada

发明人： Ravikanth V. Kothuri ,  Siva Ravada

IPC分类号： G06F17/30

CPC分类号： G06F17/30333 ,  G06F17/30241 ,  Y10S707/99933 ,  Y10S707/99939

摘要： A method, system, and computer program product provides improved performance for queries on local partitioned indexes. A method of performing a database query comprises receiving a query of spatial data in a database, the database comprising at least one partitioned spatial index, obtaining metadata relating to all partitions of the spatial index using array-fetching techniques, determining, for each partition, whether the partition is relevant to the query by comparing with “footprint” (root_mbr) information stored in the metadata for the partition, and processing the query on each relevant partition.

摘要翻译： 方法，系统和计算机程序产品为本地分区索引的查询提供了改进的性能。 执行数据库查询的方法包括：在数据库中接收空间数据的查询，所述数据库包括至少一个分区的空间索引，使用数组提取技术获得与所述空间索引的所有分区有关的元数据， 通过与存储在分区的元数据中的“footprint”（root_mbr）信息进行比较，以及在每个相关分区上处理查询，分区是否与查询相关。