Abstract: A mutable multilevel data structure representing a graph structure may include multiple read-only levels and a single writable level. Each read-only level may include a vertex table (with references to edge tables on the same level or a different level containing elements of adjacency lists for some vertices) and an edge table (with elements of adjacency lists that changed since the previous read-only level). A hybrid variant may switch between a performance-optimized variant (whose edge tables include complete adjacency lists for vertices whose edge sets were modified) and a space-optimized variant (whose edge tables include only newly added adjacency list elements). The vertex tables and/or the writable level may be implemented using copy-on-write arrays, each including an indirection table and multiple fixed-sized data pages. Computations may be run on the read-only levels or on the writable level and read-only levels.

Abstract: A method for avoiding conflicts in a multi-master database cluster is provided. A set of hot spots is identified in the database cluster. When a given node receives a given transaction, the given node selects one or more hot-spot servicing nodes for one or more hot-spot sub-transactions, namely one or more sub-transactions of the given transaction that correspond to one or more hot spots of the set of hot spots. Subsequently, the given node redirects the hot-spot sub-transactions to their respective hot-spot servicing nodes. The hot-spot sub-transactions are then executed at their respective hot-spot servicing nodes.

Abstract: According to one embodiment of the present invention, a system for managing data within a plurality of data management architectures comprises at least one processor. The system persists an entity managed by a first data management architecture to a second data management architecture. The first data management architecture manages entity data within one or more data sources, while the second data management architecture manages persisted entities with data from the one or more data sources within a common repository. A modification to data of the persisted entity is detected within the one or more data sources, and the modified data is synchronized with the persisted entity in the repository of the second data management architecture. Embodiments of the present invention further include a method and computer program product for managing data within a plurality of data management architectures in substantially the same manner described above.

Abstract: Content platform management is enhanced by logically partitioning a physical cluster that comprises a redundant array of independent nodes. Using an interface, an administrator defines one or more “tenants” within the archive cluster, wherein a tenant has a set of attributes including, for example, namespaces, administrative accounts, data access accounts, and a permission mask. A namespace is a logical partition of the cluster that serves as a collection of objects typically associated with at least one defined application. Each namespace has a private file system such that access to one namespace (and its associated objects) does not enable a user to access objects in another namespace. A namespace has capabilities (e.g., read, write, delete, purge, and the like) that a namespace administrator can choose to enable or disable for a given data account.

Abstract: According to one embodiment of the present invention, a system for managing data within a plurality of data management architectures comprises at least one processor. The system persists an entity managed by a first data management architecture to a second data management architecture. The first data management architecture manages entity data within one or more data sources, while the second data management architecture manages persisted entities with data from the one or more data sources within a common repository. A modification to data of the persisted entity is detected within the one or more data sources, and the modified data is synchronized with the persisted entity in the repository of the second data management architecture. Embodiments of the present invention further include a method and computer program product for managing data within a plurality of data management architectures in substantially the same manner described above.

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. A primitive storage layer (storage pools) knits together raw block stores and provides a storage mechanism for containers and transaction logs. Storage pools are manipulated by individual file servers. 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.

Abstract: A system that implements a data storage service may store data for database tables in multiple replicated partitions on respective storage nodes. In response to a request to back up a table, the service may export individual partitions of the table from the database and package them to be independently uploaded (e.g., in parallel) to a remote storage system (e.g., a key-value durable storage system). Prior to uploading the exported and packaged partitions to the remote storage system, the service may verify that the exported and packaged partitions can be subsequently restored, which may include unpackaging and/or re-inflating the exported and packaged partitions to create additional unpackaged copies of the partitions, re-importing the additional unpackaged copies of the partitions into the database (e.g., as additional replicas), and/or comparing checksums generated for the exported partitions with checksums generated for the additional unpackaged copies of the partitions.

Abstract: A migration framework includes a migration status data store that stores the migration status of a variety of different databases that are being migrated. A migration manager monitors the migration status of the different databases and invokes migration scripts to perform migration steps on the various databases, based upon their migration status. As the migration steps are completed, a status update component updates the migration status of the various databases that are being migrated.

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: A list of classes found in a core dump file is determined. One or more classes requested by a classloader is also determined. A set of one or more classes requested by the classloader that are found in the core dump file is then determined.

