Abstract: System and method for constructing a hierarchical index table usable for matching a search sequence to reference data. The index table may be constructed to contain entries associated with an exhaustive list of all subsequences of a given length, wherein each entry contains the number and locations of matches of each subsequence in the reference data. The hierarchical index table may be constructed in an iterative manner, wherein entries for each lengthened subsequence are selectively and iteratively constructed based on the number of matches being greater than each of a set of respective thresholds. The hierarchical index table may be used to search for matches between a search sequence and reference data, and to perform misfit identification and characterization upon each respective candidate match.

Abstract: Computing systems, apparatuses, computer-implemented methods, and computer program products are disclosed for creating a shared communication channel in a group-based communication platform having a plurality of database shards. An example computer-implemented method includes generating a shared communication channel shard that is assigned a shared communication channel identification, a first set of shared communication channel attributes associated with a first group identification, and a second set of shared communication channel attributes associated with a second group identification. The method further includes generating first and second externally shared group-based shared communication channel interfaces based on the first and second sets of shared communication channel attributes, respectively.

Abstract: Techniques are described for responding to aggregate queries using optimizer statistics already available in the data dictionary of the database in which the database object targeting by the aggregate query resides, without the user creating any additional objects (e.g. materialized views) and without requiring the objects to be loaded into volatile memory in a columnar fashion. The user query is rewritten to produce a transformed query that targets the dictionary tables to form the aggregate result without scanning the user tables. “Accuracy indicators” may be maintained to indicate whether those statistics are accurate. Only accurate statistics are used to answer queries that require accurate answers. The accuracy check can be made during runtime, allowing the query plan of the transformed query to be used regardless of the accuracy of the statistics. For queries that request approximations, inaccurate statistics may be used so long as the statistics are “accurate enough”.

