Ravi Kanth Kothuri

6470344, Oct 22, 2002

Aug 27, 1999

09/384648

Ravi Kothuri - Nashua NH
Siva Ravada - Tewksbury MA
Jayant Sharma - Nashua NH
Jayanta Banerjee - Nashua NH
Ambuj Singh - Santa Barbara CA

Oracle Corporation - Redwood Shores CA

G06F 1730

707100, 7071041

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.

6505205, Jan 7, 2003

Jan 3, 2002

10/037923

Ravi Kothuri - Nashua NH
Siva Ravada - Tewksbury MA
Jayant Sharma - Nashua NH
Jayanta Banerjee - Nashua NH

Oracle Corporation - Redwood Shores CA

G06F 1730

707100, 707 1, 707 7, 707101, 707103, 7071041

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.

7774381, Aug 10, 2010

Feb 7, 2008

12/069089

Ravi Kothuri - Nashua NH, US
Siva Ravada - Nashua NH, US
Edward Fisher - Brookline NH, US

Oracle Int'l Corp. - Redwood Shores CA

G06F 7/00
G06F 17/30

707803, 707802

Methods and other embodiments associated with performing an in-memory triangulation of an arbitrarily large data set are described. One example method for performing in-memory triangulation of an arbitrarily large data set includes striping a data set into multiple stripes, selecting a first stripe to triangulate, and then performing an in-memory triangulation on the stripe. The method may also include removing certain triangles from the triangulated irregular network produced by the triangulation, merging another stripe with the leftover data, and repeating the process until the arbitrarily large data set has been triangulated piece-by-piece, with the triangulations occurring in memory.

8224871, Jul 17, 2012

Aug 9, 2010

12/852670

Ravi Kothuri - Nashua NH, US
Siva Ravada - Nashua NH, US
Edward Fisher - Brookline NH, US

Oracle International Corporation - Redwood Shores CA

G06F 17/30
G06F 9/44

707803, 717171

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.

8228326, Jul 24, 2012

May 13, 2008

12/152147

Ravi Kothuri - Nashua NH, US
Baris M. Kazar - Nashua NH, US
Siva Ravada - Nashua NH, US

Oracle International Corporation - Redwood Shores CA

G06T 15/00

345419

Systems, methods, and other embodiments associated with determining whether geometries represented by geometry objects intersect are described. One example method recursively decomposes a higher order geometry (e. g. , solid) into a set of lower order geometries (e. g. , surfaces) and examines the lower order geometries, continuing the recursion until an intersection decision is reached. The example method includes accessing geometry objects and accessing a spatial index that stores MBVs associated with the geometry objects. The method includes extracting candidate pairs of intersecting features upon determining MBVs associated with the geometry objects intersect and providing the candidate features to a feature-feature logic. The method includes providing an intersection signal based on a features intersection signal provided by the feature-feature logic.

8248409, Aug 21, 2012

Oct 14, 2008

12/287835

Baris M. Kazar - Nashua NH, US
Siva Ravada - Nashua NH, US
Ravi Kothuri - Nashua NH, US

Oracle International Corporation - Redwood Shores CA

G06T 17/00
G06T 15/40
G06F 7/00
G06F 17/30

345420, 345421, 707705

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.

8269764, Sep 18, 2012

Oct 3, 2007

11/906785

Siva Ravada - Nashua NH, US
Ravi Kothuri - Nashua NH, US
Baris M. Kazar - Nashua NH, US

Oracle International Corporation - Redwood Shores CA

G06T 15/00

345419, 345420, 345421, 345427, 345619, 345629, 707100

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.

20040193566, Sep 30, 2004

Mar 27, 2003

10/397530

Ravi Kanth Kothuri - Nashua NH, US

G06F017/30

707/001000

A method for determining relationships among data representing regions on a surface of a body. The method includes identifying a center of a first geometry. A minimum distance is identified from the center to a boundary of the first geometry. A first circle is defined on the surface of the body having the minimum distance as its radius and the center of the first geometry as its center. The first circle is compared with a second geometry to determine if the second geometry fulfills a first filter condition with respect to the first geometry.