Abstract: The present invention provides a system and method for reserving space to guarantee file writability in a file system supporting PCPIs. An administrator of a storage system implants a set of space reservation policies to ensure that clients of the storage system do not receive an out of space error in response to overwriting a section of a particular file.

Abstract: An integrated human and computer interactive data mining method receives an input database. A learning, modeling, and analysis method uses the database to create an initial knowledge model. A query of the initial knowledge model is performed using a query request. The initial knowledge model is processed to create a knowledge presentation output for visualization. It further comprises a feedback and update request step that updates the initial knowledge model. A multiple level integrated human and computer interactive data mining method facilitates overview interactive data mining and dynamic learning and knowledge representation by using the initial knowledge model and the database to create and update a presentable knowledge model. It facilitates zoom and filter interactive data mining and dynamic learning and knowledge representation by using the presentable knowledge model and the database to create and update the presentable knowledge model.

Abstract: The invention provides a document representation method and a document analysis method including extraction of important sentences from a given document and/or determination of similarity between two documents. The inventive method detects terms that occur in the input document, segments the input document into document segments, each segment being an appropriately sized chunk and generates document segment vectors, each vector including as its element values according to occurrence frequencies of the terms occurring in the document segments. The method further calculates eigenvalues and eigenvectors of a square sum matrix in which a rank of the respective document segment vector is represented by R and selects from the eigenvectors a plural (L) of eigenvectors to be used for determining the importance.

Abstract: Disclosed is a data processing system implemented method, a data processing system and an article of manufacture for executing a query having a union operator. A data processing system implemented method direct the data processing system to execute a query against a database having data objects. The query has sub-queries and having a union operator. The union operator is operable on sub-queries associated with the query. The database is operatively coupled to the data processing system.

Abstract: Disclosed is a data processing system, a data processing system implemented method and an article of manufacture for executing a query having a union all operator. The data processing system implemented method directs the data processing system to execute a query against a data object. The query has a union all operator and has a set of data modifying operators. The set of data modifying operators is associated with the union all operator. The union all operator references the data object. The data processing system implemented method includes preventing the union all operator from being applied to the data object, and applying the set of data modifying operators against the data object.

Abstract: Disclosed is a technique for processing a base model. The base model is received. Then, the base model is used to create a ViewType comprising a ViewType object, one or more ViewList objects corresponding to classes in the base model, and one or more ViewElem objects corresponding to attributes in the base model.

Abstract: Disclosed is a technique for input parameter binding. When executing a statement, data in an application structure of the statement is compared with optimization information in a bind-in structure. When there is a match between the data in the application structure and data in the optimization information in the bind-in structure, the statement is executed with the optimization information. Also disclosed is a technique for output parameter binding. When executing a statement, data in an application structure of the statement is compared with optimization information in a bind-out structure. When there is a match between the data in the application structure and data in the optimization information in the bind-out structure, the statement is executed with the optimization information.

Abstract: A relevancy ranking and clustering method and system that determines the relevance of a document relative to a user's query using a similarity comparison process. Input queries are parsed into one or more query predicate structures using an ontological parser. The ontological parser parses a set of known documents to generate one or more document predicate structures. A comparison of each query predicate structure with each document predicate structure is performed to determine a matching degree, represented by a real number. A multilevel modifier strategy is implemented to assign different relevance values to the different parts of each predicate structure match to calculate the predicate structure's matching degree. The relevance of a document to a user's query is determined by calculating a similarity coefficient, based on the structures of each pair of query predicates and document predicates.

Abstract: There is provided a technique capable of executing a predetermined processing while continuing a database processing. Firstly, the database to be operated is switched from the main database to a duplicate database. The predetermined processing is executed to the main database which becomes the non-operation mode by the switching. Next, a database access request is distributed to the duplicate database which becomes the operation mode by the switching, thereby performing the database processing. Update information indicating the content of the update processing performed to the duplicate database is output. The output update information is reflected on the main data base for which the predetermined processing has been executed. After this, the database to be operated is switched from the duplicate database to the main database.

Abstract: An efficient method for renaming consecutive keys in a B-tree representing a hierarchical namespace, such as a file system, has an estimated time efficiency of O(logN), where N is the number of nodes in the B-tree. All the consecutive keys to be renamed are first excised from the original B-tree to form a trimmed B-tree, and the excised nodes are stored in a separate temporary extracted B-tree. The nodes in extracted B-tree are then renamed, and the renamed extracted B-tree is inserted into the trimmed B-tree to form a final B-tree that contains the renamed keys.

