Oracle International Corporation

Oracle International Corpration

Ravi Murthy

Nipun Agarwal

Eric Sedlar

Sivasankaran Chandrasekar

Muralidhar Krishnaprasad

Sam Idicula

Namit Jain

James W Warner

Ashish Thusoo

Anand Manikutty

Zhen Hua Liu

Asha Tarachandani

Viswanathan Krishnamurthy

Aman Naimat

Abhyudaya Agrawal

Jagannathan Srinivasan

Thomas Baby

Susan M Kotsovolos

Bhushan Khaladkar

Sreedhar Mukkamalla

Anh-Tuan Tran

Neema Jalali

Nikhil Raghavan

Vikas Arora

Visar Nimani

Syam Sundar Pannala

Fei Ge

Anil Nori

Thuvan Hoang

Subramanian Muralidhar

Nitin Kumar Gupta

Vikram Kapoor

Nimar Singh Arora

Dinesh Das

Geeta Arora

Sundeep Abraham

Rohan Angrish

Adiel Yoaz

Andrea Di Blas

Sivansankaran Chandrasekar

Man-Hay Tam

Sivasankaran Chandrasekaran

Lik Wong

Thomas Chang

Seema Sundara

Bhaskar Ghosh

Balasubramanyam Sthanikam

Ravikanth Kasamsetty

Edwina Lu

Hui Zhang

Wesley Lin

Qin Yu

Olga Peschansky

Rajagopalan Govindarajan

K Karun

Vijay Medi

Ajay Sethi

Paul A Reilly

James Stenoish

Samuel DeFazio

Sanket Malde

Dmitry Lenkov

Kwok Lun Alex Yiu

Chin Hong

Reema Koo

Mayssam Sayyadian

Shashaanka Agrawal

Anjana Manian

Ellen Batbouta

Nicolas Montoya

Doug McMahon

Doug Mc Mahon

Arkady Rabinov

Nitin Gupta

A declarative mechanism is used to manage large documents within a repository. The large documents are sectioned into subdocuments that are linked together by a parent document. The combination of the parent document and subdocument is referred to as a compound document. There are multiple options for configuring rules to break up a source document into a compound document and naming the subdocuments. The compound documents may be queried using statements that treat the compound document as a single XML document, or the parent document of a subdocument may be queried and treated independently. Access control and versioning can be applied at the finer granularity of the subdocument.

Managing compound XML documents in a repository

A validation procedure employs metadata reuse using composite path signatures to make a metadata reuse determination. The procedure is performed as part of validating a set of data objects. Validating an initial subset of data objects generates N different sets of object-specific metadata, each set of which is associated with a different composite path signature. When subsequently validating another data object, a composite path signature is generated for the data object and compared with the composite path signatures of the N different sets of object-specific metadata. If a match is found, then the object-specific metadata of the matching composite path signature is reused for the data object. The object-specific metadata is remapped to an in-memory representation of the data object.

Metadata reuse for validation against decentralized schemas

Access control rewrites generate rewritten queries that may be executed more efficiently using index evaluation to determine which rows satisfy one or more access control conditions.

Techniques for efficient access control in a database system

A method and apparatus for managing hierarchical relationships in a relational database system is provided. An 'orderkey' data type, which is native within a relational database system, is disclosed. The orderkey type is designed to contain values that represent the position of an entity relative to the positions of other entities within a hierarchy. Such values represent hierarchical relationships between those entities. Values that are of the orderkey type have properties that allow hierarchy-oriented functions to be performed in an especially efficient manner. Database functions, which operate on and/or produce values that are of the orderkey type, are also disclosed. Such functions can be placed within SQL statements that a database server executes, for example. In response to executing SQL statements that contain such functions, the database server performs hierarchy-oriented operations in a highly efficient manner.

Efficient mechanism for managing hierarchical relationships in a relational database system

Techniques are provided for encoding/decoding binary XML data in a client program before sending/receiving the XML to/from a database server. By encoding the binary XML at the client, the overhead of parsing the XML text is avoided by the database server, thus improving database server scalability. Also, the XML data is sent by the server to the client in the binary form, and the binary format is decoded by the client program to perform the necessary operations.

Client processing for binary XML in a database system

