Abstract: A system that facilitates the distribution and redistribution of chunks of data among multiple servers, may identify servers to store replicas of the chunks based on at least one of utilization, prior data distribution, and failure correlation properties, and place the replicas at the identified servers. The system may monitor total numbers of replicas available in the system, identify chunks that have a total number of replicas below one or more thresholds, assign priorities to the identified chunks, and re-replicate the identified chunks based on the assigned priorities. The system may monitor utilization of the servers, select one or more of the replicas to redistribute based on the utilization of the servers, select one or more of the servers to which to move the one or more replicas, and move the one or more replicas to the selected one or more servers.

Abstract: Techniques for writing data in a distributed database system having a plurality of members and a master are disclosed. In one embodiment, a write request is received at an originating member. The write request is applied to a version of a database on the originating member and is placed in a journal queue of items for propagating to the master in one single atomic action. The write request is propagated to the master. Whether the propagated write request is associated with a conflict is determined, and in an event it is determined that the propagated write request is associated with the conflict, an indication that the write request is associated with the conflict is sent to the originating member.

Abstract: A method and a system for maintaining consistency of replicated files distributed over a plurality of independent processing slave nodes part of an application tier of a multi-tier client/server data processing system are described. The replicated files are distributed from a master node of a master tier. Upon reception of an update request to update a master database a new version of a replicated file is first generated and stored in a shared file system. A notification of availability of the new version is forwarded to a synchronizing slave node and broadcasted to all slave nodes. Each slave node preloads the new version of the replicated file from the shared file system and acknowledges successful completion. Upon reception of all acknowledgments in the synchronization slave node a notification of preloading achievement is forwarded to the master server which updates the master database.

Abstract: A distributed storage system and a method for storing objects based on locations. The distributed storage system may include a plurality of data nodes, at least one selection agent, a client, and a proxy server. The plurality of data nodes may be configured to be grouped into a plurality of zone groups based on locations of the plurality of data nodes and configured to store a target object and replicas of the target object. The at least one selection agent may be configured to select multiple target zone groups and select one target data node for each one of the selected multiple target zone groups.

Abstract: In a master device, an address for a transmission origin and an address of an ultimate transmission destination, included in a message from an end device, are stored, as a pair, as proxy information, and the address of the transmission origin included in the message is overwritten with the local communication address, to form a proxy message to the destination device. Moreover, the master device performs a search for a round-trip route to the destination device and sends the proxy message to the destination device following the outbound route that has been searched. The destination device, upon receipt of a proxy message, sends back a message to the master device following the inbound route that has been searched by the master device. The master device uses the proxy information to send back, to the end device, the message from the destination device.

Abstract: Disclosed are various embodiments for distributing data items within a plurality of nodes. A data item update request is replicated from a master node in a plurality of nodes to a plurality of slave nodes within the plurality of nodes. The replicated data item update request is determined to be locality-based durable. Responsive to the determination that the replicated data item update request is locality-based durable, the data item update request is confirmed to a client, wherein the client had originated the data item update request. Upon failover of the master node to another node within the plurality of nodes, a fault-tolerant failover quorum ensures that all previously confirmed updates are found and recognized by the new master node.

Abstract: A communication device includes a database. The database is configured to store data records to be synchronized with a host device and to store, for each record, a corresponding device synchronization parameter (DSP) and a corresponding host synchronization parameter (HSP). The DSP indicates a version number assigned to a current version, of the respective data record, as stored in the database of the device. The HSP indicates a version number assigned to a current version, of the same record, as stored in the host device.

Abstract: A method for updating a plurality of disk images, each of the plurality of disk images derived from a common base disk image and a delta image comprising a plurality of delta files, includes applying a delta file to a base disk image to generate a second disk image comprising a portion of the base disk image modified by the delta file and an unmodified portion of the base disk image. Each delta file represents at least one difference between one of the plurality of user disk images and the base disk image. The method includes applying a patch to a copy of the base disk image, and determining that the patch is applied to a portion of the base disk image corresponding to the unmodified portion of the base disk image. The delta file is applied to the patched copy of the base disk image.

