Abstract: Many web applications require access to a relational database. The requirements of such web applications are different from conventional applications that access a database. Web applications need to have selective recoverability and need to have support for different transaction structures, other than the flat transaction structure of conventional database applications, including nested and chained transactions. To achieve this, an interface between the application and database has the following functional features: 1) the interface to the database is connection oriented, i.e., the connection is retained across several invocations of the application; 2) the backend of the interface is long living, i.e., it exists across multiple invocations; 3) state information about a session in progress is maintained, and more specifically, it is distributed between the backend of the interface and the hidden fields of the HTML output document.

Abstract: The present invention provides a tool with which a DBA can analyze a VLDB at all levels of data storage, both logical and physical, to analyze performance problems. The invention is particularly applicable to systems in which database files are striped over multiple disk drives. In the present invention, storage of information is monitored at three levels: database files, file system files, and individual disk drives Parameters indicating the activity and performance level of each of the levels of storage are taken at selected intervals and stored. An analysis tool is provided that allows a DBA to select a time window during which the database performance is be assessed. The analysis tool has a map of the logical and physical arrangement of the database being monitored and allows a DBA to move from level to level of both logical and physical structures involved in storing the data while displaying I/O activity in an easily understood manner.

Abstract: An approach for managing a manufacturing process is provided. A specification and recipe management system (RSMS) manages the validation of new specifications that reference one or more recipes and one or more contexts stored in a recipe management system (RMS). The validation of new specifications includes verifying that RMS code blocks contained in the new specification can be processed by the RMS. Also, the versions of recipes and contexts referenced in the specification are checked to ensure that they are either the current, valid version number or a valid new version number. The RSMS provides a specification browser for examining cross-reference information for specifications, recipes and contexts. The cross-reference information specifies recipes and contexts referenced in a selected specification, subject to a recipe/context filter. In addition, the cross-reference information identifies specifications that reference a selected recipe or a selected context, subject to a specification filter.

Abstract: A relational data base management system that stores and retrieves large data objects (LOBs) from data base storage includes a data manager that maintains LOB data space allocation according to the buddy system with two types of allocation pages, called regular buddy space (RBS) pages and super buddy space (SBS) pages. The RBS pages control buddy spaces comprising equal-size areas of the LOB data space in which LOB buddy segments are stored. The SBS pages control the RBS pages. The RBS pages include a pointer array that contains the forward-most location of where searching for a free storage space should begin and a counter array that indicates the number of free buddy segments in a buddy space for a particular buddy segment size. The SBS pages include analogous pointer and counter arrays that refer to the RBS pages and indicate the location and extent of free storage space, and also include a divided-space array and an SBS page directory.

Abstract: One aspect of the invention is a method for maintaining persistence in a shared object system. A request is received to update a persistent record of a shared object's state wherein the persistent record of the shared object's state is contained in a database. At least one SQL statement is dynamically generated in response to the request. That statement is generated using a data structure comprising data reflecting at least a portion of the state of the shared object and a map associating attributes to the shared object with the location of those attributes in the database. An SQL statement is then sent to the database.

Abstract: The invention provides a method and system for presenting infromation in a web document using a program applet to restrict further copying or redistribution. The web document includes a first region in which a graphical element or other information is displayed, and a second region covering the first region in which a program applet is invoked by a server for the web document. The program applet is dynamically created upon access, and assigned a serial number. The program applet contacts the server for permission to display the graphical element or other information; thus, the server can control, by granting or denying permission, when and if the program applet displays the graphical or other information.

Abstract: An electronic catalog requisition system includes software for efficiently selecting items from a database. The software accepts search terms from a user, and then executes a sequence of search strategies on the database which may include a proximity search, a word count search, and a fuzzy logic search. The sequence is terminated when a search algorithm has uncovered at least one match. Each database entry has a corresponding product category. A list of categories from each of the matching products is dynamically compiled and displayed to the user. The user can page through the list of displayed matches, or alternatively can create a subset of the list by selecting only the items within one of the categories. In addition, the user can further refine the list of items by selecting those items having a particular attribute. The software can also maintain a list of synonyms for attributes as an aid for finding appropriate matches within the database.

Abstract: A new file system partition is added to an existing partition in disk storage space by creating a new file in the existing storage space of the existing partition and giving this file the attributes of a partition. This new file having partition attributes is referred to as a "raw file." Apparatus in a computing system for creating and accessing a raw file would comprise a storage system controller for creating a raw file of a predetermined size with the attributes of a partition, a storage space driver for accessing storage space in a data storage system and a storage access control for translating an access request for a raw file to an actual address for the raw file so the storage space driver can access the raw file based on the actual address for the raw file.

Abstract: A method for managing the production of vehicle electrical schematics includes entering into a computer manual changes to preexisting schematics and to textual connector pages that pertain to the schematics. A computer program then reconciles the textual pages with the schematics, combines them, and then outputs a new version of the schematics with connector pages.

Abstract: The preferred embodiment of the present invention provides a method and apparatus for storing and accessing data. The preferred embodiment hybrid tree-array database provides the ability to perform fast searching using tree database search techniques and the ability to search all user data fields using array search techniques. In particular, fast key searching as a typical tree database and sequential array searching of all data fields as a typical array database are provided in a single database, without requiring the user data be duplicated and stored in two separate databases. Thus, the preferred embodiment provides searching flexibility without the excessive storage requirements and complexity inherent in managing separate array and tree databases. The preferred embodiment also provides the advantage of allowing individual users of the database to search the data using either tree or array search techniques without requiring any detailed knowledge of the dual nature of the hybrid tree-array database.

