Abstract: Systems and methods that describe a graph database system with an online component and an offline component, are provided. Write events that modify a first graph in a real-time graph database included in the online component are received. Graph logs that include changes to the first graph in the real-time graph database caused by the write events are generated. The graph logs are transmitted to an offline component of the graph database system in a chronological order. A second graph in the offline component is modified using the graph logs. The first graph and the second graph are instantiated using a graph schema.

Abstract: A computer-implemented method for keyword search in a data set. Data of the data set is represented by a knowledge graph. The knowledge graph comprises vertices representing entities of the data set and edges representing relations between said entities. The method comprises the following steps: receiving a search query comprising at least two entities; computing for the at least two entities of the search query a salient subset of the data set, wherein the salient subset is computed such that a structural compact subgraph exists in the knowledge graph, the structural compact subgraph connecting the at least two entities of the search query, and computing for the salient subset a structural compact subgraph of the knowledge graph which connects the at least two entities of the search query.

Abstract: Data item deltas are generated for each of M updates of a plurality of updates, wherein M is greater than or equal to one, and a first first-level combined delta is generated representing N updates of the plurality of updates, wherein N is greater than M, and the N updates comprise the M updates and O=N?M other updates. A first second-level combined delta is generated representing J updates of the plurality of updates, wherein J is greater than N, and the J updates comprise the N updates and K other updates of the plurality of updates, wherein K=J?N. The deltas, the first first-level combined delta and the first second-level combined delta are stored for enabling subsequent reading of at least part of the data by accessing the data item, the first first-level combined delta and the first second-level combined delta.

Abstract: Techniques are provided for obtaining generic vectorized d-heaps for any data type for which horizontal aggregation SIMD instructions are not available, including primitive as well as complex data types. A generic vectorized d-heap comprises a prefix heap and a plurality of suffix heaps. Each suffix heap of the plurality of suffix heaps comprises a d-heap. A plurality of key values stored in the heap are split into key prefix values and key suffix values. Key prefix values are stored in the prefix heap and key suffix values are stored in the plurality of suffix heaps. Each entry in the prefix heap includes a key prefix value of the plurality of key values and a reference to the suffix heap of the plurality of suffix heaps that includes all key suffix values of the plurality of key values that share the respective key prefix value.

Abstract: This disclosure relates generally to a method and system for extraction of SQL queries in an application. Various conventional approaches models SQL query extraction at a specific program point problem as an instance of string expression problem. Many string analysis based solutions are not scalable for large applications and those which are scalable do not account explicitly for the heap based flow. In an embodiment, the disclosed method and system utilizes a multi-criteria slicing based model which takes into account the data flowing through heap and contributing to SQL queries generation.

Abstract: A knowledge graph stores connections among tables in a data set and queries used to extract information from the data set. The queries may be used to generate reports. The knowledge graph indicates which of the tables each query uses and indicates which of the queries is used by each table. The knowledge graph may also store schema for the tables and information describing the tables and the queries. A graph builder may generate the knowledge graph by crawling the data set and the queries and by using a query parser to determine the tables each query uses. The graph builder may automatically update the knowledge graph. The graph builder may detect data quality issues in a table of the data set. The graph builder may query the knowledge graph for the queries that use the table. The graph builder may associate notifications with the queries.

Abstract: An example method for managing datasets produced by alert-triggering search queries may include producing a dataset by executing a search query on a portion of data associated with a time window defined relative to a current time. The method may further include responsive to determining that a portion of the dataset satisfies a condition defining an alert, generating an instance of the alert. The method may further include associating, by a memory data structure, the instance of the alert with an identifier of the query and a parameter specifying a time of execution of the query that has triggered the instance. The method may further include receiving a request for the dataset portion. The method may further include substituting, in a definition of the time window, the current time with the time parameter. The method may further include reproducing the dataset portion by re-executing the query using the time window.

Abstract: An approach is provided for generating graph database parameter settings. Parameter settings for importing data into a graph database are determined. A speed of importing simulated data into the graph database and a system resource usage are determined by executing an importing of the simulated data using the parameter settings and a simulated hardware environment. A reward associated with the parameter settings is determined. Using a policy network that includes convolutional neural networks and based on the reward and the settings, candidates of adjusted parameter settings are determined. Using a Monte Carlo tree search in multiple iterations to estimate changes in speeds of importing the simulated data and changes in system resource usages for candidates of the adjusted parameter settings, rewards for the candidates are determined. Based on the rewards, a candidate is selected as including final parameter settings that optimize an importing speed and system resource usage.

Abstract: Aspects of the present disclosure include a system comprising a machine-readable storage medium storing at least one program and computer-implemented methods for efficiently storing graph data. Consistent with some embodiments, the method includes using the graph data to construct a tree topology bitmap that represents a topology of a portion of the nodes in a tree data structure representing the graph data. The method further includes creating an archive bit array for the tree data structure that includes elements populated with a binary indicator of whether a corresponding leaf node includes a known entry. The method further includes creating a leaf values array comprising a known value for each leaf node in the tree data structure with a known entry. The method further includes storing, in a memory storage device, the tree topology, the archive bit array, and the leaf values array in association with an initial timestamp.

