Abstract: An XML (eXtensible Markup Language) schema to define a list of terms to be recognized as semantic categories is disclosed. Using an instance of the XML schema, a user may easily define terms to be recognized as semantic categories without having to compile a complete recognizer plug-in. The XML schema may be written using any editing tool or XML schema editing tool to create an instance of the schema. An instance of the semantic category list schema is also referred to as a semantic category list file. Typically, the user completes all of the properties of the XML schema and specifies the list of terms to recognize directly in the XML schema. In addition to specifying terms directly in the XML schema, the user may use a binary representation of the list of terms because of size constraints. The user may also define actions in the semantic category list file.

Abstract: The present invention relates to a system and methodology for resource query management. The system includes a resource manager, a query engine and a filter component. The system facilitates construction and management of a resource query across resource type(s) that may be similar, different, incongruent and/or distinct. Accordingly, an SQL environment is leveraged to perform efficient, complex and intensive queries and/or operations using resource query constraint(s) from a resource constraint(s) store and the filter component over large set(s) of resources from the resource pool.

Abstract: A domain processor includes at least one robot modeler, at least one domain modeler, and at least one Query Processor Modeler. The robot modeler includes means for modeling at least one computer-based robot, the robot adapted for accessing at least one web-based data source including entities in a predefined domain. The domain modeler includes means for modeling at least one domain model and means for establishing at least one extraction model and at least one storage model. The Query Processor Modeler includes means for selecting at least two Query Processor elements from a set of predefined query processor elements, means for combining the selected Query Processor elements, and means for executing the associated query processor elements on at least one computer system, at least one of the query processor elements of the associated query processor elements being a Robot query processor Element adapted for accessing the web-based data source.

Abstract: Search results are provided in a format that allows users to efficiently determine whether audio or video documents identified from a search query actually contain the words in the query. This is achieved by returning snippets of text around query term matches and allowing the user to play a segment of the audio signal by selecting a word in the snippet. In other embodiments, markers are placed on a timeline that represents the duration of the audio signal. Each marker represents a query term match and when selected causes the audio signal to begin to play near the temporal location represented by the marker.

Abstract: A method for generating a list of media items selected from a library of media items in response to only a single action being performed. The method displays information identifying a portion of the library of media items and selects a group of media items from the portion of the library in response to only a single action. By utilizing only a portion of the media items in the library, the generated list of media items is desirable to a user by excluding less desirable media items.

Abstract: A method for saving search query information on a server coupled to the Internet as a search folder. The method may include the steps of: identifying a user communicating with the server; storing the search query associated with the user in a data store on the server responsive to a user instruction to store the search query; and submitting the query to an Internet search engine for execution based on a triggering event. A data structure for storing the search folder is also described.

Abstract: In a multi-tenant environment, synchronous processing requests from clients associated with tenants are handled by middle tier servers, which forward requests for asynchronous processing to queues associated with organizational databases for each tenant directed by a locator service. A group of independent asynchronous processing servers are used to perform the asynchronous processing interacting with the databases in a distributed manner. The allocation of the requests among the asynchronous servers is managed by an exponential back off for organizations with no waiting requests algorithm combined with a quota system based on historic load for organizations that have requests. The independence of the synchronous and asynchronous processing servers, as well as the distributed interaction between the asynchronous processing servers and the databases enables scalability of the system based on request types and implementation of reliable recovery mechanisms.

Abstract: A mechanism by which a server system executing a host application monitors utilization of a fractionally reserved space on a volume storing application data. The server system executes space reservation policies to ensure that the host application is not halted due to inability to create snapshots on the volume. In one implementation, the server system alerts a system administrator if the rate of change in the size of data snapshots exceeds a specified threshold and initiates deletion of backup datasets stored on the volume if the size of a data snapshot exceeds the available space on the volume.

Abstract: A system for the entry of notes on a policy or claim, wherein the notes, after submission, are stored is non-editable form and are locked in a database for historical archival. In one scenario, the entered notes are editable and can be deleted for a pre-set time period, wherein, after the expiration of the pre-set time period, the entered notes are stored is non-editable form and are locked in a database for historical archival. Filters can be used to categorize and render the stored notes based on a set of categories.

Abstract: A method is described for managing an application's cached persistent data with different isolation levels. The different isolation levels include: 1) requesting a lock for a first item of database data in response to the first item of database data not being cached and not yet having been used by the application; 2) requesting a lock for a second item of cached database data in response to the second item of database data being updated for a first time by the application; and, 3) requesting a lock for a third item of cached database data in response to it being confirmed that the third item of database data will need to be updated in its database.

