Abstract: A method and system are provided for handling within a database system data items that are associated with data types that are not supported by the database language used to the database system. The data types are registered with the database system by storing, in the database, metadata that indicates the structure, physical layout, and constraints that apply to the data types. The database system uses the structure and physical layout information to access individual elements of data items. The database system validates data items using the constraint information, which includes constraints that dictate what values are valid for certain elements based on what values are supplied for other elements. Data items associated with many different data types may be stored in the same table. Applications can access the data items through a transformation view that transforms the data items from their native format to a format expected by the applications.

Abstract: A system for conducting research on the Internet accesses a pre-selected web site on a computer network through a host site and provides a view of a page from the web site on a computer monitor in an environment downloaded at least in part from the host within which data can be clipped from the view and saved to a file, along with site-specific reference data, which includes, for example the site name, author, and URL. A human-perceptible document can be produced from the clipped data and the data can be edited.

Abstract: A method and system are provided for reconfiguring a multiple node system after an epoch change in a manner that reduces the overhead and system unavailability typically incurred during reconfiguration. A resource-to-master mapping is established using the combination of a resource-to-bucket hash function and a bucket-to-node hash function. The resource-to-bucket hash function is not changed in response to an epoch change. The bucket-to-node hash function does change in response to epoch changes. Techniques are disclosed for adjusting the dynamic bucket-to-node hash function after an epoch change in a manner that load balances among the new number of nodes in the system. Further, the changes to the bucket-to-node assignments are performed in a way that reduces the number of resources that have to be remastered. In one embodiment, only those resources that lose their masters during an epoch change are assigned new masters during an initial reconfiguration.

Abstract: An information retrieval system processes user input queries, and identifies query feedback, including ranking the query feedback, to facilitate the user in re-formatting a new query. A knowledge base, which comprises a plurality of nodes depicting terminological concepts, is arranged to reflect conceptual proximity among the nodes. The information retrieval system processes the queries, identifies topics related to the query as well as query feedback terms, and then links both the topics and feedback terms to nodes of the knowledge base with corresponding terminological concepts. At least one focal node is selected from the knowledge base based on the topics to determine a conceptual proximity between the focal node and the query feedback nodes. The query feedback terms are ranked based on conceptual proximity to the focal node. A content processing system that identifies themes from a corpus of documents for use in query feedback processing is also disclosed.

Abstract: The present invention provides a directory service system for accessing a plurality of directory services in a uniform manner. Each directory service manages information relating to objects of that directory service. The type of information that a directory service manages for an object is defined by the object class of the object. An object class defines the properties (i.e., information) that a directory service manages for objects of that object class. Each property has a property name and property type. A directory service has a property value for each property defined by the object class of each object. The directory service system comprises a schema browsing component, a name resolving component, a binding component, and an extending component. The schema browsing component controls the retrieving of the property name and property type of each property of each object class of each directory service.

Abstract: A method and apparatus for accessing storage from at least two different host computers features creating a first file having a first meta-data format and user data blocks in a mass storage medium using the first host computer and reading a logical to physical mapping of the user data blocks from the first file. A second file, having a second meta-data format, is created using a second host computer and the second file has blocks preallocated to be the same length as user data blocks of the first file. A logical to physical mapping of the preallocated user blocks is then obtained and the data blocks of the preallocated file are linked to the data blocks of the first file so that a reference to the preallocated blocks will provide an address at which the data requested can be read in the first file. In this manner, different meta-data blocks, corresponding to different filesystems, and/or operating systems, can be used in the respective first and second host computers.

Abstract: A parallel processing architecture for a relational database management system (RDBMS) that supports both a process model operating system and a thread model operating system. The RDBMS is implemented as a shared nothing, single database image utilizing Parallel Database Extensions (PDEs) that insulate the RDBMS from the specifics of the operating system and that provide the necessary techniques for accessing common memory segments.

Abstract: Innovative managers of persistent data are provided. As an example, in a client/server environment, a persistent manager object may be initialized on both the client and server subsystems. The persistent manager objects may be instances of the same persistent manager class. The persistent manager object on the client subsystem may receive a request to store persistent data and the persistent manager object on the client sends the request to the persistent manager object on the server subsystem. The persistent manager object on the server subsystem may then store the persistent data to make it subsequently be available for the client subsystem.

Abstract: An input/output control device (11) comprises a dual processor system. Supplied with a file update request, first and second processors (12, 14) perform individual processing independently of each other. While the first processor (12) processes a processing request from an input/output device (18) with a current operation file, a new operation file is loaded from a storage medium (17) to a second memory (15). At a predetermined timing, input/output control is switched from the first processor (12) to the second processor (14). Thereafter, judgement is made about whether or not a new processing request subsequently received is an existing call already triggered in the current operation file or a new call newly triggered. In case of the existing call, the call is transmitted through a data transmission/reception unit (16) to the first processor (12) to perform processing with the current operation file.

Abstract: The present invention provides a novel method and apparatus for performing real-time computer garbage collection, in a manner that offers unprecedented low bounds on the worst-case frequency and duration of the collection task. The invention is used with a plurality of data objects and with one or more mutator programs. The mutators and a garbage collector run on one or more processors. The mutators each have a corresponding thread with a corresponding thread state. In the present invention, execution of all mutators is temporarily restricted at the start of each new garbage collection cycle. However, unrestricted execution of a mutator is quickly resumed, as soon as that mutator's thread state is processed. The remainder of the garbage collection cycle may be performed concurrently with the mutators.

