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: 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: 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 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: 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 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.

Abstract: A forking coordinator of a journal-based multi-data-store database determines that a forking criterion for a first journal has been met. The coordinator stores an indication that processing of transaction requests directed to a particular subset of the database is suspended. The coordinator instantiates a second journal for storing committed transaction entries for the particular subset. Metadata of the second journal indicates that transaction entries with sequence numbers in a particular range are stored in the first journal. The coordinator stores an indication that transaction processing associated with the particular subset of the system is to be resumed using the second journal.

Abstract: Described embodiments provide systems and methods for synchronizing a production volume and a backup volume of a storage system. A first thin volume is created and associated with the production volume. A first replica of the production volume is generated by copying data from the production volume to a replica volume. During the copying, an I/O request to be written to the production volume may be received. Data from the I/O request is written to the first thin volume and data changed due to the I/O request is tracked in metadata associated with the production volume and the first thin volume. A size of the first thin volume is checked, and when the size of the first thin volume is below a threshold, changes from the first thin volume are applied asynchronously to the backup storage.

Abstract: The present approach improves the query performance of a database in a manner that is transparent to a user. In one aspect, this approach creates separate partition tables that are not directly accessible to a user of the database. A client-facing aspect of the database is a logical model which may correspond to a single, main table with which the user interacts. Thus, queries or operations may be generated on the client side in the context of the logical model. A database or query layer can then, transparent to the user, translate the user generated requests into query language that addresses the proper partitions to generate a result set or otherwise perform a database operation.

Abstract: A method for handling of open transactions in a data replication environment. The method includes querying one or more tables of a source database to determine a first open transaction associated with the one or more tables of the source database. The method further includes determining a database user that initiated the first open transaction. The method further includes querying one or more tables of the target database corresponding to the one or more tables of the source database associated with the first open transaction, to determine whether the database user has access privileges for the one or more tables of the target database and dynamically skipping replication of the first open transaction to the target database, such that the data replication system no longer waits for the first open transaction to complete.

Abstract: Disclosed are systems, methods, and non-transitory computer-readable storage media for re-associating content items of a user account of a content management system on a computing device relinked to the content management system. The systems, methods, and non-transitory computer-readable storage media can include the content management system receiving a request to relink the computing device with a user account of the content management system. The systems, methods, and non-transitory computer-readable storage media can also include determining a local content item of the client device corresponds to at least one revision of a plurality of revisions of a content item of the user account, wherein the content item is currently removed from the user account. Finally, the systems, methods, and non-transitory computer-readable storage media can cause the client device to delete the local content item.

Abstract: A storage system comprises a production site in operable communication with a replication site, and an object store, comprising a plurality of data objects associated with data stored in at least one data storage entity of the production site, disposed at the replication site. The replication site is configured to generate a virtual access point in time (PIT) based at least in part on the plurality of data objects, by providing a plurality of nodes in operable communication with the storage system, where each respective node is configured to, substantially concurrently, perform a MapReduce operation to generate a respective first set of disk objects based on the plurality of data objects, and to create a respective set of metadata objects. The first set of disk objects and the first set of metadata objects are merged together into a virtual access PIT from each of the plurality of parallel nodes.

Abstract: A method of synchronizing transactions between blockchains comprising receiving first and second pluralities of transactions on a first private blockchain network and recording them to first and second private blocks on the first private blockchain network, respectively, generating a first merged block comprising the first private block and the second private block and 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 first private smart contract linked to the first private blockchain network, 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, and performing a checkpointing process between the first private smart contract and the second smart contract. The first private blockchain network has a parameter difference from the second blockchain network.

Abstract: Large amounts of unstructured or semi-structured log data generated by software and infrastructure components of a computing system are processed to identify anomalies and potential problems within the computing system. Stored log messages may be queried and analyzed according to dynamic fields constructed from the content of the log messages. As time goes on, the dynamic fields may be converted into static fields which are extracted and indexed at the time of ingestion of the log messages.

