Abstract: A computerized data storage system and a method for portioning performance among data areas on a hard disk drive. The system includes a management computer coupled to one or more host computers and a storage apparatus. The storage apparatus includes hard disk drives and a storage controller for partitioning the hard disk drives among data volumes in the storage apparatus and for assigning the data volumes to the host computer. A performance partitioning module utilizes a queue management table for forming a number of queues on memory of the hard disk drive. The queues receive READ and WRITE requests and convey these requests to data areas assigned on recording media of the hard disk drive. After a request from a queue is executed, a gate between the queue and the data areas may be closed to allow requests from other queues an opportunity to access the data areas.

Abstract: A method and system for managing files in a server environment includes launching a plurality of virtual servers in a computing system; copying a content of a file of a virtual server to a shared space; providing access to the file copy in the shared space when the virtual server attempts to access the file; detecting files with the same content in other virtual servers; and providing access to the file copy in the shared space from the other virtual servers when they attempt to access their files with the identical content.

Abstract: A method for communicating data includes selecting a portion of data for communication to a remote computer with the data portion in device-dependent format and comprising at least an integer, a real number, or a binary value. A portable buffer is generated based on the selected data portion, the portable buffer comprising at least one device-independent data representation. The portable buffer is communicated to the remote computer for processing the data portion in a second device-dependent format.

Abstract: A data processing method comprises receiving a search term, accessing a data store, the data store including at least one searchable element, selecting components of the search elements, each component containing the search term, and creating a list of the components, the list including an indicator of the occurrence of the component.

Abstract: The present invention is related to data storage and transmission. Data is compressed and stored by a controller computer instead of having a client computer gather, compress and store the data. This allows for data to be retrieved from the data stores and displayed for user retrieval, even when communication failures have occurred.

Abstract: A system, method, and computer program product are provided for analyzing a plurality of rules in a textual rules structure. Further, the plurality of rules are decomposed into a plurality of contexts, based on the analysis. In addition, the plurality of contexts are stored in a table. Furthermore, a database associated with a device and/or any robot equipped with an operating system may be utilized.

Abstract: Techniques are provided for including collection items in the ranked set of search results that are returned to a user in response to a search query. Collection scoring techniques are also provided for generating relevance scores for collection items in a different manner than relevance scores are generated for base items that are not collections. The collection scoring techniques may be applied to non-base collection items, base collection items, or both. Items that match the search query, including base items and collection items, are ranked in a unified ranking based on their respective relevance scores, thereby allowing searches to readily determine the relevance ranking of matching collection items relative to matching base items.

Abstract: Systems, methodologies, media, and other embodiments associated with supporting queries with soft time constraints are described. One exemplary system embodiment includes logic for accepting a query having a soft time constraint. The example system may also include logic for rewriting the query having the soft time constraint into a query having a row limitation or a sample percentage limitation. In one example, the row limitation or sample percentage limitation are computed by repetitively comparing an estimated query execution time to the soft time constraint.

Abstract: A method for communicating data includes selecting a portion of data for communication to a remote computer, with the data portion in device-dependent format and comprising at least an integer, a real number, or a binary value. An XML tree of values is generated from the selected data portion and the XML tree comprises the selected portion of data with each value associated with one data type. The XML tree of values is bundled into a portable buffer communicated to the remote computer for processing the data portion in a second device-dependent format.

Abstract: Disclosed is a management system of a managed system. The management system includes a data sensor layer that interfaces with the managed system to collect raw data. The data sensors in the data sensor layer add semantic tags to the raw data to form tagged data. The semantic tags are maintained throughout the life cycle of the tagged data. The management system further includes a core engine for processing the tagged data based on the semantics tags.

Abstract: An improved system and method is provided for identifying web communities from seed sets of web pages. A seed set of web pages may be represented as a set of seed vertices of a graph representing a collection of web pages. An initial probability distribution may be constructed on vertices of the graph by assigning a nonzero value to the vertices belonging to the seed set. Then a sequence of probability distributions may be produced on the vertices of the graph by modifying the probability distribution over a series of one-step walks of the probability distribution over the vertices of the graph. For each probability distribution produced in the sequence, level sets of vertices may be generated, and a level set with minimal conductance may be selected for each probability distribution. The level set with the least conductance may then be output representing a community of web pages.

