Abstract: A system and method for performing policy-based storage management using data related to access frequency and file attribute accumulation. A switch device provides transparency for transactions between a client and a storage network. The transparency allows objects (e.g., files or directories) to be moved (e.g., migrated) on the storage network without affecting a reference to the object used by the client (e.g., a file handle). A monitoring module generates accumulation data associated with the transactions for use in policy-based management. The accumulation data can describe uses of the file such as how often certain files are accessed, modifications to files such as creations of new directories or files, and other uses.

Abstract: Collection-based object replication for a system that includes a client computing device (client) connected to a server and multiple data storage nodes. In certain cases, a data storage node generates a replica of multiple replicas of a collection. The collection is a unit of data placement, access, replication, and repair. Other data storage nodes are also configured with a respective replica of the multiple replicas. The data storage node verifies whether an object received directly from the client for storage in the collection has been fully replicated by the other data storage nodes in respective replicas.

Abstract: A system that facilitates data presentation and management includes at least one database to store a corpus of data relating to one or more topics. The system further includes a summarizer component to automatically determine a subset of the data over the corpus of data relating to at least one of the topic(s), wherein the subset forms a summary of at least one topic.

Abstract: A system, method, and computer program product allows a web service consumer to create an example query which illustrates the web service desired. The example query is compared, element by element, to potentially relevant web services. The difference between each element in the example query and any element in the web service being compared is quantified as a distance metric, based on the relationship between the elements. The relationships might be classified as: exact match, direct synonym, fuzzy synonym, hyponym, hypernym, or no match. The distance metric for each element in the example query is summed to calculate a total distance between the example query and the web service being compared. This sum is an expression of the difference between the example query and the web service being compared.

Abstract: A distributed file system and method distributes file system objects across multiple self-contained volumes, where each volume is owned by a unique file system node. Logical links are used to reference a file system object between volumes. Each file system node includes a relocation directory in which is maintained hard links to locally-stored file system objects that are referenced from another file system node using logical links. Various file system operations that involve multiple volumes are performed without having to place a write lock on more than one volume at a time. Various caching schemes allow the various file system nodes to cache file system object data and metadata.

Abstract: A method for information retrieval with unified search between heterogeneous objects includes indexing a first object as a document in a search index; referencing a second object related to the first object in a facet of the document; and storing a relationship strength between the first and second objects in the facet of the document in the search index. Multiple heterogeneous objects can be related to the first object and referenced in multiple facets of the document, each with its relationship strength to the first object. Scoring an indirect object by indirect relation to a query object can be carried out by aggregating the relationship strengths between the indirect object and the retrieved objects multiplied by the retrieved objects' direct scores of relationship strength to the query object.

Abstract: A system and associated method for managing data. Each pointer of at least one pointer is stored in a metadata object. The pointer resides in a first repository, each unique file resides in a second repository, and the metadata object resides in third repository. Each pointer is deleted from the first repository. Upon receipt from the first repository of an event indicating both a unique file and a pointer no longer resides in the first repository, the pointer is searched for in each metadata object residing in the third repository pertaining to a hierarchical metadata management system (HMMS). After searching and locating the pointer in a metadata object in the third repository, the pointer is restored to the first repository. A hierarchical storage management system (HSM) is notified that the pointer currently resides in the first repository thus allowing the HSM to retrieve the unique file from the second repository.

Abstract: Computer-implemented processes are disclosed for clustering items, and for using item clusters to generate and/or present item recommendations. One process involves calculating distances between items based on how the items are categorized within a hierarchical browse structure. These distance calculations may then be used as a basis for forming clusters of items.

Abstract: A method of and service for searching computerized networks, such as the internet, that first performs a search based on a user query to produce results that are ranked. The results comprise references to entities (addresses on the network, such as web sites). Before reporting the results to the user, the invention provides that the search entity contacts the entities listed in the search results to determine whether entities listed in the search results desire to change their rank when compared to other entities listed in the results. If some entities do desire to change their rank, the invention charges fees to entities that increase their rank and credits (pays fees) to entities that decrease their rank.

