Techniques are described herein for enabling autonomous agents to generate conclusive answers. An example of a conclusive answer is text that addresses concerns of a user who is interacting with an autonomous agent. For example, an autonomous agent interacts with a user device, answering user utterances, for example questions or concerns. Based on the interactions, the autonomous agent determines that a conclusive answer is appropriate. The autonomous agent formulates the conclusive answer, which addresses multiple user utterances. The conclusive answer provided to the user device.

In accordance with an embodiment, described herein are systems and methods for supporting slowly changing dimensions and metadata versioning in a multidimensional database, comprising. A system can comprise a computer that includes one or more microprocessors, and a multidimensional database server executing on the computer, wherein the multidimensional database server supports at least one hierarchical structure of data dimensions. A data dimension can slowly change over time. When such changes occur, metadata associated with the data dimension can be updated. Advantageously, a current snapshot of the data structure can allow searching of previous changes to the slowly changing dimension based upon the metadata.

Embodiments of the invention utilize an optimized key-value storage engine to strike the optimal balance between cloud-cost and performance and supports queries, including updates, lookups, range queries, inserts, and read-modify-writes. Cloud cost is manifested in purchasing both storage and processing resources. The improved approach has the ability to self-design and instantiate holistic configurations given a workload, a cloud budget, and optionally performance goals and a set of Service Level Agreement (SLA) specifications. A configuration reflects an optimized storage engine design in terms of, for example, the individual data structures design (in-memory and on-disk) in the engine as well as their algorithms and interactions, a cloud provider, and the exact virtual machines to be used.

The disclosed technology relates to a system configured to detect a modification to a node in a tree data structure. The node is associated with a content item managed by a content management service as well as a filename. The system may append the filename and a separator to a filename array, determine a location of the filename in the filename array, and store the location of the filename in the node.

The present invention relates to a highly flexible, scalable multi-blockchain, hierarchical data-sharing and data-storing system, at least comprising a third-party blockchain system, a data-sharing blockchain system, and an application-layer client, wherein the data-sharing blockchain system performs data aggregation and hierarchical storage on shared data uploaded by the third-party blockchain system through accessing the data-sharing blockchain system, so as to allow the application-layer client to require the shared data from the data-sharing blockchain system. The disclosure herein creates a single reliable data-sharing blockchain apparatus based on blockchain systems, so as to facilitate aggregation of data coming from different blockchain systems, reduce node complexity and block data redundancy when data are acquired from multiple parties, and define different sharing rules for different data contents, thereby being adaptive to scenarios where data are shared among parties.

The present invention relates to a lightweight data storage apparatus for graphic blockchains, at least comprising a common transaction construction module for a user to initiate new transactions and a network broadcast module for broadcasting the transactions, wherein the apparatus further comprises a combined-transaction constructing module and a transaction deleting module, wherein the combined-transaction constructing module serves to determine whether number of transactions initiated by an account satisfies a first predetermined condition, and if yes, execute a first lightening procedure on the transactions, and the transaction deleting module serves to execute a second lightening procedure on the transactions that have been processed by the first lightening procedure and now have validation references satisfying a second predetermined condition, after which the network broadcast module broadcasts the transactions obtained after the second lightening procedure. With the disclosed transaction-combining and reference-transaction-deleting scheme, data storage overheads of a graphic blockchain can be reduced.

One example method includes creating a source FS Merkle tree having a structure that matches a topology of a source FS, and a target FS Merkle tree having a structure that matches a topology of a target FS, receiving a change to the source FS, implementing the change in the source FS, updating the source FS Merkle tree to reflect the change, replicating the change to the target FS so that, with respect to the change, the target FS is synchronized with the source FS, updating the target FS Merkle tree to reflect the change to the target FS, and comparing the source FS Merkle tree to the target FS Merkle tree.

A method for implementing a relationship builder to relate data across multiple entities of a database system, comprising the steps of: providing a set of data sets across multiple entities in the database system, wherein an entity comprises a set of structured data or a set of semi-structured data; identifying a set of relationships across the set of datasets without any prior schema knowledge of the set of data sets; testing and discarding relationships et of relationships across the set of datasets that are detected as a negative; referring a set of remaining relationships which have not been discarded as a set of tested possible relationships; validating the set of tested possible relationships by applying an initial filtering algorithms to remove any false positives comprising a distilled relation; and determining a set of tested possible relationships as comprising a set of true relationships applying a set of graph algorithms.

A file directory tree structure of a selected storage snapshot is dynamically divided into different portions. A plurality of the different file directory tree structure portions are analyzed in parallel to identify any changes of the selected storage snapshot from a previous storage snapshot. To analyze each of the plurality of the different file directory tree structure portions, a processor is further configured to traverse and compare a corresponding file directory tree structure portion of the selected storage snapshot with a corresponding portion of a file directory tree structure of the previous storage snapshot while at least another one of the plurality of the different file directory tree structure portions of the selected storage snapshot is being analyzed in parallel.

A computer implemented method may include: storing key-value pairs in an index in persistent storage, where indirect nodes of the index include pointers, where each pointer identifies an index portion and includes a generation identifier for the identified index portion, where the index comprises a plurality of snapshots associated with a plurality of generations; receiving a request to read data of a particular snapshot of the index, wherein the particular snapshot is associated with a particular generation of the plurality of generations; in response to the request, performing a traversal starting from a particular root node associated with the particular generation; and providing the requested data based on the traversal.