Abstract: A virtualized computing system for executing a distributed computing application, such as Hadoop, is discussed. The virtualized computing system stores data in a distributed filesystem, such as Hadoop Distributed File System, and processes data using a topology awareness that takes into account the virtualization layer of the virtualized computing system. The virtualized computing system employs locality-related policies, including replica placement policies, replica choosing policies, balancer policies, and task scheduling policies that take advantage of the awareness of the virtualization topology.

Abstract: It is provided a computer system, comprising a server and first and second storage systems. The first storage system stores deduplicated data sharing at least a part of data with other data, shared data shared by a plurality of pieces of the deduplicated data, and first type data representing a type of the stored data including the deduplicated data and the shared data. The deduplicated data is associated with the shared data by a pointer to the shared data, and includes differential data indicating a difference from the shared data. The server creates second type data representing a type of the data stored in the second storage system from the first type data. The second storage system stores the shared data associated with the deduplicate data at a reading position before a position at which the deduplicated data is read in sequential reading and stores the second type data.

Abstract: A distributed database system may implement log-structured distributed storage using a single log sequence number space. A log for a data volume may be maintained in a log-structured distributed storage system. The log may be segmented across multiple protection groups according to a partitioning of user data for the data volume. Updates to the log may be assigned a log sequence number from a log sequence number space for the data volume. A protection group may be determined for an update according to which partition of user data space the update pertains. Metadata to be included with the log record may indicate a previous log sequence number of a log record maintained at the protection group. The log record may be sent to the protection group and identified as committed based on acknowledgments received from storage nodes implementing the protection group.

Abstract: A method of managing content in a network by a cache repository that includes receiving content from a content source; storing the content in the cache repository; sending the content to a remote repository for storage; and determining if a connection to the remote repository can be established in the network. If the connection to the remote repository can be established, the method includes retrieving the content from the remote repository; and if the connection to the remote repository cannot be established, the method retrieves the content from a backup repository.

Abstract: A distributed database system may efficiently replicate distributed storage system changes on one or more read-only nodes. Storage metadata that indicates an access scheme for obtaining data for a particular view of the database from a distributed storage system may be maintained at a read-only node. An update to the storage metadata may be received that indicates a change to the distributed storage system that affects the validity of read requests for a different particular view of the database. In some embodiments, the change may indicate which storage nodes may be storing data according to the different particular view of the database, such as a change in membership of a protection group for the data at the distributed storage system. The storage metadata at the read-only node may be updated according to the received update such that a subsequent read request for the different particular view of the database is sent to the distributed storage system according to the updated access scheme.

Abstract: A key-value store provides column-oriented access to data in a distributed and fault tolerant manner. Data can be inserted into the data store and data can be retrieved either randomly or sequentially from the data store at high rates. Keys for a table are ordered and the entire table is divided into key ranges. Each key range is handled by a table which itself is divided into key ranges called a partition. Partitions are also divided into segments. Such recursive division into smaller and smaller key ranges provides parallelism. At the highest level, operations on tablets can be distributed to different nodes. At lower levels, different threads can handle operations on individual segments. Large-scale restructuring operations can be decomposed into operations on individual segments so that a global lock on larger objects does not need to be kept across the entire operation.

Abstract: A computer implemented method, system, and computer program product for enabling consistency between zones comprising creating a lease agreement between a first zone and at least a second zone; wherein the lease indicates that the first zone is the owner of an object; wherein the lease agreement dictates that a notification is to be sent before a cached object in the first zone is updated if the lease is still valid; wherein the lease indicates the first zone is to send a heartbeat to the second zone within the predetermined period of time if the object has not been changed and the lease is still valid; and setting up heartbeats from the first zone to at least a second zone within a predetermined amount of time; wherein the heartbeat indicates that the lease is still valid and the object has not been changed.

Abstract: The present invention discloses a method and an apparatus for recommending a suspicious component in problem diagnosis for a cloud application. In the method, firstly a graph data model representing a hierarchical structure of the cloud application is constructed, wherein the graph data model comprises an application node representing the cloud application, a plurality of component nodes representing a plurality of components of the cloud application, and inter-node lines indicating inter-node relationships. Then real-time information of the cloud application is obtained, in response to detecting performance degradation of the cloud application. Impact degrees of the plurality of component nodes on the performance degradation of the cloud application is obtained based on the constructed graph data model and the obtained real-time information, and a suspicious component sequence is generated according to the impact degrees of the plurality of component nodes.

