Abstract: A digital magazine identifies content items for recommendation to a user by determining the address information of one or more content items. The address information of a content item identifies a source from which the content item was received and additional information describing the content item. Representations of content items are generated from the address information for each content item. Additionally, representations of content items previously presented to the user are generated from the address information for the previously presented content items. A measure of similarity between a representation of a content item and a representation of a previously presented content item is determined and used to select content items to present to the user.

Abstract: A system can include a reconciliation engine configured to evaluate metadata in a given manifest file of a plurality of manifest files generated for redundant copies of a given media asset. The metadata describes a condition of a given chunk of media content in one of the redundant copies of the given media asset. The system can also include a manifest modification function configured to modify the given manifest file for the given chunk of media content in response to the reconciliation engine detecting that the given chunk of media content is damaged based on the evaluation of the metadata associated with the given chunk of media content in the given manifest file.

Abstract: Systems and methods for relationship recommendations systems in accordance with embodiments of the invention are illustrated. In one embodiment, a relationship recommendation server system includes a processor wherein a relationship recommendation program configures the processor to obtain a graph database including a set of nodes including node attribute data and a set of edges including edge attribute data and describing relationships between nodes in the set of nodes, determine a set of motif data, where the motif data describes at least one subgraph including a subset of the nodes and a subset of the edges within the graph database, obtain a search node, generate additional edges between the search node and a subset of the nodes within the graph database, where the additional edges form subgraphs including the search node that are isomorphic to a subset of the motif data, and recommend relationships based on the generated additional edges.

Abstract: A database server receives a query from a remote application server that is associated with a calculation scenario. The calculation scenario defines a data flow model that includes one or more calculation nodes that each define one or more operations to execute on the database server. A top operator node of the calculation nodes specifies a plurality of attributes and the query requests a subset of the attributes specified by the top operator node; Thereafter, the database server instantiates the calculation scenario so that it is optimized by requesting only the subset of attributes. The database server then executes the operations defined by the calculation nodes of the optimized calculation scenario to result in a responsive data set. The database server then provides the data set to the application server.

Abstract: A method and system of sharing a folder in a file system between an owner and a grantee is provided. An indication of a folder to share with a grantee may be received from the owner. The folder to share may be a subfolder within a parent folder, the parent folder not shared with the grantee. Then, sharing permissions indicating a level of access the grantee has to the folder may be stored with the folder. A virtual folder corresponding to the folder to share may be created on a device of the grantee. The virtual folder maps to all objects within the folder to share and may be stored at a level equal to parent folders of a file hierarchy on device of the grantee.

Abstract: This disclosure generally relates to data delivery in distributed applications. One example method includes identifying a data source associated with a shuffle operation, the data source configured provide data from a data set associated with the shuffle operation; identifying a data sink associated with the shuffle operation, the data sink configured to receive data provided by the data source; associating a shuffler component with the shuffle operation, the shuffler component configured to receive data from the data source and provide the data to the data sink; receiving, by the shuffler component, a first data portion from the data source; providing, by the shuffler component, the first data portion to the data sink; receiving, by the shuffler component, a second data portion from the data source, the second data portion being received from the data source prior to or concurrent with providing the first data portion to the data sink.

Abstract: An internet-based method and system is disclosed for creating and printing sheets of more customized stickers. The system includes, a database of assets stored on a central server accessible via the internet, wherein the assets are graphic images, objects and text that can be accessed and manipulated by a user at a remote location. A user interface provides the user with a canvas corresponding to the sheet of stickers, asset tools to access, select and save assets that are used to create the stickers, asset transformation tools to manipulate the assets on the canvas, and die-cut tools to create die-cut borders surrounding each of the stickers. The once the sheet of stickers has been created, the user can place an order for the sheet to be printed and delivered to the user.

Abstract: This disclosure relates to a method, article of manufacture, and apparatus for restoring one or more versions of a file. In some embodiments, this includes receiving a request to restore the file, determining if a stub corresponding to the file exists in an extended recycle bin; if exists, moving the stub from the extended recycle bin to a primary storage, if not, locating a backup of the stub in a backup storage, copying the backup to the primary storage, locating the file accordingly, retrieving the file from the secondary storage, locating copies of multiple versions of the stub from the backup storage, copying from the backup storage to the primary storage, locating multiple versions of the file on the secondary storage accordingly, and retrieving the one or more versions of the file from the secondary storage.

Abstract: A system is provided that manages aggregated information-driven approvals. The system creates an aggregation attribute that includes an aggregation function that automatically aggregates a plurality of data values into an aggregate data value for an attribute across a plurality of components of a document. The system defines an attribute identifier for the aggregation attribute, where the attribute identifier defines the attribute of the document whose data values are automatically aggregated by the aggregation function. The system further defines one or more filters for the aggregation attribute, wherein the one or more filters define the components of the document whose data values are automatically aggregated by the aggregation function.

