Abstract: A method for synchronizing a file system (FS) and a remote file system (RFS) includes monitoring the FS for FS events, generating FS event records, receiving RFS event records of RFS events, generating file system operations (FSOs) based on the FS and RFS event records, and communicating the FSOs to the FS and RFS to synchronize them. A method for generating the FSOs includes accessing a plurality of FS and/or RFS event records, processing the accessed records to generate processed event records, generating the FSOs based on the processed event records, and outputting the FSOs to cause synchronization of the FS and RFS. Systems are also described. The invention facilitates event-based, steady-state synchronization of local and remote file systems.

Abstract: A geospatial mapping system can access a geospatial layer data set for a first geographic area defined by a first presentation level, and provide the geospatial layer data set for the first geographic area to a client device to present a visual rendering of the first geographic area. The geospatial mapping system can receive a request to utilize an advanced feature set on a subset of geospatial artifacts located within the first geographic area, and promote, to the geospatial layer data set, an additional geospatial artifact data set for the subset of geospatial artifacts, yielding an updated geospatial layer data set for the first geographic area. The geospatial mapping system can provide the updated geospatial layer data set to the client device to provide the advanced feature set for interacting with the subset of geospatial artifacts located within the first geographic area.

Abstract: An apparatus is configured to initiate distributed computations across a plurality of data processing clusters associated with respective data zones, to utilize local processing results of at least a subset of the distributed computations from respective ones of the data processing clusters to generate global processing results, and to update at least one distributed ledger maintained by one or more of the plurality of data processing clusters to incorporate one or more blocks each characterizing at least a portion of the distributed computations. Each of at least a subset of the data processing clusters is configured to process data from a data source of the corresponding data zone using one or more local computations of that data processing cluster to generate at least a portion of the local processing results.

Abstract: A system for storing and transmitting data in a highly compact format comprising reference codes to data chunklets contained in a library, wherein the data are retrieved after transmission or storage by re-constructing the data from the chunklets in the library using the reference codes. One version of the system contains proprietary libraries which act as a form of data security. Another version of the system contains a standardized version of the library encoded onto the firmware of a broad range of computing devices, allowing optimized storage and transmission of data between two such devices equipped with the system.

Abstract: A replication chain comprising one or more replication nodes of a multi-tenant stream management system is assigned to store data records of a partition of a particular data stream. A data record of the partition is received at a selected replication node of the replication chain. In a sequential order, a respective replica of the data record is stored at each replication node of the chain. An acknowledgement of a successful storage of the data record is provided after the replications are completed.

Abstract: The present disclosure relates to techniques for analysis of data from multiple different data sources to determine similarity amongst the datasets. Determining a similarity between datasets may be useful for downstream processing of those datasets for different uses. A graphical interface may be provided to display detailed results including: a similarity prediction, data similarity prediction, column order similarity prediction, document type similarity prediction, prediction of overlapping or related columns, orphaned column prediction (e.g., a left orphaned column or a right orphaned column). Detecting similarities may be useful for leveraging prior data transformations generated for the datasets that are analyzed.

Abstract: Disclosed embodiments relate to generating an update package for updating software on an Electronic Control Unit (ECU) in a vehicle. Operations may include accessing a plurality of attributes of a software update to be stored on the ECU in the vehicle; accessing a corresponding plurality of attributes of current software stored on the ECU in the vehicle; comparing the plurality of attributes with the corresponding plurality of attributes; generating a delta file representing differences between the plurality of attributes and the corresponding plurality of attributes determined in the comparison; and providing the delta file to the ECU, wherein the delta file is configured to be processed by startup code in the ECU that enables the delta file to execute in the ECU in the vehicle.

Abstract: Various embodiments are directed to systems and methods for creating an archive of a set of logical storage units stored on at least one storage medium. A first plurality of LSU descriptors may be generated. Each LSU descriptor may describe a current version of one of the set of LSUs at about the time of the generating. A first archive may be read to produce a first archive plurality of LSU descriptors. Each of the first archive plurality of LSU descriptors may describe a version of one of the set of LSUs when the first archive was created. The first archive plurality of LSU descriptors may be compared with the first plurality of LSU descriptors to identify a first LSU from the set of LSUs that has an associated LSU descriptor that does not match a corresponding LSU descriptor from the first archive plurality of LSU descriptors.