Abstract: A system and method for synchronizing files to a cloud storage service provides an adaptive visual display that offers details of the synchronization process of each file being synchronized. Information included in the display can include details of the progress and status of the file synchronization for a particular file, as well as a group of files. Files being actively synchronized are locked in the display for the user view. Files that are not actively synchronized may scroll in the display so that the user can view information about multiple files being synchronized during a given synchronization.

Abstract: One exemplary aspect comprises a method comprising: (a) storing, in a first database, data specific to a client; (b) based on the data, identifying with a processing system comprising one or more processors one or more fields of a record to be updated in a second database managed by the client; (c) obtaining write-only access to one or more fields of the identified one or more fields of the record; and (d) updating, based on the data stored in the first database, one or more fields of the identified one or more fields of the record in the second database.

Abstract: A system that implements a data storage service may store data on behalf of storage service clients. The system may maintain data in multiple replicas of partitions that are stored on respective computing nodes in the system. The system may split a data partition into two new partitions, and may split the replica group that stored the original partitions into two new replica groups, each storing one of the new partitions. To split the replica group, the master replica may propagate membership changes to the other members of the replica group for adding members to the original replica group and for splitting the expanded replica group into two new replica groups. Subsequent to the split, replicas may attempt to become the master for the original replica group or for a new replica group. If an attempt to become master replica for the original replica group succeeds, the split may fail.

Abstract: System and method for location aware fine-grained multi-channel synchronization of mobile repositories along with aggregate analytic computation is disclosed. The System is able to improve upon existing systems by allowing for custom policies on synchronization to be stored and applied when data synchronization happens, these policies are persisted in the Sync Data Repository and applied during sync. The System is able to improve upon existing systems by allowing for persistent marking of states of the sync repository as Sync Points. This way data can be pulled from a sync point. The System is able to improve upon existing systems by having a computation framework that is able to push down aggregate analytics to user, these analytics are computed by analyzing data in the Sync Channel along various dimensions such as temporal, geo.

Abstract: A collection-synchronizing system synchronizes a local data collection with a remote device. During operation, the system can detect the remote device, and receives collection summaries for one or more data collections stored at the remote device. A collection summary can include at least one additive hash value that represents one or more content items of a data collection. Then, for a data collection that exists at the local device and the remote device, the system compares a remote additive hash value for the remote data collection with a local additive hash value for the local data collection. If the system determines that the local additive hash value does not match the remote additive hash value, the system synchronizes structured names for the data collection at the local device and the remote device.

Abstract: In various embodiments, the present invention relates to systems and methods for managing user data in a plurality of storage appliances coupled to a wide area network. In some embodiments, the present invention relates to systems and methods that allow users to view and manipulate files in a shared virtual container. In other embodiments, the present invention also relates to systems and methods that allow users to access virtual containers located on storage appliances that are owned by other users.

Abstract: A controlling method executed by a processor included in an information processing apparatus, the controlling method includes storing identifiers of information processing apparatuses and identifiers of groups, each of the information processing apparatuses belonging to at least one of the groups, a group among the groups storing replications of one or more identifiable data; and detecting, by the information processing apparatus, a failure of other information processing apparatus belonging to one or more groups among the groups to which the information processing apparatus executing the detecting of the failure belongs, based on the identifiers of information apparatuses and the identifiers of groups.

Abstract: A key-value store provides column-oriented access to data in a distributed and fault tolerant manner. Data can be inserted into the data store and data can be retrieved either randomly or sequentially from the data store at high rates. Keys for a table are ordered and the entire table is divided into key ranges. Each key range is handled by a table which itself is divided into key ranges called a partition. Partitions are also divided into segments. Such recursive division into smaller and smaller key ranges provides parallelism. At the highest level, operations on tablets can be distributed to different nodes. At lower levels, different threads can handle operations on individual segments. Large-scale restructuring operations can be decomposed into operations on individual segments so that a global lock on larger objects does not need to be kept across the entire operation.