Abstract: In a network system in which clients and file servers are connected by networks and a client makes access to a file stored in a disk storage device of a file server via the networks, accessibility to a file of a file server distant from the client tends to be deteriorated. In order to resolve the problem, the file server having the file searches for an appropriate file server in the proximity of the client and transfers the file to the appropriate file server (migration target server). Thereafter, the client makes access to the migration target server for the file.

Abstract: A system and method for assembling timing data in a multi-layer server environment are disclosed. An HTML based request is generated. A time of generation of the HTML based request is then deposited in one or more hidden data fields associated with the HTML based request. The HTML based request is forwarded to one or more servers that deposit an arrival time in the one or more hidden data fields. Next, an HTML based response is generated. The arrival times provided by the one or more servers are transferred to one or more hidden data fields associated with the HTML based response. The HTML based response is forwarded to one or more servers that deposit a departure time in the one or more hidden data fields associated with the HTML based response.

Abstract: An input section inputs a document set. A normalization section calculates a similarity as a relative value between documents, with respect to combinations of a plurality of documents, in the document set. The normalization section employs the tf·idf method. In tf·idf method, a document vector and a significance of a word included in the document is used to perform normalization to convert each similarity to an absolute value.

Abstract: A network has a file system configured for providing a selected version of a first file to a client, having requested the file, based on detecting that the client has opened a second file having an identified relationship with the first file. Files are identified as having a relationship based on membership in a file group, wherein each file group identifies only one version of each file specified in the corresponding file group; hence, multiple file groups can identify files associated with respective versions of a file set. In response to determining the first file belongs to a file group, the file system identifies the version of the second file opened by the client, and selects the version of the first file to be provided to the client based on determining the file group associated with the version of the second file opened by the client.

Abstract: A method that enables real-time processing of mobile based transactions in a three-tier database by employing pending operation/locks databases at each mirror in the three-tier database and generating a token for each proposed transaction that indicates the operations/locks needed to perform the transaction. The token is passed to each mirror database to compare with the corresponding operation/lock database. When a conflict is detected, a flag indicating such is set.

Abstract: Resolving a query term includes receiving at least one query term from a requestor and determining a geographic location of the requestor. The geographic location of the requestor may be determined by accessing an electronic information store containing a requestor profile including geographic information about the requestor, where the requestor profile is used by more than one program. The query term is resolved against electronic information within at least one electronic information store to determine whether one or more matches exist and a result is generated that accounts for the geographic location of the requestor.

Abstract: A program product to perform a method for updating database objects in database servers. The program product causes the computer system to the perform steps of receive user specified database schema files for release to a list of corresponding database servers where modifications are to occur, wherein each schema file includes proposed database object structures, and verify that the schema files contain valid DDL commands. The computer system verifies that the user has proper permissions to modify the database object structures, and compares existing database object structures to the proposed database object structures to determine if the existing database object structures need to be modified. If the exising database object structures need to be modified, then the computer system modifies the existing database object structures, creates release notes that include documentation related to modifications of the database object structures, and sends the release notes to predefined addresses.

Abstract: A system and method is provided for exchanging a first sub-hierarchy of at least two sub-hierarchies of a hierarchical file system (HFS) with a second sub-hierarchy of the at least two sub-hierarchies, the HFS being accessible by at least one processor and having a root directory that is a parentless directory. The method includes the steps of providing for the first sub-hierarchy to include a first root directory stored in a first location occupied by the root directory of the HFS and a first plurality of files configured to branch therefrom; providing for the second sub-hierarchy to include a second root directory stored in a second location of the HFS that is not occupied by the root directory of the HFS and a second plurality of files configured to branch therefrom; and providing for relocation of the second root directory to the first location.

Abstract: There is disclosed a data processing system implemented method, a data processing system, and an article of manufacture for directing a data processing system to maintain a database table associated with an initial maintenance scheduling interval. The data processing system implemented method includes selecting a randomizing factor, and selecting a new maintenance scheduling interval for the database table based on the initial maintenance scheduling interval and the selected randomizing factor.

Abstract: A device or software may detect a number of times an item is accessed. A more direct path to the item may be automatically generated. The more direct path may be based at least in part on how often the item is accessed.