Abstract: Passive monitoring of a large-scale network using multiple tiers of ordinary network switches, as opposed to purpose-built network monitoring hardware, is accomplished by initially providing network communications to an initial tier of monitoring switches, either from existing switches that copy frames and provide them to the monitoring switches, or from network taps to which the monitoring switches are connected. The initial tier of monitoring switches comprises flow tables that initially simply drop all frames provided to those switches and, subsequently, when specific network issues arise, they are modified to include a specification particular frame criteria whose frames are either forwarded to subsequent tiers of monitoring switches, or statistics regarding those frames are collected. Subsequent tiers of monitoring switches receive frames from the initial tier and direct them to one or more appropriate analysis computing devices.

Abstract: Systems and methods are provided for adaptive data replication. A first data object is stored. One or more first network characteristics of a communication network are detected. A first replication mode is triggered (e.g., a single-master replication mode) based on the one or more first network characteristics of the communication network. The single-master replication may be configured to facilitate real-time synchronizations (e.g., for critical updates). One or more second network characteristics of the communication network are detected. A second replication mode (e.g., a multi-master replication mode) is triggered based on the one or more second network characteristics. The second replication may be configured to facilitate a delayed synchronization (e.g., for non-critical updates) of the first data object and the second data object using the second update file.

Abstract: The present disclosure relates to systems, methods, and computer program products for keeping multiple caches updated, or coherent, on multiple servers when the multiple caches contain independent copies of cached data. Example methods may include receiving a request to write data to a block of a first cache associated with a first server in a clustered server environment. The methods may also include identifying a second cache storing a copy of the block, where the second cache is associated with a second server in the clustered environment. The methods may further include transmitting a request to update the second cache with the received write data, and upon receiving a subsequent request to write subsequent data, identifying a third cache for invalidating based on access patterns of the blocks, where the third cache is associated with a third server in the clustered environment.

Abstract: Local distributed backup techniques are described, where each client device calculates a manifest of its files and sends the manifest to a central server. The server performs deduplication based on the received manifest to determine which files are missing and need to be backed up, and notifies the client of those files. At this point, instead of uploading the missing files to the central server, the files are instead uploaded to another peer client device that has sufficient disk space and resides in the network vicinity of the original client device. The upload may be done to multiple peers for redundancy. Upon backup completion, the client state may be left as-is, in which case the client periodically uploads incremental updates to keep any changes synchronized with the backup peer. Alternatively, the client can be centralized to the central server, but at a later time when more resources are available.

Abstract: Disclosed aspects relate to data management for a mass storage device. The mass storage device may be structured to include an encrypted file system to store a set of data and a token analyzer to manage access to the encrypted file system. A connection between the mass storage device and a computing device may be sensed. In response to sensing the connection, a token corresponding with the computing device may be detected. Based on the token, the token analyzer may determine to provide the computing device a set of selected permissions to the encrypted file system. The set of selected permissions to the encrypted file system may be provided by the mass storage device to the computing device.

Abstract: In accordance with an embodiment, a system and method for supporting RESTful management in an application server environment for operating application software includes an interface configured to receive input for interacting with the application server environment. When a request to manage the application server environment is received, REST resources are dynamically generated using bean trees and other bean information within the application server environment. The REST resources are then usable as input to the interface to manage the application server environment.

Abstract: According to some embodiments, a method for processing input data comprises creating a MapReducer object corresponding to a MapReduce environment; and receiving, by a MapReduce interface, a plurality of input parameters comprising the input data; a mapper function; a reducer function; and the MapReducer object; and using the MapReduce interface to process the input data by one or more processors in the MapReduce environment using the mapper function and the reducer function. According to some embodiments, the method further comprises creating a second MapReducer object, wherein the second MapReducer object corresponds to a second MapReduce environment; receiving, by the MapReduce interface, the second MapReducer object in place of the first MapReducer object; and utilizing the MapReduce interface to process the input data by the one or more processors in the second MapReduce environment using the mapper function and the reducer function.

