Abstract: Optimization of job execution includes generating a hash tree for an initial dataset, executing a data processing job against the initial dataset, the job including a set of calculations against data of the records of the initial dataset, generating, based on a modification to the initial dataset to produce a modified dataset, a hash tree for the modified dataset, comparing the hash tree for the initial dataset to the hash tree for the modified dataset, and identifying one or more blocks of the modified dataset that are updated compared to the initial dataset, and re-executing the job against the modified dataset. The re-executing performs only those calculations that use data of the records of the one or more blocks that are updated compared to the initial dataset, and does not perform other calculations that do not use data of the records of the one or more blocks.

Abstract: Optimization of procedures for enterprise applications can take both declarative query statements and imperative logic into account in a unified optimization technique. An input procedure can implement complex analytical queries and also include iterative control flow logic such as loops. Alternative query execution plans for the procedure can be enumerated by moving queries out of and into loop boundaries via hoist and sink operations. Program correctness can be preserved via excluding some operations via dependency graphs. Sink subgraphs can also be used. Query inlining can also be supported, resulting in synergies that produce superior execution plans. The computing execution resource demand of the respective alternatives can be considered to arrive at an optimal query execution plan that can then be used to actually implement execution of the procedure. Execution performance can thus be greatly improved by performing counterintuitive optimizations.

Abstract: Data retrieval can be managed in a data grid. For example, a computing device can receive a write command from a second node in the data grid, the write command being for storing a second version of data. In response to the write command, the computing device can use a database to determine that a first version of the data is to be locally served by a first node in the data grid. The computing device can then transmit a communication that causes the first node to switch from (i) locally serving the data, to (ii) obtaining and serving the second version of the data from a remote node, such as the second node. The computing device can then update the database to indicate that the second version of the data is to be locally served by the second node.

Abstract: In accordance with an embodiment, described herein are systems and methods that enable client-side calculation with data provided at a multidimensional or other database server. Data provided at the server in accordance with a server-side model, can be transformed/prepared into a grid, for use with a client-side application, for example a client spreadsheet application. During preparation of the grid, one or more portions of the grid that are identified as client-side dynamic parameters, can be represented as dynamic formulas that are modifiable within the client-side application; while parameters of the server-side model that are outside of the grid can be represented as constant values. The grid provided to the client can be used to perform client-side calculations that allow for rapid calculations in response to changes in the client-side model, without introducing a round-trip performance lag between the client-side and server-side.

Abstract: In a method for evaluating a performance of a recommender system, a session of M content items consumed by a user can be identified. The session can be defined such that, for each of a first (M-1) content items in the session, a delay time between a completion of consumption of one of the first (M-1) content items and a commencement of consumption of a directly next content item in the session is less than a predetermined duration of time. Content items in a content item-base can be ranked, based on the first (M-1) content items, according to a likelihood of each content item in the content item-base to be consumed next. A session metric can be generated for each content item in the content item-base. The recommender system can be trained based on the session metric for the Mth content item.

Abstract: A system for querying web pages to validate entity names is disclosed. The disclosed system receives a request for validating an entity name. The system identifies a search web link based on the information in the request. The system converts the request to a format appropriate for a search web page corresponding to the search web link. Then, the system sends the formatted request to the search web page via the search web link. The system receives a result web page and extracts a set of result entity names. The system then computes a hash value for the entity name in the request and each of the result entity names. Next, the system compares the hash value computed for the entity name in the request with hash values computed for each of the result entity names and determines a matching score for each of the result entity names based on the comparison of the hash values.

Abstract: A user can manage personal contact information in a contacts application across multiple writable service provider accounts with only a minimum of user action required. An update function of the contacts application gives the user the ability to easily copy one or more contact records brought up in the contacts application to writable service provider accounts selectively chosen by the user.

Abstract: A system and method can support recovery of persisted data from persistent storage of a distributed data grid, and provide persistent store versioning and integrity. A coordinator in the distributed data grid can receive a plurality of identifiers from one or more members of the distributed data grid, wherein each said identifier is associated with a persisted partition in a persistent storage for the distributed data grid. Then, the coordinator can select an identifier for each partition, wherein each selected identifier is associated with a most recent valid version of a partition. Furthermore, the coordinator can determine an active member in the distributed data grid that is responsible for recovering said partition from a persisted partition associated with the selected identifier.

Abstract: A method, system, and computer program product for dynamically building a database query by combining a static query clause with a user-specified filter. A method commences upon receiving a user-specified query filter from a user interface, then reformatting the user-specified query filter from a first query filter representation (e.g., clicks or text from the user interface) into a second query filter representation (e.g., into XML or into a database connectivity format, or into an SQL format, or into any native format). Subsequent steps combine the second query filter representation with a predefined database query (e.g., from an enterprise application) to form a dynamically-generated database language query. The filter is specified at a user interface, and the predefined database query is specified by an application.

Abstract: A method may include generating a first hash value that is representative of a current configuration of a database storing a plurality of data records. A change in the configuration of the database may be detected based on the first hash value and a second hash value representative of a previous configuration of the database. The configuration of the database may include a plurality of database tables available for storing the plurality of data records. In response to detecting the change in the configuration of the database, the database may be updated by at least transforming the plurality of data records in accordance with the current configuration of the database. Related methods and articles of manufacture, including computer program products, are also disclosed.

