Abstract: A method is provided of using a set of servers to provide deferential services that have a pre-negotiated time for notice to release the servers. The method includes defining a virtual checkpoint frame interval that is constrained to a duration of up to half of the pre-negotiated time for notice to release the servers. The method includes collecting packets and transactions occurring during the interval that are processed by a current server. The method includes, responsive to an end of the interval, (i) writing, to a shared state database, a state of processing of the packets and transactions occurring during the interval, and (ii) releasing the packets and transactions occurring during the interval. The method includes copying the packets and transactions occurring during the interval, and the state, from the current server to another server for subsequent processing, responsive to an indication of an instance loss on the current server.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives a set of values for a set of attributes associated with a plurality of data objects managed by a first system. The program further generates a replication filter for filtering the plurality of data objects based on the set of values for the set of attributes associated with the plurality of data objects. The program also replicates a subset of the plurality of data objects from the first system to the second system based on the replication filter. The program further receives a set of data from the second system, the set of data generated by the second system based on the subset of the plurality of data objects.

Abstract: A method of computing a query performance prediction (QPP), comprising: receiving a target search query and a set of target search results obtained by executing the target search query on a corpus of data-elements, computing variations of the target search query, receiving a candidate set of search results for each of the variations, computing a statistical similarity metric indicative of statistically significant similarity or dissimilarity between each candidate set of search results and the set of target search results, clustering the candidate sets of search results into a cluster of pseudo effective reference lists (PE-RL) according to an association with statistical similarity requirement, and into a cluster of pseudo ineffective reference lists (PIE-RL) according to an association with statistically dissimilarity requirement, and computing the QPP of the target search results responsive to the target search query according to an aggregation of the PR-RL cluster and PIE-RL cluster.

Abstract: Embodiments are directed to managing data in a file system. A source file system may be mirrored on a target file system by executing one or more replication jobs. A root object of the source file system may be associated with a current read-only identifier corresponds to a current update epoch of the source file system. A replication job that copies objects from the source file system to the target file system may be executed. A write request directed to the source file system may be received. Write objects associated with the write request may be determined The source file system may be traversed upwards from the write objects. A read-only identifier associated with each visited object may be determined based on the read-only identifier matching the current read-only identifier. The write request may be enabled based on the mismatch of the read-only identifier and current read-only identifier.

Abstract: This computer system includes a plurality of nodes for forming a distributed KVS. The plurality of nodes have a plurality of key ranges to which upper-limit data amounts are set, each upper-limit data amounts being an upper limit of an amount of manageable data. When a new key range is created, the plurality of nodes lowers an upper-limit data amount of an existing key range so that the sum of an upper-limit data amount of the new key range and an upper-limit data amount of the existing key range does not exceed a maximum amount which is the amount based on the volume of the memory of the computer apparatus.

Abstract: Described is a system for improving data authentication using blockchain technology and multi-party computation (MPC). The system ensures authenticity of distributed data sent from one or more servers to the distributed clients. The system initializes MPC protocols to ensure secrecy of keys used to sign a new data element. Blockchain technology is utilized to ensure correctness and integrity of the new data element. A bidirectional blockchain is used such that a forward blockchain stores the new data element to be received by the distributed clients, and a reverse blockchain stores a public key used by the distributed clients to verify authenticity of the new data element stored in the forward blockchain. Signing of the new data element with the public key causes a previous public key to expire.

Abstract: A computer receives, at a target node, a replication target update, wherein the replication target update comprises a write frequency of a replication target and a size of the replication target. The computer creates a replication task to perform replication based upon the replication target update. The computer calculates a priority value of the replication task wherein the priority value is based upon the write frequency of the replication target and the size of the replication target. The computer inserts the replication task into a priority queue. The computer processes the replication task.

Abstract: Methods, systems, and computer readable media for testing network elements of an in-band telemetry (INT)-capable network are disclosed. One exemplary method includes generating, by a network test tool device, at least one INT test system data packet that includes emulated INT metadata that represents telemetry parameters corresponding to a plurality of emulated network devices. The method also includes sending the at least one INT test system data packet to an INT sink device and generating, by the INT sink device, an INT telemetry report derived from the INT metadata extracted from the at least one INT test system data packet. The method also includes forwarding the generated INT telemetry report to a software defined network (SDN) controller entity.

