Abstract: A backup tool can manage multi-level backup into a cloud and restoration from the cloud. The backup tool can request a data source to stream backup data to the backup tool, and the backup tool can then generate data objects from the data stream for storing into the cloud. The backup tool generates the data objects in accordance with serialization of the data stream. The order of the data objects resulting from the data stream serialization is encoded into the names of the data objects. In addition, the backup tool encodes the backup level into the object names. With sequencing and backup level encoded into the data object names, the data objects can be stored in the cloud for later restoration.

Abstract: Methods and systems for database optimization include detecting a plurality of columns in an unoptimized database that co-appear in queries to the database. The plurality of columns are compacted into a single hyper-column to form an optimized database. Each entry in the hyper-column includes data from a corresponding entry in each of the plurality of columns. An interface is generated for the optimized database that accepts queries according to a schema for the unoptimized database and translates the queries into queries according to a schema for the optimized database.

Abstract: A method for upgrading a database schema in real time, wherein the database schema is associated with a plurality of databases is provided. The method may include installing a first plugin on a database upgrade process associated with a database. The method may include installing a second plugin on each database instance within the plurality of databases. The method may include determining a delta associated with a final target version of the database schema. Additionally, the method may include outlining an existence of an incongruence, an existence of an override or an existence of a customization removal based on the determined delta. The method may include performing a peer-to-peer broadcasting analysis between each database. The method may include defining a migration strategy for each database instance within the plurality of databases based on the peer-to-peer broadcasting analysis. The method may further include creating a script for upgrading the database schema.

Abstract: Described are methods, systems and computer readable media for dynamically updating join operation results in a computer system. A memory-efficient computer system for dynamically updating join operation results may include multiple memory devices having different access times. A computer system for dynamically updating join operation results in real time may re-apply a join operation based on a communication received over a network interface device.

Abstract: A method begins by a dispersed storage (DS) processing module transmitting a set of write commands for storing a set of encoded data slices in storage units of a dispersed storage network (DSN) and determining whether at least a first threshold number of write responses have been received within a response time period. When the at least the first threshold number of the write responses have been received within the response time period, the method continues with the DS processing module determining whether a total number of responses have been received within another response time period. When the total number of responses have not been received within the other response time period, the method continues with the DS processing module issuing a sub-set of write commit commands corresponding to a response number of encoded data slices for which a response was received.

Abstract: A method for upgrading a database schema in real time, wherein the database schema is associated with a plurality of databases is provided. The method may include installing a first plugin on a database upgrade process associated with a database. The method may include installing a second plugin on each database instance within the plurality of databases. The method may include determining a delta associated with a final target version of the database schema. Additionally, the method may include outlining an existence of an incongruence, an existence of an override or an existence of a customization removal based on the determined delta. The method may include performing a peer-to-peer broadcasting analysis between each database. The method may include defining a migration strategy for each database instance within the plurality of databases based on the peer-to-peer broadcasting analysis. The method may further include creating a script for upgrading the database schema.

Abstract: The present invention includes a method, system, and computer-readable medium for calculating a social graph using a social utility grid interface. The method includes the following steps. First, collecting one or more types of communication data. Next, inputting the one or more types of communication data into a social utility grid infrastructure. The social utility grid infrastructure analyzes the input data to determine a multi-dimensional first-order social graph by: (1) normalizing each of the one or more types of communication data; (2) representing the each of the one or more types of communication data as a vector; (3) calculating a Euclidean Norm; and (4) generating the multi-dimensional first-order social graph. Then, providing the multi-dimensional first-order social graph to one or more software applications.

Abstract: A system for providing a user interface includes a gadget definition, a style definition, and a scene file. The gadget definition includes one or more XML-based gadget definition tags defining a gadget element and the style definition includes one or more XML-based style definition tags defining one or more style attributes to be applied to the gadget element. The scene file is an XML-based document that includes a gadget element tag that specifies the gadget element. The system further includes a parser to parse the scene file, the style definition, and the gadget definition, and to generate an object that includes a gadget object corresponding to the gadget element. The system also includes a layout engine to determine, based on the object model, a layout of the user interface, and a rendering engine to render, based on the determined layout, the user interface including the gadget element.

Abstract: A data processing system determines whether a natural language query or a result has a temporal characteristic. In response, at least one of user profile information or user activity history information for a user is analyzed to identify user characteristics indicative of a timeframe for scheduling a reminder notification of the result. A timeframe for scheduling the reminder notification is calculated based on results of analyzing the user profile information or user activity history information. A reminder notification is scheduled to be output at a scheduled reminder notification time based on the calculated timeframe. At a later time, in response to the later time being equal to or later than the scheduled reminder notification time, the reminder notification is output to a client device associated with the user, wherein the reminder notification specifies the result generated for the natural language query.

Abstract: A method for categorizing text strings assigns text strings to topical categories. A search engines retrieves and ranks a list of Uniform Resource Locators (URLs) for each test string. The most highly-ranked URLs for a set of text strings form a whitelist of pre-approved text strings that are assumed to correlate closely with category meaning. Incorrectly categorized text strings are identified by scoring a list of URLs retrieved by a search engine for each text string, comparing each score to the whitelist position of the text string, flagging text strings with scores that deviate from whitelist position by at least a threshold amount, and reassigning flagged text strings to categories with the most similar sets of retrieved URLs.

