Abstract: The present in invention is directed to a checkpointing filesystem of a distributed-memory parallel supercomputer comprising a node that accesses user data on the filesystem, the filesystem comprising an interface that is associated with a disk for storing the user data. The checkpointing filesystem provides for taking and checkpoint of the filesystem and rolling back to a previously taken checkpoint, as well as for writing user data to and deleting user data from the checkpointing filesystem.

Abstract: A system, method and article of manufacture are provided for integrating a personalizable diary with an information page having a link to the diary. The information page is first displayed. Upon selection of the link to the diary by a user, the diary is displayed. User input for adding entries in the diary is received and selection of the entries for display on the information page is also allowed.

Abstract: A system comprising an analysis engine that interacts with a user profile server and a content management system. The user profile server is used to collect and manage data. The content management system manages a plurality of content types for a plurality of service points in real-time. A service point supports a content type.

Abstract: A hash-CAM (H-CAM) which may work with a controller and a memory containing a database of either search values and associate content or associate content by itself The H-CAM includes at least one set of paired hash units and CAM units and at least one logic unit. The CAM units hold values known to cause hash collisions in the respectively paired hash units, and the logic unit prioritizes the hash and CAM unit outputs to a single address value usable to access the memory and obtain a search result at the controller that is not the result of a hash collision. The H-CAM may optionally include a search data storage to store the search values, so that they need not be stored in the memory, and a comparator to determine and handle newly determined hash collisions.

Abstract: A method of purging cached open files from a client-side delayed close list on a remote file system. The remote file system stores a unique file identifier for each cached open file which is independent of the cached file's namespace. In response to a delete or rename command of a remote target file, the remote file system obtains a target file identifier from the target file's server. The remote file system then compares the target file identifier with each of the cached file's unique file identifier. If a cached file's unique file identifier matches the target file identifier, the cached file is purged from the delayed close list.

Abstract: A system for processing a data file which includes versioned records of a fixed length, each record having one or more data fields and a reserve area for accommodating a change in the record format by creating a further field using a portion of the reserve area such that the length of the record is not changed. Additional records may be added to the record set to accommodate new or expanded data fields that exceed the fixed length of the records. Each record of the data file has a version number. The system includes an input vertical stack processor for transitioning previous versions of the records into a current version of the record for processing by an application processor. An output vertical stack processor creates outbound versioned records including the current version and all previous versions for each record of the data file.

Abstract: A system and method for normalizing encoded text data such as Unicode which is extensible without use of character definition tables through the use of metadata tagging. First, metadata characters, which have no effect on the interpretation of the raw text data, are used to express higher order protocols of encoded two text strings. Next, meta normal form conversion is performed on one or both of two strings to be compared, if both strings are not already in the same meta normal form. Finally, content equivalence determination is performed in which the characters in each string are compared to each other. If a string contains a metadata character, that character is ignored for purposes of equivalence comparison. The remaining characters represent the pure content of the string, e.g. characters without any particular glyph representation.

Abstract: A method for storing records in a database or reading the same therefrom includes the steps of editing data of a non-indexed field of a conventional database as a string of comment characters through a conversion table so as to store the same in a remark field of the database; and showing contents of data of the non-indexed field on a screen of the database by referring to the conversion table in reading the string of comment characters contained in the remark field of the database.

Abstract: The invention disclosed herein enables a collection of computers and associated communications infrastructure to offer a new communications process which allows a requestor to receive configuration information of a computational device from a responder. The requester first sends query documents that contain queries for configuration information of a computational device to the responder; the responder automatically collects the answers for the queries and sends a response document that contains the configuration information of the computational device to the requestor. The queries are written in a formal descriptive language which is transparent, safe for network evaluation, and extensible, and the configuration reader of the responder can parse the queries and automatically invoke a set of standard inspectors to obtain the corresponding configuration information.

Abstract: A method for locating neighbor objects of a query object in a database. A query tile set is defined including a plurality of tiles that define an initial query radius that the query object is grouped within. Neighbor objects are located within the initial query radius. A number of neighbor objects within the initial query radius is determined. The query radius is expanded beyond the initial query radius by defining an expanded query tile set beyond the query tile set if the number of neighbor objects is less than a target number. Neighbor objects are located within the expanded query radius. It is determined whether a number of neighbor objects within the expanded radius corresponds to a target number. The query radius is expanded and neighbor objects located within the expanded radius until the number of neighbor objects equals or exceeds the target number.

Abstract: The present invention is embodied in a system and method for dynamically adjusting data values in response to remote user input to provide the remote user with real time interaction of the data values. First, a user requests information from a remote computer and then results of the requested information are collected at a host computer. Second, the results of the request are transmitted in a hidden format from the host to the remote computer. Third, the results are remotely processed in response to user input. Last, the processed results are dynamically displayed. Client-side processing is preferably used instead of server-side processing to enable the user to quickly access and adjust information dynamically and in real time without server delays.

