Abstract: Techniques are provided for managing caches in a system with multiple caches that may contain different copies of the same data item. Specifically, techniques are provided for coordinating the write-to-disk operations performed on such data items to ensure that older versions of the data item are not written over newer versions, and to reduce the amount of processing required to recover after a failure. Various approaches are provided in which a master is used to coordinate with the multiple caches to cause a data item to be written to persistent storage. Techniques are also provided for transferring data items and locks associated with the data items from one node to another.

Abstract: A method for managing a collection of objects, comprises selecting a property which is common to all of the objects; creating a plurality of exemplar structures, at least one exemplar structure for each object; prototypically categorizing the exemplar structures; and using the exemplar structures to access information regarding said collection. Each exemplar structure comprises an exemplar, which is a good example of the property; a broader term, which provides context to the exemplar; an object identifier, which identifies one of the collection of objects; and at least one attribute, which describes the exemplar.

Abstract: A method and apparatus for transferring records between database tables using a transaction log. In one embodiment of the method, a first application generates a transaction for deleting a record from a first table in a database. In response to the generation of the first transaction, a copy of the record is stored in an entry of a transaction log before the record is deleted from the first table. A second application generates an instruction for copying the record from the transaction log to a second table, and the record is copied from the entry to the second table.

Abstract: Methods and apparatus are disclosed in which locks for shared data are acquired by specifying a pathname for the shared data. One embodiment, among others, includes a method for locking shared data. The method includes the steps of receiving a first request to acquire a lock for a first pathname, storing the first pathname in a lock store, searching the lock store for a corresponding pathname in response to a further request to acquire a lock for a second pathname, and if the second pathname corresponds to the first pathname in the lock store then denying the further request to acquire the lock for the second pathname.

Abstract: A method for enrichment of text which enables mixed data mining includes generating a model for structured data found in tables of a database. In the model, semantically-linked terms are associated with referents, such as field names or cell content of the fields, of the structured data. The referents may be a business object or refer to a business object. A plurality of candidate referring entities in textual data in the database, such as chunks of free text, is identified. For each candidate referring entity, a similarity measure between the candidate referring entity in the textual data and the model is computed to identify referring entities of the candidate referring entities and corresponding business objects/referents to which the referring entities refer. The textual data is enriched with information derived from the business objects.

Abstract: A system and method for an ultimate locking mechanism which minimizes a lock period for modifying shared data in a shared database. A process is executed as one or more initial instances and a final instance. Each initial instance reads the shared data from the shared database without acquiring a lock on the shared database. The locking mechanism obtains results that are directed to modifying the shared data and buffers the results at least partially. During or after each of the initial instances, it determines whether the next instance is to be the final one (e.g., the estimated runtime of the next instance is acceptable as the lock period). In response to a positive determination, the final instance of the process is executed. The final instance uses at least one of the buffered results during execution and acquires the lock on the shared database to modify the shared data.

Abstract: A method and system for creating vertical search engines with cloud computing networks. The cloud computing networks include a cloud communications network using public networks, private networks, community networks and hybrid networks. The cloud communications network provides on-demand vertical search services, broadband network access, resource pooling, rapid elasticity and measured electronic services for vertical search engines. The method and system dramatically improve a vertical search engine infrastructure used by searchers by providing vertical electronic information using less bandwidth and less processing cycles via the cloud communications network than via a non-cloud communications network. Custom vertical search engines can be created by a user with QR bar codes and other types of bar codes and other types of custom information.

Abstract: Methods, apparatus, and articles of manufacture for accessing process control data involve loading a client object and communicating a data access request from the client object to a real object configured to communicate with a server. The real object then communicates a query to the server based on the data access request and obtains process control data from the server in response to the query. The process control data is then mapped from a first data layout associated with a server schema to a second data layout associated with a client schema. The mapped process control data is then communicated to an application.

Abstract: A media object being played by a user may be marked by creating a mark object comprising the playback time when the mark was created. The time may be used to reference metadata with information about the media object at the time referenced. The metadata may be used to launch web searches corresponding to elements of the media at the time in question, for example, a back up singer at a point in a music track or the name of a resort in a movie. The searches may be performed from media player or the mark object may be transferred to a networked computer for performing the searches. The technique is equally applicable to portable media players, software or firmware media players on computers, or set top boxes.

Abstract: Method and apparatus for organizing data by overlaying a searchable database with a directory tree structure. The method includes generating the directory tree structure that includes nodes comprising a designated category for each node and branches comprising links between the nodes, and generating one or more pointers. Each pointer corresponds to a specific node and the pointer links the specific node to an item of data within the searchable database. All pointers associated with the specific node link related items of data corresponding to the designated category. Each node within the directory tree structure can include a corresponding html address. Items of data can be web-based multimedia including audio, video, images, and appropriately formatted text, displayed in an encyclopedia-like format. Nodes, branches, and pointers within the directory tree structure can continually be added, edited, or deleted.

