Abstract: Disclosed herein is a computer-implemented method of processing a query using a columnstore comprising a plurality of segments, the method comprising: receiving a query comprising a parameter; determining a key corresponding to the parameter; identifying a mapping structure, from a plurality of mapping structures, relating to said key, wherein each mapping structure corresponds to a respective segment of the columnstore; interrogating the identified mapping structure to determine a value corresponding to the key, wherein the value identifies an entry of an index table of a plurality of index tables that corresponds to the respective segment, wherein the entry of the index table identifies a row of the respective segment of the columnstore relating to the parameter; and retrieving data relating to the parameter from a data source based on data stored in the entry of the index table.

Abstract: A mapper tree for a logical volume is provided by storing, in each leaf node of the mapper tree, pointers to pages of non-volatile storage that store host data written to corresponding pages within a segment of the logical address space of the logical volume that corresponds to the leaf node. In response to receiving an initial write operation directed to a segment of the logical address space of the logical volume for which no leaf node currently exists in the mapper tree, a representation of a new leaf node is added to a super leaf node in the mapper tree that efficiently stores representations of multiple leaf nodes.

Abstract: Disclosed herein are system, method, and computer program product embodiments for the translation of a level based format, where each record contains a complete individual path from the highest to the lowest leaf level, to an annotated hierarchy through a generator function which through mapping and encoding on a level-by-level basis, keeping track of sibling links, is able to perform a depth-first pre-ranking order assessment of original data, to produce an annotated hierarchy which may be utilized by a user.

Abstract: A method and an apparatus for creating an index in a blockchain-type ledger, and a device are disclosed. According to one implementation, a method may include obtaining, by a centralized database server, a data record, wherein the data record is stored in a blockchain-type ledger, and wherein the data record comprises a service attribute and a sequence number; determining location information of the data record in the blockchain-type ledger, wherein the location information comprises a block height of a data block comprising the data record, and an offset of the data record in the data block; establishing a mapping relationship between the service attribute, the location information, and the sequence number; and based on the sequence number, writing the mapping relationship to an index.

Abstract: A portion of a graph dataset is generated for each computing node in a distributed computing system by, for each subject vertex in a graph, recording for the computing node an offset for the subject vertex, where the offset references a first position in an edge array for the computing node, and for each edge of a set of edges coupled with the subject vertex in the graph, calculating an edge value for the edge based on a connected vertex identifier identifying a vertex coupled with the subject vertex via the edge. When the edge value is assigned to the first position, the edge value is determined by a first calculation, and when the edge value is assigned to position subsequent to the first position, the edge value is determined by a second calculation. In the computing node, the edge value is recorded in the edge array.

Abstract: A computer implemented and computer controlled method of arranging, in memory, data subsets retrieved from a single or from different data sources, and structured in accordance with a logical data model, for the processing of these data subsets by an action-based logical data model. The action-based logical data model comprises actions, data categories, including a subject data category, an object data category, a spatial data category and a temporal data category, action topology combinations, instance information supplemented to an action topology combination, and constructors. A constructor comprises a plurality of properties in accordance with a constructor topology combination. A property operates on action topology combinations matched to data subsets elements of data subsets in accordance with the action-based logical data model, for presenting structured relations between data subset elements of data subsets.

Abstract: Automated Index Management entails automated monitoring of query workload in a DBMS to determine a set of higher load queries to use to evaluate new potential indexes. Without the need of user approval or action, the potential indexes are automatically created, evaluated and tested, and then made available for system wide use for executing queries issued by end users. Indexes created by Automated Index Management are referred to herein as auto indexes.

Abstract: Techniques are described for monitoring and enabling access to information about key access patterns for nonrelational database tables managed by a nonrelational database service of a service provider network. Storage nodes store data as key-value pairs (or key-document pairs), where the records or documents of a database are addressed by a unique key for each record. The storage nodes over time receive requests to perform various operations (for example, to get, put, update, or delete data in a table) associated with records stored by the storage nodes. The storage nodes collect information indicating a frequency with which such requests are received for each key for which a storage node is responsible. This frequency information for each key can be normalized relative to a maximum frequency supported by the storage nodes to obtain an access frequency score, where the maximum frequency indicates a frequency at which additional requests to the storage node may be throttled.

