Abstract: Methods and apparatus, including computer program products, for providing a data structure, embodied in a computer-readable medium, implementing a tree of nodes having inner nodes and leaf nodes, and performing a scan of the data structure to identify an entry that satisfies a search criterion. Each leaf node includes a key having a first value representing a starting point of an interval, a second value representing an ending point of an interval, and a third value representing a duration of an interval. Each inner node is a root node of a subtree. Each inner node includes a key having a first value representing a minimum of the starting points of intervals in the corresponding subtree, a second value representing a maximum of the ending points of the intervals in the corresponding subtree, and a third value representing a maximum duration of the intervals in the corresponding subtree.

Abstract: One embodiment of the present invention provides a system that provides heterogeneous resources for client systems. During operation, the system maintains a stateful resource database that tracks heterogeneous resources in a given environment. The system receives requests from client systems, and in response to the requests searches for a heterogeneous resource in the stateful resource database that matches the request. If the system finds an available heterogeneous resource that matches the request, it proceeds to submit the request to the resource. Maintaining and using the stateful resource database facilitates efficiently sharing scarce heterogeneous resources across a number of client systems.

Abstract: A database management system provides the capability to perform cluster analysis and provides improved performance in model building and data mining, good integration with the various databases throughout the enterprise, and flexible specification and adjustment of the models being built, but which provides data mining functionality that is accessible to users having limited data mining expertise and which provides reductions in development times and costs for data mining projects. A database management system for in-database clustering comprises a first data table and a second data table, each data table including a plurality of rows of data, means for building a clustering model using the first data table using a portion of the first data table, wherein the portion of the first data table is selected by partitioning, density summarization, or active sampling of the first data table, and means for applying the clustering model using the second data table to generate apply output data.

Abstract: A method and apparatus is disclosed for XML query evaluation using early-outs and multiple passes to evaluate an XML query. A multi-pass evaluation procedure evaluates the XML query one step at a time as needed to complete evaluation. The multi-pass evaluation procedure evaluates XML queries containing logical expressions such as “AND” expressions, “OR” expressions, and implied “AND” expressions within “FOR” clauses. Queries containing logical expressions are often satisfied before every component is evaluated. Thus, executing the multi-pass evaluation procedure allows the evaluation to exit early when the veracity of the query is determined, not necessarily when every component has been evaluated. The multi-pass evaluation procedure executes as long as a descendant axis of the XML query need not be evaluated past a child node. When evaluation of a descendant axis past a child node is required, the multi-pass evaluation procedure may switch to a single-pass evaluation procedure to complete evaluation.

Abstract: A facility for efficiently storing and querying snapshot measures from a relational data warehouse is provided. The facility allows for the efficient query of measures at any given point in time by efficiently modeling snapshot measures. In one technique, the facility stores periodic snapshots of a metric at longer time intervals, and computes intermediate snapshots of the metric as necessary in between these time intervals. Under this technique, the facility can compute an intermediate snapshot measure of a metric for any specified time by determining the last snapshot measure of the metric from the most recent periodic snapshot, and adding to the last snapshot measure the value of the changes to the metric that happened since the time of the most recent periodic snapshot and the specified time.

Abstract: A shortened identifier, such as a shortened URL, is used to access data, a service, and/or another resource that is associated with a full identifier, such as a full URL. In an exemplary embodiment, a hash key is generated from the full URL and included with a domain identifier to form a shortened URL. Other codes can also be included in the shortened URL. The shortened URL can be included in a message, page, and/or other data element that is generally too small for the full URL. When received from a client, a property code, a user ID, and/or other data is used to locate one or more full URLs. A selected hash function is applied to the full URLs to generate a table of hash keys. If a match exists with the hash key from the shortened URL, the resource is accessed at the corresponding full URL.

Abstract: Performing a backup is disclosed. A first set of data associated with a second set of data is backed up. The first set of data is made available for use before backing up the second set of data. The second set of data is backed up within a prescribed interval after completing the backup of the first set of data. One of the first set of data and the second set data comprises metadata associated with the other of the first set of data and the second set of data and the other comprises one or more items of managed content.

Abstract: Systems and methods are provided for finding a log file generated by an application during an execution of the application on at least one computer node. The computer node is one of a plurality of computer nodes of a distributed computer that has a computer-readable storage medium that contains therein both a plurality of log files and meta data describing attributes of the log files. In one implementation, a method includes receiving at least one attribute describing a log file that has been generated by the computer node of the distributed computer. The meta data is searched to identify one or more log files described by the received attribute. Locations of the identified log files in the computer-readable storage medium are presented based on the results of the searching step.