Abstract: Methods for reviewing a collection of documents to identify relevant documents from the collection are provided. A search of the collection can be run based on query terms, to return a subset of responsive documents. A probability of relevancy can be determined for a document in the returned subset, and the document is removed from the subset if it does not reach a threshold probability of relevancy. Documents in a thread of a correspondence (for example, an e-mail) in the responsive documents subset can be added to the responsive documents subset. Further, an attachment to a document in the responsive documents subset can be added to the responsive documents subset. A statistical technique can be applied to determine whether remaining documents in the collection meet a predetermined acceptance level.

Abstract: Virtual attribute logic adds virtual attributes to a Lightweight Directory Access Protocol (“LDAP”) response, and meta-virtual attribute logic adds additional virtual attributes to provide further information about the virtual attributes. For example, a Distinguished Name (“DN”) of an entry that provided a virtual attribute may be added by the meta-virtual attribute logic.

Abstract: A novel system for automatically indicating the specific identity of ambiguous named entities is provided. An automatic disambiguation data collection is created using a reference resource. Explicit named entities are catalogued from the reference resource, together with various abbreviated, alternative, and casual ways of referring to the named entities. Entity indicators, such as labels and context indicators associated with the named entities in the reference resource, are also catalogued. The automatic disambiguation collection can then be used as a basis for evaluating ambiguous references to named entities in text content provided in different applications. The content surrounding the ambiguous reference may be compared with the entity indicators to find a good match, indicating that the named entity associated with the matching entity indicators is the intended identity of the ambiguous reference, which can be automatically provided to a user.

Abstract: A facility for tailoring navigation results is described. The facility receives a navigation request from a distinguished user. In response, the facility identifies a user group to which the distinguished user belongs and presents to the distinguished user a navigation result responsive to the navigation request that is adapted for members of the identified user group.

Abstract: One embodiment of the present invention provides a system that automatically annotates an image. During operation, the system receives the image. Next, the system extracts image features from the image. The system then identifies other images which have similar image features. The system next obtains text associated with the other images, and identifies intersecting keywords in the obtained text. Finally, the system annotates the image with the intersecting keywords.

Abstract: Techniques are provided for managing caches in a system with multiple caches that may contain different copies of the same data item. Specifically, techniques are provided for coordinating the write-to-disk operations performed on such data items to ensure that older versions of the data item are not written over newer versions, and to reduce the amount of processing required to recover after a failure. Various approaches are provided in which a master is used to coordinate with the multiple caches to cause a data item to be written to persistent storage. Techniques are also provided for managing checkpoints associated with the caches, where the checkpoints are used to determine the position at which to begin processing recovery logs in the event of a failure.

Abstract: A composite storage server employs a plurality of distributed storage sites including a mount site, a source copy site and one ore more copy target sites for executing a storage of volume data within the composite storage server. In operation, a deferred copy target site receives a communication of a source copy complete message from the mount site, the source copy complete message being indicative of the source copy site having a complete copy of the volume data, and detects a transition by the mount site of the host job from an active status to an inactive status subsequent to the communication of the source copy complete message from the mount site. Based on the inactive status of the host job, the deferred copy target site pulls the volume data from a peer distributed storage site having a complete copy of the volume data.

Abstract: An improved system and method for flexible object placement and soft-state indexing of objects in a distributed object store is provided. A distributed object store may be provided by a large number of system nodes operably coupled to a network. A system node provided may include an access module for communicating with a client, an index module for building an index of a replicated data object, a data module for storing a data object on a computer readable medium, and a membership and routing module for detecting the configuration of operable nodes in the distributed system. Upon failure of an index node, the failure may be detected at other nodes, including those nodes that store the replicas of the object. These nodes may then send new index rebuilding requests to a different node that may rebuild the index for servicing any access request to the object.

Abstract: A method and apparatus for loading an XML document into memory is provided. A client loads one or more array elements into a first partition of an array that is maintained in memory. Each array element represents an XML element of an XML document. Upon determining that an amount of data maintained in the first partition exceeds a first threshold, the client subsequently loads array elements into a new partition of the array. Upon determining that an amount of data maintained in the memory of the client exceeds a second threshold, the array elements of the least recently used partition are persistently stored in a database without persistently storing the entire XML document. When the last XML element of the XML document is loaded into a partition of the array, that partition is persistently stored in the database, thereby causing the entire XML document to be stored in the database.

Abstract: A composite storage server employs a plurality of distributed storage sites including a mount site, a source copy site and one or more copy target sites for executing a storage of volume data within the composite storage server. In operation, an immediate copy target site receives a communication of a source copy complete message from the mount site, the source copy complete message being indicative of the source copy site having a complete copy of the volume data. Based on the source copy complete message, the immediate copy target site pulls the volume data from a peer distributed storage site having a complete copy of the volume data (e.g., the source copy site, the mount site or another copy target site).