Abstract: Systems, methods, and computer-readable storage media are described for processing data change request. In one exemplary embodiment, a computer-implemented method receives one or more requests in a software production environment for one or more data changes to data from a requestor. The method executes the request(s) in a rollback mode. The method generates a snapshot of the executed request(s). The method also transmits the snapshot to an approver. In response to an approval of the snapshot from the approver, the method also executes the request(s) in a commit mode.

Abstract: A system and method for efficiently managing log data to be transferred to a DBMS (database management system). The system includes a processor that detects a change in a log file and reads a log message; performs a first preprocessing to change the content of the log message when it is decided that inputting the log message to the DBMS is necessary, and that changing of the content of the log message is necessary; generates column data by parsing on the first preprocessed log message and separating the parsed log message into columns; performs a second preprocessing to change the content of the column data when it is decided that inputting the column data to the DBMS is necessary, and that changing of the content of the column data is necessary; and provides the second preprocessed column data to the DBMS.

Abstract: Aspects of the subject disclosure may include, for example, a device that includes a processing system including a processor, and a memory that stores executable instructions that, when executed by the processing system, facilitate performance of operations, where the operations include receiving intelligence requirements from sources authenticated through a blockchain distributed ledger, normalizing data received by the sources, wherein the normalized data complies with the intelligence requirements, and generating a recommendation or course of action based on the normalized data. Other embodiments are disclosed.

Abstract: In one embodiment, a computer-implemented method for object-granular policy assignment in an object storage environment includes: automatically assigning a plurality of objects stored within the object storage environment to one or more policies; and locating one or more of the objects among a plurality of policy rings within the object storage environment based on semantics of the one or more policies. A virtual namespace maps each object to at least one of the policy rings based on the one or more policies assigned to the object; and the virtual namespace is scalable with a number of the plurality of objects stored within the object storage environment. Corresponding systems and computer program products are also disclosed.

Abstract: A method for validating data structures includes generating and storing, at each of multiple intervals, a signature for each of multiple data structures, including a parent data structure and a child data structure. The method also includes, in response to a request to validate the child data structure, retrieving active state signatures of the parent and child data structures, and comparing the active state signatures. The method further includes, when the active state signatures are inconsistent, comparing the active state signature of the child data structure to a first prior state signature of the parent data structure; and when the active state signature of the child data structure is consistent with the first prior state signature of the parent data structure, notifying a user that the child data structure is a match for the parent data structure but out of sync therewith.

Abstract: A method for creating a secure data block to validate an information source is disclosed. For example, the method is executed by a processor and includes receiving a story via a user interface, accessing a truth criteria database to identify a truth criteria associated with a category of the story, associating one or more parameters of the story to the truth criteria to create a map between the one or more parameters and the truth criteria, and creating one or more secure data blocks to record the map between the one or more parameters of the story and the truth criteria.

Abstract: A method, apparatus, and computer program product for validating a structured data object. A computer system identifies rules for validating interrelationships among data nodes. The data nodes are composable into structured data objects according to a domain specific language. The validation rules are topologically sorted according to dependency relationships declared therein. The computer system receives the structured data object, which consists of interrelated data nodes. The structured data object is traversed according to a traversal algorithm that tracks dependency relationships. Each data node is inserted into a queue according to the traversal algorithm. For each data node in the queue, a subset of the validation rules is identified. The subset is run within a context of the structured data object. Rule failure for the data node are recorded, and a failure report is generated that indicates failure results for each data node.

Abstract: A method and apparatus of a device that grows and/or shrinks a table that is shared between a writer and a plurality of readers is described. In an exemplary embodiment, a device receives an entry to be added to the shared table. In response to receiving the entry, the device remaps shared table to add a new storage segment to the shared table. The device further adds the entry to the shared table, where the entry is stored in the new storage segment. In addition, the device updates a shared table characteristic to indicate that the shared table has changed. The device further shrinks the shared table by remapping the table to remove a segment of the table.

Abstract: Disclosed herein is a system and method for interoperability of blockchains thereby allowing use of smart contracts across blockchains in real time and in a secured manner. A plurality of blockchains are connected to each other and allow use of smart contracts written on them by other connected blockchains without the need of rewriting and/or downloading the smart contract on other blockchain. The disclosed system and methods use a distributed file system storage for secured processing of information flowing from one blockchain to other connected blockchain. Further, each connected blockchain is associated with distinct private and public key in order to encrypt and decrypt the data flowing across blockchains.