Abstract: Described is a technology in which an image retrieval system is updated incrementally as new image data becomes available. Updating is incrementally performed and only triggered when the new image data is large enough or diverse enough relative to the image data currently in use for image retrieval. Incremental updating updates the leaf nodes of a vocabulary tree based upon the new image data. Each leaf node's feature frequency is evaluated against upper and/or lower threshold values, to modify the nodes of the tree based on the feature frequency. Upon completion of the incremental updating, a server that performed the incremental updating is switched to an active state with respect to handling client queries for image retrieval, and another server that was actively handling client queries is switched to an inactive state, awaiting a subsequent incremental updating before switching back to active state.

Abstract: A high availability cluster and method of storage medium management in such high availability cluster. A number k of nodes belonging to the cluster, where k?2 and includes a master node, are provisioned with high-access-rate and low-access-rate storage media. A file is written to the high-access-rate medium of a serving node selected from among k-1 nodes excluding the master node. The file is also written to low-access-rate medium of each of k-2 nodes excluding the master node and the serving node. A distributed storage medium management protocol supervises file migration from the, low-access-rate medium of a back-up node to the high-access-rate medium of the back-up node upon disruption of file availability on the serving node. File rebalancing relies on parameters including popularity, write- and read-requests, capacity, processing load or cost.

Abstract: Data replication management which enables rapid retrieval while increasing the performance of the entire system, and maintaining data synchronization regarding successively updated data is performed. There are steps which comprises a step that when a slave node which has received an instruction for retrieval does not receive a return massage from a master node within a predetermined time period (Ts1) from the transmission of a request message to the master node, the slave node requests the master node to provide a transaction log up to the latest version with respect to the update of a master database; a step that the master node which has received the request transmits the transaction log to the slave node; and a step that the slave node updates a replica database with reference to the transaction log transferred from the master node.

Abstract: Methods and systems are described that involve replica placement strategy for distributed systems. At the time of index creation, initial index replica placement is decided. The first index replica is placed locally on the current processing server node. This server node operates as a master host for the first replica. The other index replicas are placed on different hosts depending on the index type, split index or non-split index, and a set of criteria. For non-split indexes, the set of criteria includes: a number of recently created replicas per host, resource usage per host, and a total number of replicas per host. For split indexes, the set of criteria includes: a number of replicas of any split index part per host and a number of local first replicas of split index parts. If all criteria re equal, the first host in alphanumeric ordering receives a next replica.

Abstract: Methods and apparatus are disclosed for facilitating online storage of files (e.g., audio tracks, video, etc.) for playback/access or sale/exchange by the owners of the files without violating copyrights that copyright holders have in the files. For example, by providing a playback service that does not store additional versions of an audio file when the file is transmitted to, and immediately played on, a user device without buffering, the present invention avoids violating copyright laws by not making copies of the file. Numerous other aspects are disclosed.

Abstract: A first tenant-nonspecific database table on a repository accessible to an application server of a multi-tenant software delivery architecture can maintain a first record designating a first predefined generic field of a plurality of predefined generic fields. The first record can include an organization-specific master data field definition of the first predefined generic field maintained in a first tenant-specific definition field assigned to a first customer tenant of a plurality of customer tenants that are accessible via the application server. Each customer tenant of the plurality of customer tenants can provide a discrete organization-specific business configuration of a core software platform. A second tenant-nonspecific database table maintained on the repository can maintain a second record that can include a key value designating the first tenant, a record designator, and an organization-specific master data value corresponding to the first predefined generic field.

Abstract: A computer-implemented system of centrally managing core enterprise reference data of an enterprise that includes one or more processing units and one or more memory units, the system includes a storage medium having stored therein a process layer that implements one or more business configuration processes of one or more enterprise-level business workflows. The system further includes a storage medium having stored therein a service layer underlying the process layer that provides services that enable process tasks for the one or more business configuration processes and a storage medium having stored therein a data layer underlying the service layer and storing in a repository, core enterprise reference data that is received from one or more external data sources using a staging strategy that reduces data transfer time between the core enterprise reference data repository and the one or more external data sources.

