Abstract: Some content players use manifest files to obtain and play video content. The manifest files include metadata information for obtaining video chunks that together constitute a full video, and can be used by content players to obtain the chunks, stitch them together, and render the video as a stream. Described herein are techniques for dynamically generating manifest files. A request for a manifest file is received, such as from a video player. Manifest file contents are retrieved, such as from an original manifest file. A manifest file to be used by a video player to fetch video chunks is then dynamically generated and returned.

Abstract: Embodiments relate to digital data retention management. An aspect includes calculating a retention date associated with a data object in a storage system. Another aspect includes generating a cryptographic checksum for metadata relating to said data object, the metadata comprising the retention date. Another aspect includes storing said metadata and said cryptographic checksum. Another aspect includes, based on receiving a request to perform a deletion transaction on said data object for deleting said data object from the storage system: verifying metadata validity by checking the cryptographic checksum for the metadata associated with said data object to detect possible tampering of the metadata; verifying retention expiration by determining that a current date is past the retention date comprised in said metadata; and based on successful verification of metadata validity and retention expiration, authorizing deletion of said data object by the storage system.

Abstract: In some embodiments, a method includes receiving a command to update a form component within a set of one or more form templates. The method also includes receiving an alternative form component for the form component that is to be updated. The method includes performing a pattern matching across a number of form templates to identify the set of one or more form templates in the number of form templates. The method includes refactoring the set of one or more form templates. The refactoring includes changing a reference in the set of one or more form templates to reference the alternative form component.

Abstract: At a logging service, a representation of a transaction requested by a client is received. The transaction includes at least a first write operation directed to a data object at a first data store. Based at least in part on the contents of the representation and contents of a persistent log of the logging service, a determination is made that the requested transaction is to be committed. A log record corresponding to the first write operation is inserted into the persistent log. The first write is propagated to the first data store after the record has been inserted in the persistent log.

Abstract: A computer implemented method of ranking items of data stored in a database comprising a plurality of records, wherein each record is associated with one or more items of data. The method includes generating a concordance of the items of data associated with the records in the database. Each record is assigned to a first group of records or to a second group of records. For each item of data a first indicator is determined representative of its occurrences in the records of the first group. For each item of data a second indicator is determined representative of its occurrences in the records of the second group. For each item of data a score is determined representative of a discriminative power of that item of data on the basis of the first and second indicator of that item of data.

Abstract: A method for clustering data elements stored in a data storage system includes reading data elements from the data storage system. Clusters of data elements are formed with each data element being a member of at least one cluster. At least one data element is associated with two or more clusters. Membership of the data element belonging to respective ones of the two or more clusters is represented by a measure of ambiguity. Information is stored in the data storage system to represent the formed clusters.

Abstract: Various systems and methods for dividing, accessing, and sending portions of a data structure from one node to another for replication from a primary site to a secondary site are disclosed. The method includes dividing a data structure into portions. The data structure stores information identifying which regions of a data volume have been modified and nodes in a cluster share access to the data volume. The nodes and the data volume are located at the primary site. The method also includes sending a first portion of the data structure to a second node in the cluster. The sending causes the second node to replicate the data identified in the portion of the data structure from the data volume to the secondary site. In one embodiment, the accessing and the sending are performed by a logowner node.

Abstract: Various technologies described herein pertain to predicting intrinsically diverse sessions and retrieving information for such intrinsically diverse sessions. Search results retrieved by a search engine responsive to executing a query are received. A query classifier can be employed to determine whether the query is intrinsically diverse or not intrinsically diverse based on one or more features of the query and session interaction properties. The query is intrinsically diverse when included in an intrinsically diverse session directed towards a task, where the query and disparate queries included in the intrinsically diverse session are directed towards respective subtasks of the task. An objective function can be evaluated based at least upon the query to compute an optimized value when the query is determined to be intrinsically diverse. The search results can be presented on a display screen according to the optimized value when the query is determined to be intrinsically diverse.

Abstract: A method of identifying duplicate crash dumps in a computer system may include receiving a first crash dump caused by an application crash, extracting a first function signature of a function that caused the first crash dump, and searching a datastore of crash dumps for function signatures that substantially match the first function signature. The searching may include performing an approximate string-match between each of the function signatures the first function signature and performing an exact string match between each of the function signatures and the first function signature. The searching may also include combining weighted results of the approximate string-match with weighted results of the exact string match to generate match scores for each of the function signatures, and identifying the function signatures that substantially match the first function signature based on the match scores.

