Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: A system and methods are provided for identifying conversations in tweet streams. A method includes grouping tweet messages in the tweet streams into tweet groups, responsive to hashtags therefor and time intervals in which the tweet message were sent. The method further includes splitting the tweet groups into subgroups responsive to secondary hashtags and a time separation between the tweets messages. The method also includes clustering any of the subgroups into a respective same conversation responsive to word occurrences, word frequencies, and account holders. The method additionally includes merging any of the subgroups having different hashtags into the respective same conversation responsive to overlapping glossary and account lists. Each of the tweet groups and each of the subgroups correspond to a respective different one of the conversations when unable to be split, clustered, or merged.

Abstract: A system and methods are provided for identifying conversations in tweet streams. A method includes grouping tweet messages in the tweet streams into tweet groups, responsive to hashtags therefor and time intervals in which the tweet message were sent. The method further includes splitting the tweet groups into subgroups responsive to secondary hashtags and a time separation between the tweets messages. The method also includes clustering any of the subgroups into a respective same conversation responsive to word occurrences, word frequencies, and account holders. The method additionally includes merging any of the subgroups having different hashtags into the respective same conversation responsive to overlapping glossary and account lists. Each of the tweet groups and each of the subgroups correspond to a respective different one of the conversations when unable to be split, clustered, or merged.

Abstract: Techniques are provided for testing new software slated to be deployed on a target machine population with a number of target machines having a number of existing software programs. Method steps can include obtaining a list of depending software programs on selected ones of the target machines. The list can include those of the existing software programs which depend on the new software and/or those of the existing software programs on which the new software depends. The steps can further include identifying relevant test cases based on the list of depending software programs, instantiating a plurality of test client platforms characteristic of the target machine population, and testing the relevant test cases on the plurality of test client platforms to identify failures.

Abstract: A system and method for addressing a node in a tree-like data structure evaluates a relative path expression of a node from one or more marker nodes. In one aspect, a single path expression is determined from a nearby marker node. In another aspect, multiple path expression are determined and resolved to a single path expression. In yet another aspect, the method and system of the present disclosure assign unique identifiers to a subset of nodes in the tree data structure.

Abstract: Techniques for replicating data in a system having a data tier with a plurality of data sources and an application tier with a plurality of applications are provided. Such techniques can include creating an instance of an information model of the data that is specified by a schema. The model can be created in a form that is suitable for manipulation by at least one of the applications and that forms at least a portion of a model tier that is intermediate the data tier and the application tier. A replica of an instance of the information model can be created in a form suitable for remote transmission, and a consistency policy can be obtained that specifies a level of consistency required between the instance of the information model and the replica.

Abstract: A system, method and computer program product for synchronizing replicas of shared data structures associated with one or more computer systems. The method comprises: evaluating a metric for performing a replica synchronization operation on a first computer system according to a first synchronization method; evaluating the metric for performing a replica synchronization operation on the first computer system according to a second synchronization method; and, selecting, at synchronization time, based on the evaluated metric, whether to use the first or second synchronization methods, and communicating a command to a second computer system to replicate a shared data structure based on the selected synchronization method.

Abstract: Techniques for replicating data in a system having a data tier with a plurality of data sources and an application tier with a plurality of applications are provided. Such techniques can include creating an instance of an information model of the data that is specified by a schema. The model can be created in a form that is suitable for manipulation by at least one of the applications and that forms at least a portion of a model tier that is intermediate the data tier and the application tier. A replica of an instance of the information model can be created in a form suitable for remote transmission, and a consistency policy can be obtained that specifies a level of consistency required between the instance of the information model and the replica.

Abstract: Techniques for replicating data in a system having a data tier with a plurality of data sources and an application tier with a plurality of applications are provided. Such techniques can include creating an instance of an information model of the data that is specified by a schema. The model can be created in a form that is suitable for manipulation by at least one of the applications and that forms at least a portion of a model tier that is intermediate the data tier and the application tier. A replica of an instance of the information model can be created in a form suitable for remote transmission, and a consistency policy can be obtained that specifies a level of consistency required between the instance of the information model and the replica.