Abstract: A method for data replication between two file systems is disclosed. A base file relationship between the current generation of files and the last replicated generation may be constructed based on the generation-to-generation base file relationships of the intervening generations. The base file relationship between the current generation of files and the last replicated generation may be utilized in the replication of the current generation of files to the replica file system to reduce the amount of data that needs to be transferred while the files on the replica file system are more than one generation behind the current generation due to network outage or other issues.

Abstract: An automated repartitioning agent (ARA) of a storage service determines a repartitioning plan for a storage object. The plan identifies a source set of partitions whose keys are to be distributed among a target number of partitions. The ARA generates a data structure representing the source set, with entries indicating the key sets of corresponding partitions. The ARA implements repartitioning iterations until the keys of the source set have been redistributed. In each iteration, the ARA compares the key set of a selected entry of the data structure with a target key set and performs repartitioning actions based on the result. The repartitioning action may include splitting the selected entry's partition, merging the selected entry's partition with another partition, or designating the selected entry's partition as acceptable.

Abstract: In embodiments of synchronizing linked assets from unsynchronized file folders, files are organized in folders of a file system, where the folders include a synchronized folder and an unsynchronized folder, the synchronized folder having been selected for synchronization of the files contained in the synchronized folder, and the unsynchronized folder containing linked assets. The files contained in the synchronized folder are synchronized with a network-based memory system that stores an instantiation of the files. A synchronization service can determine that a file contained in the synchronized folder references to one or more of the linked assets contained in the unsynchronized folder. The synchronization service can then synchronize a linked asset from the unsynchronized folder automatically based on criteria associated with the file contained in the synchronized folder.

Abstract: A system for storing and transmitting data in a highly compact format comprising reference codes to data chunklets contained in a library, wherein the data are retrieved after transmission or storage by re-constructing the data from the chunklets in the library using the reference codes. One version of the system contains proprietary libraries which act as a form of data security. Another version of the system contains a standardized version of the library encoded onto the firmware of a broad range of computing devices, allowing optimized storage and transmission of data between two such devices equipped with the system.

Abstract: A computer-implemented method for providing tenant aware, variable length, deduplication of data stored on a non-transitory computer readable storage medium. The method is performed at least in part by circuitry and the data comprises a plurality of data items. Each of the plurality of data items is associated with a particular tenant of a group of tenants that store data on the storage medium.

Abstract: A method, article of manufacture, and apparatus for protecting data. In some embodiments, this includes taking a snapshot of a virtual machine, parsing the virtual machine to determine a header section and a file system, indexing the virtual machine based on the parsing, storing the index in a storage device, and storing the snapshot in a deduplicated data storage device.

Abstract: A control method executed by a control device, the control method including identifying a specified time period based on execution history information on previous jobs related to the plurality of systems, the specified time period being a period prior to execution start timing of a first job, update processing for a data storage area from which the first job refers to data is not executed during the specified time period, performing control so that evaluation timing of an amount of the data that the first job refers to from the data storage area is included in the identified time period, determining a specified system among from the plurality of systems based on the amount of the data evaluated at the evaluation timing, and causing the specified system to execute the first job.

Abstract: A method and system for synchronizing documents in a distributed server-client environment. The system includes a synchronization server, a distributor client, a user client, and/or a network connecting the server and the clients. The method includes the steps of wrapping synchronization information such as document ID and version number in a synchronized document, storing the synchronized document and the synchronization information in a synchronization server, and comparing the local version with the version stored in the sync server if a latest version is to open, and if the local version is not the latest version, accessing the latest version document by receiving the document from the synchronized server.

Abstract: A method, article of manufacture, and apparatus for protecting data. In some embodiments, this includes taking a snapshot of a virtual machine, parsing the virtual machine to determine a header section and a file system, indexing the virtual machine based on the parsing, storing the index in a storage device, and storing the snapshot in a deduplicated data storage device.

Abstract: A method is provided for execution by one or more processing modules of a dispersed storage network (DSN). The method begins by the DSN receiving a request to update one or more data segments of a data object and continues with the DSN determining whether one or more encoded data slices (EDSs) of a plurality of EDSs associated with the one or more data segments of the data object are eligible for partial updating. The DSN then executes a partial updating process for the eligible EDS while excluding any EDSs eligible for the partial updating that would be unaffected during the partial updating process.

