International Business Machines Corporation

Shih-Gong Li

Theodore J Shrader

Kenneth Ray Banning

David Yu Chang

Bruce A Tate

Wendy Sue James

Wen-Tzer Thomas Chen, Jr

John S Wang

Xiao Xi Liu

Song Song

Chun Ying

Li Wei

George P Erwin-Grotsky

Alejandra Sanchez-Frank

Anton Versteeg

Yao Fu Rong

Charles K Bucher

Hao Wang

A search facility having a user interface including three windows: a query window, a graph window and a history window. Each of the windows is presented simultaneously in the graphical user interface. The query window displays the text of the most recently input query statement which is searched in a database stored in a computer system. The graph window graphically displays the current results of the most recent query statement. The history window presents the query statements and their results during the current query session. In one preferred embodiment, the query statements and their results are graphically presented as a tree, wherein the query statements and query results are nodes and each query statement result is a child of the query statement which was run to create it. Input to any of the windows will change the presentation of data within the other two windows.

Database search facility having improved user interface

A method, system and program for distributing data to a first node in a parallel database system from a plurality of existing nodes. First, a minimal sufficient number of communication buffers necessary to guarantee that a table scan operation in each of the existing nodes will execute without stopping is determined. Once calculated, the minimal sufficient number of communication buffer is allocated in the memory associated with each of the existing nodes. Thus, data from each of the plurality of existing nodes to the first node can be redistributed without interruption. Unless the redistribution process has a default set of data to be redistributed, which data from which data tables in each of the plurality of existing nodes is to be distributed to the first node must be determined. The first node may either be a new node which must be registered within the parallel database system, or an existing node within an imbalanced parallel database system which has excess capacity. The minimal sufficient number of communication buffers is determined according to the ratio of a mean queuing in a communication buffer and an average time to fill a communication buffer.

Minimal sufficient buffer space for data redistribution in a parallel

A method and apparatus for monitoring the status of a computer network by displaying polygon-shaped objects (or 'icons') to represent groups of devices connected to the network. In a preferred embodiment each device (or 'node') on the network is assigned to one of a number of groups (or 'clusters'), each cluster is represented as a polygon-shaped object on a computer system display, and the number of sides for each polygon is displayed according to the size of the group represented. The appearance of the sides of each polygon may also help indicate the size of the group. A base value may be varied to partly govern the shape and appearance of the polygon.

Method and apparatus for displaying clusters on a computer network

A system and method for identifying class relationships in an object oriented system. An object oriented program in an object oriented source code language is parsed for the immediate class relationship data. The immediate class relationship data is stored in a relation data library. In response to a user query, a derive engine is employed to derive multiple level class relationship data from the immediate class relationship data. The multiple class relationship data is presented on a system display to the user. As the number of immediate class relationships captured by the parser will be overwhelmingly huge in the case of a huge object oriented system, the derivation step is preferably divided into two. In anticipation of the user query, the immediate relationship data for each class of object is preprocessed and stored in a facts library according to class and type of relationship. This facts library is traversed by the derive engine in response to the user query to derive the multiple level class relationship data.

Identifying multiple level class relationships in an object oriented

A technique for transferring a graphical object in a graphical user interface on a computer display from a source window to a target window. It is determined that a graphical object from the source window has entered the target window during a drag and drop operation. Next, it is determined that the graphical object has hit an interior boundary of the target window. The target window is scrolled so long as the graphical object continues to hit the interior boundary. Once the target location is visible in the target window, the graphical object is located at the target location at conclusion of the drag and drop operation. The invention contemplates a graphical user interface in which some target windows are scrollable during a drag and drop operation with a graphical object from a foreign window, while some windows are not. Thus, in a mixed graphical user interface, it must be determined whether the target window is scrollable during a drag and drop operation.

Scrolling a target window during a drag and drop operation

An apparatus for modifying a database query including apparatus for graphically displaying in at least two dimensions data obtained from a database by the database query, apparatus for selecting at least one portion of the graphically displayed data, and apparatus for modifying the database query according to the selected portion of the graphically displayed data. In addition, a method for modifying a database query including the steps of graphically displaying in at least two dimensions data obtained from a database by the database query, selecting at least one portion of the graphically displayed data, and modifying the database query according to the selected portion of the graphically displayed data.

Apparatus and method of modifying a database query

