Abstract: Parallel logical replication involves multiple apply threads running on a destination database server applying, in parallel, changes made by source transactions, where the changes of a single source transaction may be applied in parallel by multiple apply threads. An apply transaction for a source transaction may be committed by an apply thread independently of the commitment of any other apply transaction of the source transaction, that is, without coordinating the committing of another apply transaction executed by another apply thread for the source transaction. A configuration language is used to configure parallel logical replication. The language facilitates the configuration of various aspects of parallel logical replication, including the number of apply threads, partitioning schemes for the apply threads for partitioning change records between the apply threads, and various other aspects of parallel logical replication.

Abstract: Systems and methods for searching for a media asset are described. In some aspects, the system includes control circuitry that receives a first search query from a user. The control circuitry identifies media assets related to the first search query from a content database. The control circuitry receives a second search query following the first search query. The control circuitry determines whether a media asset from the media assets is related to the second search query. In response to determining that less than a threshold number of media assets from the media assets are related to the second search query, the control circuitry transmits an instruction requesting the user to repeat the second search query. The control circuitry receives a third search query related to the first search query. The control circuitry determines a media asset from the media assets that is related to the third search query.

Abstract: The present invention is a distributed computer system of heterogeneous databases joined in an information grid and configured with an Application Programming Interface hardware which includes a search engine component for performing user-structured queries on multiple heterogeneous databases in real time. This invention reduces overhead associated with the impedance mismatch that commonly occurs in heterogeneous database queries.

Abstract: Methods, systems, and apparatus facilitate social and business networking in a multi-tenant database. An application can provide each user with the ability view targeted data of interest. The data of interest can be supplied in a feed associated with the user created list, which compiles the feed items, e.g., comments, posts, stories, etc., of the object feeds subscribed to by the list. Lists can include entity feeds of objects, on the database well as child records associated with those objects. Accordingly, a user can create tailored feeds and can organize related information into feed for that list. In further embodiments, applications are provided which allow users are able to view filtered selections of other users and objects on the database system.

Abstract: Improved access management techniques for storage networks are described. In one embodiment, for example, an apparatus may comprise a processor circuit and an access control component for execution by the processor circuit to select a set of hosts for which to enable access to a logical storage volume of a network storage cluster, select, from among a plurality of nodes of the network storage cluster, a set of nodes via which to enable access to the logical storage volume by the set of hosts, and generate a storage configuration object comprising a parameter identifying the set of nodes. Other embodiments are described and claimed.

Abstract: Monitoring data can be sent, received, stored, and accessed with zero setup. Customers can send monitoring data to be stored without the customers having to perform any setup ahead-of-time, such as arbitrary lists of key-value pairs. Customers can perform zero setup pivot queries using stored monitoring data. For example, users can perform pivot queries using any available stored information, such as available metric types and dimensions, without any setup needed ahead-of-time.

Abstract: Transferring an application from a first site to a second site includes determining that the second site is a destination site for the application, causing writes by the application at the first site to be propagated semi-synchronously to the second site, transferring storage data from the first site to the second site, suspending operation of the application on the first site, and resuming operation of the application on the second site. The application may be a virtual machine or a host cluster capable of transitioning applications between cluster nodes. The virtual machine may be transferred from the first site to the second site by transferring an image of the virtual machine from the first site to the second site. The destination site may be selected by a user. The second site may be located remotely from the first site across an asynchronous distance.

Abstract: According to one embodiment of the present invention, a system maps one or more virtual relations to a table of a relational database management system. The system generates a structured query language (SQL) statement for the table from a SQL statement for a virtual relation by applying the mapping to one or more elements of the SQL statement for the virtual relation. Embodiments of the present invention further include a method and computer program product for mapping virtual relations to a table in substantially the same manners described above.

Abstract: According to one embodiment of the present invention, a system maps one or more virtual relations to a table of a relational database management system. The system generates a structured query language (SQL) statement for the table from a SQL statement for a virtual relation by applying the mapping to one or more elements of the SQL statement for the virtual relation. Embodiments of the present invention further include a method and computer program product for mapping virtual relations to a table in substantially the same manners described above.

Abstract: An IC card includes a communication unit, a storage unit that stores a file, and a controller that interprets and executes a command instruction. The controller judges, when a command that instructs to select a dedicated file is input from an external apparatus, whether a certain fixed value is inserted at a predetermined position of the command, starts, when judged that the certain fixed value is inserted in a non-transaction state, transaction processing after accepting the command as a transaction start instruction simultaneous with the selection of the dedicated file, accepts, when judged that the certain fixed value is inserted during the transaction processing.