Abstract: The disclosed computer-implemented method for recovering data may include (i) accumulating a list of changed blocks that have changed in a replicated source volume over a continuous-data-protection window of time, (ii) receiving a request to recover data in a replication target volume of the replicated source volume, (iii) converting the changed blocks to a changed-block volume that is paired with the replication target volume, (iv) launching a virtual machine from the replication target volume and the paired changed-block volume, (v) determining that an intercepted read request is directed to a changed block stored within the changed-block volume, and (vi) redirecting the intercepted read request from the replication target volume to the changed-block volume to fulfill the intercepted read request. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A computer determines whether it has received user input or a node within a replica set has reached a capacity threshold. Based on receiving user input or determining that a node within a replica set has reached a capacity threshold, creating a snapshot of the data stored in the replica set and partitioning the data based on the created snapshot. The computer then initializing nodes within a new replica set and moves a partition from the original replica set to the new replica set before deleting the other partition from the old replica set.

Abstract: A system to reduce the amount of storage and memory used to maintain derived datasets is disclosed. The system operates by using pointers to the underlying data in persistent, byte-addressable storage media. The system additionally reduces the creation time of the views when storage class memory (SCM) is the underlying storage. Furthermore, the invention relates to a form of compression that is tailored to the use cases of big data analytics. The processes of this disclosure use random access to significantly improve performance.

Abstract: A synchronization queuing service associated with a content management system repository can record file events occurring to content items maintained at the content management system repository. The synchronization queuing service can receive a file synchronization request for information identifying a content item to which a client machine is subscribed. The synchronization queuing service can determine consistency or inconsistency of a client machine state of the content item relative to the content item at the content management system repository and can respond to client machine with a file event summary comprising information usable by the client machine to identify actions necessary to synchronize the client machine state of the content item the content item.

Abstract: Methods, systems, and media for providing distributed database access during a network split. In some embodiments, the method comprises: receiving, at a node of N nodes, configuration information of the database which indicates which of the N nodes stores replicated shards of the database including master shards and corresponding slave shards, N being an odd number greater than one; identifying, after a network split, a subset of the N nodes which are capable of communicating with each other; receiving, by a proxy, a request to perform a write operation to an object in the database; determining that a second node included in the subset of the N nodes stores a master shard including the object; determining that the subset includes at least (N+1)/2 nodes; and causing the request to perform the write operation to be routed to the second node.

Abstract: This disclosure describes techniques performing data object renaming operations. This disclosure describes techniques for performing data object renaming operations in a manner that may reduce file system corruption and data loss. The techniques described herein may include selectively journaling particular types of renaming operations. Selectively journaling particular types of renaming operations may mitigate potential data loss and file system corruption.

Abstract: Certain aspects of the present disclosure provide methods and systems for efficiently identifying data inconsistencies between electronic record systems using data partitioning. In certain embodiments, data stored in each of two record systems may be partitioned into a number of groups. Corresponding groups of data from the two record systems may be compared for data inconsistency. Upon determining data inconsistencies between certain corresponding groups, additional partitioning and data comparison may be performed to identify the source of the data inconstancies.

Abstract: The present disclosure relates to an apparatus for managing local monitoring data. The apparatus for managing local monitoring data includes an identification unit configured to identify monitoring data as one of structured monitoring data and unstructured monitoring data using flag information of the monitoring data, a storage unit configured to store structured monitoring data in a relational database or unstructured monitoring data in an unstructured database on the basis of an identification result of the monitoring data, and a conversion unit configured to search structured monitoring data corresponding to a data conversion condition among the structured monitoring data to convert the searched structured monitoring data into unstructured monitoring data.

Abstract: A computer-implemented method according to one embodiment includes identifying a cloud computing environment, establishing a baseline associated with input and output requests within the cloud computing environment, monitoring activity associated with the cloud computing environment, comparing the activity to the baseline, and performing one or more actions, based on the comparing.

