Abstract: A method and system for retrieving subscription information associated with a content file are provided. The method, according to an example embodiment, includes automatically generating a hash of the content file and retrieving an identifier for the subscription from a peer machine participating in a distributed hash table network. Subscription information is then retrieved using the subscription identifier, either from a specially configured subscription server or from a subscriber machine in the distributed hash table network.

Abstract: Methods for creation of a content association system in which a client application communicates to a distributed hash table network an association between one piece of content in a client's library and one other piece of content in the client's library are described. The client creates a hash for a first file in the library and a reference to a second file in the library. The client stores the reference to the second file in the distributed hash table at a node corresponding to the hash. To discover files associated with a file in a peer's library, the peer creates a hash for a file in its library and retrieves references to other files from the distributed hash table.

Abstract: A method and system for facilitating peer-to-peer networking among local peers are described. Hashes are generated from a digital content file and virtual coordinates of virtual nodes in a virtual coordinate system. The generated hashes are then used to retrieve peer connection information.

Abstract: In a method and system for matching content between content sources, a first set of metadata describing a first content item is compared to a second set of metadata describing a second content item. Based on the comparing, an accuracy score is generated. The accuracy score indicates an amount of similarity between the first set of metadata and the second set of metadata. The accuracy score is compared to a predetermined accuracy threshold value. Based on the accuracy score being greater than or equal to the predetermined accuracy threshold value, a determination is made that the first content item and the second content item are a match. Based on the accuracy score being less than the predetermined accuracy threshold value, a determination is made that the first content item and the second content item are not a match.

Abstract: In a method and system for matching content between content sources, a first set of metadata describing a first content item is compared to a second set of metadata describing a second content item. Based on the comparing, an accuracy score is generated. The accuracy score indicates an amount of similarity between the first set of metadata and the second set of metadata. The accuracy score is compared to a predetermined accuracy threshold value. Based on the accuracy score being greater than or equal to the predetermined accuracy threshold value, a determination is made that the first content item and the second content item are a match. Based on the accuracy score being less than the predetermined accuracy threshold value, a determination is made that the first content item and the second content item are not a match.

Abstract: In a method and system for facilitating peer-to-peer networking, a download set identifying content being downloaded by a client program is transmitted to a network device. In response to an offline event indicating that the client program is no longer downloading the content over a network, an online event indicating the client program is resuming the downloading of the content is transmitted to the network device. Downloading of the content identified by the download set is completed by synchronizing the client program with the network device.

Abstract: Methods for creation of a content association system in which a client application communicates to a distributed hash table network an association between one piece of content in a client's library and one other piece of content in the client's library are described. The client creates a hash for a first file in the library and a reference to a second file in the library. The client stores the reference to the second file in the distributed hash table at a node corresponding to the hash. To discover files associated with a file in a peer's library, the peer creates a hash for a file in its library and retrieves references to other files from the distributed hash table.

Abstract: A method and system for retrieving subscription information associated with a content file are provided. The method, according to an example embodiment, includes automatically generating a hash of the content file and retrieving an identifier for the subscription from a peer machine participating in a distributed hash table network. Subscription information is then retrieved using the subscription identifier, either from a specially configured subscription server or from a subscriber machine in the distributed hash table network.

Abstract: A method and system for facilitating peer-to-peer networking among local peers are described. Hashes are generated from a digital content file and virtual coordinates of virtual nodes in a virtual coordinate system. The generated hashes are then used to retrieve peer connection information.

Abstract: A data processor comprises a number of databases for storing records and a plurality of user systems capable of accessing the databases. The user systems each include a datastore/application environment instance with which users can interface. Host systems may include more than one instance. The datastores contain time-versioned views of records. The data processor is operable in at least two modes, a normal operation mode in which an evaluation in response to a user enquiry can be carried out using records relevant to a current viewpoint time and time span, and a recovery operation mode in which records relevant to a viewpoint time and time span for a previous evaluation are accessed and used to exactly reproduce the previous evaluation.

Abstract: A data processor comprises a number of databases for storing records and a plurality of user systems capable of accessing the databases. The user systems each include a datastore/application environment instance with which users can interface. Host systems may include more than one instance. The datastores contain time-versioned views of records. The data processor is operable in at least two modes, a normal operation mode in which an evaluation in response to a user enquiry can be carried out using records relevant to a current viewpoint time and time span, and a recovery operation mode in which records relevant to a viewpoint time and time span for a previous evaluation are accessed and used to exactly reproduce the previous evaluation.

Abstract: A data processing method evaluates expressions, including temporally-scoped operands, to produce temporally-scoped results. Each of the temporally-scoped operands and results includes a sequence of one or more value instances, each value instance including a data item, a start time, and an end time, the start time and end time defining a time span in which the data item is valid. An expression involving a binary operator is evaluated by scanning each of the operands of the binary operator and generating a value instance in the result, in respect of each time span in which each operand has a constant value.

Abstract: In a time-versioned storage mechanism, data is stored as a plurality of records, each including at least one attribute, a time span indicating the time span for which the attribute is valid, an insertion time indicating when the record was created, and a type field. The type field indicates whether the record is a concrete record, a delta record that possibly modifies the attribute value of a previous concrete or delta record, or an archive record replacing one or more records that have been archived. The data is accessed to find an attribute value from the point of view of a specified viewpoint time, by retrieving only records with insertion times not later than said viewpoint time, and constructing an attribute value from the retrieved records. The data is updated only by adding concrete records or delta records, without modifying attribute values in the concrete records or delta records.

Abstract: A method for evaluating an expression comprises issuing parallel requests to acquire a plurality of operands. If, upon receipt of a first subset of the operands, it is determined that a second subset of the operands is no longer required in respect of a particular time span, the request for the second subset cancelled for that particular time span. If one operand contains an error indication for a particular time span, the method continues with the request for the other operand for that particular time span, and returns an “error” for that particular time span only if the request for the other operand is not cancelled.