Abstract: Systems and methods for managing state data from monitored entities in a computing environment are described. In a push-based approach, a publisher computer obtains state data of an element from the monitored entities and sends the state data on to a subscriber computer. From the state data, the publisher computer generates one metadata record for the element that is updated as newer state data is obtained such that each element is associated with just one record. The publisher computer scores and ranks the records of the elements based on a time since previous state data was sent to the subscriber computer, a magnitude of a change, and the existence of one or more event flags. The publisher computer schedules and queues the state data according to their ranking. The highest priority record in a queue is sent only when a timing signal indicates that state data can be sent.

Abstract: Regarding a management of data stored in a folder to which a permission range of access is set, a data management apparatus is caused to perform (a) a detection region setting step which sets a detection region for detecting a preliminary operation, which is for storing any data into a destination folder which can store data; and (b) a storing limitation step which limits the storing of the data into the destination folder in cases where the preliminary operation is detected at the set detection region, and the access permission range set for the destination folder is different from the access permission range set for a source folder storing the data originally.

Abstract: The present invention relates to data cleansing, and in particular performing the semantic standardization process within a database before the transform portion of the extract-transform-load (ETL) process. Provided are a method, system and computer program product for standardizing data within a database engine, configuring the standardization function to determine at least one standardized value for at least one data value by applying the standardization table in a context of at least one data value, receiving a database query identifying the standardization function, at least one database value and the context of the data, and invoking the standardization function.

Abstract: The present invention relates to a system for generating a table comprising generating means for generating a table which contains at least a column or line depicting one or more first categories and at least a column or line depicting first values associated with said first categories and wherein the system further comprises selecting means for selecting one of said first categories by a user and adding means for enlarging the table upon selection of a category by said selecting means, said adding means being adapted to enlarge the table by adding a new column or line which comprises second categories into which said selected first category may be subdivided as well as second values associated with said second categories and wherein said new column or line does not comprise categories into which non selected first categories may be subdivided.

Abstract: Described are techniques for using resources of a data storage system. The data storage system is configured to have a first data storage configuration including a first extendable resource. The data storage system is configured to execute a virtual machine and one or more applications executing in the context of the virtual machine. One or more metrics are monitored regarding any of data storage system resource utilization and performance. It is determined whether the one or more metrics comply with specified criteria. If the one or more metrics do not comply with the specified criteria, processing is performed that includes providing a notification in connection with migrating any of the virtual machine and data used by the virtual machine from the data storage system.

Abstract: Systems and associated methods for automated and semi-automated building of domain models for documents are described. Embodiments provide an approach to discover an information model by mining documentation about a particular domain captured in the documents. Embodiments classify the documents into one or more types corresponding to concepts using indicative words, identify candidate model elements (concepts) for document types, identify relationships both within and across document types, and consolidate and learn a global model for the domain.

Abstract: An associative object model for presenting composite entity information is provided. More particularly, a system and method of linking various data related to an entity from isolated databases in a distributed enterprise is provided. The system and method presents composite information on the entity to different systems within the distributed enterprise. The method includes propagating a change of data of a first entity type to one or more related or associated entity types in an active associative object model (AOM) accessible by a subscribing system and a publishing system in an enterprise.

Abstract: Embodiments of the present invention address deficiencies of the art in respect to data synchronization and provide a novel and non-obvious method, system and computer program product for synchronization log driven data synchronization. In one embodiment of the invention, a data synchronization method can be provided to include assembling a group of initial updates for synchronization, consulting a synchronization log of updates excluded from past synchronizations to determine updates already applied during past synchronizations, removing updates already applied during past synchronizations from a filtered set of updates, and synchronizing the filtered set of updates. In this regard, assembling a group of initial updates for synchronization can include assembling a group of initial updates having a timestamp greater than a timestamp for an immediate past synchronization.

Abstract: In one example embodiment, a method is implemented to relink a data item. The method includes identifying that a data item, referenced by a referencing document, is absent from a data item location for the data item indicated by the referencing document. User preference data, indicating a designated relink location to search for absent data items, is accessed. The relink location is searched for the absent data items. Another example embodiment may include a method to relink a current data item to a replacement data item location by accessing user preference data and searching a relink location for a replacement data item in accordance with the relink location indicated by the user preference data.