Abstract: A method and system for increasing the computational and network efficiency of presence servers having collections of publications is provided. The presence system uses several techniques that enable a presence server to provide rich presence information without requiring expensive processing. First, the presence system accepts batches of publication updates in a single presence update request. Similarly, the presence system accepts batches of subscription requests. Next, the presence system supports new expiration types for publication update requests that eliminate the need for a publishing user to continually refresh presence information that has not changed. Finally, the presence system accepts access lists that contain membership groups rather than an individual list of users that are to have access to a particular presence collection.

Abstract: The present invention relates to a method and system for effectively providing search results by referring to local information related to a searcher in response to a search request from the searcher through a communication network. The present invention provides a method for providing local information search results, comprising the steps of maintaining local information for searching related to the searcher, relating a plurality of search items related to a network information provider to a keyword and local information related to the network information provider, receiving a search request from the searcher, identifying at least more than one search item related to the keyword that meets the search request and selecting a search item related to local information matched to the local information for searching among the identified search items, and arranging at least a part of the search items according to a predetermined search item arranging method in arranging the selected search items.

Abstract: A b-tree may contain multiple keys stored in a normalized form. This normalized form allows keys to be quickly compared and may be used in compressing the underlying b-tree. Each normalized key is compressed relative to the previous key by replacing the common prefix bytes with a common prefix length byte containing the number of bytes in common between the key and the previous key. The compressed keys are stored sequentially in memory with no gaps in between.

Abstract: A method is described for making a change in an object oriented relational database in which objects that represent items of persistent data are related to other objects that represent items of persistent data. The method comprises referring to a backward reference contained in a first object that does not have visibility to a second object that the first object is in a unidirectional relationship with. The first object represents a first item of persistent data. The second object represents another item of persistent data. The backward reference identifies the second object. The method also comprises removing the unidirectional relationship, adding a new unidirectional relationship from a third object to the first object, and modifying the backward reference to identify the third object rather than the second object. A cascade delete method that uses a backward reference is also described.

Abstract: Use situations of storage devices utilizing a storage area network (SAN) are predicted and the devices are automatically managed on the basis of the predicted results. To manage the devices utilizing the SAN, there is established the policy prescribing actions each executed when some object to be judged satisfies some condition with regard to storage devices. Information concerning use situations of the devices is collected and a value of an object to be judged of the policy is calculated based on collected information to judge whether the value of the object to be judged satisfies a condition of the policy. When the condition is satisfied, the action of the policy is executed. The objects to be judged of the policy may be actual result values in the past, current values or prediction values in the future relative to use capacity of storages, the number of I/O operations of disk or fragmentation.

Abstract: A method is described for making a change in an object oriented relational database in which objects that represent items of persistent data are related to other objects that represent items of persistent data. The method comprises referring to a backward reference contained in a first object that does not have visibility to a second object that the first object is in a unidirectional relationship with. The first object represents a first item of persistent data. The second object represents another item of persistent data. The backward reference identifies the second object. The method also comprises removing the unidirectional relationship, adding a new unidirectional relationship from a third object to the first object, and modifying the backward reference to identify the third object rather than the second object. A cascade delete method that uses a backward reference is also described.

Abstract: A system and method are provided to manage different types of workload. The method comprises receiving a request, determining a class of the request, determining a priority level associated with the class of the request, and servicing the request utilizing the priority level of the class of the request. The class of the request may be associated with a target volume, as well as with a network protocol, or with a network port.

Abstract: A progress UI is displayed within a user's web page for long-running requests. For each long-running request, a progress UI is displayed to the user indicating that the long-running request is being processed until the long-running request has been processed. The progress UI may be a progress indicator showing the user the status of the processing, or the status message could be some other message to the user indicating that the long-running request is still being processed. While the long-running request is being processed, data is sent from the server to the user's browser at a rate such that the server performing the long-running request does not time out. The current state of a web page may be maintained such that when a long running request is made the web page that contains the control that issued the long-running request is not automatically refreshed when the long running request takes place.

Abstract: An electronic document is parsed to remove irrelevant text and to identify the significant elements of the retained text. The elements are assigned scores representing their significance to the topical content of the document. A matrix of element-pairs is constructed such that the matrix nodes represent the result of one or more functions of the scores and other attributes of the paired elements. The resulting matrix is a compact representation of topical content that affords great precision in information retrieval applications that depend on measurements of the relatedness of topical content.

Abstract: A method and apparatus for data recovery are disclosed. A plurality of queries executing in a database system are tracked. A query with a longest duration is selected and undo retention duration is calculated for supporting the longest query.