Abstract: A method for updating a system that synchronizes medical data between a cloud repository on a cloud server and a plurality of local repositories on a plurality of local servers of healthcare facilities connected to the cloud server is provided. The method includes, by the cloud server: receiving a request to update a medical synchronization application stored on the cloud server and each of the local servers of the healthcare facilities using an update file; transmitting an instruction to each local server to update the medical synchronization application determining a version information of the medical synchronization application on all of the local servers; and executing the update file to update the medical synchronization application on the cloud server only in the event that cloud server determines that the medical synchronization application of all of the local servers have been updated.

Abstract: Testing a database replication system within a multi-container system architecture comprises receiving a first request for creating a database recovery system within a multi-container system architecture. The multi-container system architecture is configured to contain a plurality of tenant databases and a system database, and the database recovery system includes a primary system and a secondary system. The primary system is then identified from the information in the first request. Upon identification, a first tenant database included in the plurality of tenant databases is determined that corresponds to the identified primary system. Upon determining the first tenant database, a second tenant database of the plurality of tenant database is generated that corresponds to the secondary system, and which is enabled to test replicating information that would otherwise be associated with the first tenant database. Related apparatus, systems, techniques and articles are also described.

Abstract: Embodiments provision captive portals on network access points (NAPs). In response to a request from a NAP owner, a cloud service associates a NAP with the NAP owner and provides a control channel for configuring the NAP. The NAP owner inputs configuration settings describing the captive portal. The cloud service processes the configuration settings to generate configuration data. The cloud service transmits the configuration data to the NAP. The NAP applies the configuration data to configure the NAP. Some embodiments configure Wi-Fi hotspots with captive portals for gated access to the Internet.

Abstract: Provided herein is technology relating to data deduplication and particularly, but not exclusively, to methods and systems for determining an efficiently optimal size of data blocks to use for backing up a data source. Also provided herein are systems for identifying duplicate data in data backup applications.

Abstract: A synchronization window for synchronizing data for a calendar in a client calendar data store on a calendar data client computer system with data for the calendar in a server calendar data store on a calendar data server computer system can be calculated using a current time. A request for synchronization data for calendar items for the calendar with calendar times that are within the synchronization window can be sent to the calendar data server. One or more responses to the request can be received from the calendar data server. The response(s) can include received records for calendar items that are at least partially within the synchronization window. The received records can include a master record of a recurring calendar item and an instance record of an occurrence of the recurring calendar item. The received records for the calendar items can be incorporated in the client calendar data store.

Abstract: An oldest version timestamp is received from a first database. A current commit timestamp is received from a second database configured to asynchronously replicate the first database. The current global commit timestamp corresponds to a commit transaction executed in the first database and subsequently replicated in the second database. A first test query is then issued to the second database including a request for a current timestamp of the second database. A second test query is issued to the primary database requesting records associated with a target update version that has a target timestamp equal to the current snapshot timestamp. A determination is then made that a first return associated with the first test query and a second return associated with the second test query are identical indicating a successful validation. Related apparatus, systems, techniques and articles are also described.

Abstract: A computer-implemented method includes, by a streaming analytics component, identifying a source database table and a target database table. The target database table includes one or more target database rows and one or more target database columns. The method further includes identifying a change stream including a plurality of row-level modifications that cause the target database table to replicate the source database table. The method further includes determining that each row-level modification affects one or more common columns of the target database columns, wherein the common columns exhibit one or more common values for those of the target database rows that are affected by the row-level modifications. The method further includes generating, based on the common values and the common columns, a reconstructed modification statement and sending the reconstructed modification statement to an apply component. A corresponding computer program product and computer system are also disclosed.

Abstract: A snapshot analysis system analyzes a plurality of data snapshots taken in connection with data stored on a block device allocated by a data storage system. The snapshot analysis system may include an ingestor capable of initially detecting new snapshots and adding a root node for the snapshots. The system may include a block device analyzer that analyzes each snapshot to determine its contents, the relationship within data structures extant within the snapshot, and the snapshot's relationship to other snapshots and/or that of other block devices. The system may also include a clustering analyzer capable of determining whether snapshots are associated with multipart block devices, such as LVM or MD-RAID devices. The system may further include a block device emulator that exposes data associated with a given snapshot as an addressable block device without necessitating retrieval or exposure of the full block device to which the snapshot is associated.