Abstract: A method for performing block-level incremental backups of file system volumes using a pseudo device layer of a volume manager. A driver associated with a snapshot backup program is configured to back up the full pseudo disk upon receipt of a backup request, and not automatically performed upon startup. Incremental backups are performed thereafter using a driver that has been modified to include a monitor that tracks writes during backups. The standard I/O routine of the kernel is overwritten with an I/O routine that tracks write operations. The volume manager is called back to perform the incremental backup operations upon each write operation. The going down routine of the kernel is also overwritten to track any updates to the volume manager. If the volume manager is updated, the data structure is cleared and future backups are performed from a subsequent full backup.

Abstract: Techniques are provided for encoding/decoding binary XML data in a client program before sending/receiving the XML to/from a database server. By encoding the binary XML at the client, the overhead of parsing the XML text is avoided by the database server, thus improving database server scalability. Also, the XML data is sent by the server to the client in the binary form, and the binary format is decoded by the client program to perform the necessary operations.

Abstract: The World Wide Web (WWW) can be modelled as a labelled directed graph G(V,E,L), in which V is the set of nodes, E is the set of edges, and L is a label function that maps edges to labels. This model, when applied to the WWW, indicates that V is a set of hypertext documents or objects, E is a set of hyperlinks connecting the documents in V, and the edge-label function represents the anchor-text corresponding to the hyperlinks. One can find a probabilistic ranking of the nodes for any given label, a ranking of the labels for any given node, and rankings of labels and pages using flow based models. Further, the flows can be computing using sparse matrix operations.

Abstract: Methods and apparatus, including computer systems and program products, for executing a query on a subset of data, for example, to facilitate a fast search with a very large result set. In one general aspect, a method of executing a query includes receiving a query for execution on data in the data repository; generating an estimate of a number of results of the query; defining a subset of data in the data repository; determining whether to execute the query on the subset of the data; executing the query on the subset of the data to generate a partial set of results if the query is to be executed on the subset of the data, otherwise executing the query on the data repository to generate a complete set of results; and providing query results.

Abstract: A system for use with an information retrieval system, in which system is used for transforming a database statement containing a first subquery and a second subquery joined together, the first subquery including a group by operation over a child subquery, the information retrieval system comprising means for removing the first subquery from the database statement thereby eliminating the join between the first subquery and the second subquery.

Abstract: Embodiments of this invention provide primary magnetic disk data storage capacity to clients while at the same time making sure that client data is replicated locally and at an offsite location to protect from all forms of data loss.

Abstract: A search tree embodying a plurality of signatures to be compared with an input string of characters and including a number of branches of sequential states originating at a root node, wherein each state comprises a state entry including a failure transition and one or more success transitions, is optimized by selecting a failure size parameter indicating a minimum number of characters to be traversed on the failure transitions and selectively modifying the search tree to create a modified search tree for which all failure transitions to non-root states are characterized by the selected failure size parameter.

Abstract: A search tree embodying a plurality of signatures and a number of states each having a failure transition to a fail state and one or more success transitions to next states is optimized by selecting a success size parameter that indicates a maximum number of input characters to be traversed on the success transitions and compressing the search tree to create a compressed search tree characterized by the selected success size parameter.

Abstract: An organization maintains a computer network comprising at least a forest A and a forest B, where forest A has a directory A and a querying entity A capable of querying directory A, and forest B has a directory B and a querying entity B capable of querying directory B. Querying entity A receives a request from the user and decides whether to grant the request based at least in part on whether the user is a member of the group. Thus, querying entity A queries directory A to return information on the group, is directed to forest B, contacts querying entity B, requests querying entity B to query directory B whether the user is a member of the group, receives a response, and grants the request from the user based at least in part on whether the user is a member of the group.

Abstract: A system and method for management for data replication in a data storage environment is disclosed. The system includes an architecture, software, and methodology for recovering from failure of software agents, which are operational in the data storage environment, by an ordered allocation of non-failed software agents to compensate for the failed agents.

Abstract: Every presence has needs. A need could be consumer electronics, loans, autos, or knowledge, etc. The presence uses search engines to become knowledgeable about the need. The current search engines are not intelligent. The idea of the invention is to provide more accurate results and semantically linked results through an intelligent index. The invention uses results from known, semantic and unknown indexes with Guiding Information to return the most relevant results to the users.