Abstract: Methods and systems relating to a file distribution scheme in a computer network are disclosed that distributes files in an efficient manner that reduces, among other things, network traffic. In an embodiment of the invention, a method for updating a file is disclosed. In such a method, unique chunks in a first version of a digital file are identified. For a second version of the digital file, chunks that are the same as in the first version are identified. Recompilation information is generated and stored for these identified chunks. Also, for the second version of the digital file, chunks in the second version that are different from chunks in the first version are identified. Recompilation information is generated and stored for these identified chunks. With this information, the second version of the digital file is completely defined and can be efficiently stored.

Abstract: A network element (NE) comprising a memory configured to store a digest log for a conference, a receiver coupled to the memory and configured to receive a first message from a first of a plurality of service proxies of the conference, wherein the first message comprises a signature profile of a first of a plurality of participants of the conference associated with the first service proxy, a processor coupled to the receiver and the memory and configured to track a state of the conference by updating the digest log according to the first message, and a transmitter coupled to the processor and configured to send a plurality of second messages to indicate the digest log update to the service proxies without a transmission request from the service proxies.

Abstract: A method and system for automatically enforcing a hybrid branching strategy include receiving a changeset designated for a branch. In response to receiving the changeset, the system may automatically determine whether a merge conflict associated with the changeset exists between the branch and an associated protected branch, and the system may automatically determine whether the changeset is up to date. Upon determining that no merge conflict exists, the system automatically initiates execution of a continuous integration testing pipeline. The continuous integration testing pipeline includes a series of tests applied to the changeset. If the changeset passes the series of tests, the system automatically merges the changeset with the associated protected branch.

Abstract: A method is presented for using a distributed source control system with a centralized source control system. A first set of files is obtained from a source control repository and stored on a first electronic computing device. The first set of files comprises all or part of a code base in the centralized source control system. A request is received for at least part of the code base from a second electronic computing device in a distributed source control system. As a result of the request, at least a part of the first set of files is sent to the second electronic computing device. A change set for the first set of files is received from the second electronic computing device. The change set is processed to be in a format compatible with the source control repository. The change set is submitted to the source control repository.

Abstract: In certain embodiments, the method may comprise, determining one or more features associated with each of one or more concepts from at least one sentence; determining at least one concept feature matrix based on the one or more features; determining one or more contribution factors among the one or more concepts, based on the at least one concept feature matrix; determining incremental synchronization data by storing current timestamp associated with the one or more concepts and comparing it with knowledge data; generating at least one new concept feature matrix based on the incremental synchronization data; determining one or more new contribution factors among the one or more concepts, based on the at least one new concept feature matrix; determining differential value between the one or more contribution factors and the one or more new contribution factors; and dynamically updating the knowledge data, in the repository system.

Abstract: A data storage system is disclosed that utilizes garbage collection and logs for managing system data. In one embodiment, system data stored in a non-volatile memory is updated based on the character of changes to data stored in a data storage system (e.g., changes caused by host system activity). For example, when changes to stored data are scattered (e.g., changes are made to random memory locations), it may be beneficial to generate and accumulate more logs reflecting changes to the system data. As another example, when changes to stored data are substantially consolidated (e.g., changes are made to consecutive memory locations), it may be beneficial to update system data stored in the non-volatile memory more frequently. Reduction in write amplification, increase in efficiency, and reduction in start-up and initialization time can be attained. Reconstruction time of system data can also be reduced.

Abstract: A system and method to create a clone of a source computing system, the system including the steps of selecting a memory space coupled to the source computing system, retrieving uncoded data from the selected memory space, encoding the uncoded data by use of a bit-marker-based encoding process executing on a backup server, storing encoded data in a protected memory coupled to the backup server, wherein the protected memory is protected from a power interruption, retrieving the encoded data from the protected memory; and decoding the encoded data onto a target computing system, wherein the target computing system is separate from the source computing system.