Abstract: A method for managing transfer of data over a network to a recipient system is disclosed. The method is implemented at a database management system that stores a schedule of data transfers associated with records in a database. The method includes: receiving a signal representing an electronic message from a third party system, the electronic message including details of a first scheduled data transfer to a first record in the database at a first transfer time; obtaining details of a second scheduled data transfer from the first record to the recipient system; determining that an effect on the first record by the first and second scheduled data transfers meets stored predefined criteria; updating the schedule of data transfers to change a second transfer time associated with the second scheduled data transfer; and initiating the second scheduled data transfer according to the updated schedule of data transfers.

Abstract: Methods and systems for an extensible, universal ledger. One of the methods includes receiving at a journal manager engine a register transaction type request for a first transaction type, the journal manager engine reading and writing to a journal that stores a history of object state and of code by which object state is changed, wherein the register transaction type request is based at least in part on a template and specifies at least one action that can be performed as part of the first transaction type; writing the transaction type request to the journal including an operation definition for the first transaction type; receiving a transaction request of the first transaction type; obtaining the operation definition from the journal; executing an operation in response to the transaction request to produce a transaction result; and recording the transaction result in the journal.

Abstract: Systems and methods disclosed herein are directed to a scalable and advanced analytics computing platform for distributed ledger data for integrating an entity's legacy systems, distributed ledger systems, and crypto-asset transactions, as well as related metadata.

Abstract: Systems and techniques for sequence to sequence conversational query understanding are described herein. A query may be received that includes multiple words. It may be identified that the query is to be reformulated based on an attention value for an attention word in the query. Relationships may be determined among words of the query and words in a previously submitted query and words in results from the previously submitted query. The query may be reformulated based on the relationships. The reformulated query may be employed to retrieve query results.

Abstract: Various embodiments relate generally to data science and data analysis, computer software and systems, network communications to interface among repositories of disparate datasets and computing machine-based entities that seek access to the datasets, and, more specifically, to a computing and data storage platform configured to provide one or more computerized tools that facilitate data projects by providing an interactive, project-centric workspace interface that may include, for example, a unified view in which to identify data sources, generate transformative datasets, and/or disseminate insights to collaborative computing devices and user accounts.

Abstract: Embodiments described herein are directed to computer-implemented methods, systems, and computer program products for calculating a metric using natural language processing tokens. A non-limiting example of the computer-implemented method includes parsing, by a processing device, user content using a natural language processing technique to extract tokens. The method further includes filtering, by the processing device, the tokens relating to a natural language processing criterion. The method further includes calculating, by the processing device, a metric based at least in part on the filtered tokens. The method further includes determining, by the processing device, whether to take an action by applying the metric to a set of rules. The method further includes taking the action responsive to determining to take the action.

Abstract: A natural language processing system with pre-specified SQL queries is provided. A user input can be performed via a graphical user interface. The system can process via natural language processing, and return an intent field corresponding to one or more variables. Pre-specified SQL queries can be provided for possible intents. The query can be altered by populating with particular parameters. In addition, an answer can be returned to the user comprising natural language results and graphical material.

Abstract: A method of augmenting a reliability model for a manufactured product includes receiving a product attribute identifying a product, receiving a first component attribute and a second component attribute, and receiving first manufacturing data and second manufacturing data, the first manufacturing data comprising manufacturing data associated with the first component and the second manufacturing data comprising manufacturing data associated with the second component. The method can include applying a set of compatibility rules to the first manufacturing data and the second manufacturing data, determining pairing data from the application of the set of compatibility rules to the first manufacturing data and the second manufacturing data, obtaining a reliability model of products including the product, augmenting the reliability model based on the pairing data, and performing one or more actions with the augmented reliability model.

Abstract: Introduced here are various embodiments for selectively assigning a query to an expert. A network-accessible server system may receive a query from a client device indicating a question or project proposal. The query text may be parsed and attributes of the query may be determined by inspecting the parsed query text. The query attributes may be compared with attributes associated with a pool of experts with various specialties and expertise in various fields. The network-accessible server system may match the query attributes with attributes associated with a first expert with a similarity that exceeds a threshold similarity level to identify that an expertise of the first expert matches the requested expertise in the query. The first expert may be assigned to the query and prompted to provide a response to the query.

