Abstract: An apparatus adapted to operate as an A party in a database synchronization with a B party via a mobile communication network. The database contains data items to be synchronized. The apparatus includes mechanisms for maintaining a copy of the database and a client-server communication module with a client part and a server part. The client part is configured to communicate via the mobile communication network with the server part of the B party. The apparatus also includes change detection mechanisms responsive to a detection of a changed data item, for initiating a synchronization event via the client part of the client-server communication module.

Abstract: Embodiments of the present invention are directed to facilitating tag assignment to data objects as data objects are added to a tag-associated data-object storage system by users of the tag-associated data-object storage system and to facilitate subsequent display, access, and further characterization of data objects that already reside in the a tag-associated data-object storage system. Methods and systems of the present invention provide for automated tag suggestion to users in order to both increase usability of the interface provided to the tag-associated data-object storage systems as well as decrease the likelihood of unnecessary and unproductive tag proliferation within the tag-associated data-object storage system.

Abstract: A graph that includes multiple nodes and edges is received. Multiple instances of the graph are generated by randomly instantiating the edges according to either a binary independent cascade model or a randomized edge length independent cascade model. Where the binary independent cascade model is used, combined reachability sketches are generated for each node across all instances of the graph. Where the randomized edge length independent cascade model is used, combined all-distances sketches are generated for each node across all instances of the graph. Depending on which model is used, the combined reachability or all-distances sketches are used to estimate the influence of nodes in the graph or to estimate a subset of nodes from a graph of a specified size with a maximum influence using a greedy algorithm.

Abstract: Methods to determine and automatically recommend or adjust configuration parameters for storing files in large-scale distributed storage systems are disclosed. These methods may receive file metadata and trace data that allows the system to identify file access patterns. Additionally, the methods may receive information about distributed storage systems in a datacenter. This information can be used to choose storage parameters on a per-file basis for storing files.

Abstract: Systems, methods, and computer-readable media are disclosed for generating, storing, and managing play queues remotely from a user device on which content associated with the play queues may be played. A client application executing on a user device may transmit a request to generate a remote play queue to a remote server. The request may include an indication one or more sources for the content and may optionally include an indication of the content to associate with the play queue. The remote server may access metadata associated with a subset of the content of the play queue and transmit the metadata to the client application, thereby allowing retrieval and playback of the content on the user device.

Abstract: The disclosed embodiments relate to a data storage system that facilitates efficiently recovering from storage device failures. Upon receiving a request to retrieve a data block from the data storage system, the system uses a hash that identifies the data block to look up a bucket and an associated cell containing the data block. Note that the bucket aggregates a large number of data blocks and is located in the associated cell that comprises a set of object storage devices (OSDs). Within the cell, the system uses the bucket to look up an OSD that contains the bucket in a local bucket database (BDB) for the cell. Within the OSD, the system uses the bucket and the hash to look up an offset and a length for the data block in a write-ahead log that stores data blocks for the bucket. Finally, the system returns the data block from the determined offset.

Abstract: According to one embodiment of the present invention, a system for managing data within a plurality of data management architectures includes at least one processor. The system persists an entity managed by a first data management architecture to a second data management architecture. The first data management architecture manages entity data within data sources and the second data management architecture manages persisted entities within a common repository. Entity attributes are mapped between the first and second data management architectures. The system further provides one or more supplemental attributes for the persisted (e.g., registration mode or fully persisted mode) entity within the second data management architecture, wherein the supplemental attributes are unmapped between the first and second data management architectures.

Abstract: According to one embodiment of the present invention, a system for managing data within a plurality of data management architectures includes at least one processor. The system persists an entity managed by a first data management architecture to a second data management architecture. The first data management architecture manages entity data within data sources and the second data management architecture manages persisted entities within a common repository. Entity attributes are mapped between the first and second data management architectures. The system further provides one or more supplemental attributes for the persisted (e.g., registration mode or fully persisted mode) entity within the second data management architecture, wherein the supplemental attributes are unmapped between the first and second data management architectures.

Abstract: Embodiments of the present invention provide one or more hardware-friendly data structures that enable efficient hardware acceleration of database operations. In particular, the present invention employs a column-store format for the database. In the database, column-groups are stored with implicit row ids (RIDs) and a RID-to-primary key column having both column-store and row-store benefits via column hopping and a heap structure for adding new data. Fixed-width column compression allow for easy hardware database processing directly on the compressed data. A global database virtual address space is utilized that allows for arithmetic derivation of any physical address of the data regardless of its location. A word compression dictionary with token compare and sort index is also provided to allow for efficient hardware-based searching of text. A tuple reconstruction process is provided as well that allows hardware to reconstruct a row by stitching together data from multiple column groups.