Abstract: A system includes reception of a first query from a client device at a first database node of a database instance comprising two or more database nodes, determination of a second database node of the two or more database nodes associated with the first query, compilation of the first query at the first database node to generate first compiled code, and transmission of the first compiled code and a first identifier of the second database node from the first database node to the client device.

Abstract: A system and method for generating replication requests for objects in a distributed storage system is provided. For a respective object in a distributed storage system the following is performed. Replication policies for the object that have not been satisfied are determined. Replication requests are ranked for the object whose replication policies have not been satisfied based on a number of replicas of the object that need to be created in order to satisfy the replication policies for the object. Replication requests are generated for the object based at least in part on the replication policies for the object that have not been satisfied and on a current state of the distributed storage system. At least a subset of the replication requests for the objects in the distributed storage system are distributed to respective instances of the distributed storage system corresponding to the replication requests for execution.

Abstract: Multiple servers sharing a distributed file system are used to perform copies of regions of a source file in parallel from a source storage unit to corresponding temporary files at a destination storage unit. These temporary files are then merged or combined into a single file at the destination storage unit in a way that preserves the inode structure and attributes of the source file. A substantial speedup is obtained by copying regions of the file in parallel.

Abstract: A method for synchronizing Customer Relationship Management data between a Software as a Service (“SaaS”) CRM provider and a mobile device. This method enables both read and write access from the mobile device whether a network connection to the SaaS provider is available or not. The method involves creating a local mobile device database to track portions or all of the SaaS provider database. In the case where a network separation occurs and the device and SaaS databases diverge, the synchronization method may be used to make the mobile device database and the SaaS database consistent and coherent again. In one embodiment, multiple local database tables are used to represent a single SaaS CRM table to facilitate synchronization, and a status indicator is used to visually and quickly convey status to the mobile user.

Abstract: According to one embodiment of the present invention, a system for managing data within a plurality of data management architectures comprises at least one processor. The system persists an entity managed by a first data management architecture to a second data management architecture. The first data management architecture manages entity data within one or more data sources, while the second data management architecture manages persisted entities with data from the one or more data sources within a common repository. A modification to data of the persisted entity is detected within the one or more data sources, and the modified data is synchronized with the persisted entity in the repository of the second data management architecture. Embodiments of the present invention further include a method and computer program product for managing data within a plurality of data management architectures in substantially the same manner described above.

Abstract: According to one embodiment of the present invention, a system for managing data within a plurality of data management architectures comprises at least one processor. The system persists an entity managed by a first data management architecture to a second data management architecture. The first data management architecture manages entity data within one or more data sources, while the second data management architecture manages persisted entities with data from the one or more data sources within a common repository. A modification to data of the persisted entity is detected within the one or more data sources, and the modified data is synchronized with the persisted entity in the repository of the second data management architecture. Embodiments of the present invention further include a method and computer program product for managing data within a plurality of data management architectures in substantially the same manner described above.

Abstract: One or more techniques and/or systems are disclosed for providing efficient synchronized data access. A request to access data on a first data provider is received. The requested data on the first data provider is synchronized with a second data provider, such that the first and second data providers respectively comprise a same version of the requested data. A provider score can respectively be determined for the first data provider and for the second data provider, where the provider score utilizes heuristic data that may indicate a data access rate and/or a cost of data access, for the respective first data provider and second data provider. The request for data access can be routed to the data provider that comprises a desired provider score, where a desired provider score may indicate a desired rate of data access and/or cost of data access.

Abstract: A method, an apparatus, and a system for issuing a partition balancing subtask, which are applied to a controller and may be used to implement migration of a partition between nodes. After receiving a second partition balancing task, the controller generates a second partition balancing subtask set, where the second partition balancing subtask set includes at least one partition balancing subtask, and each partition balancing subtask records: a migration partition, a node to which the migration partition belongs, and a destination node; searches a current partition balancing subtask set, and deletes a repeated partition balancing subtask between the second partition balancing subtask set and the current partition balancing subtask set; and issues remaining partition balancing subtasks after the repeated partition balancing subtask is deleted to the destination node recorded in each partition balancing subtask.

