Abstract: Methods and systems for providing a flexible protection model in a computer system by decoupling protection from privilege are described. Information describing a relationship between the two or more domains that define types of protection and portions of code is received. The portions of code with the multiple domains that provide fine granularities of protection can be executed in the same privilege level. The relationship is not required to be linear. In addition, the overhead associated with crossing protection domains is relatively low with respect to traditional operating system context switching overhead.

Abstract: Systems and methods for providing data source analytics are provided. Results of a query of an unstructured data source and a query of a structured data source are merged. The merged results are stored at an in-memory database that is local to an analytics component. The analytics component is executed to access the merged results from the in-memory database and provide an output corresponding to contents of the structured data source and the unstructured data source.

Abstract: Systems and apparatuses are provided for a distributed aggregate user defined function processing system. A non-transitory computer readable medium stores instructions for a query compiler to identify a call to a distributed aggregate user defined function within a query of the distributed analytical data processing system, retrieve metadata associated with the distributed aggregate user defined function, and validate and resolve respective inputs and outputs of a plurality of function partitions associated with the distributed aggregate user defined function according to the retrieved metadata. A distributed processing engine includes a plurality of processing nodes to execute the plurality of function partitions and organize data flow from the plurality of function partitions to produce an output for the distributed aggregate user defined function.

Abstract: The present disclosure provides a computer-implemented method of handling data quality in a real-time information management environment. The method includes acquiring a first data set from an unstructured data source using a probabilistic Natural Language Processing (pNLP) engine, the first data set comprising a first tuple that describes a relationship and a corresponding probability that the relationship is accurate. The method also includes acquiring a second data set from a structured data source, the second data set comprising a second tuple that describes second relationship and probability reflecting that the second relationship is accurate. The method also includes storing the first and second data sets into a common data store using a common data format that includes the probabilities corresponding to the first data set and second data set.

Abstract: Systems and apparatuses are provided for a distributed aggregate user defined function processing system. A non-transitory computer readable medium stores instructions for a query compiler to identify a call to a distributed aggregate user defined function within a query of the distributed analytical data processing system, retrieve metadata associated with the distributed aggregate user defined function, and validate and resolve respective inputs and outputs of a plurality of function partitions associated with the distributed aggregate user defined function according to the retrieved metadata. A distributed processing engine includes a plurality of processing nodes to execute the plurality of function partitions and organize data flow from the plurality of function partitions to produce an output for the distributed aggregate user defined function.

Abstract: Optimized query plans are partitioned into equivalence groups that each include equivalence classes. Each equivalence group corresponds to a particular compiled, normalized, and parameterized query plan prior to optimization. Each equivalence class within an equivalence group corresponds to a different query plan corresponding to the particular compiled, normalized, and parameterized query plan represented by the equivalence group that has been optimized with respect to the selectivity of one or more predicate clauses of the query that is compiled to produce the particular compiled, normalized, and parameterized query plan. Optimized query plans are cached according to their respective equivalence groups and equivalence classes.

Abstract: The present disclosure provides a computer-implemented method of processing a business intelligence client request in real-time using Unified Information Access System architecture. The method includes receiving a business intelligence client request and acquiring data from a plurality of data sources relevant to the business intelligence client request. A first portion of the data is acquired from a first data source in a first data format native to the first data source, and a second portion of the data is acquired from a second data source in a second data format native to the second data source. The method also includes converting the data into a common data format and storing the data to a common data store. The method also includes processing the business intelligence client request on the common data store.

Abstract: A distributed computing system includes a plurality of processors and shared memory service entities executable on the processors. Each of the shared memory service entities is associated with a local shared memory buffer. A producer is associated with a particular shared memory service entity, and the producer provides data that is stored in the local shared memory buffer associated with the particular shared memory service entity. The shared memory service entities propagate content of the local shared memory buffers into a global shared memory, wherein propagation of content of the local shared memory buffers to the global shared memory is performed using a procedure that relaxes guarantees of consistency between the global shared memory and the local shared memory buffers.

Abstract: Embodiments of the present invention partition optimized query plans into equivalence groups, each comprising one or more equivalence classes. Each equivalence group corresponds to a particular compiled, normalized, and parameterized query plan prior to optimization. Each equivalence class within an equivalence group corresponds to a different query plan corresponding to the particular compiled, normalized, and parameterized query plan represented by the equivalence group that has been optimized with respect to the selectivity of one or more predicate clauses of the query that is compiled to produce the particular compiled, normalized, and parameterized query plan. Optimized query plans are cached according to their respective equivalence groups and equivalence classes.

Abstract: A distributed computing system includes a plurality of processors and shared memory service entities executable on the processors. Each of the shared memory service entities is associated with a local shared memory buffer. A producer is associated with a particular shared memory service entity, and the producer provides data that is stored in the local shared memory buffer associated with the particular shared memory service entity. The shared memory service entities propagate content of the local shared memory buffers into a global shared memory, wherein propagation of content of the local shared memory buffers to the global shared memory is performed using a procedure that relaxes guarantees of consistency between the global shared memory and the local shared memory buffers.

Abstract: A system and method for virtual memory management. A plurality of virtual memory pages having selectable page sizes are used to tailor memory allocations in a way which balances overallocation of memory against the number of entries saved in accessing that memory through the translation buffer. A library routine can act on the overallocated memory to hide memory requests from the operating system.

Abstract: A method of performing remote process execution in a computer network. A remote process execution request, including an identification of a process to be executed, is transmitted from a requesting computer to a serving computer. At both the requesting and the serving computers, a file addressing structure is established, so that a file reference by the remote process at the serving computer addresses a file located at the requesting computer. The remote process is activated at the serving computer in response to the remote process execution request. In response to a file reference by the remote process, the file is automatically accessed from the requesting computer in accordance with the addressing structure. The method includes a technique by means of which files may be selectively and automatically accessed from either the requesting or the serving computer, as desired by a user.

Abstract: A method of propagating resource information among computers of a computer network in a fully distributed (or decentralized) fashion. A solicit message from a client one of the computers is transmitted to one or more prescribed server ones of the computers each time the client computer is made operative in the newtork. In response to the solicit message, each of the prescribed server computers determines if it is available as a resource to the client computer. The server then transmits a positive response message or a negative response message to the client computer if the server computer is available or unavailable, respectively.In addition, when a server computer becomes available as a resource to one or more client computers, it transmits an advertisement message to the prospective client or clients.