Abstract: An automatic data reference system and method responds to a query for a data item by determining whether a match can be found between the query dimensions and the dimensions of one of a number of data tables stored in the database for queries which constitute an exact match for an existing data table, as well as those queries which are underdefined, overdefined or require relational joining or linking of two or more data tables.
Type:
Grant
Filed:
August 7, 1991
Date of Patent:
March 22, 1994
Assignee:
Occam Research Corporation
Inventors:
George W. Potts, Sr., Mark Zand, Terrence P. Higgins
Abstract: A distributed database system comprises a plurality of sites having a computer and a database, and interconnected by communication lines. In each computer, a transaction execution section executes data processing of transaction by accessing the database, according to a transaction generated by a transaction generation section or a transaction sent by another site. A list creation section creates a list of the sites which participate in the transaction generated by the transaction generation section, and sends the list to all other sites participating in the transaction. A commit preparation process section prepares the commit processing of the transaction when the transaction execution section has finished executing the data processing of the transaction and sends a commit preparation completion message to all participation sites.
Abstract: Method and apparatus for providing a universal addressing plan for a network of voice store-and-forward messaging system sites wherein a telephone numbering plan for a telephone network can be mirrored among the sites in the network, notwithstanding whether the sites utilize the public switched network or on a private network.
Type:
Grant
Filed:
April 2, 1991
Date of Patent:
February 15, 1994
Assignee:
Rolm Company
Inventors:
Roberto Perelman, Chris Yuan, Bipin Patel, Jack J. Ahn, Mark E. Kaminsky
Abstract: A queue manager for controlling the execution of requests for the transport of messages from users to destinations. Each request includes a message and an identification of a destination. The queue manager includes a queue for storing pending requests and a dispatcher task for creating a worker task to execute each request and provides a method for adapting the execution of requests to constraints and characteristics of destinations and communications links.
Abstract: A single entity contains source lines, being operated on by one or more end users. Within the same entity are entity version and level control data. Individual source lines contain version-related identification variables. After each version or level update by a user, a comparison is made between new and old versions; source line identification variables are modified, and new source lines are added; dependent version information is stored in the entity, and control data is updated. Subsequent retrievals of a version are responsive to the dependent version information, and produce indications of any changes that had been made to dependent versions.
Abstract: A system for inserting code markers for observing indications (external to the microprocessor upon which the software operates) of the occurrence of an event in the execution of the software. Additional instructions or markers are added to the software to be debugged to produce simple, encoded, memory references to otherwise unused memory or I/O locations that will always be visible to a logic analyzer as bus cycles. Although the code markers cause a minimal intrusion in the underlying software, they make tracing events by a conventional logic analyzer much simpler and allow for performance evaluations in manners not heretofore possible. In particular, the inserted code markers provide a method of dynamically extracting information from a running software system under test using simple low intrusion print statements, encoded I/O writes on procedure entries and exits and the like.
Abstract: A multi-step method enables a user to extract useful information from a complex relational database without needing to construct elaborate Structured Query Language statements or to become familiar with details of the particular data model involved. In particular, the method generates a table of output data from a relational database having one or more database tables made up of columns of attributes, rows instances, and one or more keys composed of one or more attributes each as elements.
Abstract: Identification of a target object within an object hierarchy is made in response to user selection. The prior attribute values for the target object are then displayed on a display device. Upon user selection, new object attribute values are generated for the target object. A propagation group for the new object attribute values is made in response to user designation of relating factors and the new object attribute values are applied to all objects within the related group.
Type:
Grant
Filed:
October 3, 1991
Date of Patent:
August 31, 1993
Assignee:
International Business Machines Corporation