Abstract: Embodiments described in the application provide for reports that are generated in many different formats using an Approval Workflow Engine (AWE) and an XML Publisher (XMLP) component. The AWE can accept user parameters to extract data from at least one data source, transform the data, and generate a structured XML data file appropriate for the report. The AWE can pass this XML file, along with at least one report template and other necessary information to the XMLP, which is able to generate reports in any of a number of specified formats. Such an approach keeps the data separate from the formats and components, and allows for multiple reports to be generated without accessing an application for each format. The AWE also can store an audit history record for each transaction passing through the AWE in order to provide a concise location from which to retrieve the information.

Abstract: A computer readable storage medium includes executable instructions to analyze sort options associated with an input table and a comparison table. It is determined whether a consistent sort can be performed by a first database associated with the input table and a second database associated with the comparison table. A first sort operation is performed on the input table at the first database and a second sort operation is performed on the comparison table at the second database when a consistent sort can be achieved. Sort operations on the input table and the comparison table are executed at a common sort engine when a consistent sort cannot be performed by the first database and the second database.

Abstract: Techniques are presented for snapshotting. Blocks associated with a storage volume are frozen from volatile access upon receipt of a snapshot request. Continued volatile access to the frozen blocks is permitted by transparently mapping each frozen block to an available block within the volume that is not associated with the snapshot. Volatile access continues on the available blocks.

Abstract: Systems and methods are disclosed for providing a federated backup involving the coordination and synchronization of backup and restore operations among a plurality of hosts to ensure data consistency. A master node (backup host) acts as the initiator, coordinator, controller, and possibly as primary console for the entire backup and restore operation. All other worker application hosts and/or worker backup hosts operate as worker nodes and perform various backup and restore steps as directed by the master node. Centralized error handling aborts or recovers the entire backup operation in the event of failure on any one node. In addition, a logical view of the data is provided such that the backup can be managed as one entity, while backing up the data of each node. The backup workload may also be distributed to any other dedicated worker backup hosts (nodes) in order to minimize the impact to the production environment.

Abstract: A method for analyzing, querying, and mining graph databases using subgraph and similarity querying. An index structure, known as a closure tree, is defined for topological summarization of a set of graphs. In addition, a significance model is created in which the graphs are transformed into histograms of primitive components. Finally, connected substructures or clusters, comprising paths or trees, are detected in networks found in the graph databases using a random walk technique and a repeated random walk technique.

Abstract: Concurrency control between multiple data transactions involving the same data includes comparing the version identifications which uniquely identify versions of the data during a read request and during a write request of a data transaction. An exception is thrown if the version identifications do not match, and the exception is handled within the data transaction.

Abstract: The present technique provides a combined file space for files from multiple partner computing devices. An individual cache policy associated with each partner computing device determines the manner in which the files in the combined file space are filtered for the respective partner computing device. Files data that do not have content stored locally have metadata associated with the files stored locally in the combined file space.

Abstract: A file namespace hierarchy bypass and method to access files are provided. The bypass can be employed, for example, as a computer-readable medium with instructions for generating a unique identifier associated with a file and instructions for accessing the file based on the unique identifier and a specified search space. A computer-readable medium having instructions for obtaining the unique identifier and specified search space associated with the file and instructions for generating a path designation by combining the unique identifier and the specified search space used to access the file may also be employed. The method for bypassing the namespace hierarchy of the file, for example, may include passing the unique identifier and specified search space to a program and accessing the file based on a path designation generated by the program by combining the unique identifier and specified search space.

Abstract: Techniques described herein adaptively select materialized view fragments for persistent maintenance. During an interval of time, the selected fragments are persistently maintained in the database system, while the other non-selected fragments are not persistently maintained as materialized view fragments. Over time, the composition of the set of selected fragments may change. As queries are executed in the database system over an interval of time, statistics including the frequency of access of each currently selected fragment during that interval are generated. At the start of the next interval of time, based on these statistics, some currently selected fragments may be unselected. Some currently non-selected fragments of one or more candidate materialized views may be selected based on the statistics.