Abstract: Aspects of the present disclosure involve systems, methods, computer program products, and the like, for grouping a plurality of content files in content delivery network (CDN) for easier storage and access. In one embodiment, the CDN may store related files in one or more container files within the CDN to reduce the number of stored files. In addition, a manifest provided to the requesting device relating to the content may be altered to point to the container files rather than the separate content files within the container. The manifest may also provide information to the requesting to extract and process the content files within the container file in the proper order for playing on the requesting device.

Abstract: Methods, systems, and apparatus, including computer program products, for presenting search query suggestions. In an aspect, query triggers in a resource are identified at a client device. For each query trigger identified in the resource, a rank score for the query trigger based on query trigger attributes is calculated at the client device. The query triggers are ranked at the client device based on the rank scores. Search query suggestions are generated at the client device from the query triggers identified in the resource. The search query suggestions include terms of the query triggers, expansion terms of the query triggers, and search query suggestions generated from templates applied to the terms of the query triggers and expansion terms of the query triggers. The search query suggestions are presented at the client device according to the rank of the corresponding query triggers.

Abstract: This disclosure relates to multidimensional search and retrieval on losslessly reduced data by organizing prime data elements using components of a structure of an input dataset so that searches can be performed on the losslessly reduced data based on the one or more components of the structure. Some embodiments can retrieve, from the data structure that organizes the prime data elements, either references to metadata for prime data elements, or metadata for prime data elements, or prime data elements in a content associative manner, based upon the value of certain fields or dimensions in an input query presented to the data structure (said data structure being called the prime data sieve). For every prime data element, the prime data sieve can retain a reverse reference to the losslessly reduced representation of each chunk that refers to the prime data element.

Abstract: The exemplary embodiments described herein are related to techniques for automatically generating narratives about data based on communication goal data structures that are associated with configurable content blocks. The use of such communication goal data structures facilitates modes of operation whereby narratives can be generated in real-time and/or interactive manners.

Abstract: A computing system includes at least one source data center that generates data and a plurality of recovery groups, coupled to the at least one source data center, where each of the recovery groups includes a synchronous data center that receives synchronous data from the at least one source data center and includes an asynchronous data center that receives asynchronous data from the at least one source data center. Cycle switching for asynchronous data transfer is coordinated by the at least one source data center for a first subset of recovery groups containing at least two of the recovery groups. The computing system may also include a second subset of the recovery groups, different from the first subset, where cycle switching for asynchronous data transfer is coordinated by the at least one source data center for the second subset.

Abstract: For efficiently storing and retrieving data and metadata in phases, in a first phase, metadata tokens, which are assigned to metadata-emitting entities, are used for storing the data and the metadata together in a single input/output operation while piggybacking the metadata of least active metadata-emitting entities onto one of the metadata-emitting entities having one of the metadata tokens. In a second phase, the metadata is re-written to a metadata delta journal for reclaiming the metadata tokens. In a third phase, the metadata journal is applied to a metadata structure containing the metadata of the storage system, the metadata delta journal is then cleared after successfully updating the main metadata structure with the metadata of the metadata journal. The metadata journal is swapped with an empty metadata journal for concurrently adding metadata while retaining the metadata journal until applying the metadata delta journal to the metadata structure.

Abstract: Mechanisms are provided for performing tabular data correction in a document. Tabular data is received and analyzed to identify at least one portion of the tabular data having an erroneous/missing data value. A functional dependency of the at least one portion of the tabular data on one or more other portions of the tabular data is determined. A correct data value for the erroneous or missing data value of the at least one portion of the tabular data is determined based on the functional dependency of the at least one portion. In addition, the tabular data is modified to replace the erroneous or missing data value with the correct data value and thereby generate a modified table data. A processing operation is then performed on the modified table data to generate a resulting output.

Abstract: A system can maintain multiple queues for deduplication requests of different priorities. The system can also designate priority of storage units. The scheduling priority of a deduplication request is based on the priority of the storage unit indicated in the deduplication request and a trigger for the deduplication request.

Abstract: A system for supporting a user's repetitive motion activity operates to manage cadence-based playlists identifying one or more media content items having a tempo corresponding to a user's cadence. The cadence-based playlists can be categorized by different tempi or tempo ranges that cover all likely cadences during the user's activities. A media-playback device is provided to acquire a user's cadence and retrieve a cadence-based playlist associated with a tempo or a tempo range corresponding to the cadence.

Abstract: Limiting the number of concurrent requests in a database system. Arranging requests to be handled by the database system in at least one queue. Defining a maximum value (SS) of concurrent requests corresponding to the at least one queue. Monitoring at least one queue utilization parameter corresponding to the at least one queue and calculating a performance value based on the at least one queue utilization parameter. Adapting the maximum value (SS) of concurrent requests of the at least one queue dynamically based on the performance value (PF) in order to improve system performance. Limiting the number of concurrent requests of the at least one queue dynamically based on the dynamically adapted maximum value (SS).