A method, system and program for displaying data in a panel with output fields which are insufficiently long to display some data. A panel with data in a plurality of output fields is displayed, in one preferred embodiment, the data is displayed in matrix form. A first data displayed in a truncated manner in a first output field insufficiently long to fully display the first data. If the first output field is selected, a first location on the display is determined at which a first floating output field sufficiently long to display the first data will not overlap any significant feature of the panel and the first floating output field is displayed at this location. An indicia is displayed in any output field to indicate that the data is displayed therein in a truncated manner. If subsequent output fields are selected containing truncated data, their floating output fields are located so that they do not overlap any previous floating output field. If subsequent locations can not be identified, the previous output fields can be repositioned. Alternatively, a permissible distance between a truncated output field and its floating output field can be increased.

Float to surface display

A method, system and program for providing a graphical interface for a database are accomplished by the operation of a process in the memory of a processor. A selected entry in the database is dynamically used as input to a conditional definition dialog box. The definition of individual conditions, the definition of the relationship of conditions to the selected entries, the editing of conditions, and the editing of the relationship of conditions is simplified and rendered dynamic and interactive for the user thereby facilitating the completion of the task being performed. The user need not remember the related column information for a specified predicate because the system will provide that information simultaneously with the conditional definition in a form that supports the direct manipulation of the related information. The selected entries and their relationship are displayed simultaneously with the definition activities for both the initial definition and any subsequent editing activities. The user may select this information and drag it to the desired location to proceed on the desired activity.

Method and apparatus for displaying a dialog box enabling user

A method, system and program for providing a graphical interface for a database are accomplished by the operation of a process in the memory of a processor. The definition of individual predicates, the definition of the relationship of predicates, the editing of predicates, and the editing of the relationship of predicates is simplified and rendered dynamic and interactive for the user thereby facilitating the completion of the task being performed. The user need not remember the related column information for a specified predicate because the system will provide that information simultaneously with the predicate definition in a form that supports the direct manipulation of the related information. The predicates and their relationship are displayed simultaneously with the definition activities for both the initial definition and any subsequent editing activities. The user may select this information and drag it to the desired location to proceed on the desired activity.

Method and apparatus for graphically displaying query relationships

A method, system and program for determining a set of tables from which data can be redistributed between nodes in a parallel database. First, a list of candidate tables from those stored in the memories associated with a plurality of nodes in the parallel database is established. The list is ordered according a workload of each of the candidate tables. Next, each of the candidate tables is tested to determine whether it can be scanned at each of the plurality of nodes at which the candidate table is stored within a predetermined time period. Any candidate table which can be scanned within the predetermined time period is added to the set of tables from which data can be redistributed. Once the set of tables for redistribution are established, data sets, or buckets, within the redistribution tables are selected. The selected buckets are redistributed from the plurality of nodes to a receiving node. The receiving node is a new node to the parallel database system or an underutilized node in the parallel database system.

Selecting buckets for redistributing data between nodes in a parallel

In response to user input from a computer pointing device such as a track ball, activation of an icon causes at least one pair of adjacent opposing scroll icons such as arrows to be dynamically created on opposing ends of a display screen. Subsequent selection of either of the arrows causes scrolling of contents of a window in a corresponding respective one of a pair of opposing directions. Required conventional pointing device movement is minimized when alternate scrolling in opposing directions is desired due to the dynamically created arrows being adjacent, whereby conventional traversal of a cursor over large display screen distances between opposing non-adjacent arrows is thereby avoided. In an alternate embodiment, space-apart scroll icons point in opposing directions, whereby activating either arrow dynamically creates an adjacent opposing arrow, thereby completing the arrow pair necessary to scroll in either direction.

User interface system and method for creating and removing a scrolling

Identifying and analyzing multiple level class relationships in an

A method, system and program for determining which data stored in the nodes in a parallel database to redistribute to a receiving node. First, an average workload for the nodes within the parallel database is calculated based on the total workload divided by the number of existing and new nodes. Next, a set of transmitting nodes is established each of which has a workload which exceeds the average workload. A set of data structures which when redistributed from the transmitting node to the receiving node will lower the transmitting node workload to equal or slightly greater than the average workload is selected. Finally, the set of data structures is redistributed from the transmitting node to the receiving node.

Growing community of inventors

Austin, TX, United States of America

Shih-Gong Li