Abstract: A system and method for information storage using blockchain and pointer databases, comprising a computer with a blockchain manager and datastore manager, and blockchain data input, which connects over a network to a distributed blockchain ledger containing information such as personally-identifying data and a datastore system containing searchable information such as a DNS system on the persons entered into the blockchain, the datastore system also containing reference numbers for each searchable block in the blockchain, such that verification or identification can both be accomplished swiftly and securely of data in the blockchain such as for data verification to verify or identify persons submitting data to such a system.

Abstract: In various example embodiments, a system and method for generating a statistic using transaction data are presented. Transaction data is received, the transaction data regarding transactions performed by a set of merchants. An activity filter is generated based on the transaction data. A set of active merchants that each performs the threshold amount of transaction activity during a period of time is selected. A statistic is generated based on the transaction data.

Abstract: A system and method of generating a database schema from a graphical user interface used to create a form. The embodiments discloses the system that utilizes a drag and drop application that allows for configuration of a plurality of forms. These forms can then be placed in a graphical flow that will dictate the order of the forms. Through its graphical user interface, the system is able to gather information on field structure, flow among form elements, element identification, among other embodiments. This information allows the system to automate the creation of the database schema without user intervention.

Abstract: An automation control and monitoring system is provided that includes an automation control component and a data store. The automation control component is configured to store measurement data acquired from a sensing component of the automation control system. Metadata is dynamically associated with the measurement data, such that at least a portion of both the data and the metadata may be accessed using a name reference that provides an indication of particular data from the one or more data fields and particular metadata associated with the particular data.

Abstract: In accordance with various embodiments of the present disclosure, a query for information related to machine data generated by one or more machine data sources of a cloud computing platform (CCP) is sent by a client computing device and to a cloud computing monitoring component of the CCP, where the query is formed using native query language of the CCP. As a result, the client computing device via a connector receives a first data object that is formatted in accordance with a first format associated with the CCP. The client computing device via the connector may then convert the first data object to one or more second data objects formatted in accordance with a second format that allows for enhanced ingestion by a data intake and query system.

Abstract: Provided are a computer program product, system, and method for providing information on detected user interactions with natural language processor (NLP) items to a server to use to determine an order in which to render NLP items in a user interface. Interactions with natural language processing (NLP) items in documents are detected. For each interaction with an NLP item of the NLP items in the documents, determination is made of a context attribute value for a context attribute related to the interaction with the NLP item. Then interaction information is generated indicating the NLP item and the determined context attribute value. The interaction information is sent to the server to include in user interaction information in a database.

Abstract: Taxonomy driven multi-system networking and content delivery systems and methods are provided herein. An example systems includes a website authoring platform generating a taxonomy structure for a webpage, the taxonomy structure indicating assets to be included in the webpage a layout for the assets, a technical documentation authoring system for creating technical documents related to the assets, and a metadata binder providing the technical documentation authoring system with access to the taxonomy structure of the website authoring platform so that technical document authors are provided with the taxonomy structure to guide creation and structuring of the technical documents so that the technical documents comprise data that corresponds to the assets.

Abstract: In some examples, in response to an event at the deduplication system, a system accesses item metadata of a backup item that is backed up to a remote object storage system, the item metadata of the backup item including range information indicating a range of identifier values for portion objects of the backup item stored in the remote object storage system. The system issues, based on the range information, requests to obtain respective attribute information of the portion objects of the backup item stored in the remote object storage system. The system determines, based on the attribute information, a name of a given portion object of the backup item already used.

Abstract: A distributed file system may store a plurality of entity attributes. A node consolidating system may identify similarities between entity attributes for different entities. The node consolidating system may generate an entity graph which displays relationships and similarities between entities in a graphical user interface.

Abstract: In accordance with an embodiment, described herein is a system and method for database replication benchmark testing. The system can include one or more microservices configured to collect performance metrics from a testing environment, and a plurality of workload configurations that define different types of pipelines. Each pipeline can be used to execute a workload, and use different techniques to handle errors during the execution of the pipeline. A pipeline control manager can receive a workload configuration, and identify a pipeline defined therein. The pipeline control manager can invoke the one or more microservices to collect performance metrics from the testing environment, and use the collected performance metrics to validate the testing environment before starting the workload. Performance metrics from each pipeline stage can be consolidated and displayed at a user interface. The system can automatically select a workload configuration based on a replication feature to be tested.

Abstract: One or more computing devices, systems, and/or methods for transmitting content items using search history profiles are provided. For example, a first request to access a web page may be received. The first request may be associated with a device. The first request may be analyzed to determine a query. The query may be stored in a search history profile associated with the device. The search history profile may comprise indications of a plurality of queries. A second request for content may be received from a second device associated with the search history profile. Responsive to receiving the second request, a content item may be selected from a content items database based upon the query. The content item may be transmitted to the second device. The device may be the same as the second device. Alternatively and/or additionally, the device may be different than the second device.