Abstract: While consulting indexes to conduct a search, a determination is made from time to time as to whether it is more efficient to consult individual indexes in a set or to merge the indexes and consult the merged index. The cost of merging indexes is compared with the cost of individually querying indexes. In accordance with the result of this comparison, the indexes are merged and the merged index is consulted, or the indexes are individually consulted. A cost-balance invariant in the form of an inequality is used to equate the cost of merging indexes to a weighted cost of individually querying indexes. As query events are received, the costs are updated. As long as the cost-balance invariant is not violated, indexes are merged and the merged index is queried. If the cost-balance invariant is violated, indexes are not merged, and the indexes are individually queried.

Abstract: A system including a plurality of servers each executing an application, a plurality of Wide Area File System (WAFS) clients which are correspondingly connected to the servers, a WAFS server which is connected to each WAFS client, a storage system or network attached storage (NAS), connected to the WAFS server, which stores data in a plurality of volumes or filesystem forming a consistency group, and a backup server for controlling backup of the consistency group. Each WAFS client includes a cache for temporarily storing data, and a cache manager for managing the cache. The WAFS server includes a backup agent that responds to the backup server, and a consistency manager that maintains consistency among the caches. The system is implemented to bring to a state of consistency the caches in the WAFS clients and the corresponding volumes in the WAFS server.

Abstract: An entry for a file to be stored in a file system can be created. A priority is assigned to the file that indicates an importance of the file relative to a plurality of additional files stored in the file system, the priority being one of three or more priorities available to files in the file system. Additionally, one or more of the files that are associated with the lowest priority values can be automatically deleted.

Abstract: A time series monitoring system, implemented in software, executes persistent queries on multiple input time series, handling high data throughput with low response time. The system supports dynamic management of time series, of windows in time series, and of persistent queries. Also, the system can use historical values in present windows to help populate inserted windows.

Abstract: A coordination planner is suitably used for a query framework system for processing a user request for data from one or more data sources. The query framework system comprises multiple query processing components including a set of query operation providers, each being capable of providing a specific query operation. The coordination planner prepares a user request for execution by translating a logical representation of the user request into a physical representation of the user request using the query operation providers, and executes the physical representation of the user request to obtain a result data stream using the query operation providers.

Abstract: Database synchronization processing is completed within a reasonable time, using narrow-band network that connects a primary site to a secondary site, to reduce the running cost of a system. A primary DBMS has a transaction executing unit for reading a primary DB of a primary storage system to update data as requested in an update request, and a write unit for writing the updated data in the primary storage system. The primary storage system includes an unnecessary information removing unit for overwriting an unused area in the written data successively with one of a preset character and a preset value. The primary storage system is connected, via a network, to a second storage system which stores a copy of the primary DB. The primary storage system is connected to the network via a network device which has a data compression unit for compressing a succession of the same value.

Abstract: Information is maintained on a mobile client device. A delete command is received at the mobile client device over a wireless mobile network from a mobile-device data management server configured to provide mobile-device service to multiple mobile client devices over the wireless mobile network. The information is deleted from the mobile client device automatically and without user interaction in accordance with the delete command.

Abstract: A method and system for bundling objects containing related data. Objects that are related to each other are bundled together to avoid synchronization problems. The bundling process is performed in parallel, as are operations, such as calculations, performed on the objects.

Abstract: A method for interfacing applications to maintain data integrity. A client service identifies new or changed data in a client application. The data is then posted to a core service in a transaction. Next, the client applications that need updating are determined. For the client applications that need updating a pending transaction directed to those client applications is stored in the queue storage. The client service for one of the client applications that needs updating searches the queue storage for the pending transaction. The client service then updates the client application that needs updating with the new or changed data.

Abstract: Semantically linked pages are queried based on a user supplied interest vector. The interest vector provides a weight for presenting results from the query of pages. The interest vectors are used to calculate the importance of pages of a query based on the weight of semantic links associated with the page known as page rank indicators. Optionally, the calculation is augmented by other page ranking algorithms. An indication of the resulting pages is displayed according to the calculated importance. Preferably the calculation utilizes a dot product of page rank and user interest vectors.

Abstract: A request is received with a first operation identifier to lock a first resource. The first resource is locked with the first operation identifier. It is determined whether a second resource should be locked with the first operation identifier or with a second operation identifier based on whether an operation to be performed for the request may complete after the request is processed. Additional embodiments are described and claimed.

Abstract: A method of building an offline address book (OAB). An OAB data file and a table of attributes are generated at a server. The data file and table are transferred from the server to a client. The transferred data file and table are indexed by the client.