Abstract: Provided are a method, system, and program for managing a database. A request is processed to create an index on at least one key column of a table in a computer readable medium. A determination is made of table partitions in which rows of the table are stored. One index partition is generated for each determined table partition, wherein each index partition includes nodes, wherein each node in each index partition includes a key value from at least one column in a corresponding table row in the table partition associated with the index partition and a location identifier identifying the corresponding table row in the corresponding table partition. In certain embodiments, a technique is implemented during queries to limit the search to a subset of the multiple index partitions when possible and return rows in the order of the key columns of the index while the same range of key values can exist across multiple index partitions.

Abstract: In incremental garbage collectors based on the Train algorithm a futile condition may exist where the collector never finishes collecting an old train. The present invention provides an expanded collection set of a younger car with an object referenced from another train. That reference will be found by scanning the remembered sets of other car. If no such younger car is found, then a younger car with an external reference may be added to the collection set. One of these other cars is added to the collection set and, if there are no other changes, the collection will reduce the volume in the train being collected and therefore break the futile situation.

Abstract: A system and method for managing logical versions of a filesystem made through a near-instantaneous copy process is provided. Each logical version of the filesystem, including the primary version, is assigned a unique epoch number or other identifying value, and each filesystem object is assigned two epoch numbers that define the space of logical versions for which the object exists. A list of all valid epoch numbers are maintained in a version table. The near-instantaneous creation of a logical version of the filesystem requires inserting a unique epoch number entry in the version table (106) and the next epoch number to the new logical version. An original state of the system is preserved through the use of a copy-on-write procedure for filesystem objects that are reference by that logical filesystem version (120). Accordingly, filesystem versions are maintained and original states of previous states of the logical filesystem versions are preserved.

Abstract: A database management system is provided for protecting data from being malicious update or deleted. The system is arranged to hold as a table attribute an insert-only attribute and a row deletion prohibition period, and as an access right attribute a row insertion date and time holding column name and to specify a row insertion date and time when a row was inserted, for disabling said date and time data. When requesting a table data update or a row deletion, the table attribute and the row insertion date and time are checked for preventing the malicious update and deletion.

Abstract: A documents control apparatus includes an attribute sharing unit that shares an attribute of a document with another documents control apparatus, an edit processing unit that edits the attribute, and a switching unit that determines whether the attribute is shared with the other documents control apparatus. The switching unit switches the edit of the attribute based on the determination. If the attribute sharing unit does not share the attribute, the switching unit allows the edit processing unit to edit the attribute as requested. If the attribute sharing unit shares the attribute, the switching unit controls the operation of the edit processing unit.

Abstract: Disclosed is a search mechanism comprising: accepting search intent information from a user having a search intent; creating a semantic taxonomy tree having term(s) representative of the search intent information; augmenting the term(s) with associated concepts derived from the term(s) using existing terminological data; associating a weight with at least one of the term(s); obtaining user preference intent; determining root term(s); transforming the semantic taxonomy tree to a Boolean search query; submitting the Boolean search query to searcher(s); receiving at least one search result(s); interpreting the search result(s); requesting page(s) specified the search result(s); receiving the page(s); generating ranked results; presenting the ranked results to the user; presenting the semantic taxonomy tree to the user; accepting user feedback from the user; and using the user feedback to update the user preference intent.

Abstract: Provided are a method, system, program, and data structure for implementing a locking mechanism to control access to a shared resource. A request is received to access the shared resource. A determination is made of whether a first file has a first name. The first file is renamed to a second name if the first file has the first name. A second file is updated to indicate the received request in a queue of requests to the shared resource if the first file is renamed to the second name. An ordering of the requests in the queue is used to determine whether access to the shared resource is granted to the request. The first file is renamed to the first name after the second file is updated.

Abstract: The present system improves the performance of a query in a database system when a plan for the query comprises sorting an input that is at least partially sorted such that a slow materialization sort can be applied. The invention applies the slow materialization sort by determining a sequence of subsets in accordance with the partially sorted input. As each of the subsets is determined, the subset is output for further processing. Advantageously, the invention reduces the waiting period for obtaining results from a sorting operation under certain circumstances.

Abstract: In a database system that supports object name overloading, database query statements are compiled and cached as data structures so that object level privileges are correctly resolved. Database query statements stored in the cached data structures are utilized when appropriate and a new compilation is performed when an incorrect resolution would result. The data structures are stored in a predefined order to ensure that a deterministic search of the cache is efficiently performed.

Abstract: Database access operations require a process of first locating a database of data that contains requested data and then retrieving the requested data from within the database table. The database tables are stored within a database file that contains an index structure to assist in the determination of the location of the table within the file. Depending upon the structure of the tables and their location within the database file, different searching methods may be used to determine the location of the table. Each searching method results in a different processing efficiency for the search. However, the most efficient searching methodologies operate only on database files having a preferred structure. The least efficient searching methodologies will operate on all database files. The present invention determines the most efficient searching methodology that is supported by a database file when it is registered with a processing system.

Abstract: A method and apparatus for converting a single instance computer application to a multiple instance application includes disabling the single instance application and linking the executable files associated with the single instance application to routines in a library that includes routines for use by a multiple instance application. Multiple instance metadata that represents the structure of the multiple instance application is automatically created based on metadata that represents the structure of the single instance application. The data from the single instance application is imported to complete the conversion to a multiple instance application.

Abstract: A distributed processing technique and associated method are disclosed for achieving parallel BLAST processing without requiring client systems to have direct access to the entire BLAST sequence database and without requiring significant and complex post-processing steps to obtain desired result data. More generally, a distributed processing technique and associated method are disclosed for analytical processes that require access to a massive database.

Abstract: Systems, methods, and computer products that efficiently update multidimensional data cubes by using hierarchy dependency relationships that are present in the tables of the multidimensional database. An embodiment of the present invention improves the techniques associated with refreshing multidimensional database information when the multidimensional data has been changed.

Abstract: The copy of data in two directions is realized without fixing a copy direction to one direction between storage device systems which constitute a copy pair. In storage device systems which constitute a copy pair, a data consistency holding control part is disposed. The data consistency holding control part operates so as to write write-in data to a logical volume which forms the copy pair into a physical storage device after cache part has waited for more than a predetermined time from the corresponding reception time, in such a manner that, when write-in data which was received from a superior device and write-in data which was received from another storage device system through DKCI/F are written into the same storage location of the physical storage device in an overlapped manner, they are written in the order of the time of reception on which the write-in data was received from a superior device.

Abstract: In a method of semantic querying in a peer-to-peer network, an item of information is mapped into a semantic vector based on the latent semantic indexing algorithm or any IR algorithms that can derive a vector representation. The semantic vector is associated with an address index as a key pair. The key pair is stored in an overlay network formed from the peer-to-peer network such that the stored key pair is proximally located to at least one other key pair having a similar semantic vector.

Abstract: A method for automatically determining query language operators of a Web information source, includes providing a set of known query operators, each known query operator in the set operating according to at least one syntax, wherein for a test query comprising a query operator and a test key word, each syntax of the operator produces a different number of document matches for the test query at a known Web information source; performing the test query on the Web information source, wherein the test query produces a number of document matches on the Web information source; comparing the number of document matches produced by the Web information source with the number of document matches produced by the known operator's different syntaxes; and using an established criteria for determining if comparing results indicate the Web information source supports the known query operator according its matching syntax.