Abstract: A job execution device includes: a storing unit; a file system that divides a storing area of the storing unit into a plurality of division areas, and manages the storing area of the storing unit; a management table in which deletion management information indicating whether an overwrite deletion is necessary is registered for each of the division areas; a deletion processing unit; a job execution unit; and a management table updating unit. When the file system receives the releasing request, the file system changes the division area management information for the division areas to be released by the releasing request so as to change the status to “unused” before the deletion management information for all of the division areas to be released by the releasing request is changed to a non-necessity of the overwrite deletion.

Abstract: A distributed data warehouse system maintains data blocks on behalf of clients, and stores primary and secondary copies of data blocks on different disks or nodes in a cluster. The data warehouse system may back up data blocks in a key-value backup storage system. In response to a query targeting a data block previously stored in the cluster, the data warehouse system may determine whether a consistent, uncorrupted copy of the data block is available in the cluster (e.g., by applying a consistency check). If not (e.g., if a disk or node failed), the data warehouse system may automatically initiate an operation to restore the data block from the backup storage system, using a unique identifier of the data block to access a backup copy. The target data may be returned in a query response prior to restoring primary and secondary copies of the data block in the cluster.

Abstract: A computer receives one or more keywords input by a user to describe a metric or a test and identifies a first document that includes at least one of the keywords. The computer identifies, in the first document, a known distribution pattern and an associated metric or measure that relate to the one or more keywords. The computer makes an electronic record of the identified known distribution pattern and associated metric or measure.

Abstract: Quasi-identifiers (QIDs) are detected in a dataset using a set of computing tasks. The dataset has a plurality of records and a set of attributes. An index is generated for the dataset. The index has an indicator for each attribute value of each record in the dataset. Each indicator specifies all the records in the dataset having the same value for the attribute. Each task is assigned an attribute combination and a subset of the plurality of records in the dataset and is passed to a thread for execution on computing resources. The executing task inspects the set of records specified by the index indicator for each attribute value in the attribute combination to produce a result. The result of at least one task identifies a unique record for the associated attribute combination. The attribute combination producing the unique record is a QID.

Abstract: In one embodiment, a computing device receives an indication of a first user action by a first user. The computing device determines a topic of the first user action based on analyzing content associated with the first user action, and determines whether the first user has a preference to exclude posts associated with the topic or a category associated with the topic. If the first user has not indicated any preference to exclude posts associated with the topic or the category, then the computing device identifies a second user action by a second user and related to the topic, and determines whether the first user has indicated a preference to exclude posts associated with the second user. If the first user has not indicated any preference to exclude posts associated with the second user, the first user is provided with access to the second user action.

Abstract: In a method for managing a plurality of data entities, data pertaining to transactions by a plurality of users with respect to the data entities is collected and a collaborative filtering operation is applied on the data entities to determine similarity levels of the data entities with respect to each other. In addition, for at least one of the data entities, remaining ones of the data entities are ranked according to the determined similarities while discounting for popularities of the data entities. Moreover, identifications of at least another one of the data entities having the highest rankings to the at least one of the data entities are presented to a first user to recommend the at least another one of the data entities for use by the first user.

Abstract: Mechanisms are provided that: identify topics associated with a plurality of pieces of media content presented in a session; calculate a distance metric for pairs of topics, wherein each of the pairs of topics includes a first topic associated with a first piece of media content and a second topic associated with a second piece of media content, and wherein the second piece of media content was presented within a given span of the presentation of the first piece of media content; for each first topic of the pairs of topics, generate a rank-ordered list for all corresponding second topics; for each of the plurality of pieces of media content, generate a single rank-ordered list of all second topics; and for each of the plurality of pieces of media content, identify one or more other pieces of media content as recommended media content based on the single rank-ordered list.

Abstract: A device classification method that includes: receiving a first action performed on a first device in the device group, for classifying the first device as belonging to the coordinated operation group; setting, when the first action is received, each of one or more devices in the device group other than the first device to a classifiable state in which the device is classifiable as belonging to the coordinated operation group; receiving a second action performed on a second device in the device group that is set to the classifiable state, for classifying the second device as belonging to the coordinated operation group; and classifying, when the second action is received, the first device and the second device as belonging to the coordinated operation group.

Abstract: Both content creators and content consumers can benefit by improving communication mechanisms that currently exist. For example, content creators can increase the appeal of content by leveraging the energy of fans, but it is often difficult to identify which content consumers are the best or top fans. However, such can be identified based on various metrics, for example, based on engagement and/or influence of the content consumer. Once the set of top fans is identified, content creators can interact, potentially exclusively, with the set of top fans, which can enhance the experience for all parties involved.

Abstract: An apparatus includes a communication interface for receiving reference activity data items, current activity data, and current environmental data; at least one processor; and at least one memory including computer program code; wherein the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to maintain a reference activity data item relating to a previous activity, which reference activity data item includes reference activity data associated with reference environmental data; receive current activity data and current environmental data relating to a current activity; determine the reference activity data associated with the reference environmental data corresponding to the current environmental data; compare the current activity data with the reference activity data; and provide feedback for a user of the apparatus in response to the comparison.