Abstract: Approaches for a persistent data store that may be used to service data queries originating from data warehousing applications, operational reporting applications, or data archiving and data feed applications. At periodic intervals, data may be extracted from one or more disparate data sources. The extracted data may be stored in the persistent data store in a tabular format. A backward delta data set is generated. The backward delta data set identifies what additions, deletions, and modifications need to be made to the data stored in the persistent data store to return the data to a most recent version. Backward delta data sets are stored and maintained in accordance with a policy that instructs two or more backward delta data sets, associated with a continuous interval of time, be combined into a single backward delta data set after the expiration of a specified amount of time.

Abstract: The description relates to cloud-edge topologies. Some aspects relate to cloud-edge applications and resource usage in various cloud-edge topologies. Another aspect of the present cloud-edge topologies can relate to the specification of cloud-edge applications using a temporal language. A further aspect can involve an architecture that runs data stream management systems (DSMSs) engines on the cloud and cloud-edge computers to run query parts.

Abstract: Dynamic application instance discovery and state management within a distributed system. A distributed system may implement application instances configured to perform one or more application functions within the distributed system, and discovery and failure detection daemon (DFDD) instances, each configured to store an indication of a respective operational state of each member of a respective group of the number of application instances. Each of the DFDD instances may repeatedly execute a gossip-based synchronization protocol with another one of the DFDD instances, where execution of the protocol between DFDD instances includes reconciling differences among membership of the respective groups of application instances. A new application instance may be configured to notify a particular DFDD instance of its availability to perform an application function.

Abstract: Technology is disclosed for a data migration process for a storage server that preserves storage efficiency information. The storage server receives an indication of a group of two or more files and selects among the two or more files a reference file and one or more selected files. The storage server initiates a first migration operation to copy or move the reference file from a source storage server to a destination storage server. The storage server initiates one or more additional migration operations to copy or move the selected files from the source storage server to the destination storage server. At least one of the additional migration operations include a step of transmitting to the destination storage server data blocks of the selected files that are not shared between the reference file and the selected files, but avoid transmitting to the destination storage server the blocks shared with the reference file.

Abstract: A computer displays a first set of components available for selection by the customer for an IT solution. The computer receives, from the customer, selection of a first component included in the first set of components. The computer determines that subsequent use of the first component requires a service. The computer identifies and displays a second set of components based on compatibility with the first component and ability to use the same service as the first component. The computer receives selection, from the customer, a second component included in the second set of components. The computer designs the IT solution to (a) include the first component and the second component and (b) share the same service during use of the first component and the second component.

Abstract: Methods and apparatus for storing and transmitting historical configuration data associated with information technology assets are disclosed. The system reads and stores a first version of data with a timestamp. The system then performs a local update by reading a second version of data with a timestamp, replacing the first set of data and timestamp, and storing the changes between the first and second versions of data. The system also may receive update requests from a remote location for the latest version of data. The changes between versions of data are sent to the remote location, where the changes between versions of data are stored and are usable to create the requested latest version of data and/or prior versions of data.

Abstract: Techniques for replicating data in database systems are described. In an example embodiment, a set of changes is received at a destination database, where the set of changes has been applied at a source database and is being replicated from the source database to the destination database. The set of changes is analyzed and it is determined that the set of changes includes two or more of: a subset of row-level changes, a subset of statement-level changes, and a subset of procedure-level changes. A set of dependencies is determined at least between the changes that are included in the subsets of changes. The changes, in the subsets of changes, are assigned to two or more processing elements. The set of changes is applied to the destination database by executing the two or more processing elements in parallel to each other and based on the set of dependencies.

Abstract: The replication of data between a source system and a destination system is disclosed. After having calculated a signature for a fragment of data to be replicated, the source system transmits same to the destination system. The latter determines whether or not the signature is known, e.g., whether or not a fragment is associated with the signature. If so, the data to be replicated is reconstructed (with respect to fragment in question). If not, a message indicating that the signature is unknown is transmitted to the source system, which then transmits the corresponding fragment to the destination system. The latter stores and reconstructs the data to be replicated (with respect to the fragment in question).

Abstract: A gossiping scheme for sharing node status in a cluster of nodes provides a robust mechanism for determining node status within the cluster. Nodes transmit gossip messages to each other nodes, the gossip messages listing other nodes in the cluster that are operational. When a node does not receive a gossip message from a particular node within a predetermined time period, then the node transmits messages to the other nodes indicating that the particular node is down. However, if another node has received a packet from the particular node within the predetermined time period and receives the node down message, then the other node responds with a node alive message.

