Abstract: One or more processors generate a data source table. The data source table is specific for a particular constrained natural language (cNL) vocabulary term from a cNL vocabulary dictionary. The data source table includes a location reference to multiple predetermined data sources that contain data related to the particular cNL vocabulary term, where at least two of the multiple predetermined data sources are disparate types of data sources as compared to each other. The data source table also includes a location reference to a materialized view of data from each of the multiple data sources, where the materialized view of data is data that is related to the particular cNL vocabulary term. One or more processors receive a request for data related to the particular cNL vocabulary term from a requester, and then retrieve data from multiple materialized views from the data source table to the requester.

Abstract: A plurality of memory maps may be allocated that represents the hash table on a memory device to store keys and values. The memory maps may comprise at least a primary map and a secondary map. A hash table operation may be performed on the primary map based on a first position computed using a first hash function, and if not successful, a bounded linear probing that probes a defined primary probe region in the primary map. Responsive to determining that the hash table operation on the primary map is not successful, the hash table operation may be performed on the secondary map based on a second position computed using a second hash function, and if not successful, a bounded linear probing that probes a defined secondary probe region in the secondary map.

Abstract: One or more processors generate a data source table. The data source table is specific for a particular constrained natural language (cNL) vocabulary term from a cNL vocabulary dictionary. The data source table includes a location reference to multiple predetermined data sources that contain data related to the particular cNL vocabulary term, where at least two of the multiple predetermined data sources are disparate types of data sources as compared to each other. The data source table also includes a location reference to a materialized view of data from each of the multiple data sources, where the materialized view of data is data that is related to the particular cNL vocabulary term. One or more processors receive a request for data related to the particular cNL vocabulary term from a requester, and then retrieve data from multiple materialized views from the data source table to the requester.

Abstract: A request to open a file from a plurality of files in a storage is received from an application. The storage is made up of an index partition, containing recordings of file system indexes, and a data partition, containing recordings of the indexes and the file system data body. A file descriptor is created with an update flag that references the file. A determination is made that the file is being updated by the application, and the update flag is set to a value representing that the file is being updated. A request to write an index of the file system is received. A determination is made whether a specific file from the plurality of files is being updated. The index is written to the storage with an extended attribute for the specific file indicating that the specific file was being updated at the time the index was written.

Abstract: Described are methods, systems and computer readable media for data partitioning and ordering.

Abstract: A client tracking mechanism has a log file analysis routine that may generate two tables, one having a licensable entity designator and last logged off time, and the other having a current session designator. The first table may be aggregated by a server that may collect data from multiple client tracking mechanisms to determine a licensable entity's sessions across multiple servers. The client tracking mechanism may save and resume analysis from the last analyzed log file entry, and may be able to track sessions that are both shorter and longer than the time between each analysis. In many embodiments, a licensable entity may be a user or a device, when a license arrangement is configured in a per-user or per-device basis.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for aggregating task data for multiple users. In one aspect, a method includes accessing action trail data that corresponds to a task and resources related to that task, wherein each task relates to one or more related topics and is defined by a sequence of user actions corresponding to the resources related to that task; clustering the action trails based on the action trail data such that each action trail cluster corresponds to a particular task and includes the action trails corresponding to that particular task; and for each action trail cluster, ranking the resources that correspond to the included action trails according to the topics of the particular task.

Abstract: Protected data is divided into a plurality of segments. For each segment in the plurality of segments, a fingerprint is generated. The plurality of fingerprints is grouped into group(s) of fingerprints and for each group of fingerprints, a group fingerprint is generated. It is determined if the group fingerprint being processed is stored in a cache and if so, the group fingerprint being processed is flagged as one for which a virtual copy will be performed.

Abstract: A server includes a triple processor with instructions executed by a processor to receive an input document, read and store document restrictions for the input document, specify a first triple permutation, and produce for each triple in the input document a record of the triple in accordance with the first triple permutation and the position of the triple in the document. The server also includes a query processor with instructions executed by a processor to receive a query, match components of the query to triples in a triple repository to form initial triples, remove triples from the initial triples in accordance with document restrictions associated with the triples to form final triples, and return the final triples.

Abstract: A storage device management method, a storage device management system and a memory storage device are provided. The method includes establishing multiple first temporary files in a first directory before receiving a setting instruction from a host, wherein the first temporary files are stored in multiple consecutive clusters of a file system and an operating system of the host is unable to access files in the first directory. The method further includes receiving the setting instruction from the host, wherein the setting instruction instructs to configure a temporary file directory in a second directory and the operating system of the host is able to access files in the second directory. The method further includes linking a cluster number of the consecutive clusters storing the first temporary files to the temporary file directory in the directory area corresponding to the file system.

Abstract: A method and system. Target clusterability is calculated as an average of a respective clusterability of at least one target data item comprised by a target domain. Target-side matchability is calculated as an average of a respective matchability of each target centroid of the target domain to source centroids of a source domain, wherein the source domain comprises at least one source data item. Source-side matchability is calculated as an average of a respective matchability of each source centroid of said source centroids to the target centroids. Source-target pair matchability is calculated as an average of the target-side matchability and the source-side matchability. Cross-domain clusterability between the target domain and the source domain is calculated as a linear combination of the calculated target clusterability and the calculated source-target pair matchability. The cross-domain clusterability is transferred to a device.

Abstract: Techniques are disclosed for allowing administrators to manage runtime environments (RTEs). An RTE configuration component prompts for metadata characterizing a plurality of dynamically configurable runtime environments (RTE) for executing data queries. The RTE configuration component generates an RTE definition to associate with each of the plurality of RTEs. When a query is received for execution, the RTE configuration component dynamically configures the server computing system for query execution according to a selected one of the plurality of RTE definitions.

Abstract: A method for optimizing data access in a data warehouse having a model driven architecture is provided. A data model for storing time series measurement data representing a plurality of dimensions and measurements is received. The data model includes one or more aggregation tables. A query having one or more predicates is received from a user. The one or more predicates are analyzed to determine whether the received query can be optimized using the existing aggregation tables. The received query is optimized using the aggregation tables, in response to determining that such query optimization is possible.

Abstract: Techniques are disclosed for allowing administrators to manage runtime environments (RTEs). An RTE configuration component prompts for metadata characterizing a plurality of dynamically configurable runtime environments (RTE) for executing data queries. The RTE configuration component generates an RTE definition to associate with each of the plurality of RTEs. When a query is received for execution, the RTE configuration component dynamically configures the server computing system for query execution according to a selected one of the plurality of RTE definitions.

Abstract: A distributed storage system may store data object instances in persistent storage and may store keymap information for those data object instances in a distributed hash table on multiple computing nodes. Each data object instance may include a composite key containing a user key. The keymap information for each data object instance may map the user key to a locator and the locator to the data object instance. A request to store or retrieve keymap information for a data object instance may be routed to a particular computing node based on a consistent hashing scheme in which a hash function is applied to a portion of the composite key of the data object instance. Thus, related entries may be clustered on the same computing nodes. The portion of the key to which the hash function is applied may include a pre-determined number of bits or be identified using a delimiter.

Abstract: Methods, systems, and computer-readable storage media for optimizing query processing in encrypted databases. In some implementations, actions include receiving a query that is to be used to query an encrypted database, generating a plurality of query plans based on the query, each query plan including a local query and one or more remote queries, the local query being executable at a client-side and the one or more remote queries being executable at a server-side, selecting an optimal query plan from the plurality of query plans, providing one or more remote queries of the optimal query plan to the server-side for execution, receiving one or more remote results, and processing a local query of the optimal query plan and the one or more remote results to provide a final query result.