Abstract: A system for managing data including at least a randomly accessible recording medium, comprised of a data area in which recordal data is recorded in one or more variable length recording blocks by file and a management data area in which file entries and recording entries for each recording block of the files are recorded, the file entries including name data showing the names of the recordal data recorded in the files and identification data showing the record entries of the first recording blocks in which the recordal data are recorded, the record entries including head position data showing the heads of the recording blocks, link data showing the recording blocks in which continuations of the recordal data are recorded, and recording length data showing the recording lengths of the recording blocks.

Abstract: A device and method is disclosed for loading data into and updating a data structure known as a cube forest for use in a batch-load-then-read-intensively system. The device and method perform loading and updating functions efficiently. Hierarchically split cube forests provide a method for efficiently duplicating information, and can be optimized to reduce update and storage costs. Cube forests including hierarchically split cube forests are most appropriate for read-intensive, update-rarely-and-in-large-batches multidimensional applications in an off-the-shelf (low cost) hardware environment. A method and an apparatus for loading data into and updating a cube forest are disclosed herein.

Abstract: A browsing data creation system of an information searching apparatus includes a data storage for storing plural kinds of data that are to be searched for. Each of the data having a data format corresponding to the kind of data that it is. Instructions can be input into the information searching apparatus and browsing data can be created from the data stored in the data storage according to a data format input into the information searching apparatus. Data that is to be searched for has a time based access and is divided into page units. An instruction is input to the information searching apparatus to search in page units.

Abstract: In a computer system executing a repository program and having a memory, a method is disclosed for versioning a UML model in the repository in accordance with an updated XML representation of the UML model. The method includes the steps of identifying differences between UML objects in the UML model and XML objects in the XML file. Where there is a difference between one of the UML objects and one of the XML objects, it is reserved as a ghost object. The ghost object is updated to match each corresponding one of the XML objects. Objects whose target references have been changed are reserved and updated. Finally, the UML objects are updated in the repository that refer to ghost objects updated in the preceding step. The method includes making changes to the ghost object Attributes, References and owned elements to match Attributes, References and owned elements, respectively, found in the XML object.

Abstract: A FormLogic (FL) client/server system and method to access existing enterprise data sources on an occasional basis. The system includes a FL builder program to generate a communications agent that encapsulates a communication session. The session includes one or more related tasks. The system also includes a FL server which is connected to one or more enterprise data sources. The FL server provides the ability to link hardware devices running a FL engine as a client to access existing enterprise data sources on an occasional basis. It is optimized to communicate by exchanging a minimum amount of data, since the wireless transports do not move large amounts of data quickly and data is expensive to move. Each session encompasses connecting the remote host, performing a specific task or set of tasks, then disconnecting from the host. Because the connection times must be short, the client and server need to be able to perform the required tasks without user intervention.

Abstract: Computer systems typically include many application programs which enable uses to perform a wide range of tasks. The application programs are generally stored on high-capacity memory devices, such as hard drives. Many of these high-capacity memory devices are slow relative to other components of computer system and thus noticeably reduce the overall performance, particularly during start of application programs. One way of improving performance is to organize application programs in memory devices so that often-used application programs are stored in areas that are faster to access or otherwise have less effect on computer performance. Unfortunately, there is no convenient way of keeping track of how often each application program is used. Accordingly, the inventors devised an operating system that logs, or records, certain information every time an application program is started. The log ultimately provides a convenient measure of how frequently application programs are used.

Abstract: A global cache for SQL sections and methods of accessing the cache. The global cache being at the database level and being accessible to all agents of all applications. The global cache having a static and a dynamic portion. The static portion containing section entries having both section information and section data. The dynamic portion having two sub-portions, a statement portion and a dependency portion. The dependency portion containing multiple SQL statements, multiple compilation environments for each SQL statement and multiple variations within each compilation environment. The dependency portion of the dynamic portion containing a plurality of lists of object types. Each object type having its own list, the list containing data on which variations are dependant on each object.

Abstract: A system for managing data including at least a randomly accessible recording medium, comprised of a data area in which recordal data is recorded in one or more variable length recording blocks by file and a management data area in which file entries and recording entries for each recording block of the files are recorded, the file entries including name data showing the names of the recordal data recorded in the files and identification data showing the record entries of the first recording blocks in which the recordal data are recorded, the record entries including head position data showing the heads of the recording blocks, link data showing the recording blocks in which continuations of the recordal data are recorded, and recording length data showing the recording lengths of the recording blocks.

Abstract: A system and method for storing, saving and printing information in a computer network system, particularly the internet, where a plurality of network server devices are in communication with at least one user device. First a network session is established between a user device and one or more of the network server devices. A display device is provided to show a target page including a plurality of first level link references for selection by the user. Each first level link reference in turn includes subsequent level link references. A server search is conducted to identify all level link references pertaining to a specified server network. The results are in turn stored, printed or saved at a memory location.

Abstract: One or more searchable repositories of bookmark sets are stored in a computer system, each bookmark set can be downloaded to a client browser as a unit. Each bookmark set contains a set of Uniform Resource Locators (URLs) and is associated with related information such as a set of keywords, one or more topics and user specific information. The bookmark set is downloadable as a unit to the client browser. When a search query from a client containing a set of keywords is received, the stored bookmark sets are searched for one or more bookmark sets associated with at least one keyword matching a keyword from the search query. A list of bookmark sets which satisfy the query, i.e. are associated with matching keywords, are returned to the client browser. Responsive to a request for downloading a selected bookmark set, the selected bookmark is served to the client. The selected bookmark set is received and used by the client browser to access the set of URLs in the selected bookmark set.