Abstract: The present invention relates to a method for monitoring a bookmarked web page and a system and a computer program implementing such a method. A method according to an embodiment of the invention includes a first phase, including steps for storing, in association with each other, user identification data and an active version of the web page. The method further includes at least one iteration of a second phase, including a step for sending from user's browser to a network server a request for change information about the bookmarked web page since the stored version was active. On response of the server, if the web page has changed, the user has the possibility to choose to keep the stored old version of the web page or to accept the current version of the web page. The network server may be a server associated with the web page, e.g., a web site server, or an ISP server.

Abstract: A computer-implemented method is provided for managing and sharing picture files. In one embodiment of the present invention, the method comprises providing a server platform and providing a data store on the server platform for maintaining full resolution copies of the files shared between a plurality of sharing clients. A synchronization engine is provided on the server platform and is configured to send real-time updates to a plurality of sharing clients when at least one of the sharing clients updates or changes one of said files. A web interface may also be provided that allows a user to access files in the data store through the use of a web browser.

Abstract: One machine, i.e. computer, on a network, such as associated with a distributed database, e.g. a data store or a partition thereof, is designated as a master, which alone can issue system orderstamps for transactional operations, while other machines associated with the data store or partition thereof act as any of clients that submit transactions to the master, or as slaves that adhere to updates from the master. If a transactional operation on the distributed database is attempted on a client machine, and communication cannot be established with the master machine, the transaction fails. The distributed data store having such a master provides a method that decreases transaction time across the distributed database, and maintains consistent data between separate machines.

Abstract: The present invention provides a reproducing apparatus for reproducing a plurality of pieces of content data stored in a content data storage unit according to a play list defining reproduction order of the content data. The apparatus includes a play list storage unit, a request information generating unit, and a play list reconstructing unit. The play list storage unit stores the play list having a play list generating rule and identifying information for identifying the content data matching the play list generating rule. The request information generating unit generates reconstruction requesting information for requesting reconstruction of the play list. The play list reconstructing unit reconstructs at least a part of the play list stored in the play list storage unit into a play list having the play list generating rule corresponding to an apparatus use condition in response to the reconstruction requesting information generated by the request information generating unit.

Abstract: A system for resolving addresses in an internet protocol based network. The system includes an address resolving master database and a plurality of slave databases. A plurality of transfer agents are each allocated to different ones of the plurality of slave databases for reading data from the master database and writing it to the slave databases. Each slave database receives and stores either ENUM data or DNS data, but not both. A plurality of applications have read access to at least one of the plurality of slave databases.

Abstract: An apparatus and method of synchronizing a datum between a plurality of stores is disclosed. A version history is associated with the datum in each store. The version history has one or more entries, and each entry has an identifier and a value. The identifier identifies a store that has modified the datum, and the value indicates a number of modifications to the datum made by the store. When synchronizing the datum between stores, the version histories of the datum are compared to determine whether one version history is subordinate to another version history. The datum in the store having the subordinate version history is then replaced with the datum having the dominant version history. When compared, a conflict resolution by a user is required if the version histories are not identical, if the version histories do not have all the same identifiers, and if one version history does not contain all of the identifiers with equal or greater values of those in the other version history.

Abstract: Techniques are described for parallelizing qualifying window functions without reliance on partitioning criteria specified in the command that includes the qualifying window functions. Because the techniques do not rely on partitioning criteria specified in the command, the techniques may be used on commands in which no partitioning criteria is specified. In general, the techniques involve partitioning the work of a qualified window function into ranges, and sharing precomputed aggregate values between computational elements to calculate the value for the window functions.

Abstract: System and method for assignment of unique identifiers in a distributed environment. In a distributed system having a plurality of nodes, a method for allocating identifiers comprises steps of: allocating a pool of identifiers for use; maintaining lists of free identifiers in the pool at participating nodes; obtaining at a first node permission to update the lists of free identifiers; upon receiving permission to update the lists, allocating for the first node a set of identifiers from the lists; updating the lists of free identifiers to reflect allocation of the set of identifiers for the first node; sending the updated lists from the first node to other participating nodes; upon receiving the updated lists of free identifiers at each other participating node, updating each other participating node's respective copy of the lists of free identifiers; and relinquishing the first node's permission to update the lists of free identifiers.

Abstract: Implementations of the present disclosure provide for automation of manual tasks executed on an application server. Implementations include generating a manual action request at the application server, the manual action request including at least one parameter, transmitting the manual action request to an administrator computer, determining that an automation module corresponding to the manual action request exists within a database based on the at least one parameter, providing the automation module to the application server, and executing the automation module on the application server to resolve a task corresponding to the manual action request.

