Abstract: Systems, methods, and non-transitory computer-readable media can determine a set of potential visualizations for a data set based on a set of visualization templates. The set of potential visualizations is ranked based on ranking criteria. A set of visualization recommendations for the data set is determined based on the ranking.

Abstract: An embodiment may involve, based on a profile associated with a client device, selecting an audio file containing music. Based on an attribute of the audio file containing the music, an audio file containing a story may be selected. A playlist for the client device may be generated, where the playlist includes (i) a reference to the audio file containing the music, and (ii) a reference to the audio file containing the story. A server device may transmit the playlist to the client device over a wide area network. Reception of the playlist at the client device may cause an audio player application to retrieve and play out each of the audio file containing the music and the audio file containing the story.

Abstract: Disclosed are systems, apparatus, methods, and computer readable media for performing actions in response to information updates provided in an information feed. In one implementation, an information update is selected for comparison with a data record creation rule. The data record creation rule may specify a data record creation operation for creating a data record based the selected information update. The selected information update may be capable of being displayed in an information feed. A determination may be made as to whether the selected information update includes information satisfying a trigger condition associated with the data record creation rule. When the information in the selected information update satisfies the trigger condition, the data record creation operation may be performed to create the data record. The data record creation operation may identify information to include in the data record.

Abstract: A data manager determines an appropriate number of clusters for continuous data using unsupervised learning. The data manager selects an appropriate number of clusters based on at least one temporal stability measure between continuous data from at least two time intervals.

Abstract: A visualization of literary elements of a work of literature, such as a novel or short story, is generated from meta-data records representing a digital work of literature including literary elements (humor, drama, adventure, etc.), characters, and plot devices related to a position within the work of literature where each appears. A significance level is determined for each of the elements, characters and plot devices at each position within the work of literature, and these are plotted into a sequential graph having position (e.g. timeline) axis and a significance level axis. The sequential graph is then output for printing or display. Human-generated and machine-generated meta-data may be ingested equally well by the method. Colors, line thickness, and a broken line patterns may be employed for greater visual meaning. And, the sequential graph may be annotated according to segments (e.g. chapters, sections) and dominant genre within each segment.

Abstract: In one or more embodiments, an analytical search engine is provided. The analytical search engine provides a search-driven data analysis approach that greatly facilitates data searches. The analytical search engine provides a more efficient user experience and, at the same time, simplifies the search process for its users. The analytical search engine employs a robust search model that provides a comprehensive definition and coverage of available data. The search engine provides various functionality such as type-ahead or look-ahead suggestions to help users define precise queries. The search engine also identifies ambiguous or incomplete queries and provides disambiguation suggestions to correct the queries.

Abstract: A mechanism is provided for replicating non-supported data types using an existing replication format supported by an existing replication system. Responsive to detecting an application writing data to a local storage that is to be replicated to the secondary site, the input/output (I/O) operation being performed by the application is intercepted. Data of the I/O operation in a non-supported format is converted to a format supported by the existing replication system. A replication log record is generated for the data in the format supported by the existing replication system. The data described by the replication log record for the data is then stored in a storage device at the secondary site.

Abstract: A method may include iterating through at least a portion of a table stored in a database by identifying a timestamp block associated with a range of rows forming the portion of the table. In response to determining that the timestamp block is a sparse timestamp block storing timestamps associated with only some of the rows in the first range of rows, generating a bitmap. Each of the binary values in the bitmap may correspond one of the rows in the range of rows. Moreover, each of the binary values in the bitmap may indicate whether the timestamp block includes a timestamp associated with a corresponding row from the range of rows. Iterating through the range of rows may include accessing, based on the bitmap, the timestamp block to read or write timestamps of transaction affecting the rows in the range of rows.

Abstract: A method may include performing a transaction on a row in a table stored in a database. In response to performing the transaction, a first timestamp block associated with a range of rows including the row may be retrieved. In response to determining that the first timestamp block is a sparse timestamp block that has reached maximum capacity, a second timestamp block may be allocated for storing the timestamp associated with the transaction. The sparse timestamp block may be allocated with sufficient storage space for storing some but not all of the timestamps associated with the range of rows. By contrast, the second timestamp block may be a dense timestamp block allocated with sufficient storage space for storing all of the timestamps associated with the range of rows. The timestamp associated with the transaction may be stored in the second timestamp block.

Abstract: Systems and methods to process a topology change in a clustered database are described. The system communicates a query to a source storage platform enquiring of a topology change in a clustered database stored on the source storage platform. The system receives a message, at a control computer responsive to communicating the query. The message includes node identifiers identifying nodes including a first node identifier identifying a first node included in the clustered database. The system automatically identifies an addition of the first node to the clustered database on the source storage platform. The system initializes the first node on the source storage platform by communicating a first node agent to the first node. The first node agent is configured to execute on the first node to extract the data image at the source storage platform and stream the data image to the secondary storage platform.

