Abstract: Replicas are selected in a large distributed network, and the roles for these replicas are identified. In one example, the role of voting is assigned to a number of computing clusters. To make this selection, a task assigning service finds a candidate leader and M computing clusters to be used as voters. This selection may be based on finding latencies between the M computing clusters and the leader.

Abstract: Systems and methods for automatically associating content characteristics to a third-party content are provided. A uniform resource locator identifying a resource is received from a content provider. The content is rendered to produce an object tree. A first node of the object tree is determined, where the first node represents a content slot. A second node of the object tree proximate to the first node is identified. The second node has a content characteristic, which is extracted. The extracted content characteristic is associated with the first node and stored.

Abstract: A system, a method and a computer program product for storing data, which include receiving a data stream having a plurality of transactions that include at least one portion of data, determining whether at least one portion of data within at least one transaction is substantially similar to at least another portion of data within at least one transaction, clustering together at least one portion of data and at least another portion of data within at least one transaction, selecting one of at least one portion of data and at least another portion of data as a representative of at least one portion of data and at least another portion of data in the received data stream, and storing each representative of a portion of data from each transaction in the plurality of transactions, wherein a plurality of representatives is configured to form a chain representing the received data stream.

Abstract: A fast-copyable database apparatus includes a processor and a memory in electronic communication with the processor. The memory stores a database table with multiple records each having a compound key including a version identifier. The memory also stores instructions executable to cause the processor to generate a first virtual clone of the database table and a second virtual clone of the database table, receive a query at the first virtual clone, and modify the query so that it includes a version identifier of the first virtual clone. The processor can query the database table using the modified query to generate a response based in part on each record from the set of records having a version identifier associated with an ancestral path of the version identifier of the first virtual clone, and send the response. Each compound key includes a version identifier and a data portion.

Abstract: Disclosed are database systems, computing devices, methods, and computer program products for identifying recurring sequences of user interactions with an application. In some implementations, a server of a database system provides a user interface of the application for display at a computing device. The database system stores data objects identifying a first plurality of user interactions with the application. The server receives information representing a second plurality of user interactions with the application. The server updates the database system to further identify the second user interactions. The server identifies a recurring sequence of user interactions from the first and second user interactions as resulting in a first target state of the application. The server updates the database system to associate the recurring sequence of user interactions with the first target state of the application.

Abstract: A non-transitory, computer-readable recording medium having stored therein a processing program causes a computer to execute a process including reconstituting a specific portion of received data, based on reference information specifying a referenced portion of the received data for selecting processing data from the received data, the processing data being subject to a query processing; determining whether to discard the received data, based on the specific portion of the received data and a selecting condition for selecting the processing data; and reconstituting the received data when the determining determines not to discard the received data.

Abstract: Methods, systems, and computer-readable storage media for providing notifications in distributed development. In some implementations, actions include receiving change information, the change information indicating one or more changes to source code, processing the change information to determine one or more entities associated with the change, comparing the one or more entities to one or more subscriptions, the one or more subscriptions being specific to a user, for each entity associated with a subscription, providing a notification in a set of notifications, and providing a sub-set of notifications for display to the user.

Abstract: A method, apparatus and system for data analysis are provided by the embodiments of the disclosure, which may solve the problem of low efficiency of the data analysis. The disclosed method includes: retrieving pipeline data from a pipeline data set piece by piece, wherein each piece of pipeline data includes attribute values of multiple views; performing normalization sorting of the retrieved pipeline data based on the attribute value in a predefined view; obtaining an attribute value entry list by extracting attribute value entries from the normalization sorted pipeline data; obtaining a first characteristic value list by performing deduplication operation on the attribute value entry list through mapper operation; obtaining a second characteristic value list by performing accumulation operation on the first characteristic value list through reducer operation; and obtaining a result of the predefined indicator by analyzing the second characteristic value list.

Abstract: Computer-readable media, computer systems, and computing devices for initiating a search function, such as presentation of a search box or initiation of a search, is provided. In one embodiment, the method includes detecting movement of a selector from within a display area to an edge of the display area. Such a selector can be controlled by an input device coupled to a user device. In response to detecting movement of the selector from within the display area to the edge of the display area, a search-query input area associated with a search engine is presented within a display screen view.

Abstract: Systems and methods are provided in which a content guide includes one or more tags associated with a single user, a group of users or a channel subscribed to by users that enables the retrieval of content for subsequent viewing and which can be supplemented by recommendations and data from other sources.

Abstract: A computer which updates the computer's own database in use of a transaction log: acquires the transaction log; processes records in the acquired transaction log, and with respect to a record related to an update instruction, executes the update instruction represented by the record when an object of the update instruction is read onto a memory of the computer; and executes the update instruction put on standby with respect to the object either until the object of the update instruction put on standby is read onto the memory and becomes a processing object, or when the update instruction put on standby has been read onto the memory and become a processing object.