Abstract: Limiting the number of concurrent requests in a database system. Arranging requests to be handled by the database system in at least one queue. Defining a maximum value (SS) of concurrent requests corresponding to the at least one queue. Monitoring at least one queue utilization parameter corresponding to the at least one queue and calculating a performance value based on the at least one queue utilization parameter. Adapting the maximum value (SS) of concurrent requests of the at least one queue dynamically based on the performance value (PF) in order to improve system performance. Limiting the number of concurrent requests of the at least one queue dynamically based on the dynamically adapted maximum value (SS).

Abstract: A method and system are provided for dynamic provisioning of snapshots in a data backup system with a software defined storage (SDS). The method implemented by the backup system receives a snapshot provisioning request including a user selection of snapshot objectives by a dynamic snapshot module, converts a file system reference mapping to a logical unit number (LUN) of the SDS, consolidates the snapshot provisioning request to the mapping and snapshot frequency, and passes the consolidated snapshot provisioning request to the SDS to provision snapshots.

Abstract: Provided is a process of refining Boolean queries, the process including: obtaining a query; searching a corpus of documents based on the query; selecting narrowing terms that pertain to respective subsets of the responsive documents; selecting broadening terms related to the query; instructing the user's computing device to present a graphical user interface comprising: graphical representations of the narrowing terms; graphical representations of the broadening terms; and one or more user inputs by which the user refines the query by adding a selected narrowing term or a selected broadening term; obtaining a user selection of a broadening term or a narrowing term; forming a refined query based on the user selection; searching at least part of the corpus based on the refined query to identify refined responsive documents; and instructing the user's computing device to present an updated graphical user interface with information about the refined responsive documents.

Abstract: In one embodiment, a user of a social networking system requests to check in a place near the user's current location. The social networking system generates a list of places near the user's current location, ranks the places in the list of places near the user's current location by a distance between each place and the user's current location, as well as activity of the user and the user's social contacts for each place, and returns the ranked list to the user.

Abstract: An analysis module is configured to receive data associated with an event flow. The data is received from a first analysis module (e.g., in a stack of analysis modules) or from the event flow. The analysis module is configured to execute an analysis operation on the data to generate a result. The analysis module can output the result to a second analysis module (e.g., in the stack of analysis modules) or to a user interface.

Abstract: A computer receives event information associated with a user. The computer determines one or more social media contacts associated with the event, wherein the social media contacts are further associated with the user. The computer determines one or more terms utilized by the determined one or more social media contacts. The computer detects an input by the user, wherein the input includes one or more characters. The computer determines one or more autocomplete suggestions based on the one or more terms utilized by the determined one or more social media contacts.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for selecting a template for a content item. In one aspect, a method includes receiving a content item request that includes context data. A content item that is eligible to be presented in response to the content item request is identified. A determination is made that the content item includes a template variable that is resolved based on the context data. A template feed including a set of templates is identified based on the template variable. A template is selected from the template feed for the content item. The template can be selected based on the context data. The selected template is populated with content for the content item to create a formatted content item. The formatted content item is provided in response to the content item request.

Abstract: Limiting the number of concurrent requests in a database system. Arranging requests to be handled by the database system in at least one queue. Defining a maximum value (SS) of concurrent requests corresponding to the at least one queue. Monitoring at least one queue utilization parameter corresponding to the at least one queue and calculating a performance value based on the at least one queue utilization parameter. Adapting the maximum value (SS) of concurrent requests of the at least one queue dynamically based on the performance value (PF) in order to improve system performance. Limiting the number of concurrent requests of the at least one queue dynamically based on the dynamically adapted maximum value (SS).

Abstract: Limiting the number of concurrent requests in a database system. Arranging requests to be handled by the database system in at least one queue. Defining a maximum value (SS) of concurrent requests corresponding to the at least one queue. Monitoring at least one queue utilization parameter corresponding to the at least one queue and calculating a performance value based on the at least one queue utilization parameter. Adapting the maximum value (SS) of concurrent requests of the at least one queue dynamically based on the performance value (PF) in order to improve system performance. Limiting the number of concurrent requests of the at least one queue dynamically based on the dynamically adapted maximum value (SS).

Abstract: In one embodiment, a user of a social networking system requests to check in a place near the user's current location. The social networking system generates a list of places near the user's current location, ranks the places in the list of places near the user's current location by a distance between each place and the user's current location, as well as activity of the user and the user's social contacts for each place, and returns the ranked list to the user.