Abstract: Generating structured queries from natural language text may include receiving, using a processor, a natural language text input directed to a database management system and, using the processor, performing natural language processing on the natural language text input using an Unstructured Information Management Architecture. The natural language processing may annotate the natural language text input according to a structure of the database management system. A database operation and query elements may be determined using a processor from the annotated natural language text input. A structured query may be created, using the processor, for the database management system that implements the database operation using the query elements.

Abstract: Systems and methods are disclosed for optimizing full-spectrum cardinality approximations on big data utilizing an optimized order statistics technique. To accomplish the foregoing, a multiset of objects that each corresponds to one of a plurality of objects associated with a resource are obtained. A compound data object is populated at least in part with data that is derived based on generated decimal fraction hash values that correspond to each object in the obtained multiset. The populated compound data object is processed with a full-spectrum arithmetic mean estimation operation that can accurately determine a cardinality estimate for the obtained multiset using less resources and time when compared to traditional techniques. The determination is further made without the need to employ linear counting or bias correction operations on low or high cardinalities.

Abstract: Described herein is a system and method for detecting and reusing overlapping computations. Overlapping subgraphs of the query are determined using a normalized signature for a particular subgraph that identifies a particular subgraph across recurring instances of data. A normalized signature for each overlapping subgraph for the determined overlapping subgraphs of the query is provided. For each overlapping subgraph determined to be materialized: whether or not the particular subgraph has been materialized is determined using a precise signature corresponding to a normalized signature of the particular overlapping subgraph. The precise signature identifies a particular subgraph corresponding to the normalized signature within a particular recurring instance of data. When the particular subgraph has not been materialized, the subgraph is materialized and used to respond to the query. When the particular subgraph has been materialized, the materialized subgraph is used to respond to the query.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for facilitating dynamic selection and application for rules for query processing for large datasets in an on-demand services environment according to one embodiment. In one embodiment and by way of example, a method comprises determining processing patterns of a query based on historical performances associated with the query placed on behalf of a tenant in a multi-tenant environment, and dynamically applying one or more rules to the query for processing of the query within a predictable amount of time, where the one or more rules are dynamically selected from sets of rules based on the processing patterns. The method may further include executing the query based on the one or more rules by scanning one or more portions of a database having contents pertinent to the query and generating results by processing the query based on the contents and within the predictable amount of time.

Abstract: Disclosed herein are system, method, and computer program product embodiments for accelerating queries with zone map enhancements. An embodiment operates by receiving a query including a condition on one or more values from a column of a database table. It is determined that the values from the column are divided into a plurality of data zones, and that a sorted dictionary includes an ordered arrangement of the values from the column. A min value and a max value from a satisfaction array that indicates which values satisfy the condition are determined. Which of the data zones are disqualified are determined based on the values of the disqualified data zone falls outside of the range between the minimum value and the maximum value. The values of any remaining zones are evaluated to determine a result of the query. The result set is returned.

Abstract: Identifying data within a data store satisfying a request. A quantity of the identified data is greater than a threshold. The identified data is analyzed to produce an initial result set with a reduced data quantity including information summarizing the identified data. The analyzing includes visualizing the information summarizing the identified data as one or more graphical displays rendered within a user interface and selectively filtering the identified data based upon a selection of filter factors associated with the identified data to generate an initial result set having a smaller size in relation to the identified data set. Each of one or more succeeding result sets are generated from a corresponding prior result set until a succeeding result set includes a quantity of data satisfying the threshold. The generating of each succeeding result set includes filtering the corresponding prior result set and information summarizing the filtered result set.

Abstract: A method for automatically processing log files of different types of an automation system, said method determining a message part of a data set of the log file. All contents of the respective data sets of the log files are concatenated. The data sets of all the log files are summarized in a summary file. The data sets of all the log files are chronologically sorted in the summary file. The data sets are compressed in the summary file. The compressed data sets in the summary file are coded. The compressed data sets are assigned to groups with associated group codes. The group code of the assigned group is decoded. The decoded group code is output as the alphanumeric message part of the log file. The alphanumeric message part of the log file is stored in a memory.

Abstract: Methods, systems, and computer-readable media for implementing event-stream searching using compiled rule patterns are disclosed. A rule base is compiled based at least in part on one or more rule patterns. The field names are sorted within the rule patterns. The rule patterns comprise one or more field names and one or more field values. The rule base represents a finite-state machine comprising a plurality of states. A plurality of events are received. The events comprise field names and field values describing events associated with resources in a provider network. The field names are sorted within the events. The rule patterns are evaluated against the events using the rule base. In determining a matched rule pattern for one of the events, the finite-state machine transitions between at least two of the states for the matched rule pattern.