A method and apparatus for processing path-based database operations is provided. According to one aspect, a path cache is maintained. For each hierarchical node that is traversed during a path-determining operation, it is determined whether a cache entry corresponding to that node is already contained in the path cache. If such a cache entry is already contained in the path cache, then the path indicated in that cache entry is used to complete the pathname for the node for which the operation is being performed. As a result, hierarchically higher nodes do not need to be traversed to complete the operation. Alternatively, if such a cache entry is not already contained in the path cache, then a cache entry for the node currently being traversed is generated and inserted into the path cache for use in subsequent path-determining operations.

Path-caching mechanism to improve performance of path-related operations in a repository

An XML document can be represented in a compact binary form that maintains all of the features of XML data in a useable form. In response to a request for a modification (e.g., insert, delete or update a node) to an XML document that is stored in the compact binary form, a certain representation of the requested modification is computed for application directly to the binary form of the document. Thus, the requested modification is applied directly to the persistently stored binary form without constructing an object tree or materializing the XML document into a corresponding textual form. Taking into account the nature of the binary form in which the document is encoded, the bytes that actually require change are identified, including identifying where in the binary representation the corresponding actual changes need to be made.

Efficient piece-wise updates of binary encoded XML data

A database server determines, on an element-level of granularity, what form of VARRAY storage to map collections of elements defined by a XML schema. A collection element may be mapped to an in-line VARRAY or an out-of-line VARRAY. The determination may based on a variety of factors, including the database type mapped to the collection element, database limitations that limit the form storage for certain database types, and annotations ('mapping annotations') embedded within that XML schema that specifying a database type for database representation of a collection element or a form of VARRAY storage.

Flexible storage of XML collections within an object-relational database

Highly relevant search results for unstructured queries are efficiently identified from normalized data. A server graphs relationships between each of the data objects. For each search term, the server identifies a candidate set of data objects mapped to the term. The server calculates priority scores for the candidate data objects based at least in part on one or more of: a link analysis of the graph; or an analysis of metadata describing structural constraints upon the candidate data objects. Based on the graph, the server identifies one or more search result subgraphs, each comprising at least one data object from each of the candidate sets. The server looks for subgraphs in an order that is based on the priority scores for the candidate data objects. The server may terminate its search early, in part because prioritizing the candidate data objects increases the likelihood of receiving relevant search results first.

Mechanisms for searching enterprise data graphs

Techniques are disclosed for presenting semi-structured sets of search results comprising two or more differently-structured subsets of search results. The search results are divided into two or more groups of similarly-structured results. The search results are displayed in their respective groups rather than as a single set. Each group is displayed using a different display structure, in an order determined by a group ranking mechanism. The search results within a group ordered by a result ranking mechanism. Techniques are also disclosed for enhancing a display of similarly structured data by emphasizing highly relevant result fields. The highly relevant result fields may be identified based on metadata ranking mechanisms, uniqueness of their constituent values, historical feedback, keyword location, and/or other mechanisms. The fields are emphasized using, without limitation, highlighting, reordering, and filtering of unemphasized fields from the display.

Displaying results of keyword search over enterprise data

Techniques for managing XML data associated with multiple execution units ensure that execution units are able to use XML data coming from other execution units. Such techniques are applicable when, but for the technique, an XML type value is produced in a particular form by one execution unit and is supposed to be consumed by another execution unit that is unable to process data in the particular form, and involves detecting that the foregoing situation exists and annotating information sent to an XML producer execution unit to cause the XML type value to be transformed into a canonical form that can be shared by all relevant execution units.

Techniques for managing XML data associated with multiple execution units

Mechanisms are described for providing auto-completion capability in a user interface that allows users to search for XML tags and data in a collection of XML documents. A user searching for data in XML documents might not be aware of the entire structure of the data. A path context may be specified for narrowing the search to a particular set of nodes within the documents in the collection. When the user is in the process of typing in an XML tag name, but prior to submitting the tag name to the search engine, the user interface presents an ordered list of completed XML tags that match the prefix typed by the user. The order of the tags in the list reflects the frequency of the completed tags found within the specified path context of the collection of documents. Likewise, when the user is in the process of typing a string of text to be searched for within the value of XML nodes in the set of documents, but prior to submitting the test string to the search engine, the user interface presents an ordered list of completed text strings that match the partially specified text, where the order of the completed text strings reflects their frequency within the specified path context in the collection of documents.

Mechanisms for efficient autocompletion in XML search applications

Growing community of inventors

Fremont, CA, United States of America

Ravi Murthy