Abstract: A volume of data is copied from a first location to a second location. A procedure to repair a volume of data is initiated. A first instruction associated with the repair procedure is selectively redirected to a staging storage, based on a determination that the first instruction relates to an action that makes a change to the volume. A second instruction is selectively redirected to one of the staging storage and the volume, based on data stored in the staging storage.

Abstract: A mobile property portfolio management system provides the capability of generating, maintaining, searching and displaying property portfolio data from a mobile device such as a smartphone (e.g., iPhone), tablet (e.g., iPad) or any other mobile computing device. The property portfolio management system comprises a mobile or client portion, a central or server portion and optional satellite offices. The system comprises software that runs on one or more server computers as well as client or user side software that can be realized as a standalone software application or “app” that runs on the client device (e.g., desktop, mobile device, tablet, etc.) or entirely in a standard web browser. The property portfolio management system in effect provides a digital version of a property portfolio with easy access to portfolio data for both internal users and public users and is particularly useful when realized on a tablet or mobile device.

Abstract: Methods and apparatuses relating to Open Mobile Alliance (OMA) device management (DM) are provided. An embodiment provides a method in which a mobile device is configured for: accumulating delta records on the mobile device; and pushing delta records to a DM server when a threshold for the delta records is met or exceeded. The delta records relate to changes made to an Open Mobile Alliance (OMA) device management (DM) tree. The delta records may be purged after the pushing operation. Other embodiments provide a mobile device and computer-readable medium for performing or facilitating the method.

Abstract: A database associated with a primary database cluster may be replicated in a backup database cluster located in a different location in order to provide a highly-available fault tolerant database service. The databases are reconciled through a cluster management module distributed in each database cluster. The cluster management module uses a set of reconciliation data structures to track locally the reconciled states of each database in each database cluster, the operations made locally to the databases in each database cluster, and the author of the operations. The cluster management module in each database cluster engages in a stateless messaging protocol using the set of reconciliation data structures to determine whether or not the databases may be reconciled.

Abstract: The present invention extends to methods, systems, and computer program products for scanning files for inappropriate content during file synchronization. Embodiments of the invention are mindful of the order of operations when scanning files for inappropriate content and in subsequent file processing. In some embodiments, during synchronization, an intermediary server scans a file for inappropriate content. The file is not permitted to be fully downloaded to a client device until the scan determines that the file does not contain inappropriate content. In other embodiments, during synchronization, a client device scans a newer version of a file for inappropriate content. An older version of the file is not deleted until the scan determines that the newer version of the file does not contain inappropriate content. In further embodiments, server side scanning and client side scanning are both used to enhance capabilities for detecting inappropriate content.

Abstract: A method, apparatus or software is disclosed for transferring storage replication system configurations between heterogonous storage systems.

Abstract: A system for detecting and repairing errors in synchronization links for data records includes a first data repository containing a first data record that maintains a data field which links to associated data records) and a self-reference record. The system also includes a second data repository containing a second data record that also maintains a data field which links to associated data records) and a self-reference record. The system also includes a synchronizer that maintains a data table containing the addresses of the first and second data records and the status of any previous synchronization activity.

Abstract: Techniques and systems are disclosed for providing changed content identification for an online document that is accessed by a user or user agent. A reference point for an online document that a user or user agent is interested in accessing is identified, comprising a stored prior version of the document. The prior version of the document is retrieved, when the user or user agent accesses the online document, such as by using the reference point. Elements of the prior version are compared with elements of a current version of the document, to determine whether there are differences between the versions. If changes are identified between the prior version and the current version, the current version is automatically updated with visual or auditory representations that identify those changes of content.

Abstract: Aspects relate to apparatus and methods for rendering a page on a computing device, such as a web page. The apparatus and methods include receiving a request for a requested instance of a page and determining if the requested instance of the page corresponds to a document object model (DOM) for the page stored in a memory. Further, the apparatus and methods include retrieving a dynamic portion of the DOM corresponding to the requested instance if the requested instance of the page corresponds to the DOM stored in the memory. The dynamic portion may be unique to the requested instance of the page. Moreover, the apparatus and methods include storing the dynamic portion of the DOM corresponding to the requested instance of the page in a relationship with the static portion of the DOM.