Abstract: Technologies are generally provided for maintaining performance level of a database being migrated between different cloud-based service providers employing machine learning. In some examples, data requests submitted to an original data store/database may be submitted to a machine learning-based filter for recording and analysis. Based on the results of the data requests and the filter analyses, new key value structures for a new data store/database may be created. The filter may assign performance scores to the original data requests (made to the original data store) and data requests made to the newly-created key value structures. The filter may then compare the performance scores associated with the created key value structures to each other and to performance scores associated with the original data requests and may select the created key value structures with performance scores that are at least substantially equal to those of the original data requests for the new data store.

Abstract: In various embodiments, the present invention relates to a method of operating a server to manage user data in a plurality of storage appliances. The method involves establishing in a database system, via the server, information for each registered user; establishing and storing in the database system a set of relationships, based on designations by the users, among registered storage appliances and container designations; and using a central service running on the server to deliver storage appliance-container relationship data to the storage appliances so as to enable the appliances to substantiate the containers therein, and to replicate user data with other storage appliances that have substantiated corresponding containers, in a manner consistent with the stored relationships, and wherein the central service operates without interaction with user data stored in the containers.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating synthetic descriptive text. One of the methods includes identifying a group of linking resources, wherein each of the linking resources includes a link to a respective target resource; determining, from a search engine index, that at least some of the target resources are associated with seed queries; generating term location information that identifies, for each seed query, locations of terms from the seed query in the linking resource that links to the target resource associated with the seed query; generating synthetic descriptive text for the target resources based on the term location information; and associating the synthetic descriptive text with the target resources in the search engine index.

Abstract: Techniques for cross-ACL multi-master replication are provided. The techniques allow a replication site in a multi-master replication system implementing an asynchronous replication protocol and an access control policy to appropriately apply received data change updates to data maintained at the site even where a data change update is missing information because of the implemented access control policy.

Abstract: Described in detail herein are systems and methods for deduplicating data using byte-level or quasi byte-level techniques. In some embodiments, a file is divided into multiple blocks. A block includes multiple bytes. Multiple rolling hashes of the file are generated. For each byte in the file, a searchable data structure is accessed to determine if the data structure already includes an entry matching a hash of a minimum sequence length. If so, this indicates that the corresponding bytes are already stored. If one or more bytes in the file are already stored, then the one or more bytes in the file are replaced with a reference to the already stored bytes. The systems and methods described herein may be used for file systems, databases, storing backup data, or any other use case where it may be useful to reduce the amount of data being stored.

Abstract: A method and apparatus for file storage is disclosed, wherein the method comprises: recording meta-data information of a folder, and storing the meta-data information into key-value databases; and, when the folder includes at least one sub-folder list and/or file list thereunder, storing the contents of the at least one sub-folder list and/or file list included under the folder in secondary keys based on the primary key. The method achieves “open ended” unlimited expansion of data in a directory tree storage. The use of the “open ended” unlimited data expansion scheme avoids bottlenecks related to underlying data storage when accumulated data become large. In comparison with the prior art method, the method splits and stores large data into multiple secondary keys for uniform data distribution, thereby enhances storage stability of storage databases and facilitates data expansion and systems' transaction operations.

Abstract: Embodiments of the present invention provide a method for automatic data replication and a terminal. The method includes: after a data link to a peer end is established, send to the peer end a search request used for searching for a second folder whose folder name is the same as that of a first folder, where the search request includes a folder name of the first folder; when the peer end determines that the peer end includes the second folder, receiving attribute information of each piece of second data in the second folder, where the attribute information of each piece of second data is sent by the peer end; when the attribute information of the second data is inconsistent with attribute information of first data in the first folder, sending a replication request to the peer end.

Abstract: A system for replicating a filesystem running on multiple nodes comprising an originator system and a replica system. The originator system includes a plurality of nodes. The replica system includes a plurality of nodes and a processor. The plurality of nodes of the replica system are paired with the plurality of nodes of the originator system. The processor is configured to receive an indicator of a node of the plurality of nodes of the replica system finishing replication for a view of a filesystem at a point in time. The processor is further configured to indicate that replication for the view of the filesystem is complete in the event that all replica system nodes have received their indication for the view.