Abstract: A method for managing a plurality of workloads executing on both a primary system and on a secondary system, and synchronizing both a plurality of software data and a plurality of hardware data stored on the primary system with the secondary system is provided. The method may include receiving a region switch request and stopping the execution of the plurality of workloads on the primary system; suspending the replication of the plurality of software and hardware data stored on the primary system with the plurality of software and hardware data stored on the secondary system; and switching the replication of the plurality of software data and the plurality of hardware data that occurs from the primary system to the secondary system to occur from the secondary system to the primary system. The method may further include activating the execution of and synchronizing the plurality of workloads on the secondary system.

Abstract: Distance query techniques are provided that are robust to network structure, scale to large and massive networks, and are fast, straightforward, and efficient. A hierarchical hub labeling (HHL) technique is described to determine a distance between two nodes or vertices on a network. The HHL technique provides indexing by ordering vertices by importance, then transforming the ordering into an index, which enables fast exact shortest-path distance queries. The index may be compressed without sacrificing its correctness.

Abstract: In some examples, a computing system may receive a plurality of string matching requests with respect to a plurality of data streams, and determine one or more opportunities for aggregation of string matching.

Abstract: A computer-implemented method for finding related datasets includes, for each reference dataset from multiple reference datasets, determining domains and geographies for a user dataset and the reference dataset, obtaining a weighted domain coefficient and a weighted geography coefficient using the determined domains and geographies for the user dataset and the reference dataset, calculating a correlation coefficient between the user dataset and the reference dataset and calculating a semantic filtering coefficient for the user dataset and the reference dataset using the calculated correlation coefficient, the weighted domain coefficient and the weighted geography coefficient.

Abstract: Cookie files are screened in a client machine, wherein a cookie file includes a cookie file source. A request from a subscriber is received at a server to send a list of untrusted cookie file sources to the client machine. The list of untrusted cookie file sources is downloaded from the server to the client machine. The downloaded list of untrusted cookie file sources is used to detect cookie files received at the client machine from cookie file sources on the downloaded list by comparing the cookie file source of any received cookie file to the untrusted cookie file sources on the downloaded list.

Abstract: The present disclosure describes a data indexing and search service that resides locally on a computing device (e.g., a mobile phone) and that can host data for multiple applications on the device. By centralizing the storage of data as well as the search and query functions, unified search queries can be performed by the service.

Abstract: Disclosed are several examples of systems that can read millions of news feeds per day about topics (e.g., your customers, competitors, markets, and partners), and provide a small set of the most relevant items to read to keep current with the overwhelming amount of information currently available. Topics of interest can be chosen by the user of the system for use as seeds. The seeds can be vectorized and compared with the target documents to determine their similarity. The similarities can be sorted from highest to lowest so that the most similar seed and target documents are at the top of the list. This output can be produced in XML format so that an RSS Reader can format the XML. This allows for easy Internet access to these recommendations.

Abstract: In an example embodiment, a method for performing event stream processing is provided. An event stream is received, the event stream comprising a real time indication of one or more events occurring. Then it is determined that the event stream is identified in a streaming publish service inside a database. The event stream may then be inserted directly into one or more database tables in the database based on the determining.

Abstract: A secure synchronization apparatus, method, and non-transitory computer readable storage medium thereof are provided. The secure synchronization apparatus of the present invention includes a storage unit, an interface, and a processing unit. The interface is electrically connected to a storage server via a network. The processing unit is electrically connected to the storage unit and the interface. The processing unit is configured to execute an operating system and execute an agent program installed on the operating system. The agent program configures an isolated space, manages an extended space within the storage unit, and synchronizes an object between the isolated space, extended space, and the storage server through the interface. The isolated space and the extended space are only recognized by the agent program installed on the operating system and the object in the two spaces is accessible only via the agent program.

Abstract: Methods and systems are presented for custom caching. Application threads define caches. The caches may be accessed through multiple index keys, which are mapped to multiple application thread-defined keys. Methods provide for the each index key and each application thread-defined key to be symmetrical. The index keys are used for loading data from one or more data sources into the cache stores on behalf of the application threads. Application threads access the data from the cache store by providing references to the caches and the application-supplied keys. Some data associated with some caches may be shared from the cache store by multiple application threads. Additionally, some caches are exclusively accessed by specific application threads.

Abstract: An end-to-end data curation system and the various methods used in linking, matching, and cleaning large-scale data sources. The goal of this system is to provide scalable and efficient record deduplication. The system uses a crowd of experts to train the system. The system operator can optionally provide a set of hints to reduce the number of questions send to the experts. The system solves the problem of schema mapping and record deduplication a holistic way by unifying these problems into a unified linkage problem.