Abstract: Techniques are disclosed herein for identifying, recording and restoring the state of a database session and various aspects thereof. A session template data structure is generated that includes session attribute values describing various aspects of the session that is established between a client system and a database management system (DBMS and enables the client system to issue to the DBMS commands for execution. Based on the session attribute values, DBMS may generate a template identifier corresponding to the session template data structure. The template identifier may be stored in an association with the session state that it partially (or in whole) represents. In an embodiment, when another state of a session is captured, if the template identifier for the state is the same, then rather than storing the attribute-value pairs for the other state, the template identifier is further associated with the other state.

Abstract: Methods for generating meta-tagged media files, in which features of an event recorded in the media file are tagged to identify content, are disclosed herein. The methods include independent and simultaneous generation of a media file and meta-tags, and the combination of the media file and the meta tags based on a correlation of device times to generate the meta-tagged media file.

Abstract: Described are methods, systems and computer readable media for data object publishing/subscribing via a multicast key-value protocol.

Abstract: Systems, devices, apparatuses, components, methods, and techniques for media content playback during travel are provided. An example method a method of generating a playlist trailer for a media playback device, the method comprising: identifying a plurality of media content items from a playlist for inclusion in a playlist trailer identifying snippets from the identified plurality of media content items; and combining the identified snippets to generate a playlist trailer.

Abstract: Managing file distribution in an online file sharing system implemented by at least one server includes inviting a first entity to access a shared file hosted by the online file sharing system, and allowing the first entity to reshare the shared the through the online file sharing system with at least a second entity only to an extent permitted by a resharing policy stored by the online file sharing system.

Abstract: A system, method, and computer-readable medium are disclosed for improved segmentation analysis. In various embodiments, an artificial learning blended algorithm (ALBA) system—is implemented. In various embodiments, the ALBA system includes an optimum cluster module to determine an optimum number of clusters for multiple clustering algorithms, and a validation cluster module to validate cluster algorithms using index validation techniques to determine a clustering algorithm from multiple clustering algorithms that use the determined optimum number of clusters.

Abstract: A method of and apparatus for content assembly is provided by which an automation playlist of media events is created and published as a podcast. The publishing includes a podcast automation interface defining: a web syndication format, one or more RSS (Really Simple Syndication) channels for the publishing of the podcast, one or more RSS (Really Simple Syndication) variables for the publishing of the podcast, a podcast feed, wherein the podcast automation interface is used to create or update a local copy of one or more of: an RSS file or a web feed and distribute the podcast over a network.

Abstract: Technologies are provided for scaling applications via application scenarios. Portions of application resource content stored in a database are associated with application scenarios. The portions of the resource content associated with an application scenario are replicated to one or more computing nodes associated with the application scenario. Requests associated with the application scenario are transmitted to the one or more one or more computing nodes, where they are processed using the replicated portions of the resource content associated with the application scenario.

Abstract: A computer-implemented method of providing a materialisation of a set of logical rules on a logical database comprising a set of logical facts. Each of a plurality of parallel processing threads performs the following steps. A logical fact that has not previously been received by any thread is received by the thread. By applying any of the logical rules to the received logical fact and/or any of the logical facts received by any thread prior to the received logical fact, the thread determines whether a new logical fact is implied, and if so the new logical fact is added to the set of logical facts. The thread then repeats the above steps on any further logical facts in the set of logical facts that have not previously been received by any thread. When all threads are waiting for a new logical fact, the method has completed.

Abstract: A system for managing file systems includes memory. The system also includes a manager. The memory is used for storing in-memory data structures. The manager obtains file system references for a file system from a file system manager. The file system manager utilizes storage to provide the file system references. The manager stores the file system references in an in-memory data structure in the memory. To service file system reference requests, the manager utilizes uses the in-memory data structure to service at least one of the file system reference requests.

Abstract: Systems and methods are provided for receiving geographic coordinates for a location, determining a road segment associated with the location based on the geographic coordinates for the location, and determining a plurality of places associated with the road segment associated with the location. The systems and methods further provide for extracting visual data for each of the plurality of places, generating a plurality of feature values based on the visual data for each of the plurality of places, and analyzing the plurality of feature values to generate a visibility score for each of the plurality of places.

Abstract: The disclosed embodiments relate to a system that facilitates performing searches based on qualitative search terms. During operation, the system receives a query that applies a qualitative search term to an attribute of data items in a set of data items. While executing the query, the system processes each data item in the set of data items by extracting an attribute value from the data item and then using a concept-mapping to determine a compatibility index for the attribute value, wherein the concept-mapping associates each attribute value with a numerical compatibility index that indicates a compatibility between the attribute value and the qualitative search term. Finally, the system uses the compatibility index as a factor in determining whether to include the data item in a set of query results.

Abstract: Multi-organization shared channels are described. An instruction to create a communication channel on a group-based communication platform can be received. The communication channel can be associated with a first organization that is registered with the group-based communication platform. At least two other organizations can be associated with the communication channel, wherein a first one of the at least two other organizations is associated with a second organization that is different than the first organization and a second one of the at least two other organizations is associated with a third organization that is different than the first organization and the second organization, and wherein based at least in part on associating the at least to other organizations with the communication channel, the communication channel is a shared communication channel that is accessible by one or more users associated with the first organization, the second organization, or the third organization.

Abstract: Technologies are described for performing replication of data within a database environment having a source node and a replica node. The source node executes a database operation on at least one database table stored by the source node. The source node asynchronously sends the database operation to the replica node. A prepare commit request is synchronously sent from the source node to the replica node. The source node receives a synchronous precommit acknowledgement from the replica node. The precommit acknowledgement indicates that the database operation was executed at the replica node. The source node commits a transaction associated with the database operation.

Abstract: Provided is a computer-implemented method for linking datasets using at least two keys, including matching a second key of a first dataset with a second key of a second dataset to identify a plurality of matching records, linking the plurality of matching records from the first dataset and the second dataset, matching the first key of the first dataset with the first key of the second dataset to identify a second plurality of matching records, and linking the second plurality of matching records from the first dataset and the second dataset.

Abstract: A data structure that includes border data structures that appear at the respective interfaces between each of at least some of the segments in the data structure. The border does not conform to a data format for any of the elemental data types of the elemental data items represented within the data structure, and does not represent a size of any of the neighboring segments. Second, the data structure also includes an index. When writing the data structure, the writer tracks the position of each of the regions. When all segments and regions have been written, the writer can then write an index that represents the position of each region. The reader can then use that index to quickly read from only those regions of interest, and quickly skip over regions not of interest.

Abstract: An abstraction engine receives requests identifying a source application and a logical identifier and maps the request attributes to a stored procedure. The stored procedure invokes a native database call with respect to a database and returns the response to the abstraction later, which reformats the response to an object having <key, value> pairs that is independent of the database protocol or organization. Stored procedures may be mapped to various combinations of attributes of requests, which may include attributes such as a user identifier and application version. The stored procedure may return data from a particular database location or perform more complex functions such as filtering functions with using predefined filter criteria and locations or a filtering criteria and/or location derived from the request.