Abstract: Techniques are disclosed to provide guided natural language interactions with a connected data system, such as a graph database. In various embodiments, natural language input associated with a graph database query associated with a graph data set is received. The natural language input is processed to generate a set of candidate strings. At least a subset of the candidate strings is mapped to an entity in the graph data set. The entity and data comprising the graph data are used set to determine a candidate graph pattern associated with the graph database query. The candidate graph pattern is used to guide a user associated with the natural language input to refine the graph database query.

Abstract: Techniques are disclosed to provide guided natural language interactions with a connected data system, such as a graph database. In various embodiments, natural language input associated with a graph database query associated with a graph data set is received. The natural language input is processed to generate a set of candidate strings. At least a subset of the candidate strings is mapped to an entity in the graph data set. The entity and data comprising the graph data are used set to determine a candidate graph pattern associated with the graph database query. The candidate graph pattern is used to guide a user associated with the natural language input to refine the graph database query.

Abstract: Techniques are disclosed to provide guided natural language interactions with a connected data system, such as a graph database. In various embodiments, natural language input associated with a graph database query associated with a graph data set is received. The natural language input is processed to generate a set of candidate strings. At least a subset of the candidate strings is mapped to an entity in the graph data set. The entity and data comprising the graph data are used set to determine a candidate graph pattern associated with the graph database query. The candidate graph pattern is used to guide a user associated with the natural language input to refine the graph database query.

Abstract: Methods of conducting database transactions. One such method comprises receiving data to be written to a database; identifying a set of shard replicas corresponding to the database to which the data is to be written; transmitting, to each of the replicas in the set, a request to write the data thereto; receiving votes back from the replicas in the set, each vote representing whether the respective replica commits to a writing of the data thereto; determining whether to commit to the writing of the data to the database according to whether a majority of the replicas of every shard having replicas in the set has transmitted a vote committing to the writing of the data thereto; and transmitting an outcome of the determining to each of the replicas in the set.

Abstract: A method and apparatus for partitioning a graph database that includes nodes connected to one another is presented. The method entails determining a node type indicating a type of node that is to be used as mapped nodes, and upon receiving a new node, placing the new node in a partition according to one or more property values associated with the new node if it is a mapped node, and placing the new node in a partition according to its connections to other nodes if it is not a mapped node. The apparatus includes modules containing computer-executable instructions to perform the above method.

Abstract: Methods of conducting database transactions. One such method comprises receiving data to be written to a database; identifying a set of shard replicas corresponding to the database to which the data is to be written; transmitting, to each of the replicas in the set, a request to write the data thereto; receiving votes back from the replicas in the set, each vote representing whether the respective replica commits to a writing of the data thereto; determining whether to commit to the writing of the data to the database according to whether a majority of the replicas of every shard having replicas in the set has transmitted a vote committing to the writing of the data thereto; and transmitting an outcome of the determining to each of the replicas in the set.

Abstract: A method and apparatus for partitioning a graph database that includes nodes connected to one another is presented. The method entails determining a node type indicating a type of node that is to be used as mapped nodes, and upon receiving a new node, placing the new node in a partition according to one or more property values associated with the new node if it is a mapped node, and placing the new node in a partition according to its connections to other nodes if it is not a mapped node. The apparatus includes modules containing computer-executable instructions to perform the above method.