Abstract: A method for providing personalized, shared bookmarks that determines which bookmarks are to be shared with a given user based at least in part on an interest profile associated with that user. The interest file can be used to define important other users, based on attributes, titles, or names associated with those other users. Shareable bookmarks defined by important other users are provided to the local user through the local navigation program. The list of important persons used to define which bookmarks should be shared may be determined in various specific ways. An interest profile may be automatically maintained containing a list of persons that are important for a specific user. The list may be automatically calculated based on information such as recent email traffic, and/or can be defined manually. Privacy issues may be addressed by enabling a user to prevent certain bookmarks they define locally from being shared.

Abstract: System and methods for range and cover queries in overlay networks are described. In one aspect, respective node intervals [s, t] of multiple node intervals are allocated to corresponding nodes in a segment tree. Each integer s and t corresponding to an index to a sorted array of possible endpoints of the node intervals. Each node in the segment tree corresponds to a particular computing device (peer) of multiple computing devices in an overlay network. A node interval [s, t] is assigned to a particular peer associated with a key. This assignment provides a connection between node interval structural information of the segment tree and an underlying structure-less routing substrate in the overlay network. The segment tree is distributed across the peers for query operations over DHT.

Abstract: Reducing memory and/or storage requirements of a repository in a resource variable value save and retrieve operation implemented in computer hardware and/or software is accomplished by minimizing the number of repository entries saved by creating and saving repository entries only for resource variables that have non-normal values, and by discarding repository entries when the values of the resource variables corresponding to those entries have returned to the normal value. The number of repository entries, at any point in time, is equal to the count of resource variables known to have non-normal values. Each repository entry includes a resource variable identifier and the value of the resource variable.

Abstract: Example embodiments improve the lookup times and modification costs of indexing on a dynamically sorted list by using a combination of data structures to determine index values for secondary keys and vice versa. More specifically, exemplary embodiments provide a combination of a binary tree (e.g., a balanced binary tree) with a lookup table (e.g., linear dynamic hash table) to provide scalable retrieval of entries by either an array index or a secondary key. For example, given a key, a hash thereof returns a node placement within a balanced binary tree. This positioning can then be used at runtime to determine an index value for a data record, resulting in a near real-time lookup cost. Also note that modifications, such as reordering, insertions, and deletions, become a function of the nodes depth in the binary tree, rather than a linear function of number of records within the data array.