Abstract: Techniques for efficient data correlation are provided. A first data partition is received, and a first hash table of a plurality of hash tables is selected based on a timestamp associated with the first data partition. Additionally, a first hash bucket in the first hash table is identified based on the first data partition. It is determined that the first hash bucket includes a second data partition. Upon determining that the first hash bucket satisfies a predefined criterion, the second data partition is removed from the first hash bucket, and the first and second data partitions are associated.

Abstract: Systems, methods, and apparatus include computer programs encoded on a computer-readable storage medium, including a system for ranking videos. Videos are identified that have been presented at client devices. For each video, session start data is identified that specifies a lead video that initiated presentation to a user during a presentation session. For each lead video, presentation times over multiple user sessions are determined, a scaled presentation time is obtained, user sessions for which the lead video initiated presentation of videos are identified, and an aggregate video presentation time attributable to the lead video is determined. For each given video, a presentation score is determined based on a scaled presentation time of the lead video relative to a sum of the aggregate video presentation times for the lead videos. The videos are ranked based on the presentation scores. A user interface is updated to present the ranked videos.

Abstract: Computer-based methods, systems, and computer readable media for managing documents within a content repository or documents within the document subsets are provided. Documents within the content repository may be classified into one of a functional category and a clinical category. Documents are applied to a machine learning annotation and analysis module to automatically annotate the documents to indicate relationships between entities. A request is processed for the documents including one or more search terms, wherein the search terms pertain to one or more entities from a group of gene, gene variant, drug, cancer and a biomedical/clinical term. Documents satisfying the request are identified by comparing the one or more search terms to the annotations and specific sections of the documents, and determining a relevance of a document based on the comparison and a frequency of the one or more search terms in each of the specific sections. The identified documents are ranked according to custom techniques.

Abstract: A database system stores data in a bi-temporal index that maintains recordation time and a validity time for recorded values. The index for a given key may be append only, such that the stored data for the key doesn't require modification of previously-recorded data for given validity times. The bi-temporal index comprises a key-value data store that allows values to be recorded for a specific key, validity time, and recordation time. To retrieve a value, a request presents a query with a key, subject time, and observation time. Queries look for values with a validity time most recent to and before the queried subject time and a recordation time, associated with the validity time, most recent to and before the queried observation time. The queries prioritize the validity time over the recordation time and returns the value that satisfies the query request.

Abstract: Methods and apparatuses for search and content creation. A partial input is received via a user interface of an electronic computing device. The partial input to be used for content creation. A search query is generated in response to receiving the partial input. A structured data repository is searched for objects matching the partial input. Results from the searching of the data repository are provided. Suggested content to be created from the displayed results is generated.

Abstract: Embodiments of the present invention provide systems, methods, and computer storage media for guided visual search. A visual search query can be represented as a sketch sequence that includes ordering information of the constituent strokes in the sketch. The visual search query can be encoded into a structural search encoding in a common search space by a structural neural network. Indexed visual search results can be identified in the common search space and clustered in an auxiliary semantic space. Sketch suggestions can be identified from a plurality of indexed sketches in the common search space. A sketch suggestion can be identified for each semantic cluster of visual search results and presented with the cluster to guide a user towards relevant content through an iterative search process. Selecting a sketch suggestion as a target sketch can automatically transform the visual search query to the target sketch via adversarial images.

Abstract: A multi-dimensional graphic user interface displays selected types of information regarding items included in one or more databases or returned by a search in accordance with locations on a two-dimensional display area or projection of a three-dimensional space on a two-dimensional area and provides for selective display of information about respective items in a database (e.g. metadata) as additional dimensions of the display which may be suppressed and/or selectively introduced to avoid user distraction or obscuring information or for comparison between screens which may indicate to a user the degree to which a particular item may or may not be germane to an issue or particular subject matter of interest. The graphic user interface thus provides an effective tool for evaluating search results and organizing detailed review thereof.