Abstract: According to a preferred embodiment of the present invention, a method and apparatus for quickly and easily retrieving, manipulating and analyzing large quantities of computer-based data relevant to television-viewing consumers is disclosed. The most preferred embodiment of the present invention is a computer-based decision support system that includes three main components: a data conversion mechanism; a database mining engine (DME) in conjunction with a customized database; and a customized user interface that provides access to the various features associated with the system. In addition, the various preferred embodiments of the present invention are available for use with any standard personal computer, making the system available to a much larger group of decision-making executives than ever before possible. The user interface, in conjunction with the DME, provides a unique and innovative way to store, retrieve and manipulate data.

Abstract: A system and method for search and retrieval of electronic objects, the objects including electronically encoded information. The system and method use an electronic lexicon which is configured to provide predefined search elements that are designed to identify objects relevant to a specific community. Format filter modules identify a format of an electronic object to be searched and enable the search using the search elements within the lexicon.

Abstract: In a database data processing system, input search data is matched against an index of a database to determine database records which either closely or exactly match the input search data. The input search data is broken down into elements, and elements are converted to terms having a finite set of possible values. The Soundex function may be used to convert elements to terms. The terms are compared against an index of terms to determine which database records relate to the input search data. Through statistical analysis, match records are given a record weight which may be used to calculate how closely the input data actually is to each match record. The invention provides a fast and efficient way of accurately searching for data in extremely large databases, while not requiring precise input search data entry. The invention may also be used to compare or supplement one database against another.

Abstract: A system and method for determining the minimum and/or maximum values from a number of sample parameter values utilizes a table of last occurrence (TOLO-table), together with a sliding window or filter, to greatly enhance the speed and efficiency when determining the minimum and/or maximum value from a number of sample parameter values that fall within the sliding window. The TOLO-table typically includes a parameter column for storing entries for each one of a limited number of discrete parameter values, and also includes a time stamp column which provides entries for storing time of receipt data associated with each parameter value defined in the parameter column. Alternatively, an order number column may be employed for storing number order entries corresponding to the order in which the parameter values are received. Every time a parameter value is received, the time stamp or order number entry associated with the parameter value is updated to the current time or order number.

Abstract: A computer system having a shared disk file system running on on multiple computers each having their own instance of an operating system and being coupled for parallel data sharing access to files residing on network attached shared disks. Methods are provided for use as a parallel file system in a shared disk environment by use of a scalable directory service for the system with a stable cursor, a segmented allocation map. Dynamic prefetch and cached balance pools for multiple accesses improve the system. Extended file attributes are used for implementation of Access Control Lists in a parallel file system. Improvements to caching and cache performance developments balance pools for multiple accesses. A metadata node manages file metadata for parallel read and write actions.

Abstract: A self monitoring system that identifies optimum summary table(s) for use by a database management system, and that automatically creates or deletes summary tables based on selected summary table recommendations.

Abstract: A method and system for representing hierarchical time-based data structures and to extract information therefrom comprises means to create a container, the container having one or more layers within which data elements are arranged along the container axis and to examine the container to produce virtual static graphs which represent active data elements and their interconnections within time durations represented within the container. The data elements in the container can change between active and inactive states with time and the connections between data elements can also change with time and the container represents this information. A set of constraints is defined for the container such that interconnections between data elements only occur between data elements in different layers. Specifically, a data element can only receive input from one or more other data elements which are in lower levels and a data element can only provide output to one or more data elements which are in higher levels.

Abstract: A method of constructing a multi-lingual database includes the step of defining metadata to describe fields of a record as being either language-dependent or language-independent. The fields of the record are so described by flagging descriptions of columns associated with the fields in the metadata. A composite table, including a parent table and a child table, is then automatically generated. The parent table includes columns for the language-independent fields of the record, while the child table includes columns for the language-dependent fields of the record.

Abstract: A universal personal telecommunications service includes the steps of receiving, at a home service switching point, a telephone number entered by a caller, sending a query to the service control point coupled to the service switching point, which verifies the received telephone number as a personal telecommunications number assigned to a service subscriber. The telephone number is then translated by the service control point to a current destination number by consulting routing data indicative of a current location of the service subscriber, the routing data including follow-me diversion data and time dependent routing data. The call is then completed to the current destination number of the service subscriber.

Abstract: A computer network system and technique enables linked files, such as those that are physically distinct but data dependent, to be simultaneously accessed. Elements, whether they are realized in hardware or software, are located in both the servers and the clients in a network. A remote data server (RDS) element in a server receives coupled file access (CFA) requests from clients. A corresponding element at the client includes the names of the linked files, a file access priority, and a file access communication timeout in the CFA request. The RDS element, upon accepting a CFA request, initializes a CFA thread. A CFA thread maps the requested files into virtual memory. The server, through the CFA thread, can then proceed to provide the requisite access from the virtual-memory-mapped images. Other elements within the network can therefore access the same files from the same or another virtual memory mapping. The coupled file accessing prevents mismatches of linked files.