Abstract: As part of query processing within a distributed execution environment framework, available resources taken into account when generating an execution plan and/or executing an execution plan to determine whether to parallelize any operations. Related apparatus, systems, methods and articles are also described.

Abstract: A computer-implemented method, system, and/or computer program product optimizes an order of execution of column join operations. A first partitioning of the first data column splits the first data column into first subsets of rows. A second partitioning of the second data column splits the second data column into a second subsets of rows. Cardinalities of sub-tables derived by a respective joining of the subsets of rows of the first and second data columns are estimated, based on the first and second value frequency information. An order of execution of multiple join operations is then optimized based on the estimated cardinalities of the sub-tables.

Abstract: This disclosure relates in general to the field of directory information systems and/or services. In a method embodiment, a method of arranging objects in a directory information system includes providing a plurality of objects to a computer-readable medium having a directory information structure. Each object may have one or more characteristics and each object may be stored, for example, in the computer-readable medium according to the directory information structure. Storing the objects may further include performing a mathematic operation on at least one of the characteristic(s) of the object, and arranging the object in the directory information structure based at least in part on a result of the mathematical operation performed on at least one of the characteristic(s) of the object.

Abstract: Disclosed are systems, methods and computer program products for duplicating files on client device for storage in a cloud storage server. An example method includes: receiving, by a user device, a request to upload a file stored locally on the user device into the cloud storage server; determine time required to generate a unique file identifier for said file and time required to upload said file to the cloud storage server; responsive to the time required to generate the unique file identifier for said file exceeding the time required to upload said file to the cloud storage server, initiating the uploading of the file to the cloud storage server; and responsive to the time required to upload said file to the cloud storage server exceeding the time required to generate the unique file identifier, generating said unique file identifier and transmitting the unique file identifier to the cloud storage server.

Abstract: An approach is disclosed for implementing failover and resume when using ordered sequences in a multi-instance database environment. The approach commences by instantiating a first database instance initially to serve as an active instance, then instantiating a second database instance to serve as an instance of one or more passive instances. The active database establishes mastership over a sequence and then processes requests for the ‘next’ symbol by accessing a shared sequence cache only after accessing a first instance semaphore. The active instance and the passive instance perform a protocol such that upon passive database detection of a failure of the active database, one of the passive database instances takes over mastership of the sequence cache, and then proceeds to satisfy sequence value requests. The particular order is observed in spite of the failure.

Abstract: A computer-implemented method, system, and/or computer program product optimizes an order of execution of column join operations. A first partitioning of the first data column splits the first data column into first subsets of rows. A second partitioning of the second data column splits the second data column into a second subsets of rows. A first value frequency information indicates a frequency of attribute values within a subset of rows of the first data column processed. A second value frequency information indicates a frequency of attribute values within a subset of rows of the second data column. Cardinalities of sub-tables derived by a respective joining of the subsets of rows of the first and second data columns are estimated, based on the first and second value frequency information. An order of execution of multiple join operations is then optimized based on the estimated cardinalities of the sub-tables.

Abstract: A system including a client and a server in a client-server architecture. The client transmits requests to the server for content subject to a sorting criterion that is ultimately used to sort results of the search. The server identifies an item matching the sorting criterion from its items collection. The server further generates an identifier for the directory item. The identifier is generated from the sorting criterion and is transmitted to the client. The client uses the identifier to sort the matching items.

Abstract: A system and method for record linkage includes performing an entity augmentation process for linking new data records with existing entities in a database. Performing the entity augmentation process includes performing an exact matching sub-process that includes accessing existing entity unique identifier (UID) keys in a memory cache layer and comparing a new data record UID key to the existing entity UID keys.

Abstract: A device receives, from multiple user devices, event information associated with the multiple user devices, where the event information includes one or more actions, user information, content information, and one or more attributes. The device stores the event information in a database, and analyzes one or more portions of the event information stored in the database. The device also recommends, based on the analyzed event information, one or more adjustments to a network that delivers content to the multiple user devices.

Abstract: To back up data stored in a distributed database system, a backup utility is configured with information regarding locations of data stored in the distributed database system having a plurality of nodes. The backup utility retrieves, based on the information regarding locations of data stored in the distributed database system, backup data from the plurality of nodes for backup storage.

Abstract: Techniques to improve query caching performance by efficiently selecting queries stored in a cache for evaluation and increasing the cache hit rate by allowing for inexact matches. A list of candidate queries stored in the cache that potentially could be used to answer a new query is first determined. This list may include all cached queries, cached queries containing exact matches for select list items, or cached queries containing exact and/or inexact matches. Each of at least one candidate query is then evaluated to determine whether or not there is a cache hit, which indicates that the candidate query could be used to answer the new query. The evaluation is performed using a set of rules that allows for inexact matches of aggregates, if any, in the new query. A query plan is generated for the new query based on a specific candidate query with a cache hit.