Abstract: Processing data synchronization sessions includes processing a request to initiate a synchronization session from one or more clients to update one or more data records that include one or more data items. The one or more clients are selectively identified as one of a trusted client and an untrusted client based on one or more properties of the synchronization session, wherein the trusted client is configured to support all data classes defined by the server. The one or more clients are detected as being configured to support field level differencing that sends changed data items only for the one or data records or record level differencing that sends all of the data items included in the one or more data records.

Abstract: Mounting and populating a mirrored version of at least a portion of a file system of a recruiter machine at a volunteer machine performing one or more data processing tasks for the recruiter machine is disclosed. In some embodiments, an input stored in such a dedicated file system for the recruiter machine at the volunteer machine may be locally retrieved and reused, if still consistent with a corresponding input stored in a file system at the recruiter machine, when performing a data processing task for the recruiter machine at the volunteer machine. In some embodiments, if an input required by the volunteer machine to perform a data processing task for the recruiter machine is not cached in such a dedicated file system for the recruiter machine at the volunteer machine in a state that is consistent with a corresponding input stored in a file system at the recruiter machine, the input is obtained from the recruiter machine.

Abstract: A method and system of validating a differential update to a computer system. One method includes comparing a list of files in a new computer system image with a list of files in a former computer system image to construct a manifest list of files comprising a subset of the new computer system images and the former computer system images. The method further includes associating information with the manifest list to facilitate determining whether a differential update comprising differences between the new computer system image and the former computer system image is valid. The method also includes comparing a list of files in a computer system to receive the differential update against the manifest list of files and using the associated information to determine if the differential update is valid for the computer system.

Abstract: Techniques for writing data in a distributed database system having a plurality of members and a master are disclosed. In one embodiment, a write request is received at an originating member. The write request is applied to a version of a database on the originating member and is placed in a journal queue of items for propagating to the master in one single atomic action. The write request is propagated to the master. Whether the propagated write request is associated with a conflict is determined, and in an event it is determined that the propagated write request is associated with the conflict, an indication that the write request is associated with the conflict is sent to the originating member.

Abstract: A method for determining membership in a group of notification recipients and issuing a notification to the group of notification recipients, is disclosed. The method includes associating a set of potential recipients of notifications with at least one descriptor and dynamically forming a group of recipients to receive at least one notification based on the descriptors currently associated with the set of potential recipients of notifications. The method also includes issuing the at least one notification to the group of recipients. A system for determining membership in a group of notification recipients and issuing a notification to the group of notification recipients, is also provided.

Abstract: A priority-based method for replicating data is disclosed herein. In one embodiment, such a method includes providing a primary storage device and a secondary storage device. Multiple storage areas (e.g., volumes, groups of volumes, etc.) are designated for replication from the primary storage device to the secondary storage device. A priority level is assigned to each of the storage areas. Using these priority levels, the method replicates the storage areas from the primary storage device to the secondary storage device in accordance with their assigned priority levels. Higher priority storage areas are replicated prior to lower priority storage areas. A corresponding computer program product and system are also disclosed herein.

Abstract: A method and system are disclosed allowing for determining those users of multiple users who satisfy desired condition(s), where characteristics of the users in at least some embodiments vary dynamically. In at least one embodiment, the method includes receiving at a server device a request for a determination regarding which of a plurality of users satisfies a plurality of conditions respectively relating to a plurality of user characteristics, and obtaining at the server device a conditions specification. Additionally, the method includes accessing at least one repository in which is stored information regarding the users to obtain at least some of the information, the information concerning the user characteristics.

Abstract: According to one embodiment, a file processing apparatus includes an acquisition module, a change module, an association storage module, a receiver, a creator, a call module, a determination module, a file determination module, and an output module. The acquisition module acquires a first file having a first file name. The change module changes the first file name to a second file name. The association storage module stores the file names. The receiver receives a selection of the first file name. The creator creates a second file assigned the first file name. The call module calls an application capable of editing the second file. The determination module determines whether the name of the second file can be changed. When the file name can be changed, the file determination module determines whether a difference exists between the first and second files. When a difference exists, the output module outputs the second file.

