Abstract: A causality detection apparatus for detecting causality of events based upon a database provided with log of the events includes a sorter module for generating an event list by sorting in time sequence the events, and a frequency analysis module for calculating, based upon the event list, the number of appearance of an event set pair <X,Y> of a first event set X(={e.sub.x1,e.sub.x2, . . . ,e.sub.xn, . . . }, e.sub.xn indicates an event and n is a natural number) and a second event set Y(={e.sub.y1,e.sub.y2, . . . ,e.sub.yn, . . . }, e.sub.yn indicates an event), the number of appearance of the first event set X and the number of appearance of the second event set Y. The event set pair <X,Y> has co-occurrence so that the second event set Y occurs within a predetermined time period (window size W) after a time of occurrence of the first event set X.

Abstract: Methods and associated apparatus for coordinating file lock requests from a cluster of attached host computer systems within I/O controllers (e.g., intelligent I/O adapters) attached to a storage subsystem. The I/O controllers, operable in accordance with the methods of the present invention, includes semaphore tables used to provide temporary exclusive access to an identified portion of an identified file. The host systems request the temporary exclusive access of a file through the I/O controllers rather than over slower network communication media and protocols as is known in the art. The I/O controllers then manages a plurality of competing lock requests to provide mutual exclusivity of the file access. The file lock management is therefore managed over the higher bandwidth storage interface channels of the host systems and without the generalized network protocols burdening the lock management process and the host system CPUs.

Abstract: Representative item information concerning an item name represented on a form, parts control information for controlling a part or input/output area forming a display screen for inputting data to a database, and data attribute information including field name and data type referred to in defining a table in the database, are created for each item name beforehand. In accordance with an input from a user for image information of the form inputted beforehand, there is generated link information which includes positional information for distinguishing a position on the image information and sub referential information for distinguishing a field of the database. On the parts control information, a part is displayed on the image information displayed on a display device. A table of the database is defined on the basis of the data attribute information.

Abstract: A framework for a query compiler and run-time environment for resolving a table reference to a dynamic table that is first identified at run-time but is initially unknown at compile-time. A parser parses the table reference and creates a parsed representation for the table that identifies the type of dynamic table. A code generator creates executable plans containing run-time table object representations (TAOB), from the parsed representations, that contain the type of dynamic table. The TAOB is also extended to provide for parameters that are definable at run-time, including a table ID of the actual table entity being referenced. A routine is embedded in a run-time routine that checks the type of dynamic table in the TAOB and dispatches control to one of a plurality of corresponding routines, depending upon the type of dynamic table. The corresponding routines use the extended TAOB to dynamically link the table reference to the dynamic table, depending upon the type of dynamic table.

Abstract: A computer server that stores a HTML document, receives a request via a global network from a user for the document and sends the document to the user. The computer server uses a state machine to examine the request to determine a current state status of the request and compares it to the required state status for accessing the document stored in a state transition model. If the current status fulfills the required status, then access to the document is granted. If the required status is not fulfilled, then the server sends an error message to the user denying access to the document. Thus, the server imposes a structured, hierarchical format onto a freeform hypertext links of HTML documents by restricting movement between the links to legal transitions.

Abstract: A method of creating signal message common files for a mobile switching center which is capable of simplifying a process and effectively and directly creating a signal message common file is disclosed.

Abstract: Firewall host systems (26), (28) and (30) interface between private networks (14), (16), (18) and a public network (12). The firewall host systems (26), (28) and (30) manage alias databases (21), (25) and (29). The firewall host system (26) communicates updates to its alias database (21) to the firewall host system (28) which redistributes the updates the fireball host system (30). The firewall host system (30) then reinitializes its alias database (29) using the information received from the firewall host system (26) through the firewall host system (28). In addition, each of the firewall host systems (26), (28) and (30) provide a graphical user interface (66) which allows for the proactive maintenance of mail message queues through the provision of a mail message queue display area (68) and a command area (70) and a search area (74).

Abstract: The performance of a heterogeneous, distributed database system is optimized by supporting both block fetch operations and positioned update operations. Specifically, a data block is fetched from a target database management system (DBMS), and a positioned update instruction issued by a client is processed. The positioned update instruction, when executed by the target DBMS, enables the target DBMS to modify a row contained in the data block and addressed by a cursor as the cursor is perceived by the client. Also, performance of the database system is optimized by identifying database statements that reference invariant host variables, and modifying such database statements by replacing in the database statements the host variables with literal values equivalent to the host variables.

Abstract: A spreadsheet application includes functions and data structures for transforming real time data items individually received over time from a real time data source into time series data globally available within the spreadsheet environment. The spreadsheet application includes a tape function operating in conjunction with a plurality of tape data structures, to store real time data items received over individually over time from a real time data source into one of the tape data structures, thereby persistently storing a set of previously received real time data items in a manner that is accessible to other functions of the spreadsheet.