Abstract: The present disclosure discloses a method and system for integrating a dynamic Business Logic (BL) Database (DB) with a Human Machine Interface (HMI) application. The method comprises receiving a Business Logic (BL) specification. The BL specification comprises BL data and one or more parameters associated with the BL data. Further, one or more state charts of the BL data are generated from the BL specification. Thereafter, a dynamic BL DB is developed based on the one or more parameters and the one or more state charts. Furthermore, the BL data in the dynamic BL DB is updated when the BL data in the BL specification is updated. Lastly, the dynamic BL DB is integrated with a HMI application utilizing the BL data to implement the BL. The HMI application retrieves the updated BL data from the dynamic BL DB for implementing updated BL.

Abstract: Systems and methods for data management are disclosed. In one embodiment, in an information processing apparatus comprising at least one computer processor, a method for data management may include (1) generating a unified model for a plurality of data sources for an organization, the unified model identifying the data sources and a type of data associated with each data source; (2) harvesting data from the data sources; (3) linking the harvested data to the unified model; and (4) receiving and processing a data lineage query against the linked harvested data.

Abstract: Data conversion circuitry receives structured records including normalized data and performs a data conversion process on the structured records to generate unstructured records including unstructured syntax. The data conversion circuitry performs the data conversion process according to an unstructured syntax requirement including a syntax field mapping between the structured records and the generated unstructured records.

Abstract: Computer implemented systems and methods are disclosed for importing data from electronic data files. In accordance with some embodiments, a file format is assigned to a source electronic data files by a data importation system. The data importation system may further identify a file type identifier associated with the source electronic data file and map the source electronic data file to a transformation template. The data importation system may further store the file format, file type identifier, and an indication of the transformation template as a file type profile associated with the source electronic data file in a database.

Abstract: Method, device, and system for peer-to-peer data replication are provided. The method includes: generating a first commit redo record attached with a CSN when a first write operation happens on a first physical entity in a master node, wherein the master node is preset with the first physical entity and a second physical entity and is connected to a first subscriber node and a second subscriber node; pushing, the first commit redo record to a first subscriber node corresponding to the first physical entity based on mapping relationships between the physical entities and the subscriber nodes, wherein the first commit redo record is used for replicating data of the first write operation from the master node to the first subscriber node, and then to the second subscriber node through pushing, by the first subscriber node, the received first commit redo record to the second subscriber node.

Abstract: A system, computer program product, and computer-executable method of providing remote snapshot access from a target site within a data storage system including a source site and the target site, the system, computer program product, and computer-executable method including receiving a request to replicate a snapshot from the source site to the target site, initializing replication of the snapshot, providing access to the replicated snapshot at the target site, and processing the replication of the snapshot to create a replicated snapshot.

Abstract: A distributed database system may perform a single phase commit for transactions involving updates to multiple databases of the distributed database system. A client request may be received that involves updates to multiple database of the distributed database system. The updates may be performed at a front-end database and a back-end database. Log records indicating the updates to the front-end database may be sent to the back-end database. The log records and the updates performed at the back-end database may be committed together as a single phase commit at the back-end database. In the event of a system failure of the front-end database, log records may be requested and received from the back-end database. A restoration of the front-end database may be performed based, at least in part, on the received log records.

Abstract: Software Defined Network Attached Storage data backup is implemented using storage array synchronous data replication. A TLU is created for each user filesystem managed by a Virtual Data Mover (VDM). A VDM configuration filesystem is also created containing metadata describing a mapping of user file system TLU to physical storage resources on the storage array. Both the user filesystem TLUs and the VDM configuration filesystem are mapped to an asynchronous Remote Data Forwarding (RDF) group of the storage array, which is used by the storage array to replicate both the user filesystem TLUs and VDM configuration filesystem. Filesystem ID and export path information are reserved on the primary storage array and backup storage array when the RDF group is set up, to enable transparent failover from the primary to the backup node of selected VDMs.

Abstract: Techniques are provided for synchronous replication based cutover. An asynchronous replication process is executed to perform asynchronous incremental transfers of data of a storage object from a first computing environment to a replicated storage object at a second computing environment until a cutover criteria is met. A synchronous replication process is executed to synchronously replicate operations, targeting the storage object, to the replicated storage object based upon the cutover criteria being met. A cutover is performed to direct operations from targeting the storage object to targeting the replicated storage object based upon the synchronous replication process reaching a steady state of synchronous replication for sub-objects of the storage object, where operations are committed to both the storage object and the replicated storage object.