Abstract: Example embodiments relate to parallelizing structured query language (SQL) on distributed file systems. In example embodiments, a subquery of a distributed file system is received from a query engine, where the subquery is one of multiple subqueries that are scheduled to execute on a cluster of server nodes. At this stage, a user defined function that comprises local, role-based functionality is executed, where the partitioned magic table triggers parallel execution of the user defined function. The execution of the UDF determines a sequence number based on a quantity of the cluster of server nodes and retrieve nonconsecutive chunks from a file of the distributed file system, where each of the nonconsecutive chunks is offset by the sequence number.

Abstract: To improve the responsiveness of a user device during a synchronization of a local calendar with a master calendar, the master calendar will provide the most-relevant events, relative to the current time, first to the user device. The user device is thus enabled to display those most-relevant events to the user.

Abstract: A system for providing continuous availability comprises a second computing site that is geographically remote from a first computing site. The second computing site comprises a storage unit configured to store units of work data and data synchronously replicated from the first computing site. The second computing site further comprises a group of workloads configured to process the units of work data asynchronously replicated from the first computing site. The second computing site further comprises a software replication module configured not to replicate any data while the first computing site is available.

Abstract: Provided herein are a method and an apparatus for replicating data. A master node or a data node stores data and indices in a table region including a plurality of data regions and a plurality of index regions, merges the plurality of index regions with one another to be one index region, and then replicates a table region including the plurality of data regions and the one index region to other nodes.

Abstract: A facility maintains a cardinality schema to manage indications of property cardinality on behalf of a database such as a graph database that is indifferent to the cardinality of properties stored within it. The facility can add cardinality indications to the cardinality schema for a property based on (1) semantics used to refer to one or more values of the property in an update request, (2) the number of values specified for the property in an update request, or (3) an explicit client declaration of the property's cardinality. Where a query or update request against the database uses cardinality semantics for a property that are inconsistent with the cardinality schema's indication for the property, the facility can reject the query or update request. The facility can also use the cardinality schema to automatically complete incomplete queries using the proper cardinality semantics for each involved property.

Abstract: A computer which updates the computer's own database in use of a transaction log: acquires the transaction log; processes records in the acquired transaction log, and with respect to a record related to an update instruction, executes the update instruction represented by the record when an object of the update instruction is read onto a memory of the computer; and executes the update instruction put on standby with respect to the object either until the object of the update instruction put on standby is read onto the memory and becomes a processing object, or when the update instruction put on standby has been read onto the memory and become a processing object.

Abstract: Various implementations herein enable managing a resiliency factor of an object stored in an enterprise object storage system. For example, in various implementations, a method of adjusting a realized resiliency factor of an object based on a target resiliency factor for the object is performed by an ingest entity of a storage system that includes a cluster of storage entities. The ingest entity includes a non-transitory computer readable storage medium, and one or more processors. In various implementations, the method includes obtaining a target resiliency factor for an object. In various implementations, the method includes determining whether or not to adjust a realized resiliency factor of the object based on the target resiliency factor. In various implementations, the method includes adjusting the realized resiliency factor of the object to an adjusted resiliency factor in response to determining to adjust the realized resiliency factor.

Abstract: A data center utilizing an architecture minimizing Internet Protocol (IP) routing therein includes one or more service edge network elements located in the data center, wherein a sub-IP network communicatively couples the one or more service edge network elements to one or more customer edge network elements located at or near demarcation points between a customer edge network and a service provider network, wherein the one or more customer edge network elements and the one or more service edge network elements are configured to provide direct user access to the data center for a plurality of users; and a control system communicatively coupled to the one or more service edge network elements and the sub-IP network, wherein the control system is configured to control resources on the sub-IP network and the data center for the plurality of users.

Abstract: According to an example, hierarchal stripe locks may be obtained for a source stripe and a destination stripe. In response to receiving data for the source stripe, the data is written from the source stripe to the destination stripe, and the hierarchal stripe locks are released for the source stripe and the destination stripe. In response to receiving the data-migrated token, the hierarchal stripe locks are released for the source stripe and the destination stripe.