Abstract: An on-line primary database is momentarily QUIESCED to enable a physically consistent snapshot of the primary database to be mirrored to a secondary database as a backup while allowing the primary database to continue on servicing multiple user applications.

Abstract: A method, computer program product and system for converting Structured Query Language (SQL) statements into the Open Database Connectivity (ODBC) standard. The source code of a database application may be parsed to identify one or more keywords. These keywords may be used to identify SQL statements as well as variables that are used to process the SQL statements. Upon identifying the SQL statements, the SQL statements may be evaluated. The SQL statements evaluated may then be matched with particular functions in a function library, i.e., a collection of functions stored in data files. These functions may implement particular ODBC calls thereby enabling SQL statements to be converted into the ODBC standard. A function call, i.e., a call to that function, may be substituted for the corresponding SQL statement. The function call may then be implemented resulting in the execution of the ODBC calls.

Abstract: Systems and methods for web store events. A web store event occurs whenever an item is accessed. When an item is accessed, both synchronous and asynchronous events can fire. If a synchronous event fires, then an event object that has registered for the synchronous event is called and executed before the transaction involving the item is allowed to complete. The synchronous event also has the ability to either commit or abort the transaction. Importantly, the synchronous event has complete control over the item. An asynchronous event is called and executed after the transaction involving the item is already committed to the store and after any synchronous events have executed. Because more than one event object can register for a web store event, synchronous event objects are called according to their priority. Synchronous events fire before asynchronous events and synchronous event objects execute before asynchronous event objects.

Abstract: A mechanism is described for the reliable notification to client applications of the implementation of predefined high-level document commands in a database. The database management system is issued a number of high-level document commands such as “move electronic mail message” or “add folder” which are to be implemented in the underlying database. As each high-level document command is implemented, an entry representing the high-level document command is set in a notification table stored in a persistent memory such as the database. This entry may be set in the same atomic transaction as the other table updates needed to implement the high-level document command. The appropriate notification is then dispatched to any subscribing client applications. The client application then acknowledges to the database application that the notification has been received. In response, the entry is deleted in the notification table in the database.

Abstract: A document retrieval method using a computer program includes retrieving a first set of documents using a first query expression generated by the computer program. The first set of documents is provided to a user. An evaluation of the first set of documents is received from the user. The first query expression is changed to a second query expression generated by the computer program based on the evaluation.

Abstract: A method, apparatus, and computer readable medium for searching and navigating a document database is provided. Document categories are assigned unique numeric category identifiers. Each document in a database is assigned to one of the document categories. Metadata is associated with each electronic document that includes the numeric category identifier corresponding to the category assigned to the document. The database may be searched or browsed based on category by utilizing the metadata. URLs may also be embedded in a Web page that includes a list of document identifiers and an index. The list of document identifiers is a list containing the identities of an arbitrary number of search results. The index identifies one of the documents in the list of document identifiers to be retrieved. When such a URL is selected, a Web server computer utilizes the list of document identifiers and the index to identify the document to be returned.

Abstract: This invention provides a novel means for creating a histogram for use in minimizing response time and resource consumption when optimizing a query in a database, and other like structures, the histogram being created by placing ordered elements into specific range until the next element to be considered for inclusion in the range is a predetermined distance from the (generalized) mean value associated with the elements within the range, whereupon that next element is placed in the following range. Similarly, the following ranges are closed when the next element to be considered for inclusion in the range is greater than a predetermined distance from the (generalized) mean value associated with the elements in that range, whereupon that next element is placed in the following range. For each range, the location and size of the range is recorded with, for example, the mean value, the slope or other attribute characterizing one or more elements in the range.

Abstract: An improved image retrieval process based on relevance feedback uses a hierarchical (per-feature) approach in comparing images. Multiple query vectors are generated for an initial image by extracting multiple low-level features from the initial image. When determining how closely a particular image in an image collection matches the initial image, a distance is calculated between the query vectors and corresponding low-level feature vectors extracted from the particular image. Once these individual distances are calculated, they are combined to generate an overall distance that represents how closely the two images match. According to other aspects, relevancy feedback received regarding previously retrieved images is used during the query vector generation and the distance determination to influence which images are subsequently retrieved.

Abstract: Method and class tables and an algorithm are provided for use in determining if a called method in a message should be retrieved and executed or a method search should initiated. The method table includes method name, method identifier, method overwrite data, class overwrite data and method memory storage location associated with the method related to the overwrite data. The algorithm sets a plurality of variables to an entry in the class table and at least one method and class data referenced in a message, searches the method table and sets search variables to the class and method overwrite data and determines if a predetermined relationship exists between the method and class identifier associated with the class and method data in the message as well as data in one of method entries. The method memory storage location is read out once a method entry with the predetermined relationship is found.