Abstract: A method for performing a range max/min query in a database, in which the data is represented as a multi-dimensional data cube, is disclosed. The method comprises the steps of: partitioning the data cube into multi-level multi-dimensional blocks which are represented by a tree structure; determining the index to the maximum or minimum value for each block; generating a range max/min result from the values of the cells selected from the cells in the query region Q, and the cells referenced by the indexes at the nodes corresponding to the cells in the query region Q, using the tree structure and determined cell indexes. A branch-and-bound method is used to repeatedly reduce the size of the query region from a cell within the region, based on sub-trees whose roots are cells in the region. To further improve the method performance, one or more reference arrays may also be used to quickly traverse the tree in determining the max/min cell indexes.

Abstract: A computer system and method for accessing an altered database architecture using existing code. The present invention transforms information which is stored in a new format in a database such that it appears to existing code to be stored in an old format. In so doing, existing code which was originally designed to access the information stored in the old format is able to access the information stored in the new format. Thus, the present invention allows a user to access information contained within an altered database architecture using existing code.

Abstract: A sorting algorithm is applied to an array data structure to arrange array elements according to the predicted frequency by which those array elements are likely to be modified. Higher modification frequency array elements are arranged proximate the end of the array to minimize the number of array elements that will typically need to be updated in response to modification of these array elements, reserving the modifications that require more array elements to be updated to those array elements that have a lower likelihood of modification. A sorting algorithm suitable for use in memory compression arranges blocks for a given page in reverse order since data located proximate the beginning of a page has a higher probability of being modified than the data proximate the end of the page.

Abstract: A system and method for balancing database transaction request distribution between various hosts in a multiprocessor transaction processing system is provided. The transaction processing system includes a database and multiple host processors each coupled to at least one database transaction request unit. Database transaction requests sent from the host processors are collectively entered into a commonly-accessible load balancing queue. Each database transaction request is accompanied by a source identifier that identifies the database transaction request unit which initiated the corresponding database transaction request. The queued database transaction requests from the load balancing queue are processed by currently-available host processors, regardless of which host processor initiated the database transaction request.

Abstract: A method, apparatus, and article of manufacture which provides for the display of database management information on a computer in a user-friendly way to minimize errors and maximize database usership. The invention displays a window in a graphical user interface on a computer display. The window allows the user to enter database tables, fields, and database commands selected from a displayed menu. The window also displays a natural language translation of the current status of the database command, allowing the user to see, in real time, the scope of the request and the databases affected.

Abstract: A file retrieval apparatus and method for retrieving a desired file out of a plurality of files stored in a storage medium. Retrieval is made based on the files, information on correspondence between the files and keywords, and attribute information of the keywords, to find a file that corresponds to an input keyword. When displaying the retrieved results in form of a list, a file a user most desires is displayed at the top of the list, and keywords located at lower levels of hierarchical keywords are also displayed as retrieval objects.

Abstract: A computer system provides expanded clipboard formats that embellish the number of formats that may be used with a clipboard. These expanded clipboard formats enable users in applications to broaden their use of the clipboard and other data transfer mechanisms. The clipboard formats may be utilized by a conventional clipboard, by drag-and-drop mechanisms and by OLE data transfer mechanisms. Certain of the expanded clipboard formats are adapted for use in the data transfer of non-file system objects.

Abstract: A program product is described in which a class library is provided to permit object oriented applications flexibly to access and to manipulate, in accordance with the object model, nontraditional data values of a relational table. Nontraditional datatypes of a relational table include multimedia and large object datatypes. The data is manipulable by virtue of extended data objects that each represent particular cells of a relational table, and that inherit type-specific behaviors from the class library.

Abstract: A list of indexes, from which indexes are selected for an index access path, is sorted by number of columns upon which each index is built. From the sorted list of indexes, a set of index access methods is generated in a heuristically ordered set of passes from a given WHERE clause. The index access methods that comprise the index access path are selected from the set of index access methods according to a cost/benefit analysis.

Abstract: A method and product are provided for generating a word set for use in locating a document having a type similar to a type of document in a document collection. The method includes selecting multiple documents from the document collection, each document selected including multiple words, and stemming the words in each document selected to obtain multiple stem words. The method also includes determining a word count for each stem word in each document, and clustering the stem words based on the word count of each stem word in each document to obtain a word set. The product includes a storage medium having programmed instructions recorded thereon for performing the method steps.

Abstract: System and methods are described for improved sorting of information records. The system provides radix sorting on native data types--that is, without the resource-expensive approach of converting data types into character representations. A correct interpretation of a group of bits under examination is provided by the system at the point of examination by a radixsort engine. "Sort plan" information is provided to the radixsort engine instructing it how a particular set of bits should be interpreted for purposes of comparison. The knowledge includes a "comparison type" for a set of bits under exam. This is employed by the engine to determine an appropriate "weighting" of each group of bits--how each group should be treated at the point of comparison. The engine itself operates generically: it simply operates on the set of bits as specified by the sort plan entries, regardless of the particular data types which comprise the bits or the one or more keys from which the bits are derived.