Abstract: A process certifies an interaction between a user and an Organization. A Company WEB server requests an acquisition system (WIAS) generate a new redirection URL address (F-URL), simultaneously with sending a pre-redirected HTML form, the (F-URL) pointing to a gateway for verifying in the request the presence of a TOKEN/COOKIE indicating instantiation of a dedicated acquisition memory-storage on the server. If the TOKEN/COOKIE is not present the dedicated acquisition memory-storage is instantiated in the server and the certified acquisition step is started. Upon completion of the step for certified acquisition of the interaction the request of the user is again directed to the original URL address (O-URL), with confirmation of the acceptance to the user, the application of a time mark and an identification symbol, obtaining a certification having legal proof value, sent to a device for storing legal proof certifications.

Abstract: Methods, systems, and computer-readable media for two-dimensional partition splitting in a time-series database are disclosed. Stream processor(s) write elements of time-series data to a first replica group of a first tile associated with a first set of spatial and temporal boundaries. A second replica group is initialized with the same boundaries. A control plane generates updated metadata for the first tile. The updated metadata indicates a modified first set of spatial and temporal boundaries for the first replica group associated with the first tile and a second set of spatial and temporal boundaries for the second replica group associated with a second tile. The modified first set represents a first portion of the first set, and the second set represents a second portion of the first set. The updated metadata is obtained by the stream processor(s) which write, to the second tile, time-series data within the second set of boundaries.

Abstract: A method that involves receiving a set of first log records. The set of first log records are duplicated using key operation pairs to generate a set of second log records from the set of first log records. The set of second log records are duplicated using a second set of intervals to generate a set of third log records from the set of second log records. The set of third log records are aggregated using the second set of intervals to generate a set of aggregated log records. The set of aggregated log records includes an aggregated log record comprising a number indicating a number of events from the set of first log records that have the key, that have the operation, and that occurred during an interval of the second set of intervals. The operation is identified by comparing the aggregated log record to a server log record.

Abstract: Disclosed are various embodiments that involve selecting supplemental content. A compatibility rule is determined to require supplemental content from a first content provider to be a predetermined minimum distance from supplemental content from a second content provider. A layout is generated to include a first slot and a second slot. A first content item from the first content provider is assigned to the first slot, and a second content item from the second content provider is assigned to the second slot. A network page is generated using the layout.

Abstract: Examples described herein relate to music discovery. In one aspect, a method is provided that involves (a) receiving by a computing device an indication of a search tool from among a plurality of search tools, where each search tool of the plurality of search tools is associated with at least one respective media service, (b) receiving by the computing device an indication of a media characteristic, where the computing device receives the media characteristic via the indicated search tool, (c) selecting by the computing device one or more of the at least one respective media service that maintains media associated with the indicated media characteristic, and (d) sending by the computing device an indication of the selected one or more of the at least one respective media service.

Abstract: One example method includes receiving a write request that includes a data structure version to be written, wherein the data structure version is associated with a unique identifier, storing the data structure version in association with the unique identifier, receiving a read request for a most recent version of the data structure and, when the stored data structure version is not the most recent version of the data structure, examining respective unique identifiers of each of a group of other stored data structure versions to determine which stored data structure version is the most recent. Finally, the example method includes returning the most recent data structure version, notwithstanding that one or more other data structure versions existed at the time that the read request was received.

Abstract: System and method of generating an index structure for indexing a plurality of unstructured data objects, including: generating a set of compact feature vectors, the set including a compact feature vector for each of the data objects, the compact feature vector for each data object including a sequence of hashed values that represent the data object; generating a plurality of twisted compact feature vector sets for each of set of compact feature vectors, each of the twisted compact feature vector sets being generated by applying a respective random shuffling permutation to the set of compact feature vectors; and for each twisted compact feature vector set, generating an index for the data objects in which the data objects are slotted based on sequences of hashed values in the twisted compact feature vector set.

Abstract: In accordance with an embodiment, described herein is a system and method for use of lock-less data structures and processes with a multidimensional database computing environment. Lock-less algorithms or processes can be implemented with specific hardware-level instructions so as to provide atomicity. A memory stores an index cache retaining a plurality of index pages of the multidimensional database. A hash table indexes index pages in the index cache, wherein the hash table is accessible by a plurality of threads in parallel through application of the lock-less process.

Abstract: A mechanism is provided for replicating non-supported data types using an existing replication format supported by an existing replication system. Responsive to detecting an application writing data to a local storage that is to be replicated to the secondary site, the input/output (I/O) operation being performed by the application is intercepted. Data of the I/O operation in a non-supported format is converted to a format supported by the existing replication system. A replication log record is generated for the data in the format supported by the existing replication system. The data described by the replication log record for the data is then stored in a storage device at the secondary site.

Abstract: A method of clustering files, comprises, by a processing unit: obtaining a clustering structure comprising a plurality of nodes arranged in hierarchical levels Li, with i from 1 to N, obtaining at least one data (Dsignal) representative of a file (Dfile) to be assigned to a category; (O1) comparing said data to each centroid of each node of the first level, (O2) if said comparison matches an acceptance threshold of one or more nodes, selecting a node among these nodes, (O3) comparing Dsignal to each centroid of each node of a next level which is linked to said selected node, (O4) if said comparison matches an acceptance threshold of one or more nodes, selecting a node among these nodes, repeating O3 and O4 until a stopping condition is met, thereby indicating that Dsignal or Draw belongs to a category of files represented by said selected node.