Abstract: A distributed log collector and report generation architecture is disclosed. In some embodiments, a received query to generate a log report is forwarded to each of a plurality of log collector clusters, and responses to the query received from each of at least a subset of the plurality of log collector clusters are aggregated to generate the log report.

Abstract: A system and method enable the selection of a time range, or other record selection criteria, of database records for upload from a local database source and for transfer to a remote database. A specifically bounded time period is selected to limit the number of data records selected for upload in a particular action to those records that are individually associated with date time stamp values falling within the specified time period. This limitation of records selected for inclusion in an upload process to data records having associations with date time stamps falling within a limited time range, or other criteria, reduces a likelihood of overload in transferring data and thereby reduces the incidence of time-outs in the communication of a local database, any intermediary server or software action, and the remote database in an updating of the recipient database to reflect a current state of the local database.

Abstract: A device implementing a system for providing query completion suggestions includes at least one processor configured to receive a partial query, and derive one or more query completion suggestions for the partial query from content items that are locally stored on the device, each respective query completion suggestion being associated with metadata extracted from one of the content items from which the respective query completion suggestion was derived. The at least one processor is further configured to rank the one or more query completion suggestions based at least in part on the metadata associated with each of the one or more query completion suggestions. The at least one processor is further configured to provide, for display, at least one of the one or more ranked query completion suggestions.

Abstract: A technique for storing data in a data storage system detects that a read is being performed pursuant to a data copy request. In response, the data storage system stores a digest of the data being read in an entry of a digest cache. Later, when a write pursuant to the same copy request arrives, the storage system obtains the entry from the digest cache and completes the write request without creating a duplicate copy of the data.

Abstract: A server may maintain information about entities such as medical entities. A user device can send search queries to the server to obtain information about a particular medical entity. Using techniques described herein, the server and/or the user device may maintain information relating to the particular medical entity in a manner that a relationship between the particular medical entity and the user device can be obfuscated from the server. By doing so, privacy of a user of the user device can be protected.

Abstract: A system for determining relevant information based on user interactions may include a processor configured to receive data and associated relevance information from a data source and a set of signals describing a current environment of a user or historical user behavior information in which the data source being local to a computing device. The processor may be further configured to provide, using a machine learning model, a relevance score for each of multiple data items based at least in part on the received relevance information and the set of signals. The processor may be further configured to sort the data items based on a ranking of each relevance score for each data item. The processor may be further configured to provide, as output, the multiple data items based at least in part on the ranking.

Abstract: The disclosed computer-implemented method for navigating through a hierarchy of nodes stored in a database may include (1) receiving a request to access a database that stores a set of nodes organized in a hierarchy, wherein the hierarchy is divided into contiguous subsections and each subsection is stored in a separate page and (2) in response to the request, traversing a path through the hierarchy of nodes by (a) identifying an initial node in the path and looking up an initial page that contains the initial node, (b) loading the page from the database into local memory, the page including the initial node in the path and one or more subsequent nodes in the path, and (c) navigating to the one or more subsequent nodes in the path by accessing the page loaded into local memory instead of accessing the database. Additional methods, systems, and computer-readable media are also disclosed.

Abstract: A matched array technology system and method for displaying in a two-dimensional array the structured interaction between airspeed and angle of attack of an aircraft during various stages of flight. Proxy values of airspeed and angle of attack are defined and scaled so the axes of the array contain corresponding indicators resulting in a “matched array” and an embedded, unique “alignment vector” of cells where the underlying airspeed and angle of attack combinations are consistent with controlled flight. Wherever the proxy values intersect, indicators depict proximity to the alignment vector, and the direction and extent of adjustments to either or both airspeed and angle of attack needed to achieve and maintain controlled flight.

Abstract: Techniques to perform event-based synchronization of data are disclosed. In various embodiments, an indication is received, during the course of performing a synchronization event-based synchronization with a synchronization client, that a user of the synchronization client has provided an input associated with a request to access a file or other object the changes to which have not yet been downloaded completely to the synchronization client. Download of the changes to the file other object with respect to which the input associated with a request to access is associated is reprioritized, to enable the synchronization client to provide access to the file or other object more quickly than would have been possible without the reprioritization.

Abstract: The method includes writing data transactions from a local database to a local transaction log file, assigning a bin number to each data transaction, and determining if the assigned bin number changed due to receipt of subsequent data transactions. If the bin number has changed and the data transaction is applicable to each remote database, inserting subsequent data transactions into a local sequence log file and assigning the subsequent data transactions a first sequence number. In response to a request by a remote replicator service, provide access to the first sequence number, and if the first sequence number does not match a second sequence number, providing to the requesting remote replicator service access to the subsequent data transactions, the remote replication service updating a remote database to include the subsequent data transactions if the at least one data transaction is applicable to each of the at least one remote database.

