Abstract: An improved binary search tree (BST) balancing facility balances BSTs by copying pointers to the nodes of a BST into a pointer list in accordance with a sequential order of respective data values of the nodes. The balancing facility then builds a balanced BST based on a first index to a first pointer of the pointer list and a second index to a last pointer of the pointer list. In an illustrative embodiment, the balanced BST is built by identifying a central pointer at a midpoint of the pointer list, a left range of pointers before the midpoint, and a right range of pointers after the midpoint. The central pointer is then interpreted as a pointer to a root node, and a balanced left subtree of the root node and a balanced right subtree of the root node are built based on the left range of pointers and the right range of pointers, respectively.

Abstract: The field of distributed authoring systems, and more particularly to the implementing of authoring controls within the authoring system. Moreover, there is provided a selection mechanism which employs control structures for dynamically selecting content and display components of an authoring system.

Abstract: A system and method for providing record-keeping in a gaming environment where money or scripts representing money are collected from a gaming area on a routine basis. Using a scanning device, information tags affixed to gaming machines and removable money boxes attached to the gaming machines are scanned for information regarding the identification of the gaming machines and money boxes. Data is transmitted to a database to be recorded and later assessed using a record-keeping program. Once all money boxes have been collected in a gaming area, the data can be assessed for anomalies by using a record-keeping program running on the server computer.

Abstract: The present invention relates to a communication unit and a communication method for communicating data in a communication system, with storage means (9) for storing a profile data base, said profile data base comprising parameter data describing attributes of the communication system, said parameter data being arranged in parameter sets respectively describing a collection of attributes, whereby the parameter sets are allocated to profile units so that each profile unit comprises at least one parameter set and one parameter set can be allocated to a plurality of profile units, and managing means (10) for managing said parameter data in said profile data base and for controlling a means (18) for reading and writing parameter data from and in said storage means (9). The present invention provides a flexible and efficient way to manage and retrieve profile data in communication systems.

Abstract: A method for retrieving digital patterns similar to a query pattern operates by generating representations of each digital pattern in terms of one or more color invariant properties; storing and organizing the patterns and their representations in a database; and searching the database by reference to the representations to identify and retrieve patterns similar to the query pattern. A preferred color invariant property is an edge property of the digital patterns. A web-based pattern registration and searching architecture enables on-line pattern search and selection utilizing a variety of pattern representations and similarity techniques, including the edge property based system described above.

Abstract: A structural element data management system which assures easy and accurate update of parts structure of a product and management of required parts in the producing and design department. The structural element data management system includes a structural element display for displaying a relationship between the desired product or parts and a structural element forming the product or parts, and a system parts relationship display for displaying a relationship between a plurality of products or parts of the same system and a plurality of structural elements.

Abstract: Methods for calculating total mass storage requirements for a relational database table including database storage requirements, application and software requirements, system table requirements, scratch and sort requirements, log file requirements, and growth requirements. One method utilizes detailed inputs for each table and table index. Another method produces and utilizes estimates for the database and index requirements for all tables together. Methods can use input parameters including the page size, a fill factor, the log file space, the temporary space, the operating system and application software space, the system database space, the growth percent space, and the page file space. Some methods also take into account inputs such as the number of table, the amount of data, the average number of columns per row, the average row size, the percent of variable length columns, and the average variable length column size per table.

Abstract: A method, apparatus, and article of manufacture for accessing a database management system. A database management system (DBMS), executed by a server computer, manages one or more datastores stored on the computer. The DBMS includes an Open Transaction Manager Access (OTMA) that provides a high level application programming interface (API) for an application program to access the DBMS and its datastores, wherein the OTMA allows the application program to create an authorized connection with the DBMS. The server computer also executes a TCP/IP OTMA Connection (TOC) that establishes and manages connections between the DBMS and the application program. In the preferred embodiment, the application comprises a Java servlet or applet executed by a Java Virtual Machine JVM).

Abstract: Using a novel methodology for organizing information both in non-persistent and persistent computer storage devices, limitations common to traditional data storage models are eliminated. The invention combines two distinct, yet complementary technologies, one for the organization of non-persistent storage and one for the organization of persistent storage. The invention allows records of unlimited dimensions containing data of any type and size, in any combination, to be constructed, maintained, and utilized in both non-persistent and persistent storage. In the persistent model, the invention also allows a user to define variable length frames, multiple hashing algorithms, and reuse of space caused by deleted records using an automatic gap consolidation algorithm.

Abstract: A garbage collector collects a train-managed heap in accordance with the train algorithm. In doing so, it concentrates into a respective train the heap-located objects that belong to garbage cycles even if those cycles additionally include certain types of objects that are outside the train-managed heap. It does so by using objects within the heap as proxies for those extra-heap objects, and it evacuates into a proxy object's train any collection-set objects referred to by the extra-heap objects for which the proxy object is a proxy. The objects in those garbage cycles containing the extra-heap objects can thereby be collected incrementally despite the extra-heap references to them.

Abstract: In an expeditious approach to transmitting updated data objects from one computing site to another, a transmitting site compares an updated data object with its previous version, and only includes the changed subparts in its transmission to the receiving site. The data object is therefore sent in a compacted state. The transmitting site also sends a map showing the changed subparts's relative positions within the entire data object. The receiving site retrieves a locally stored previous version of the data object, and combines the data object's unchanged subparts with the changed subparts recently sent by the transmitting site.

Abstract: A database system with improved query execution performance is described. In order to achieve as much accuracy as possible by optimizing large block I/O related query plans, the database system implements a methodology employing two new statistical measures for use in a database server. The first statistical measure, called “Data Page Cluster Ratio” (DPCR), indicates the “packing” of data pages by measuring the “clustering” property of the data pages, i.e., how well clustered the consecutive data pages of a given relational table are in the extents. The ratio is measured for data pages accesses either via a scan of an index or via a scan of the table. The second statistical measure, called Index Page Cluster Ratio (IPCR), indicates the “packing” of index leaf pages by measuring the “clustering” property of index pages, i.e., how well clustered the consecutive index leaf pages of a given relational table's index are in the extents.

Abstract: A method and apparatus are provided for converting a non-versioned schema to a version-enabled schema. The method includes reading a first set of table definitions that belong to the non-versioned schema. A second set of table definitions is generated for the version-enabled schema such that each table definition in the second set of table definitions corresponds to a table definition in the first set of table. Each table definition in the second set of table definitions includes columns that correspond to the columns of the corresponding table definition in the first set of table definitions and one or more additional columns for storing version information. Multiple versions of a particular object are stored within the table. In response to a request from a user to retrieve the particular object, a version of the particular object to present to the user is determined based on a workspace associated with the user.

Abstract: A method and apparatus are provided for accessing ancillary data, and for generating and accessing ancillary data more efficiently. Ancillary data is generated during execution of the operator routine of a primary operator. The ancillary data is stored in a shared content and may be accessed through ancillary operators associated with the primary operator. Metadata is used to define a primary operator and ancillary operators associated with the primary operator. A DBMS, for example, receives a statement that includes a primary and at least one of its ancillary operators, and executes routines that implement the primary operator and the ancillary operator. During execution of the routine the implements the primary operator, ancillary data is generated and stored in shared content. During the execution of the routine that implements the ancillary operator, the ancillary data is retrieved from the shared content and is used.