Abstract: A method for migrating a file in a storage device. The storage device obtains a snapshot of metadata of the file. The snapshot includes logical addresses of data blocks of the file and first write time points of the data blocks. The storage device identifies a logical address of a target data block and a first write time point of the target data block. Then, the storage device obtains a second write time point from the metadata of the file. The second write time point indicates a latest time point of writing the target data block into the storage device. If the first write time point of the target data block is identical to the second write time point, the storage device migrates the target data block to pre-allocated continuous storage space. Thereby, disk defragmentation can be achieved.

Abstract: A method of identifying retirement communities, comprising: executing a query on the transaction database and the geo-demo database to identify a plurality of community clusters; electronically storing, a plurality of retirement community data, wherein each retirement community data includes a plurality of data elements including at least a first data element configured to store the plurality of community clusters; receiving, a data signal superimposed with profile information associated with a consumer, wherein the profile information includes a plurality of retirement community attributes identified by the consumer; and identifying one or more retirement communities based on attributes identified by the consumer, by querying the community clusters stored in the retirement community database for retirement community attributes identified by the consumer.

Abstract: A search of displayed content may be automatically performed in response to receipt of a search gesture that defines a scope of the search and initiates the search. The search gesture may define a region of content within the displayed content. A search query may be formulated based on the region of content defined by the search gesture. In response to completion of the search gesture, a search may be automatically initiated. In some examples, the search gesture comprises a generally circular gesture that substantially bounds the region of content.

Abstract: Data can be processed in parallel across a cluster of nodes using a parallel processing framework. Using Web services calls between components allows the number of nodes to be scaled as necessary, and allows developers to build applications on the framework using a Web services interface. A job scheduler works together with a queuing service to distribute jobs to nodes as the nodes have capacity, such that jobs can be performed in parallel as quickly as the nodes are able to process the jobs. Data can be loaded efficiently across the cluster, and levels of nodes can be determined dynamically to process queries and other requests on the system.

Abstract: A computer-implemented method for synchronizing a first data object to a second data object, wherein, each data object is assigned to a metaclass from a number of metaclasses, the metaclasses being organized in a tree structure with a root metaclass; a metaclass in the tree structure is ascertained that is situated on the path between the first data object and the root metaclass and on the path between the second data object and the root metaclass, a first and a second metaobject are produced from the ascertained metaclass; two transformations are performed to transform the first data object into the first metaobject and the second data object into the second metaobject; the first metaobject and the second metaobject are synchronized; and a third transformation is performed, the first metaobject being transformed into the first data object and the second metaobject being transformed into the second data object.

Abstract: Statistical information related to performing information searches based on search templates may be automatically generated and stored in statistical records. The statistical records may be automatically updated. The statistical records may be sorted to indicate which information searches are most efficient.

Abstract: Example apparatus and methods concern metadata peering that allows a file system to address a file in a local namespace while actually accessing the file using an address used by a shared secondary storage. This allows the file system to operate unmodified and more efficiently in a native mode that addresses files in the shared secondary storage using addresses local to a computer running the file system. An example method accesses an inode associated with a file that is stored in a shared secondary storage. The method accesses a local namespace identifier used by the file system to access the file and accesses a reference used by the shared secondary storage to access the file. The reference is not associated with the local namespace. The method stores an opaque value in the inode. The opaque value facilitates accessing the file in the shared secondary storage using the local namespace.

Abstract: Techniques for compressing leaf blocks of an index are provided. The decision whether (and/or how much) to compress leaf blocks of an index is performed on a per block basis. Thus, for example, some leaf blocks of the index may be compressed while other leaf blocks of the index may be uncompressed. As another example, different leaf blocks of an index may be compressed a different amount. In one technique, a set of index entries is identified for storage in a leaf block. Multiple estimates of potential space savings are calculated for compressing the set of index entries, one estimate for each different variation of a compression technique. The compression technique variation that is associated with the most space savings is selected and applied to the set of index entries. Thus, some techniques prevent negative compression altogether. Additionally, users require no knowledge of the underlying data to perform optimal compression.

Abstract: Methods and arrangements for associating physical activities and digital activities of a user. A plurality of physical attributes of the user are collected, via mining sensor data from at least one physical state associated with the user and a plurality of digital attributes relating to at least one digital activity of the user via mining the data from a digital presence of the user. A plurality of physical attributes and digital attributes are grouped based on a similarity measure. There are stored a grouping of the physical and digital attributes at a data storage location. Other variants and embodiments are broadly contemplated herein.