Abstract: A new database design is implemented in which everything in the database is modeled with primitives, including the links and nodes for a graph tuple store. A query syntax provides a nested tree of constraints with a single global schema. Various optimization techniques for queries and replication techniques are also described.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for synchronizing a server and an on-demand database service. These mechanisms and methods for synchronizing a server and an on-demand database service can enable embodiments to synchronize a larger amount of data. The ability of embodiments to provide such feature can enable more effective synchronization of a user-level sharing entity database with a multi-user on-demand database service.

Abstract: Systems and methods for replicating data from a production server to a backup server include recording at least one operation on one or more data items stored in a volume of a production server. The operation may be recorded as at least one journal event in a memory. A determination may then be made regarding whether a system malfunction incident has occurred in the production server and if so, a first set of journal events may be transferred from the memory to an auxiliary storage at a first time instant. At a second time instant, a second set of journal events recorded in the memory between the first and second time instants may be transferred to the auxiliary storage. At one journal event stored in the auxiliary storage unit may then be sent for replication to a backup server.

Abstract: Methods and apparatuses of a trusted index structure in a network environment. In one embodiment, a data processing system includes a master device and at least one slave device to communicate with each other through a network; and a master lock status of a shared storage device to determine the master device.

Abstract: A method of updating an original version of content to a new version of content, in a non-volatile memory storage device, the method includes: providing a non-volatile content memory storage area arranged to accommodate a full version of content; providing an auxiliary memory area; performing, while at least part of the content memory storage area is not being updated, at least one pre-update operation corresponding to at least one in-place update operation applicable, in an in-place update, on the part of the content memory storage area; storing, while at least part of the content memory storage area is not being updated, at least one result of the performed at least one pre-update operation, on the auxiliary memory area; and performing an in-place update of the at least part of the content memory storage area utilizing the at least one result stored on the auxiliary memory area.

Abstract: Methods, systems and computer program products facilitate intelligent, automatic selection of content on consumer electronic devices to be backed up. User-defined rules selectively and automatically back up content and/or metadata about the content to a network, to another external device, or to an internal chip or memory. Via a user-friendly interface, users can initially set up rules for content backup, and thereafter, content backup can occur automatically. Stored back up content can be replicated on a device, for example, when the content has become corrupted on the device, when the content is lost, and/or when the CPE device crashes.

Abstract: A map-reduce compatible distributed file system that consists of successive component layers that each provide the basis on which the next layer is built provides transactional read-write-update semantics with file chunk replication and huge file-create rates. Containers provide the fundamental basis for data replication, relocation, and transactional updates. A container location database allows containers to be found among all file servers, as well as defining precedence among replicas of containers to organize transactional updates of container contents. Volumes facilitate control of data placement, creation of snapshots and mirrors, and retention of a variety of control and policy information. Also addressed is the use of distributed transactions in a map-reduce system; the use of local and distributed snapshots; replication, including techniques for reconciling the divergence of replicated data after a crash; and mirroring.

Abstract: A scalable access filter that is used together with others like it in a virtual private network to control access by users at clients in the network to information resources provided by servers in the network. Each access filter use a local copy of an access control database to determine whether an access request made by a user. Changes made by administrators in the local copies are propagated to all of the other local copies. Each user belongs to one or more user groups and each information resource belongs to one or more information sets. Access is permitted or denied according to of access policies which define access in terms of the user groups and information sets. Access is further permitted only if the trust levels of a mode of identification of the user and of the path in the network by which the access is made are sufficient for the sensitivity level of the information resource.

Abstract: Techniques to cross-synchronize data are described. An apparatus may comprise a cross-synchronization component to synchronize multiple data items for different application programs between multiple client devices synchronized using multiple synchronization circuits. The cross-synchronization component may determine whether changes to the multiple data items made at a first client device are propagated to a second client device using consistency information maintained by a consistency group item for a consistency group including the data items. Other embodiments are described and claimed.