Abstract: A non-transitory readable storage medium storing one or more instructions that, when executed by the computer, cause the computer to perform a method of managing content and associated metadata in a network by a cache repository. The method comprises receiving content and associated data from a content source located in a local network of an edge facility; storing the content in the cache repository located in the local network of the edge facility; sending the content to an active repository remote from the local network of the edge facility for storage; and determining if a connection to the remote repository can be established in the network. If the connection to the active repository can be established, the method includes retrieving by the cache repository the content from the active repository; and if the connection to the active repository cannot be established, the method retrieves the content from the backup repository.

Abstract: The valet parking and paging system is a wireless signaling apparatus that facilitates communication between a valet parking station and a client of the valet parking station. Specifically, the valet parking and paging system is a wireless signaling apparatus that exchanges status information between the valet parking station and a client. The valet parking and paging system comprises a plurality of valet units, a plurality of client units, and a base stations. The plurality of valet units comprises a collection of individual valet units. The plurality of client units comprises a collection of individual client units. Each individual valet unit selected from the plurality of valet units plugs into and is electrically connected to a location selected from the group consisting of the base station or an individual client unit selected from the plurality of client units.

Abstract: As provided herein, a first device may be registered as authorized to authenticate a user login into a service from a second device (e.g., a smart phone may be used to log the user into a webmail service on a computer without the user having to enter a password through the computer). Responsive to the user attempting to access the service through the second device, a login interface may be displayed on the first device. The user may confirm or deny that the user wants to log into the service on the second device, thus allowing the user to seamlessly log into the service on the second device (e.g., without entering a password) while mitigating unauthorized logins into the service from unknown devices. Further, the user may use the first device to delegate the authority to authenticate the user login into the service to one or more other devices.

Abstract: A field device includes a detector and a converter communicative to the detector. The detector also may include, but is not limited to, a sensor, an analog-to-digital converter, and a first processor. The sensor may be configured to acquire an analog measurement signal. The analog-to-digital converter may be configured to convert the analog measurement signal to a digital signal. The first processor may be configured to convert the digital signal into a measurement value to generate a digital signal representing at least the measurement value. The converter may be configured to convert the digital signal representing at least the measurement value into an instrumentation signal to output the instrumentation signal. The detector may be configured to transmit the digital signal representing at least the measurement value and the analog measurement signal to the converter.

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: In response to detecting data file creation/revision in a first computing device, one or more other computing devices in which the data file creation/revision is to be synchronized are identified and a user of the first computing device is prompted to specify a message to be communicated to the one or more other computing devices in association with the data file creation/revision. The message specified by the user of the first computing device is received and communicated to the one or more other computing devices together with information that enables the data file creation/revision to be synchronized within the one or more other computing devices.

Abstract: A method and apparatus for collecting, merging, and presenting content is disclosed. The method includes collecting a plurality of selected content from a plurality of different content sources. The method further involves storing the selected content in a temporary file. Additionally, the method involves merging the collected content into a cohesive document.

Abstract: Techniques for file system recovery are disclosed. In one particular exemplary embodiment, the techniques may be realized as a method for file system recovery comprising starting a recovery process for a failed node, utilizing the recovery process to read one or more committed but un-applied transactions from storage associated with the failed node, and recreating the one or more committed but un-applied transactions in memory associated with the recovery process.

Abstract: It is provided a computer system, comprising a plurality of computers configured to execute processing in response to requests received from a plurality of external systems. The plurality of computers each share an acceptance weight statistic value calculated by each of the plurality of computers with another computer within the same network segment. The processor of each of the plurality of computers is configured to: receive a broadcast transmitted from one of the plurality of external systems to the same network segment; determine whether to respond to the received broadcast by referring to the shared acceptance weight statistic value; and send a response to the one of the plurality of external systems that has transmitted the broadcast in order to allow the one of the plurality of external systems to transmit a processing request in a case where it is determined to respond to the received broadcast.

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.