Abstract: In a high insert throughput in a database system, the database management system (DBMS) caches, asynchronously from data insert transactions, a list of storage location identifiers for storage locations in a table space in the database system. When a request for an insert transaction with an insert size is received from an agent, the DBMS identifies a storage location on the list with an amount of free space meeting the insert size. The DBMS removes the storage location identifier from the list and returns the storage location identifier for the storage location. When the insert transaction completes, the DBMS determines a remaining free space at the storage location and adds the storage location identifier to the list according to the remaining free space. By removing storage location identifiers from the list, another agent cannot receive the same storage location identifier for a parallel task. Thus, space contention is avoided.

Abstract: In a high insert throughput in a database system, the database management system (DBMS) caches, asynchronously from data insert transactions, a list of storage location identifiers for storage locations in a table space in the database system. When a request for an insert transaction with an insert size is received from an agent, the DBMS identifies a storage location on the list with an amount of free space meeting the insert size. The DBMS removes the storage location identifier from the list and returns the storage location identifier for the storage location. When the insert transaction completes, the DBMS determines a remaining free space at the storage location and adds the storage location identifier to the list according to the remaining free space. By removing storage location identifiers from the list, another agent cannot receive the same storage location identifier for a parallel task. Thus, space contention is avoided.

Abstract: A system and method can support persistence in a distributed data grid. A plurality of members in the distributed data grid can persist a plurality of partitions associated with one or more cache services in persistent storage. Furthermore, a coordinator, which may be a member in the distributed data grid, can synchronize a view of partition ownership among the plurality of members in the distributed data grid, and form a distributed consensus on which partition can be recovered from which member in the distributed data grid.

Abstract: Various systems, methods, and processes for optimizing the performance of a consolidated full backup of a restored virtual machine are disclosed. Changed data and metadata associated with the changed data is received from a hypervisor at a backup module. The hypervisor supports a virtual machine, and the virtual machine employs virtual disks. A confirmation is sent to the hypervisor from the backup module indicating that a full backup of the virtual disks has been created.

Abstract: A device extracts data files from different data sources, and processes the data files to generate data from the data files. The device trains a first artificial intelligence model and a second artificial intelligence model based on historical data parameters, wherein the historical data parameters are associated with historical data previously processed by the device. The device utilizes the trained first artificial intelligence model and the data to generate data parameters for the data, and utilizes the trained second artificial intelligence model, the data, and the data parameters to generate a data structure configuration. The device generates a data structure for the data based on the data parameters and the data structure configuration, stores the data in the data structure, and provides a user interface for accessing the data structure.

Abstract: A methods, an apparatus, a computer-readable medium, and a system for integrating data from a plurality of devices. The first data is received from a first device and the second data is received from a second device, which is a different type of device than the first device. Type of data is determined and additional data is generated based on the determined type of data received from these different devices. The additional data includes searchable metadata and/or one or more triggers based on a combination of the first and second received data. Accordingly, searchable metadata for recordings and metric values from various devices used in a session are generated. Additionally, annotations may be provided to emphasize the occurrence of triggering events.

Abstract: Disclosed are various embodiments for editable search. A computing device displays a term on a network page. The computing device then displays a search result on the network page, wherein the search result is related to the term. Later, the computing device displays an alternative term in response to a selection of the term. The computing device then sends a search query to a remote application executing on a remote computing device in response to a selection of the alternative term, wherein the search query includes the alternative term. The computing device subsequently updates the search result on the network page with a new search result related to the alternative term.

Abstract: Techniques for managing continuous queries that include subqueries are provided. In some examples, a continuous query that includes at least a subquery may be identified. Additionally, the subquery may be processed to obtain a first result or generate a logical subquery plan. Further, in some instances, the continuous query may then be processed based at least in part on the first result from the subquery or by merging a logical continuous query plan with the logical subquery plan. This may result in obtaining a second result via querying a data source with the continuous query that is based at least in part on the first result from the subquery and/or the merged plans.

Abstract: Systems and methods for retrieval of information from read-only databases that hold taxonomic-related and sequence-related data. A method may include receiving organism names from a taxonomy database and detecting new organism names. The method may also include retrieving hierarchical data and assigning the new organism names to buckets based on the hierarchical data. The method may further include receiving sequence data elements from a nucleotide database, identifying particular buckets to correspond to a screener data set, querying organism names assigned to the particular buckets with names of reference sequences of the sequence data elements, generating a mapping between the sequence data elements and organism names returned as a result of the queries, and storing the mapping.

Abstract: Provided are a computer program product, system, and method for building complex hierarchical queries. A User Interface (UI) representation of a logical query is received, wherein the UI representation describes object types, relationships between the object types, and attributes of the object types. The UI representation is translated to a logical query. The logical query is converted to data layer calls to retrieve objects having the object types, the relationships between the object types, and the attributes of the object types. The objects are received. Then, a directed graph is generated using the identified objects.