Abstract: Data files in a distributed system sometimes becomes unavailable. A method for fault tolerance without data loss in a distributed file system includes allocating data nodes of the distributed file system among a plurality of compute groups, replicating a data file among a subset of the plurality of the compute groups such that the data file is located in at least two compute zones, wherein the first compute zone is isolated from the second compute zone, monitoring the accessibility of the data files, and causing a distributed task requiring data in the data file to be executed by a compute instance in the subset of the plurality of the compute groups. Upon detecting a failure in the accessibility of a data node with the data file, the task management node may redistribute the distributed task among other compute instances with access to any replica of the data file.

Abstract: Techniques and systems for completing a database query. A time to complete a synchronous query in response to receiving an original database query is estimated by a database management system provided by one or more computing devices. A synchronous database query corresponding to the original database query is performed with the database management system if the estimated time to complete the synchronous query is less than a pre-selected threshold time. One or more asynchronous queries corresponding to the original database query are performed with the database management system if the estimated time to complete the synchronous query is greater than the pre-selected threshold time. A result, whether from a synchronous query or one or more asynchronous queries, is stored in an object within a non-relational database system.

Abstract: Technologies for performing garbage collection in database systems, such as multi-version concurrency control (MVCC) database systems, are described. For example, different garbage collection techniques can be used separately or in various combinations, including interval garbage collection, group garbage collection, table garbage collection, and combinations. For example, a particular type of combination, called hybrid garbage collection, uses technique from interval garbage collection and group garbage collection, or from interval, group, and table garbage collection.

Abstract: Systems and methods associated with latch-free searching are disclosed. One example method includes receiving a key identifying data to be retrieved from a tree-based data structure. The method also includes performing a concurrent, latch-free search of the tree-based data structure until a leaf node is reached. The method also includes validating the leaf node. The method also includes retreading a portion of the search if the leaf node fails validation.

Abstract: Disclosed herein are systems, methods, and computer program products for providing transaction-consistent snapshots of data stored in or associated with a database. An embodiment operates by receiving, at a source database, an update request to update data associated with a table stored at the source database, and modifying a value of a modification-in-progress data structure corresponding to the table to indicate that a modification is in progress for the table. The embodiment includes updating a value of a commit identification counter and a table time stamp associated with the table to indicate that cached data having a time stamp older than the updated time stamp are invalid. The embodiment further includes modifying the value of the modification-in-progress counter to indicate completion of table modification.

Abstract: Provided is a method for matching orders of digital assets. The method comprises: receiving a plurality orders of digital asset from a plurality addresses on a distributed ledger, wherein each of the orders comprises a digital signature of the address, an authorizing public key, and an authorizing private key.

Abstract: An example system includes a processor to crawl a plurality of web pages of a web application to be tested. The processor is also configured to receive an intercepted input to the web application and an output from a web application associated with each crawled web page. The processor is to further configured to detect testable elements in the intercepted input and the output. The processor is also configured to generate a fingerprint for each web page based on the detected testable elements. The processor is also configured to generate a list of clusters comprising one or more similar web pages based on the fingerprints. The processor is configured to test a single web page from each cluster.

Abstract: A storage system maintains copies of a source database to allow virtual databases to be provisioned. Transaction logs received from the source database are applied to database blocks stored in the storage system to update the database blocks. The storage system checks if there are defect in the transaction logs of the source database. If a defect in transaction logs is detected, the storage system obtains a latest copy of the source database. The storage system matches database blocks of the received copy with database blocks already available in the storage system to determine whether a corresponding database block is already available in the storage system. If a received database block is different from database blocks already available at the storage system, the received database block is stored in the storage system. The database blocks may be matched using a hash value of the database blocks.