Abstract: A client node on which a file system is mounted can be configured to efficiently handle content access requests after a snapshot is created. The client node can maintain generation numbers at a data block, a file, and a fileset level to determine whether a data block is part of a snapshot generation and consequently whether the data block is writable in a current generation. Data block mappings and write access permissions associated with the data blocks need not be revoked at the client node prior to creating the snapshot. Cached data block mappings can be accessed to identify data blocks for servicing a read request. The data block can be updated in place if the data block is not part of the snapshot generation. The write request can be serviced at a new data block if the data block is part of the snapshot generation.

Abstract: Systems and methods to provide a generic framework for application specific data exchange are shown. In example embodiments a data container is received. The data container includes data saved to a master data system. The data container is buffered. At least one backup data system is determined based on attributes of the data container. A determination is made as to whether the at least one backup data system is available. When the at least one backup data system is available, the data container is forwarded to the at least one backup data system.

Abstract: An apparatus and method is described for improving access to mostly read data on network servers. The preferred embodiments more efficiently utilize replicated data servers to minimize server response time for improved performance of data access to network servers by workload managing client requests across the primary server and all replicated servers when it is possible to do so. In preferred embodiments, a load balancer supplies the most current data for mostly read data transactions while maximizing server usage by workload managing client requests across the primary server and all replicated servers. Client requests are managed by a load balancer in the workload manager. Client requests are sent by the load balancer to replicated servers when a routing table (stale data marker list) indicates that the data is in a safe period. Clients are directed exclusively to the primary server only during data update times.

Abstract: Data replication management which enables rapid retrieval while increasing the performance of the entire system, and maintaining data synchronization regarding successively updated data is performed. There are steps which comprises a step that when a slave node which has received an instruction for retrieval does not receive a return massage from a master node within a predetermined time period (Ts1) from the transmission of a request message to the master node, the slave node requests the master node to provide a transaction log up to the latest version with respect to the update of a master database; a step that the master node which has received the request transmits the transaction log to the slave node; and a step that the slave node updates a replica database with reference to the transaction log transferred from the master node.

Abstract: A distributed database server receives a recursive lock/search request, acquires a local lock, and propagates the recursive lock/search request to a peer database server. Specific implementations within a Lightweight Directory Access Protocol (“LDAP”) server are described, and applications that can benefit from the recursive locking and searching functionality are discussed.

Abstract: A system facilitates the distribution and redistribution of chunks of data among multiple servers. The system may identify servers to store a replica of the data based on at least one of utilization of the servers, prior data distribution involving the servers, and failure correlation properties associated with the servers, and place the replicas of the data at the identified servers. The system may also monitor total numbers of replicas of the chunks available in the system, identify chunks that have a total number of replicas below one or more chunk thresholds, assign priorities to the identified chunks, and re-replicate the identified chunks based substantially on the assigned priorities.

Abstract: In some implementations, a method includes changing a master business object that is resident at a first location on a network, generating a change message for changing a replicated business object, the replicated business object being based on the master business object and being resident at a second location on the network remote from the first location, determining an update duration for updating the replicated business object, incorporating the change routine into a synchronization message when the update duration is less than a temporal constraint, and transmitting the synchronization message from the first location to the second location to update the replicated business object based on the synchronization message.

Abstract: A computer-readable, non-transitory medium stores a program that manages compressed file groups on a plurality of slave servers. The file groups include compressed files that are to be searched and have character strings. Each of the compressed file groups is expanded, using a Huffman tree that was used for compressing the compressed file group. A common compression parameter is generated based on appearance frequency, by summing, for each character, the appearance frequency in each of the compressed file groups. The expanded files are recompressed using the common Huffman tree such that sums of the access frequencies of the compressed files that are origins of the recompressed files are substantially equivalent among various slave servers. New archives including the re-compressed files are transmitted to the respective slave servers.

Abstract: Tools and techniques are described for synchronization and collaboration within peer-to-peer and client/server environments. These tools may provide methods that include establishing peer-to-peer relationships between two or more client systems. These relationships enable the client systems to create respective local instances of workspaces, shared between the client systems to allow them to collaborate with one another. The client systems may participate in peer-to-peer synchronization flows with one another, with the synchronization flows representing updates made local to the shared workspaces of the client systems. The methods may also establish establishing a client/server relationship between one of the client systems and a server system. Through this client/server relationship, the client and server systems may participate in client/server synchronization flows, with these flows representing updates made to the local shared workspace at the client system.