International Business Machines Corporation

Danny L Yeh

Mark Richard Nutter

Ching-Yung Lin

Toyotaro Suzumura

Ilie G Tanase

Jason L Crawford

Jie Lu

Chun-Fu Chen

Paul Christesten Castro

Apratim Purakayastha

Ravindranath Konuru

Frederique Anne Giraud

James Thomas Rayfield

Avraham Leff

Norman Howard Cohen

Luke Wong

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.

Distributed graph databases that facilitate streaming data insertion and queries by efficient throughput edge addition

Distributed graph databases that facilitate streaming data insertion and queries by reducing number of messages required to add a new edge by employing asynchronous communication

Distributed graph databases that facilitate streaming data insertion and low latency graph queries

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.

Method and apparatus for testing software

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.

Method and system for addressing a node in tree-like data structure

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.

Method and system for model-based replication of data

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.

Method and system combining state replication and operational-replay synchronization

A method, system, and apparatus for handing-off data receivers in a broadcast-based data dissemination environment. Data receiver hand-off is carried out between data sources in different data cells broadcasting information of the same category. Furthermore, data cell ranges are based on geographic regions rather than signal strength coverage. Generally, the hand-off process involves acquiring the current receiver location of the data receiver and comparing the receiver location with a current data cell range. If the current receiver location is outside the current data cell range, a hand-off controller searches for a new data source encompassing the current receiver location coordinates and having an associated data topic matching the current topic. Once a new data source is found, the hand-off controller subscribes the data receiver to the new data source.

Data source hand-off in a broadcast-based data dissemination environment

Growing community of inventors

Tarrytown, NY, United States of America

Danny L Yeh