Abstract: A node type of a plurality of distributed nodes to which a table to be added to a distributed database should be assigned can be identified by applying a set of placement rules defined for the table. The set of placement rules can also be applied to determine whether the table should be partitioned into more than one partition. A table group name associated with the table can be obtained and used in conjunction with the node type and determination of whether to partition the table to store the table in the distributed database on at least one node of the plurality of nodes as one or more partitions.

Abstract: Systems and methods for the crowdsourced clustering of data items in accordance embodiments of the invention are disclosed. In one embodiment of the invention, a method for determining categories for a set of source data includes obtaining a set of source data, determining a plurality of subsets of the source data, where a subset of the source data includes a plurality of pieces of source data in the set of source data, generating a set of pairwise annotations for the pieces of source data in each subset of source data, clustering the set of source data into related subsets of source data based on the sets of pairwise labels for each subset of source data, and identifying a category for each related subset of source data based on the clusterings of source data and the source data metadata for the pieces of source data in the group of source data.

Abstract: A system, device, computer program product, and/or method generates display data that allows a user to ascertain relationship between related electronic information from among sent and received electronic information. The three-dimensional time series data processing system selects one electronic information, extracts electronic information relating to the selected electronic information from the electronic information database, calculates relevance between the sender of the selected electronic information and the sender of the extracted electronic information, and generates three-dimensional time series data for three-dimensionally rendering a relationship between the selected electronic information and the extracted electronic information as positional information of the respective extracted electronic information in a virtual three-dimensional space, where the sender, the send time and the relevance are axes.

Abstract: A search system for collecting aliases associated with an entity name, includes a storage module configured to store at least one first lexical pattern, a search module coupled to the storage module and configured to obtain a plurality of first snippets from a database according to the entity name, and an alias extracting module coupled to the storage module and the search module separately and configured to, according to the entity name and the first lexical pattern, determine whether any first alias exists in the first snippets. If a first alias exists, the alias extracting module extracts it out and stores it in the storage module.

Abstract: A data processing method comprising using an application server computer, establishing a shared multi-tenant system in which tenant data that is associated with tenants is stored together in a real shared data store system; providing to a tenant computing device identifiers that identify virtual objects, wherein each of the virtual objects represents a data entity that is stored in the real shared data store system; receiving a SQL query from the tenant computing device that specifies a data operation on a first virtual object of the virtual objects; rewriting the SQL query by dynamically replacing the first virtual object with an identifier of a function; executing the function and the rewritten query without explicit metadata to generate a result set; sending the result set to the tenant computing device.

Abstract: Accelerating data transfers is described herein. When a second computing system is requested to transfer a file to a first computing system, a data segment is sent to the first computing system instead of the entire file. The data segment is then compared to data stored within a data store on the first computing system. If the data segment and data within the data store match, then the file does not need to be transferred, and a pointer points to the file already located on the first computing system. If the data segment does not match any data stored in the data store, then the file is transferred from the second computing system to the first computing system. By comparing only the data segment instead of sending an entire file, data transfer is able to be greatly expedited in situations where the data is common between systems.

Abstract: Methods and apparatus to identify at least a first portion and a second portion of resources to restore to a device are described. The first portion of the resources may be restored atomically to the device before the second portion of the resources. The device may not respond to at least one user input during the restoration of the first portion of the resources. If the restoring of the first portion is successful, the second portion of the resources may be restored. The device may respond to the user input during the restoring of the second portion of the resources.

Abstract: An aspect provides a method, including: sending a media query from a controller user device to a second user device; receiving media meta data at the controller user device in response to the media query of the second user device, the received media meta data comprising media meta data regarding a media file currently playing on the second user device and media meta data regarding one or more queued media files; providing at the controller user device a visual display based on the received media meta data, the visual display comprising a visual indication of the media file currently playing on the second user device and a preview of the one or more queued media files to be played on the second user device; and issuing one or more control action commands from the controller user device to the second user device. Other aspects are described and claimed.

Abstract: Children backup applications communicating to parent backup applications via application program interfaces are described. A child backup task is executed by a child backup application. Backup information associated with an execution of the child backup task by the child backup application is communicated from the child backup application via an application program interface to a parent backup application. A parent backup task is executed by the parent backup application based on the backup information. The child backup application inherently lacks a functionality to execute the parent backup task as the parent backup application executes the parent backup task.

Abstract: A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.

Abstract: A loan origination and processing system is described. The system can reside on a server computer that is coupled to a data store storing data related to a borrower. The server computer is further coupled to a brokerage network that comprises a loan officer client, a loan processor client, and a broker manager client. Each brokerage client computer executes a unique interface to the loan origination and processing system.