Abstract: Maintaining client version affinity during a rolling server cluster upgrade includes a server in the server cluster receiving a request from a client and checking the request for a version cookie indicating a software version that the client is running. Responsive to a determination that the server is running the same software version as the client, the server serves the request. Responsive to a determination that the client is running a software version matching a previous software version of the server, the server initiates a software upgrade on the client instead of servicing the request. Responsive to a determination that the server is not running the same software version as the client, the server forwards the request to one of the other servers in the server cluster that is running the same software version as the client.

Abstract: Maintaining client version affinity during a rolling server cluster upgrade includes a server in the server cluster receiving a request from a client and checking the request for a version cookie indicating a software version that the client is running. Responsive to a determination that the server is running the same software version as the client, the server serves the request. Responsive to a determination that the client is running a software version matching a previous software version of the server, the server initiates a software upgrade on the client instead of servicing the request. Responsive to a determination that the server is not running the same software version as the client, the server forwards the request to one of the other servers in the server cluster that is running the same software version as the client.

Abstract: Maintaining client version affinity during a rolling server cluster upgrade includes a server in the server cluster receiving a request from a client and checking the request for a version cookie indicating a software version that the client is running. Responsive to a determination that the server is running the same software version as the client, the server serves the request. Responsive to a determination that the client is running a software version matching a previous software version of the server, the server initiates a software upgrade on the client instead of servicing the request. Responsive to a determination that the server is not running the same software version as the client, the server forwards the request to one of the other servers in the server cluster that is running the same software version as the client.

Abstract: Maintaining client version affinity during a rolling server cluster upgrade includes a server in the server cluster receiving a request from a client and checking the request for a version cookie indicating a software version that the client is running. Responsive to a determination that the server is running the same software version as the client, the server serves the request. Responsive to a determination that the client is running a software version matching a previous software version of the server, the server initiates a software upgrade on the client instead of servicing the request. Responsive to a determination that the server is not running the same software version as the client, the server forwards the request to one of the other servers in the server cluster that is running the same software version as the client.

Abstract: A method for the managing access to a software resource is disclosed. The method may include receiving, from a particular consumer, a request for a number of permits corresponding to units of a software resource. The numbers of permits may be compared to a total number of available permits. In response to determining that the number of permits is greater than the total number of available permits, rejecting the request in response to determining the number of permits requested is within a threshold value of permits requested by another consumer who has requested the largest number of permits in a preceding time period.

Abstract: A method for the managing access to a software resource is disclosed. The method may include receiving, from a particular consumer, a request for a number of permits corresponding to units of a software resource. The numbers of permits may be compared to a total number of available permits. In response to determining that the number of permits is greater than the total number of available permits, rejecting the request in response to determining the number of permits requested is within a threshold value of permits requested by another consumer who has requested the largest number of permits in a preceding time period.

Abstract: A system and method for providing asynchrony in web services, such as Java-based web services, including in some instances use of a distributed in-memory data grid. Embodiments of the system allow a client application or client to make requests upon a server application or service. A queuing feature, such as one or more Java Message Service (JMS) queues, can be used to store incoming requests at the server side, to support asynchronous behavior. In accordance with an embodiment, instead of or in addition to JMS, the system can use a distributed in-memory data grid, such as Oracle Coherence, to provide queuing functionality.

Abstract: The challenge of communicating document caching policies from document servers to client processes in the most generally applicable manner is solved by enabling the application of caching policies to classes of documents, rather than single instances of documents. Caching policies are applied to a given class of documents by specifying caching policies in metadata that describes the structure of the class of documents that conform to the metadata. In the context of XML data documents and document fragments, an XML schema can be annotated to include a representation of a caching policy, thereby specifying the caching policy for XML data documents and fragments that conform to the corresponding XML schema.

Abstract: A compact binary encoding technique for information that is logically hierarchically structured, such as XML data, maintains all of the features of XML data in a useable form, such as the hierarchical structure underlying the data. Hence, data encoded in this format can undergo XML-based processing on-the-fly as it is being received or fetched, as if the data was being processed linearly in its textual character-based format. Processing of data encoded in this format can begin without having to wait for and decode the entire data set. The overhead due to XML tags is significantly minimized. The encoded data can be processed more efficiently because the data is pre-parsed. Values may be stored in their native type formats and, therefore, processing of the encoded data avoids costly type conversions. Further, any available structural constraint information can be effectively exploited.

Abstract: The challenge of communicating document caching policies from document servers to client processes in the most generally applicable manner is solved by enabling the application of caching policies to classes of documents, rather than single instances of documents. Caching policies are applied to a given class of documents by specifying caching policies in metadata that describes the structure of the class of documents that conform to the metadata. In the context of XML data documents and document fragments, an XML schema can be annotated to include a representation of a caching policy, thereby specifying the caching policy for XML data documents and fragments that conform to the corresponding XML schema.

Abstract: The challenge of communicating document caching policies from document servers to client processes in the most generally applicable manner is solved by enabling the application of caching policies to classes of documents, rather than single instances of documents. Caching policies are applied to a given class of documents by specifying caching policies in metadata that describes the structure of the class of documents that conform to the metadata. In the context of XML data documents and document fragments, an XML schema can be annotated to include a representation of a caching policy, thereby specifying the caching policy for XML data documents and fragments that conform to the corresponding XML schema.

Abstract: The challenge of communicating document caching policies from document servers to client processes in the most generally applicable manner is solved by enabling the application of caching policies to classes of documents, rather than single instances of documents. Caching policies are applied to a given class of documents by specifying caching policies in metadata that describes the structure of the class of documents that conform to the metadata. In the context of XML data documents and document fragments, an XML schema can be annotated to include a representation of a caching policy, thereby specifying the caching policy for XML data documents and fragments that conform to the corresponding XML schema.

Abstract: A compact binary encoding technique for information that is logically hierarchically structured, such as XML data, maintains all of the features of XML data in a useable form, such as the hierarchical structure underlying the data. Hence, data encoded in this format can undergo XML-based processing on-the-fly as it is being received or fetched, as if the data was being processed linearly in its textual character-based format. Processing of data encoded in this format can begin without having to wait for and decode the entire data set. The overhead due to XML tags is significantly minimized. The encoded data can be processed more efficiently because the data is pre-parsed. Values may be stored in their native type formats and, therefore, processing of the encoded data avoids costly type conversions. Further, any available structural constraint information can be effectively exploited.

Abstract: A method and apparatus for implementing a data construct, referred to herein as a "cursor variable", that has many of the attributes of simple variables and that can be used to access active sets of data from a database. Cursor variables identify a current set of data in an active set generated as a result of a database query. A cursor variable can be associated with any one of a number of different queries at any given time during program execution without using a host programming language. As a result, different active sets having different columns, different tables, and/or different predicates may be associated with the same cursor variable using instructions from a single programming language.