Ambuj Kumar Singh

US Patent:

7933915, Apr 26, 2011

Filed:

Feb 27, 2007

Appl. No.:

11/711326

Inventors:

Ambuj Kumar Singh - Santa Barbara CA, US
Huahai He - Goleta CA, US

Assignee:

The Regents of the University of California - Oakland CA

International Classification:

G06F 17/30

US Classification:

707760, 711161, 711162

Abstract:

A method for analyzing, querying, and mining graph databases using subgraph and similarity querying. An index structure, known as a closure tree, is defined for topological summarization of a set of graphs. In addition, a significance model is created in which the graphs are transformed into histograms of primitive components. Finally, connected substructures or clusters, comprising paths or trees, are detected in networks found in the graph databases using a random walk technique and a repeated random walk technique.

US Patent:

8396884, Mar 12, 2013

Filed:

Mar 28, 2011

Appl. No.:

13/073452

Inventors:

Ambuj Kumar Singh - Santa Barbara CA, US
Huahai He - San Jose CA, US
Sayan Ranu - Goleta CA, US

Assignee:

The Regents of the University of California - Oakland CA

International Classification:

G06F 17/30

US Classification:

707760, 707798, 707E1703

Abstract:

A method for analyzing, querying, and mining graph databases using subgraph and similarity querying. An index structure, known as a closure tree, is defined for topological summarization of a set of graphs. In addition, a significance model is created in which the graphs are transformed into histograms of primitive components. Finally, connected substructures or clusters, comprising paths or trees, are detected in networks found in the graph databases using a random walk technique and a repeated random walk technique.

US Patent:

20120290624, Nov 15, 2012

Filed:

May 8, 2012

Appl. No.:

13/466669

Inventors:

Ambuj K. Singh - Santa Barbara CA, US
Sayan Ranu - Goleta CA, US

Assignee:

THE REGENTS OF THE UNIVERSITY OF CALIFORNIA - Oakland CA

International Classification:

G06F 17/30

US Classification:

707803, 707E17044

Abstract:

A technique for mining pharmacophore patterns including computer-implemented methods for generating a database of pharmacophores and computer-implemented methods for classifying a query molecule with the database of pharmacophores. Generation of the pharmacophore database includes methods of defining a Joint Pharmacophore Space (JPS) using the three-dimensional geometry of pharmacophoric features of all active molecules against multiple targets.

US Patent:

6470344, Oct 22, 2002

Filed:

Aug 27, 1999

Appl. No.:

09/384648

Inventors:

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

Assignee:

Oracle Corporation - Redwood Shores CA

International Classification:

G06F 1730

US Classification:

707100, 7071041

Abstract:

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.