Oracle International Corporation

Microsoft Technology Licensing, LLC

Muralidhar Krishnaprasad

Zhen Hua Liu

Thomas Chang

Meeten Bhavsar

James W Warner

Vikas Arora

Anand Manikutty

Ravi Murthy

Visar Nimani

Sachin Bhatkar

Mark Ture

Susan M Kotsovolos

Joaquin Delgado

Hui Ouyang

Ciya Liao

Cindy Hsin

Mark Davis

Anil Kumar Nori

Rohan Angrish

Hiroshi Koide

Chi-Ming Yang

Subramanian Muralidhar

Sivasankaran Chandrasekar

Lu Xun

Kartik Paramasivam

Hui Joe Chang

Viswanathan Krishnamurthy

Hui Zhang

Radhakrishnan Srikanth

Nipun Agarwal

Eric Sedlar

Ying Lu

Geeta Arora

Jayteerth Narasingrao Katti

Manu Srivastava

Neema Jalali

Ankur Agrawal

Balachandar Pavadaisamy

Karuna Muthiah

Sudhir Mohan Jorwekar

Vishu Krishnamurthy

Hua-Jun Zeng

Thomas Baby

Nimar Singh Arora

Bhushan Khaladkar

Sundeep Abraham

Venkata Raja Gopal Ravipati

Qin Yu

Bin Li

Sung Hwa Jin

Ruppert Rolf Koch

Sharique Muhammed

Lakshmi Suresh Goduguluru

Lik Wong

Affan Arshad Dar

Sriram Krishnamurthy

Edwina Lu

Anurag Gupta

Anguel Novoselsky

Wesley Lin

Manoj K Valiyaparambil

Abhyudaya Agrawal

Pramod Gurunath

Samar Abbas

Amit Kumar Yadav

Vishwanathan Krishnamurthy

Steve Yang

Gopal Krishan

Steve Chi-Ming Yang

David Liao

Elvin Morales

Stuart John Langley

Hui X Zhang

Techniques are described herein for storing instances of data among nodes of a distributed store based on hierarchical scale unit values. Hierarchical scale unit values are assigned to the respective nodes of the distributed store. A first instance (e.g., a primary instance) of a data module is stored in a first node having a first hierarchical scale unit value. A primary instance of the data module with respect to a data operation is an instance of the data module at which the data operation with respect to the data module is initiated or initially directed. A second instance (e.g., a primary or secondary instance) of the data module is stored in a second node having a second hierarchical scale unit value based on a magnitude of a difference between the first hierarchical scale unit value and the second hierarchical scale unit value. A secondary instance is essentially a 'back-up' instance.

Hierarchical scale unit values for storing instances of data

A flexible and extensible architecture allows for secure searching across an enterprise. Such an architecture can provide a simple Internet-like search experience to users searching secure content inside (and outside) the enterprise. The architecture allows for the crawling and searching of a variety of sources across an enterprise, regardless of whether any of these sources conform to a conventional user role model. The architecture further allows for security attributes to be received at query time, for example, in order to provide real-time secure access to enterprise resources. The user query also can be transformed to provide for dynamic querying that provides for a more current result list than can be obtained for static queries.

Flexible framework for secure search

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

Systems and methods that aggregate memory capacity of multiple computers into a single unified cache, via a layering arrangement. Such layering arrangement is scalable to a plurality of machines and includes a data manager component, an object manager component and a distributed object manager component, which can be implemented in a modular fashion. Moreover, the layering arrangement can provide for an explicit cache tier (e.g., cache-aside architecture) that applications are aware about, wherein decision are made explicitly which objects to put/remove in such applications (as opposed to an implicit cache wherein application do not know the existence of the cache).

Distributed cache arrangement

Flexible authentication framework

Aspects of the subject matter described herein relate migrating message for a messaging service. In aspects, a determination is made that messages need to be migrated based on a threshold being crossed. In response, an agent is instructed to migrate data associated with the messages to another location. The agent uses various factors to determine one or more queues to migrate. While a queue is being migrated, during a first portion of the migration, messages may be added to and removed from the queue as senders send new messages and receivers consume messages. During a second portion of the migration, the queue is frozen to disallow the queue to be used for receiving new messages and delivering queued messages. The migration may be orchestrated to attempt to achieve certain goals.

High density hosting for messaging service

A messaging entity configured in a memory of first node of a plurality communicatively coupled nodes is disclosed. The nodes are included in a distributed computing system. The messaging entity is configured to operate as a secondary messaging entity in a messaging server for the plurality communicatively coupled nodes. The messaging entity is communicatively couple to a primary messaging entity configured in a memory of a second node of the plurality of nodes. The primary messaging entity is configured to store a message; store a copy of the message.

Consistent messaging with replication

A database server that manages a database retrieves metadata that is stored, within the database, in association with a procedure that is stored in the database. Based on the metadata, a Web service definition is automatically constructed to describe the procedure as a Web service. The WSDL definition can be referenced to construct SOAP messages with the appropriate arguments and in the appropriate format which, when received, are converted to a suitable format for invoking execution of the procedure by the database server.

Techniques for automatically exposing, as web services, procedures and functions stored in a database

A mechanism is provided for accessing XML data in a database system using a combination of a XML Table Index table and a XML Path Index table. By using a combination of a XML Table Index and a XML Path Index, both selection access and navigational access involved in a query can be optimized. For example, the XML Table Index gives the database system an ability to readily evaluate the predicate expression, thereby improving the selection access. Moreover, in some embodiments, the selection access can be further improved by using secondary indexes on columns contained in the XML Table Index table. In a complementary manner, the XML Path Index table gives the database system an ability to navigate to a specific location given a path expression, thereby improving the navigational access. Thus, by combining both tables, both selection and navigational accesses are improved.

Techniques of efficient XML query using combination of XML table index and path/value index

Hierarchical scale unit values for storing instances of data among nodes of a distributed store

A flexible and extensible architecture allows for secure searching across an enterprise. Such an architecture can provide a simple Internet-like search experience to users searching secure content inside (and outside) the enterprise. The architecture allows for the crawling and searching of a variety of sources across an enterprise, regardless of whether any of these sources conform to a conventional user role model. The architecture further allows for security attributes to be submitted at query time, for example, in order to provide real-time secure access to enterprise resources. The user query also can be transformed to provide for dynamic querying that provides for a more current result list than can be obtained for static queries.

Search hit URL modification for secure application integration

Growing community of inventors

Fremont, CA, United States of America

Muralidhar Krishnaprasad