Abstract: Methods, systems, and apparatus, including computer program products, for generating synthetic queries using seed queries and structural similarity between documents are described. In one aspect, a method includes identifying embedded coding fragments (e.g., HTML tag) from a structured document and a seed query; generating one or more query templates, each query template corresponding to at least one coding fragment, the query template including a generative rule to be used in generating candidate synthetic queries; generating the candidate synthetic queries by applying the query templates to other documents that are hosted on the same web site as the document; identifying terms that match structure of the query templates as candidate synthetic queries; measuring a performance for each of the candidate synthetic queries; and designating as synthetic queries the candidate synthetic queries that have performance measurements exceeding a performance threshold.

Abstract: Techniques for a method for efficiently extracting data from multidimensional databases are disclosed herein. When extracting data from a subset of a multidimensional database, the method first extracts data from high-level cells within the subset. If there are any empty high-level cells, the method removes lower-level cells that roll-up into the empty high-level cell, without extracting data from these lower-level cells. The method improves the data extraction efficiency by reducing the overhead of extracting data from empty cells of multidimensional databases.

Abstract: A method, system and computer program product for choosing actions in a state of a planning problem. The system simulates one or more sequences of actions, state transitions and rewards starting from the current state of the planning problem. During the simulation of performing a given action in a given state, a data record is maintained of observed contextual state information, and observed cumulative reward resulting from the action. The system performs a regression fit on the data records, enabling estimation of expected reward as a function of contextual state. The estimations of expected rewards are used to guide the choice of actions during the simulations. Upon completion of all simulations, the top-level action which obtained highest mean reward during the simulations is recommended to be executed in the current state of the planning problem.

Abstract: Database updates to primary and secondary database structures are performed by writing information from a client to both primary and secondary database services and building the database structure at the primary database service while delaying application of data written to the secondary database service until notification at the secondary database service from the primary database service. The primary database service provides notification upon completing the database structure so that the secondary database service can proceed with building the database structure from the information provided by the client or with information provided by the primary database service.

Abstract: A computing system may include multiple computing devices. A file at a computing device may be accessed based on a reference file stored at the device that comprises a hash value of the content of the file. The hash value may be independent of the file location or file name and include a representation of the content of the file such that a given hash value is unique for given content. For example, the hash value may be generated using a hash function on the content of the file. The hash function may be generated by the hash function that reproducibly identifies the file based on the content of the file. In this manner, the reference file may be used to uniquely identify a file as well as serve as a basis for checking the integrity of files transmitted over a network from one computing device to another computing device.

Abstract: A system and method for generating replication requests for objects in a distributed storage system is provided. For a respective object in a distributed storage system the following is performed. Replication policies for the object that have not been satisfied are determined. Replication requests are ranked for the object whose replication policies have not been satisfied based on a number of replicas of the object that need to be created in order to satisfy the replication policies for the object. Replication requests are generated for the object based at least in part on the replication policies for the object that have not been satisfied and on a current state of the distributed storage system. At least a subset of the replication requests for the objects in the distributed storage system are distributed to respective instances of the distributed storage system corresponding to the replication requests for execution.

Abstract: A method and associated system for managing rules that synchronize operations of a source system and a target system. A set of linked worksheets is generated as a function of the internal logic of the synchronization rules and of worksheets that represent data models of the source and target systems. These generated worksheets describe and relate data elements of the data models, extrinsic data that is stored externally to the source and target systems, and logical procedures performed by the synchronization rules. When the source data model, the target data model, or a logical procedure is revised, the linked worksheets are updated in response to the revision and these updates automatically propagate across the synchronization rules and across other components of the source system, the target system, and the synchronization mechanism.

Abstract: The present invention relates to an information syndication file synchronizing method, comprising: acquiring and saving the latest information publishing time in an information syndication file located on a first information publishing platform; acquiring the information syndication file, and comparing the latest publishing time with the publishing time of each piece of information in the acquired information syndication file; if the information publishing time is later than the latest publishing time, then searching for the information in a synchronization database; if searching in the synchronization database does not yield a match, then synchronizing the information onto a second information publishing platform for publishing, and saving the information to the synchronization database. The above method can efficiently synchronize an information syndication file without errors or omissions. Furthermore, also provided are an information syndication file synchronizing device and system.