Abstract: A computer-implemented method includes: monitoring and receiving, by a computing device, metadata relating to a musical project, wherein the metadata includes information identifying a plurality of individual contributors involved in the production of the musical project; storing, by the computing device, the metadata; receiving, by the computing device, a query related to the musical project; accessing, by the computing device, the stored metadata to generate a response to the query based on the stored metadata; and providing, by the computing device, a response to the query for display to a user.

Abstract: An information processing system includes: a document reception unit configured to receive multiple pieces of document data; a data storage unit configured to store the received multiple pieces of document data; and a correspondence relation estimation unit configured to estimate a correspondence relation at least between an item in a first document data and an item in a second document data out of the multiple pieces of document data stored in the data storage unit. The correspondence relation estimation unit includes an item-item coupling relation extraction unit configured to extract a coupling relation among items in the first document data and a coupling relation among items in the second document data, and a word relationship extraction unit configured to extract a relevance between a word that appears in an item in the first document data and a word that appears in an item in the second document data.

Abstract: A method and associated system for generating a service specification of a solution. Each process of at least one process is decomposed into at least one atomic service process. The service specification of the solution to be compatible with both a process model framework that includes the at least one process and a data model framework that includes at least one data element that is indirectly matched to the at least one process. The service specification represents a respective process interface of each atomic service process that performs a respective atomic service in the solution. The customized service specification is stored in a database.

Abstract: There are provided computer systems and methods for performing componentized data storage. Such a system includes a hardware processor, a system memory, and a data componentization unit including a data resolution module and a data archiving module stored in the system memory. The hardware processor is configured to execute the data componentization unit to receive a data file including multiple data types, and to transform the data file into data components corresponding respectively to the multiple data types. The hardware processor is further configured to execute the data componentization unit to generate database entries each including one of the data components, and to store each of the database entries in one of multiple databases based on the data type corresponding to the data component included in the database entry.

Abstract: A framework and interface for invoking and assimilating external algorithms and interacting with said algorithms in-session and real-time are described herein. An example embodiment also includes reproducible, updatable nodes that can be leveraged for data-driven analysis whereby the data itself can direct the algorithm choice, variables, and presentation leading to iteration and optimization in an analysis workflow. With example embodiments, an entire discovery or diagnosis process may be executed on a particular data set, thereby divorcing the discovery or diagnosis process from a specific data set such that the same discovery or diagnosis process, phenotype identification, and visualizations may be repeated on future experiments, published, validated, or shared with another investigator.

Abstract: Techniques are described for receiving data generated by multiple platforms of different types, and managing the data in multiple stages of a data lifecycle associated with a super-platform. An end-user (e.g., data discloser) may interact with multiple individual (e.g., siloed) platforms of different types. The individual platforms may generate data describing, and/or resulting from, these interactions with end-user(s). The data from the various individual platforms may be received, ingested, stored, analyzed, aggregated, and/or otherwise processed by a super-platform during various stages of a data lifecycle. In some implementations, the end-user, the super-platform, and/or the individual platform(s) may provide one or more restrictions on how the data may be handled in each of the stages of the data lifecycle.

Abstract: A method for performing a path finding operation in graph data stored in a database is provided. The method may include receiving, from a client, a request to perform a weighted path operation on at least portion of the graph data. The portion of the graph data may correspond to a graph. The request may specify attributes associated with vertices and/or edges included in the graph. In response to the request, the weighted path operation may be performed by at least identifying a shortest path between two endpoints in the graph. The shortest path may minimize the one or more attributes of vertices and/or edges included in the shortest path. Related systems and articles of manufacture, including computer program products, are also provided.

Abstract: A query of time series data stored in a database is received that specifies at least one value. The database includes (i) an index table specifying groups of segments of compressed time series data with corresponding ranges each having a lowest value and a highest value, and (ii) a segments table specifying individual segments of compressed time series data. Thereafter, using the index table, at least one group for which the specified at least one value falls within the corresponding range is identified. The segments table is then queried for the segments corresponding to the identified at least one group to generate a new segments table specifying at least one segment. Next, the at least one segment specified by the new segments table is decompressed. Data responsive to the query within the decompressed at least one segment is then identified using the specified at least one value.

Abstract: A non-transitory computer-readable recording medium storing a data acquisition program that causes a computer to execute a process including: identifying a position of a part to be extracted in a document that is associated with a specific URL and includes structural information of tags, the position being on a hierarchical structure of the tags included in the document, and allowing the position on the hierarchical structure to be registered; and accessing periodically or non-periodically the document associated with the specific URL, and extracting and outputting data corresponding to the registered position on the hierarchical structure of the tags.

Abstract: A method for performing text searches on graph data stored in a database is provided. The method may include receiving, from a client, a request to perform a text search to locate a target string in the graph data stored in the database. The request may be in accordance with a declarative graph query configured to query the graph data stored in the database. The response to the request may include performing the text search to locate, in the graph data stored in the database, one or more records of strings that are exact matches, approximate matches, and/or linguistic matches for the target string. Related systems and articles of manufacture, including computer program products, are also provided.