Abstract: The disclosed embodiments disclose techniques for using byte-range locks to manage multiple concurrent accesses to a file in a distributed filesystem. Two or more cloud controllers collectively manage distributed filesystem data that is stored in the cloud storage systems; the cloud controllers ensure data consistency for the stored data, and each cloud controller caches portions of the distributed filesystem. During operation, a cloud controller receives from a first client a request to access a portion of the file. The cloud controller contacts the owning cloud controller for the portion of the file to request a byte-range lock for that portion of the file. The owning cloud controller returns a byte-range lock to the requesting cloud controller if no other clients of the distributed filesystem are currently locking the requested portion of the file with conflicting accesses.

Abstract: A technique includes generating a checkpoint for an application that is executing on a plurality of nodes of a distributed computing system. Forming the checkpoint includes selectively regulating communication of data from the plurality of nodes to a storage subsystem based at least in part on a replication of the data among the nodes.

Abstract: This document relates to trend response management. One example can detect a trending topic and identify content associated with the trending topic. The example can take an action relating to the content that decreases a trend-induced processing spike and/or enhances a user search experience associated with the trending topic.

Abstract: A method of deduplicating data is disclosed comprising mounting, by a deduplication appliance, network shared storage of a client machine, via a network, accessing data to be deduplicated on the network shared storage device, deduplicating the data, storing the deduplicated data on a second storage device, and replacing the data in the network shared storage device by at least one indicator of the location of the deduplicated data in the second storage device. A method is also disclosed for copying deduplicated data stored by a deduplication appliance, by a client machine, comprising receiving a request to copy data from a first location to a second location, by the client machine, by providing at least one second indicator to the third location on the deduplication appliance, at the second location, if the source and the destination are on the deduplication appliance. Systems are also disclosed.

Abstract: A system and method is provided in which access patterns of data blocks are used to predict future accesses to the data blocks. One of the types of patterns that may be used in connection with the system described herein is depended blocks. Dependent blocks are blocks that are often referenced one after another in a short period of time. For example, one block (block b) is commonly referenced after another block (block a) a noted time period. The system described herein provides a block dependency algorithm that enables a search task involving searching of block dependencies with respect to proposed dependency definitions. In an embodiment, the search task may be performed based on using of a branch and bound methodology. A search tree is built in which a set of activity vectors (V) are ordered, and a search algorithm is used to traverse and “prune” branches of the tree.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for predicate application using partial compression dictionary match. A search strategy is developed for each predicate to be applied to compressed data. The compressed data is searched using the search strategy to locate the compression symbols identified in the search strategy. In response to locating a compression symbol from the search strategy in the compressed data, a respective row and applying the predicate is decompressed and a respective row that matches the predicate is returned to a database engine or an application.

Abstract: The present disclosure describes methods, systems, and computer program products for inheriting metadata concepts from product resources into a semantic model. One computer-implemented method includes defining a plurality of core data foundations, defining a derived data foundation by linking the plurality core data foundations to the derived data foundation, defining a plurality of core business layers, defining a derived business layer by linking the plurality of core business layers to the derived business layer, and compiling, by a computer, the derived business layer with the derived business layer as a universe.

Abstract: The present disclosure relates to a mobile terminal, and more particularly, to a mobile terminal for updating data files stored in a memory on a database and a control method thereof, and a mobile terminal for updating data files on a database according to the media transfer protocol (MTP) may include a memory configured to store the data files, and a controller configured to divide the data files stored in the memory into a first group composed of files to which the priority order of update is given and a second group composed of files other than those of the first group, and sequentially update the first group and the second group on the database to implement an application using data files contained in the first.

Abstract: Apparatus and systems, including computer program products, implementing and using techniques for predicate application using partial compression dictionary match. A search strategy is developed for each predicate to be applied to compressed data. The compressed data is searched using the search strategy to locate the compression symbols identified in the search strategy. In response to locating a compression symbol from the search strategy in the compressed data, a respective row and applying the predicate is decompressed and a respective row that matches the predicate is returned to a database engine or an application.

Abstract: A corrected optical property value of an optical property of interest captured within a digital image is determined. A search query based on the corrected optical property value is determined. A database is searched using the search query to determine search results for the search query that have appearance attributes with optical properties at least similar to the corrected optical property value.