Abstract: A method is provided of using a set of servers to provide deferential services that have a pre-negotiated time for notice to release the servers. The method includes defining a virtual checkpoint frame interval that is constrained to a duration of up to half of the pre-negotiated time for notice to release the servers. The method includes collecting packets and transactions occurring during the interval that are processed by a current server. The method includes, responsive to an end of the interval, (i) writing, to a shared state database, a state of processing of the packets and transactions occurring during the interval, and (ii) releasing the packets and transactions occurring during the interval. The method includes copying the packets and transactions occurring during the interval, and the state, from the current server to another server for subsequent processing, responsive to an indication of an instance loss on the current server.

Abstract: A plurality of storage nodes within a single chassis is provided. The plurality of storage nodes is configured to communicate together as a storage cluster. The plurality of storage nodes has a non-volatile solid-state storage for user data storage. The plurality of storage nodes is configured to distribute the user data and metadata associated with the user data throughout the plurality of storage nodes, with erasure coding of the user data. The plurality of storage nodes is configured to recover from failure of two of the plurality of storage nodes by applying the erasure coding to the user data from a remainder of the plurality of storage nodes. The plurality of storage nodes is configured to detect an error and engage in an error recovery via one of a processor of one of the plurality of storage nodes, a processor of the non-volatile solid state storage, or the flash memory.

Abstract: A method of synchronizing transactions between blockchains including receiving a first plurality of transactions on a first private blockchain network, recording the first plurality of transactions to a first private block on the first private blockchain network, receiving a second plurality of transactions on the first private blockchain network, recording the second plurality of transactions to a second private block on the first private blockchain network, generating a first merged block comprising the first and second private blocks, recording the first merged block to a single block on a second blockchain network, recording each of the first and second private blocks and the first merged block to a smart contract linked to the first private blockchain network, defining a first private smart contract, and performing a synchronization process between the first private smart contract and a second smart contract linked to the second blockchain network, defining a second smart contract.

Abstract: There are provided systems and methods for targeted authentication queries based on detected user actions. A user may perform various actions during a day, including online, electronic, or digital actions, such as social networking, messaging, and media consumption, as well as real-life actions, such as exercise, travel, and purchases. The actions may be used to determine a user history for the user by a service provider. When the user wishes to login to an account or otherwise authenticate the identity of the user, the user may provide login or authentication credentials. The credentials may be used to look up the user history and cause the service provider to generate an authentication query for the user based on events associated with the user in the user history. The query may be utilized to further authenticate the user by requiring the user to respond with the event associated with the user.

Abstract: An application execution method for improving the operation speed of the application in executing or in the middle of running the application is provided. The application execution method includes detecting a launch of an application, preloading Input/Outputs (I/Os) requested at the launch based on profile data with I/Os requested at a previous launch of the application, and updating the profile data based on at least one of the I/Os requested at current and previous launches of the application.

Abstract: An approach for dynamically providing a prioritized list of relevant cases includes a computer generating a set of tags for a case and retrieving a set of tags for completed cases. The approach includes the computer sorting the set of tags for the case and the set of tags for the completed cases into a set of tag types. The approach includes the computer determining a set of matching tags for each of the set of tag types between the case and completed cases. Furthermore, the approach includes the computer determining an ordered list of the completed cases. The ordered list is based, at least in part, on a number of matching tags in the set of matching tags corresponding to the completed case in the completed cases, and a number of matching tags in the set of matching tags in a tag type in the set of tag types.

Abstract: The disclosed computer-implemented method for provisioning distributed datasets may include (1) identifying a dataset, where a production cluster stores a primary instance of the dataset by distributing data objects within the dataset across the production cluster according to a first partitioning scheme, (2) receiving a request for a testing instance of the dataset on a testing cluster, where the testing cluster is to distribute storage of data objects across the testing cluster according to a second partitioning scheme, (3) locating a copied instance of the dataset, (4) partitioning the copied instance of the dataset according to the second partitioning scheme, thereby generating a plurality of partitions, and (5) providing the testing instance of the dataset by providing storage access for each node within the testing cluster to a corresponding partition within the plurality of partitions. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A computer implemented method, system, and computer program product comprising splitting IO directed to a LUN on a production site to a first thin LUN, determining to take a snapshot of the LUN at a point in time, reconfiguring the IO split from the LUN on the production site to be split to a second thin LUN, and copying changes from the first thin LUN to a protection storage device.