Abstract: A method and apparatus for applying changes to a standby database in real-time. According to one aspect, a change is applied to data contained in a standby database. The standby database functions as a replica of a primary database. The primary database has a current online redo log file to which a particular redo block was written. According to one aspect, prior to the archiving of the current online redo log file, the particular redo block is received at a process associated with the standby database. A change indicated by the particular redo block is applied to the data contained in the standby database.

Abstract: A system and method for personalizing a search results mix based on a user's search history. A system monitors the types of search results that the user frequently accesses. A default search results page can then be modified according to the frequency in which the user accesses certain search results. The modified search results page can then be presented to the user upon the submission of a search request.

Abstract: The invention relates to a system and method for storing data associated with an extensible instrumentation layer. The system and method include receiving metrics from an extensible instrumentation layer in an operating system. The metrics are defined by at least one class and a plurality of properties, with each property being associated with one class. The metrics are converted into at least one database-compliant data structure and stored in a database.

Abstract: Pursuant to receipt of a data modification command or statement, such as an Update command, it is determined which fields in a data structure, such as a UDT, computed column, indexed view, or index, for example, will be changed as a result of the command. Only those fields that are affected by the command will be changed. Thus, changes are propagated to only to those dependent data structures whose content is being modified. Tree representations are used to facilitate the determination as to whether a subfield in a hierarchy is changed.

Abstract: A method for performing an update transaction in a database system that includes sending to a remote database client an update request to update data in a database system, in which the update request comprises a first checksum value corresponding to a state of the data in the database system as of the time of the update request. The method further includes receiving a reply from the remote database client that includes a new value for the data in the database system and the first checksum value. The method further includes determining whether the first checksum value matches a second checksum value corresponding to the state of the data in the database system as of the time that the database system received the reply, and if the first checksum value matches the second checksum value, the data in the database system is updated with the new value for the data.

Abstract: A snapshot management device and snapshot management method whereby a snapshot is obtained on a regular basis, the amount of difference between two obtained snapshots is detected and, when the detected difference amount is smaller than a threshold value, of the two snapshots, the snapshot obtained earlier than the other is deleted, thereby contributing to the improved convenience.

Abstract: When two or more scalar subtrees in an execution plan are directed towards the same data set, but request different data from the data set, the two subtrees are replaced in the execution plan with a new subtree which queries the data set only once. This new query to the data set covers all data required by the different subtrees. A pivoting step then is used to separate the data which would have been sought by each subtree. The pivoting step also yields data in the same form as would have resulted from the original subtrees.

Abstract: A system protects database operations performed on a shared resource. The system may chunk memory to form a set of memory chunks which have memory blocks, at least some of the memory blocks including database objects. The system may configure at least one binary search tree using the memory chunks as nodes and buffer a set of pointers corresponding to the memory blocks. The system may further validate the buffered pointers and dereference validated buffered pointers.

Abstract: A knowledge Management (KM) tool that allows persons in an organization to more rapidly locate the people and information they need to answer their questions. Identification and visualization of information aggregate founders, including category creators, helps in locating expertise, and additionally helps to reveal and magnify hidden knowledge dynamics within the organization.

Abstract: A library virtualisation module (LVM) 13 is disclosed, the LVM being configured to connect first and second hosts 11, 12 to a library 14. The LVM comprises least two host input/outputs, each for connection to a respective host; and a library input/output, for connection to the library 14. The LVM 13 is arranged to modify requests received at its host input/outputs and to provide modified requests to the library input/output in such a way as to divide resources of the library 14 between the hosts 11, 12 without requiring unmodified requests to take into account the division of resources.

Abstract: A massive amount of information is collected when tracking statistics such as web site usage data. To simplify the analysis of such data, it is advantageous to process and segment the web site usage data. One proposed method of segmenting the data is to create a reverse sorted associative container for each different web section of a web site. Page-views, time-spent, sessions, and other web viewing metrics may be used as keys in the reverse sorted associative container and web viewer identifiers are used as values associated with the page-view value keys. After creating the reverse sorted associative containers, each reverse sorted associative container is segmented on a percentile basis.