Anguel K Novoselsky

7774700, Aug 10, 2010

Jun 20, 2006

11/471743

Anguel Novoselsky - Foster City CA, US

Oracle International Corporation - Redwood Shores CA

G06F 17/27
G06F 9/45

715236, 717136, 715235

A method and apparatus is provided for partial evaluation of XML queries for program analysis. An executable version of a first body of instructions that conforms to an XML computer language, such as XSLT, is generated. The executable version may include trace instructions for collecting information about executing the executable version against representative data, such as an XML schema document. This execution causes the generation of an execution graph, which may be optimized by the collected information. Based on the execution graph, a second body of instructions is generated that conforms to a different computer language, such as XQuery. Subsequently, the second body of instructions may be applied against XML documents that conform to the same schema as the representative data. By generating the second body of instructions before source XML documents are received, several optimizations may be made that greatly decrease the time for querying and/or transforming XML documents.

7949941, May 24, 2011

Oct 28, 2005

11/261684

Zhen Hua Liu - San Mateo CA, US
Muralidhar Krishnaprasad - Fremont CA, US
Anguel Novoselsky - San Mateo CA, US

Oracle International Corporation - Redwood Shores CA

G06F 17/27

715234, 715236, 715237, 715239

Transformation of a set of XML documents via an XSLT stylesheet is made more efficient by rewriting the stylesheet at compile-time, based on the structural description of the set of XML documents, into an optimized stylesheet containing fewer dynamic template-matching calls than the original stylesheet. This rewritten stylesheet can be further rewritten into a set of XQuery expressions. At compile-time, the particular transformation templates that are appropriate for transforming the particular nodes contained in the set of XML documents are determined, and XSLT calls to the templates are converted to calls to corresponding XQuery user-defined functions. Determination of the appropriate transformation templates may be based on the structural description of the input set of XML documents, such as an XML Schema or Document Type Definition. The data from each template is translated into corresponding XQuery constructors, instructions from the template are translated into XQuery expressions, and the XQuery functions are inlined if possible.

8266151, Sep 11, 2012

Oct 30, 2009

12/610047

Anguel Novoselsky - Foster City CA, US
Zhen Hua Liu - San Mateo CA, US
Thomas Baby - Maple Valley WA, US

Oracle International Corporationn - Redwood Shores CA

G06F 7/00
G06F 17/30

707741, 707797, 715721

A method and apparatus are provided for building and using a persistent XML tree index for navigating an XML document. The XML tree index is stored separately from the XML document content, and thus is able to optimize performance through the use of fixed-sized index entries. The XML document hierarchy need not be constructed in volatile memory, so creating and using the XML tree index scales even for large documents. To evaluate a path expression including descendent or ancestral syntax, navigation links can be read from persistent storage and used directly to find the nodes specified in the path expression. The use of an abstract navigational interface allows applications to be written that are independent of the storage implementation of the index and the content. Thus, the XML tree index can index documents stored at least in a database, a persistent file system, or as a sequence of in memory.

8312030, Nov 13, 2012

Feb 18, 2009

12/388249

Zhen Hua Liu - San Mateo CA, US
Thomas Baby - Maple Valley WA, US
Sukhendu Chakraborty - San Francisco CA, US
Anguel Novoselsky - Foster City CA, US

Oracle International Corporation - Redwood Shores CA

G06F 17/30
G06F 7/00

707756, 707755

Techniques are provided for efficiently evaluating XML queries that conform to an extension of an XML language (e. g. , XQuery or XPath). The extension allows XML queries to have full-text search capabilities. Such an XML query is compiled to generate a tree of nodes that correspond to one or more conditions in the full-text portion of the query. In one technique, the amount of memory for the execution state of the tree is determined at compile time and allocated only once throughout execution of the query. In another technique, to ensure at most a single scan of a document, all the words or phrases in the full-text portion of an XML query are located before any of the other conditions in the full-text portion are evaluated. In another technique, the elements of the full-text portion of an XML query are analyzed to determine, based at least in part on cost, which evaluation strategy, of a plurality of evaluation strategies, should be employed.

8434076, Apr 30, 2013

Dec 12, 2007

11/954757

Anguel Novoselsky - Foster City CA, US
Zhen Hua Liu - San Mateo CA, US

Oracle International Corporation - Redwood Shores CA

G06F 9/45

717154, 717136, 717140, 717150, 717160

A system which combines sequential and iterative source code is provided. The system decides which type of processing would be most suitable for all portions of the source code, regardless of type. The system can adjust that decision based on the specific nature of the constructs within the source code, and can also adjust that decision based on the platform upon which the resulting executable program will run.

8447785, May 21, 2013

Jun 2, 2010

12/792659

Zhen Hua Liu - San Mateo CA, US
Thomas Baby - Maple Valley WA, US
Sukhendu Chakraborty - San Francisco CA, US
Junyan Ding - Palo Alto CA, US
Anguel Novoselsky - Foster City CA, US
Vikas Arora - San Francisco CA, US

Oracle International Corporation - Redwood Shores CA

G06F 17/30

707796

A method, computing device, and a non-transitory computer-readable medium is provided for facilitating a context-aware search on documents stored in an unstructured database column. The database server determines whether a document stored in an unstructured database object is marked up according to a recognized markup language. Documents that conform to the markup language are indexed with value-to-node mappings and node-to-physical-location mappings to provide a context-aware search of marked up nodes within the documents. Documents that do not conform to the markup language are indexed with value-to-document mappings to provide a full-text search of the documents. The database server evaluates a context-aware search against documents that conform to the markup language within the unstructured column without requiring the user identify the documents as XML documents and store the documents in an XMLType structured column.

8566343, Oct 22, 2013

Aug 30, 2010

12/871869

Thomas Baby - Maple Valley WA, US
Sukhendu Chakraborty - San Francisco CA, US
Junyan Ding - Palo Alto CA, US
Zhen Hua Liu - San Mateo CA, US
Anguel Novoselsky - Foster City CA, US

Oracle International Corporation - Redwood Shores CA

G06F 17/30

707769, 707723, 707749

A method, computing device, and a non-transitory computer-readable medium are provided for performing a context-aware search by finding a set of nodes that are mapped to a given text or other value and, for each node in the set of nodes, performing a reverse path lookup to determine whether the node satisfies a given context. The query processor performs the reverse path lookup for a node by traversing up a node tree away from the node, using a stored mapping from the node to a parent of the node. Using mappings from nodes to parent nodes, the node tree is traversed backwards from the node up to distant ancestor nodes through parent nodes. An optimizer instructs the query processor to perform a value-based portion of the search before a path-based portion of the search based on value distribution statistics and path distribution statistics.

20080098002, Apr 24, 2008

Jul 13, 2007

11/777504

Meghna Mehta - Santa Clara CA, US
Yuhuan (Bill) Han - San Jose CA, US
Jinyu Wang - Austin TX, US
K. Karun - Sammamish WA, US
Anguel Novoselsky - Foster City CA, US
Tim Yu - Cupertino CA, US
Kongyi Zhou - Fremont CA, US

G06F 17/30

707 10, 707E17032

Techniques for implementing a schema-aware mid-tier binary XML are provided. Token vocabularies are stored in a repository that is accessible to mid-tier applications from separate database systems. The token vocabularies are thus shared among the mid-tier applications of each database system. The repository may be part of a file system or database that is separate from any of the database systems, or the repository may be part of one of the database systems.