Abstract: Systems and methods are directed to an eventually consistent replicated data store that uses, for its underlying storage, a computer software library that provides a high-performance embedded database for data. The replicated data store employs a plurality of hosts interconnected to one another, allowing for writes to any host and full awareness of membership across all hosts. With the data replication framework, various modes are allowed to be built up on top of the core system.

Abstract: The system and method alters the data delivery service plan of a subscriber in response to a network degradation event that negatively affects the subscriber's plan during transportation (e.g. in flight). In response to the subscriber's request, the system and method grants the subscriber access to the in-flight network and/or data during the flight. Additionally, the system and method monitors and detects network degradation events during the flight. If an event occurs that negatively affects the subscribers plan during the flight, the system and method determines a time extension for the subscriber to access the network and/or data based on the duration of the network degradation event. The system and method also modifies the subscriber's plan based on the determined time extension and notifies the subscriber about the network degradation event and plan modification. The plan modification may credit the subscriber additional time, data, and/or services.

Abstract: A method and system for conducting an offline session simulating an online session between a client and server in a network environment. The client imports data and functional logic from the server prior to going offline. The imported functional logic is embedded into a format or document that is capable of being interpreted and performed by the local interface at the client that is used interact with server during an online session. Whether offline or online, the user utilizes the same local interface at the client to transmit instructions to the functional logic in order to manipulate the data. In an offline session, such instructions cause the imported and embedded functional logic to execute, thereby manipulating the data that is imported at the client. Synchronization methods may also be used in order to maintain consistency and coherency between the imported data at the client and the database at the server.

Abstract: A scheme for monitoring node operational status according to communications transmits messages periodically according to a heartbeat rate among the nodes. The messages may be gossip messages containing the status of the other nodes in the pairs, are received at the nodes and indications of the communications delays of the received messages are stored, which are used to compute statistics of the stored communications delays. Parameters of the node status monitoring, which are used for determining operational status of the nodes, are adjusted according to the statistics, which may include adjusting the heartbeat rate, the maximum wait time before a message is considered missed, and/or the maximum number of missed messages, e.g., the sequence number deviation, before the node is considered non-operational (down).

Abstract: A method and system for conducting an offline session simulating an online session between a client and server in a network environment. The client imports data and functional logic from the server prior to going offline. The imported functional logic is embedded into a format or document that is capable of being interpreted and performed by the local interface at the client that is used interact with server during an online session. Whether offline or online, the user utilizes the same local interface at the client to transmit instructions to the functional logic in order to manipulate the data. In an offline session, such instructions cause the imported and embedded functional logic to execute, thereby manipulating the data that is imported at the client. Synchronization methods may also be used in order to maintain consistency and coherency between the imported data at the client and the database at the server.

Abstract: A network control system that includes several controllers for managing several switching elements. Each controller includes a network information base (NIB) storage that stores data regarding the switching elements and a secondary storage for facilitating replication of at least a portion of data across the NIB storages of the different controllers. In some embodiments, the primary purpose for one or more of the secondary storage structures is to back up the data in the NIB. In these or other embodiments, one or more of the secondary storage structures serve a purpose other than backing up the data in the NIB. In some embodiments, the NIB is stored in system memory while the system operates for fast access of the NIB records. In some embodiments, one or more of the secondary storage structures are stored on disks which can be slower to access.

Abstract: Methods and devices for accelerating webpage rendering by a browser store document object model (DOM) tree structures and computations of rendered pages, and compare portions of a DOM tree of pages being render to determining if portions of the DOM tree structures match. If a DOM tree of a webpage to be rendered matches a DOM tree stored in memory, the computations associated with the match DOM tree may be recalled from memory, obviating the need to perform the calculations to render the page. A tree isomorphism algorithm may be used to recognize DOM trees stored in memory that match the DOM tree of the webpage to be rendered. Reusing rendering computations may significantly reducing the time and resources required for rendering web pages. Identifying reusable portions of calculation results based on DOM tree isomorphism enables the browser to reuse stored webpage rendering calculations even when URLs do not match.