Abstract: Techniques are described for using a single application to interact with multiple separate realms simultaneously while maintaining data security boundaries. For example, a web browser may be used to access and interact with the multiple separate secure realms while maintaining data security boundaries between the systems. Multiple concurrent sessions may be established for a user between the web browser and multiple realms. Separate sets of security credentials (e.g., credentials used for authentication and authorization purposes) may be used to establish the sessions and for operations performed in the realms via the sessions. The application can also execute logic (e.g., via machine-executable code or instructions) for automating operations performed in the realms, such as, automating the initiation of a certain operation in one realm based upon a response received from another realm, causing operations to be initiated in two different realms such that the operations overlap in the time; and the like.

Abstract: Techniques for generating, simulating, and optimizing one or more provider-specific cloud-based architectures from a provider-independent architecture definition are disclosed. An architecture generator maps provider-independent service definitions to provider-specific service components for one or more specific cloud service providers. An architecture simulator simulates execution of a set of operations on the provider-specific cloud-based architectures to determine one or more performance and cost metrics. An architecture optimizer varies one or more design choices or parameters of a provider-specific service component to suggest which variant is optimal with respect to an optimization objective.

Abstract: The present embodiments relate to a secure boot partition for a cloud computing device of a cloud computing system. The computing device of the cloud computing system can transmit a first request for a pre-boot execution environment executable from a smart network interface card (SmartNIC). The computing device can receive the pre-boot environment executable from the SmartNIC and verify the pre-boot execution environment executable. The computing device can execute the pre-boot execution environment executable. Executing the pre-boot execution environment executable can include transmitting a second request secure boot metadata from the SmartNIC and receiving the secure boot metadata. Executing the pre-boot execution environment executable can further include mounting a boot partition, loading a boot loader obtained from the boot partition, verifying the boot loader based at least in part on the secure boot metadata, and executing the boot loader in response to verifying the boot loader.

Abstract: The present disclosure provide a multiple factor authentication process using text pass codes. A process performs a first verification of a user using an authentication credential transmitted via a first communication channel. Based on successfully performing the first verification, the process performs a second verification using a textual phrase transmitted to the user via a different communication channel. The words included in the textual phrase can be selected to avoid ambiguous pronunciations and spellings.

Abstract: Techniques are described for implementing a virtual smart network interface card to facilitate data transmission in an edge device providing cloud-computing operations. An edge device can implement a private virtual network that includes a private virtual network data plane. The edge device can execute a virtual machine to be connected to the private virtual network. To establish the connection, the edge device can generate a virtual network interface that includes a first endpoint and a second endpoint and is hosted within the private virtual network data plane. The edge device can associate the first endpoint with the virtual machine and associate the second endpoint with an orchestration module of the private virtual network data plane. The virtual machine can then send a data packet to the orchestration module via the virtual network interface.

Abstract: The present disclosure relates to systems and methods that enhance log data processing, storage, and querying by dynamically allocating mapping connections between processing/storage components based on characteristics of incoming data and the processing/storage components. More particularly, incoming data from a data stream may be extracted and utilized according to dynamic component mapping to more efficiently process the data. Additionally, active processing/storage metrics may cause dynamic reallocation of the component mappings to balance resource loads.

Abstract: Techniques for generating action recommendations for a data tape system are disclosed. A data tape system generates action recommendations for a data tape based on library-based metadata messages as well as a measured data quality value of the data tape. The system initiates an operation resulting in the data tape interacting with a media drive. A data tape library controller generates one or more metadata messages based on a result of a requested operation. The metadata message may include information regarding the type of error and a default recommended course of action. The system generates the recommended action for the data tape using a trained machine learning model.

Abstract: A computer comprising one or more processors and memory may implement multiple threads performing mutually exclusive lock acquisition operations on disjoint ranges of a shared resource each using atomic compare and swap (CAS) operations. A linked list of currently locked ranges is maintained and, upon entry to a lock acquisition operation, a thread waits for all locked ranges overlapping the desired range to be released then inserts a descriptor for the desired range into the linked list using a single CAS operation. To release a locked range, a thread executes a single fetch and add (FAA) operation. The operation may be extended to support simultaneous exclusive and non-exclusive access by allowing overlapping ranges to be locked for non-exclusive access and by performing an additional validation after locking to provide conflict resolution should a conflict be detected.

Abstract: Techniques are disclosed hereafter for efficiently enforcing a “WITHOUT OVERLAP” range constraint by confirming primary-key integrity for a new or modified row (the “target row”) by checking just two neighboring index entries, using a new “two-sided halted range scan” of the same key index on entities which have range-endpoints data as part of their primary key. Techniques are described for reducing search time and resources in situations where a query specifies an entity and a point within a non-overlapping range. Techniques are also described for optimized handling of queries that do not specify a primary key but have both a range condition and a filter on a non-key column.

Abstract: In accordance with an embodiment, the system provides support for large queries in a multidimensional database computing environment. A kernel-based data structure, referred to herein as an odometer retriever, or odometer, that manages pointers to data blocks, contains control information, or otherwise operates as an array of arrays of pointers to stored members. When used with a dynamic flow, the approach enables the system to be used, for example to handle grid queries, Multidimensional Expressions (MDX) queries, or other types of queries in which the potential size of the query can be up to 264 bits.

Abstract: Techniques are described herein for a Name Matching Engine that integrates two Machine Learning (ML) module options. The first ML module is a feature-engineered classifier that boosts text-based name matching techniques with a binary classifier ML model. The feature-engineered classifier comprises a first stage of text-based candidate finding, and a second stage in which a binary classifier model predicts whether each string, of the candidate match list, is a match or not. The binary classifier model is based on features from two or more of: a name feature level, a word feature level, a character feature level, and an initial feature level. The second ML module of the Name Matching Engine comprises an end-to-end Recurrent Neural Network (RNN) model that directly accepts name strings as a sequence of n-grams and generates learned text embeddings. The text embeddings of matching name strings are close to each other in the feature space.

Abstract: In some implementations, techniques described herein may include identifying text in a visually rich document and determining a sequence for the identified text. The techniques may include selecting a language model based at least in part on the identified text and the determined sequence. Moreover, the techniques may include assigning each word of the identified text to a respective token to generate textual features corresponding to the identified text. The techniques may include extracting visual features corresponding to the identified text. The techniques may include determining positional features for each word of the identified text. The techniques may include generating a graph representing the visually rich document, each node in the graph representing each of the visual features, textual features, and positional features of a respective word of the identified text. The techniques may include training a classifier on the graph to classify each respective word of the identified text.

Abstract: Method includes extracting, from document image, tables as objects; outputting tables in an XML format; filtering tables based on keywords and a condition including one from among AND and OR, which includes: for each of tables, determining whether the table includes at least one from among a first keyword and a second keyword, for condition being AND, based on the table containing first keyword and second keyword, outputting the table, as filtered table, and, for condition being OR, based on the table containing first keyword or second keyword, outputting the table, as filtered table, thereby outputting filtered tables that include the first keyword and/or the second keyword based on condition; executing query on filtered tables that includes keys composed based on cell level information associated with filtered tables; identifying cells based on keys; and providing target content that corresponds to cells, as response to query.

Abstract: Techniques for recommending plans to remediate a network topologies are disclosed. The techniques include predicting characteristics of the network using network topology information identifying relationships between entities in the network. The techniques further include determining a subset of the topology based on the predicted characteristics violating anomaly detection criteria. Additionally, the techniques include determining a remediation plan for modifying the subset and presenting the plan to a user.

Abstract: Disclosed is an approach to autonomously abort a lower priority transaction that is blocking a higher priority transaction, where the lower priority transaction is holding a lock on a resource for which there is contention. Some approaches also provide an efficient way to implement identification of a blocker transaction, which drastically reduces the response time to abort the blocker transaction.

Abstract: Techniques are disclosed for utilizing control packets to manage flows. In one example, an accelerator determines that a cache entry is a candidate for removal, the accelerator being responsible for forwarding packets associated with a particular flow based at least in part on a flow state. The accelerator generates an instruction to remove a cache entry of the particular flow from a cache based at least in part on receiving the determination that the cache entry is the candidate for removal. The accelerator removes the cache entry from the cache based at least in part on the instruction. The accelerator generates a control packet that includes a flow information associated with the particular flow being formatted utilizing a particular header format. The accelerator transmits the control packet to a programming data plane utilizing a path based at least in part on the control packet utilizing the particular header format.

Abstract: The present disclosure relates to techniques for identifying out-of-domain utterances.

Abstract: Techniques are disclosed for a smart network interface card (smartNIC) performing a unified logging process. In one example, an accelerator transmits a packet to a programming data plane of the smart network interface card. The programming data plane determines whether the packet is to be forwarded. In accordance with a determination that the packet is not be forwarded, the programming data plane modifies the packet to include an instruction that instructs the accelerator to log the packet and to not forward the packet. The programming data plane transmits the modified packet to the accelerator. The accelerator logs data associated with the modified packet to a unified log based at least in part on the instruction.

Abstract: Disclosed is an improved approach to handle recovery failures associated with fatal recovery processes. A software crash is prevented when a program has a failure that would typically crash the software, involving analyzing the failure in an operation, accumulating the failure information, clearing the failure (hence preventing the immediate crash), and not performing the desired operation until the root cause of the failure is fixed.

Abstract: Techniques are disclosed for processing flows by a smart network interface card (smartNIC) based on modifying a packet. In one example, an accelerator receives a packet from a first port of the smartNIC. The accelerator determines that the packet was received from a first port via a second data path instead of a first data path. The accelerator modifies the packet to indicate that the packet arrived from the first port via the second data path. The accelerator inserts the modified packet into a queue. A programming data plane of the smartNIC receives the modified packet from the queue. The programming data plane processes the modified packet based at least in part on determining that the packet arrived at the first port via the second data path.

Abstract: Techniques for sales orchestration using iterative machine learning are disclosed, including: obtaining, by a customer relationship management (CRM) system, opportunity-specific CRM data; generating, by the CRM system, one or more suggested sales actions applicable to the opportunity-specific CRM data, at least by applying a machine learning model to the opportunity-specific CRM data, wherein the machine learning model is configured to generate suggested sales actions based on CRM data; presenting, in a graphical user interface (GUI) of the CRM system, the one or more suggested sales actions; receiving, via the GUI of the CRM system, user input that indicates a chosen sales action associated with the opportunity-specific CRM data; obtaining, by the CRM system, data that indicates an outcome of the chosen sales action; updating the machine learning model based on the outcome of the chosen sales action.

Abstract: Techniques for recommending plans to remediate a network topologies are disclosed. The techniques include logging network topology information identifying relationships between entities in a network topology over a number of time periods. The techniques also include, using the logged network topology information, predicting characteristics of the network at a future time period. The techniques further include computing a signature based on the predicted characteristics and, using the signature, determining whether the predicted characteristics meet remediation criteria. Additionally, the techniques include, in response to determining the predicted characteristics meet the remediation criteria, determining a remediation plan for the current network topology and presenting the plan to a user.

Abstract: Techniques and apparatus for data networking are described. In one example, a method includes receiving a first Layer-2 Remote Direct Memory Access (RDMA) packet which includes a virtual local area network (VLAN) tag and a quality-of-service (QoS) data field; converting the first Layer-2 RDMA packet to a first Layer-3 encapsulated packet; and forwarding the first Layer-3 encapsulated packet to a switch fabric. In this method, the converting includes adding at least one header to the first Layer-2 RDMA packet, where the at least one header includes: a virtual network identifier that is based on information from the VLAN tag, and a QoS value that is based on information from the QoS data field.

Abstract: Techniques are provided for moving data between partitions. Such a process may be performed without requiring any locks that block transactions that target a partition from being executed. Instead, such transactions may proceed while a move operation is being performed. The move operation involves copying data from the targeted partition to another partition that is hidden from (or “invisible” to) those transactions that attempt to read from or write to the partition. During the move operation, changes that are made to the partition are also reflected in a journal. Eventually, the changes reflected in the journal are drained and applied to the hidden partition. Once the partition and the hidden partition are synchronized, the identities of the partitions are swapped so that future transactions will target the previously-hidden partition instead of the previously-viewable partition.

Abstract: In accordance with an embodiment, described herein is a system and method for connection concentration in a database environment. A transparency engine provided between client applications and a database can include a connection pool (e.g., UCP connection pool). The transparency engine can operate as a proxy engine for the database and as a session abstraction layer for the client applications, to enable the client applications to utilize features provided by the connection pool without code changes. The transparency engine can receive application connections from the client applications, and concentrate the application connections on a smaller number of database connections maintained in the connection pool.

Abstract: Techniques for controlling packet flows through the generation of packet flow rules are described. In an example, a network virtualization device receives network data. The network virtualization device determines a set of networks of a virtual network based on the network data. The network virtualization device receives flow data of the customer. The network virtualization device generates a packet flow rule based on the flow data and the set of networks. The packet flow rule defines a network boundary of one or more networks such that a first packet having a destination within the network boundary can flow and such that a second packet having a destination outside of the network boundary is to be dropped. The network virtualization device stores the packet flow rule in association with the compute instance.

Abstract: Techniques for managing anomalies in a software system include monitoring the software system for anomalies via a plurality of signals and determining that signal results associated with the signals indicate a presence of an anomaly in the software system. The techniques also include identifying a hierarchy of sensors associated with the anomaly, where the hierarchy includes a parent sensor and a set of child sensors that are direct or indirect descendants of the parent sensor. The techniques additionally include executing the parent and child sensors to analyze the software system for one or more causes of the anomaly, and determining the cause(s) of the anomaly based on sensor results generated by the parent and child sensors. Finally, the techniques include causing remediation of the cause(s) of the anomaly based on one or more child sensors associated with the cause(s) and one or more resolutions mapped to the child sensor(s).

Abstract: We disclose a system that executes an inferential model in VRAM that is embedded in a set of graphics-processing units (GPUs). The system obtains execution parameters for the inferential model specifying: a number of signals, a number of training vectors, a number of observations and a desired data precision. It also obtains one or more formulae for computing memory usage for the inferential model based on the execution parameters. Next, the system uses the one or more formulae and the execution parameters to compute an estimated memory footprint for the inferential model. The system uses the estimated memory footprint to determine a required number of GPUs to execute the inferential model, and generates code for executing the inferential model in parallel while efficiently using available memory in the required number of GPUs. Finally, the system uses the generated code to execute the inferential model in the set of GPUs.

Abstract: A method, system, and computer program product for managing user identification codes in an interne advertising environment. One aspect implements a system including a database engine to store a plurality of signals comprising characteristics and/or values received from a user device. A user ID generator calculates collision statistics and/or fragmentation statistics to form a first mapping function that is in turn used to generate a plurality of identification codes based at least in part a first set of selected signals. A calibration module produces measurements determined from collision quantities and/or fragmentation quantities using the first mapping function, wherein the measurements are determined by comparing the plurality of identification codes to entries in a known ID database. A sequencing module generates updated sequences of mapping functions.

Abstract: Techniques are disclosed for scaling an IP address in overlay networks without using load balancers. In certain implementations, an overlay IP address can be attached to multiple compute instances via virtual network interface cards (VNICs) associated with the multiple compute instances. Traffic directed to the multi-attached IP address is distributed across the multiple compute instances. In some other implementations, ECMP techniques in overlay networks are used to scale an overlay IP address. In forwarding tables used for routing packets, the IP address being scaled is associated with multiple next hop paths to multiple network virtualization devices (NVDs) associated with the multiple compute instances. When a particular packet directed to the overlay IP address is to be routed, one of the multiple next hop paths is selected for routing the packet. This enables packets directed to the IP address to be distributed across the multiple compute instances.

Abstract: Techniques are described herein for performing efficient matrix multiplication in architectures with scratchpad memories or associative caches using asymmetric allocation of space for the different matrices. The system receives a left matrix and a right matrix. In an embodiment, the system allocates, in a scratchpad memory, asymmetric memory space for tiles for each of the two matrices as well as a dot product matrix. The system proceeds with then performing dot product matrix multiplication involving the tiles of the left and the right matrices, storing resulting dot product values in corresponding allocated dot product matrix tiles. The system then proceeds to write the stored dot product values from the scratchpad memory into main memory.

Abstract: Techniques for managing requests to modify a data set at future times are disclosed. The system receives a request to modify the data set at a future time, such as in a future time window. The system generates a representation of the data set at the future time. The system determines the future state of the data set based on the current state of the data set and requested future modifications to the data set. The system determines whether a conflict exists between the request to modify the data set at the future time and another scheduled request to modify the data set at the future time. Based on determining whether a conflict exists, the system performs one or more of scheduling the request to modify the data set at the future time and performing a remediation action to address the conflict.

Abstract: Techniques are disclosed for generating a search index for a hierarchical data set so that a search query of the hierarchical data may return results without searching or analyzing the hierarchical data set itself. The techniques generate a flattened index that includes selected indexed attributes and additional attributes to be displayed with the indexed attributes. The techniques also generate a hierarchy representation of the hierarchical data. Using these generated data structures, query results may be returned without directly traversing the hierarchical data itself while also providing data and hierarchical context for the query results by overlaying the query results with nodes of the hierarchical representation or otherwise concurrently displaying the query results with nodes of the hierarchical representation.

Abstract: Some embodiments determine characteristics related to a theme or branding of an existing website. Characteristics from an existing website may, for example, facilitate theming or branding of a new website or software product to coordinate with the existing website. A characteristic extraction system may optimize an existing webpage based on target characteristics to be extracted from the existing webpage. Optimizing an existing webpage includes manipulating the webpage source code and/or the webpage data to facilitate extraction of the target characteristics. Optimization may result in removal of data or formatting from the existing webpage that is unnecessary for extraction of the target characteristics.

Abstract: Methods, systems, and computer readable media for network slice selection function (NSSF) recovery. A method includes creating, at an NSSF, subscriptions for a number of access and mobility management functions (AMFs) and storing availability information for each AMF. The method includes determining, at the NSSF, that the NSSF failed to process at least one service update message from at least one of the AMFs, and in response, sending a notification request message to each of the AMFs, the notification request message requesting each AMF to update availability information for the AMF. The method includes receiving, at the NSSF, updated availability information from each of the AMFs. The method includes distributing, at the NSSF, the updated availability information to each of the AMFs.

Abstract: Techniques for UNDO and REDO operations in a computer-user interface are disclosed. The techniques enables users to configure entities for UNDO and REDO operations. The techniques also enable users to roll back individual entity to an immediate previous state in one UNDO operation and subsequently to the other previous states. Other entities are not affected by the UNDO operations to the entity.

Abstract: Disclosed is an improved approach to implement anomaly detection, where an ensemble detection mechanism is provided. An improvement is provided for the KNN algorithm where scaling is applied to permit efficient detection of multiple categories of anomalies. Further extensions are used to optimize local anomaly detection.

Abstract: Techniques are described for checkpointing multiple key ranges in parallel and concurrently during file storage replications between file systems in different cloud infrastructure regions. In certain embodiments, multiple range threads processing multiple key ranges, one thread per key range, create checkpoints for their respective key ranges in parallel and concurrently after processing a per-determined number of B-tree keys. In certain embodiments, upon encountering a failure event, either a system crash or a thread failure, each thread restarts its B-tree key processing from a B-tree key after the most recent checkpoint.

Abstract: A computing device may receive a first packet addressed to a destination node. The device may check a packet counter to determine if the counter exceeds a threshold, the counter recording a number of packets addressed to the destination node that have been received during a first time period. The device may in response to the packet counter exceeding the threshold: send, by the computing device, a query to an intermediate node; generate, by the device, a query flag in response to sending the query. The query flag can indicate that a query has been sent to the intermediate node. A reply from the intermediate node can be received by the device. The reply can identify a set of processes that the intermediate node is configured to perform on the first packet. The set of processes can be applied by the device to the first packet.

Abstract: When a cloud services provider infrastructure (CSPI) receives a request from an administrator to perform an operation on an appliance, a load balancer may select a first server within the CSPI to process the request. If the first server does not have a connection with the appliance, the first server may generate a redirect response that includes server identification information identifying a particular server having a pre-established connection with the appliance. The first server may send the redirect response to the application that the administrator used to send the request. The application may then generate a second request that includes the server identification information, and send the second request to the CSPI. A load balancer in the CSPI may then forward the second request to the particular server, and the particular server may use the pre-established connection to send a request to the appliance requesting performance of the operation.

Abstract: The disclosed systems, methods and computer readable media relate to managing Non-Volatile Memory Express (NVMe) over Transmission Control Protocol (TCP) (NVMeOTCP) connections between a smart network interface card (smartNIC) and a block storage data plane (BSDP) of a cloud computing environment. A software agent (“agent”) executing at the smartNIC may manage a number of network paths (active and, in some cases, passive network paths). The agent may monitor the network traffic (e.g., input/output operations (IOPS)) through the paths (e.g., using established NVMeOTCP connections corresponding to the paths). If a condition is met relating to a heat threshold of an active path (e.g., the currently used network path), the agent may determine whether to failover and, if so, the agent may select a network path for failover. In some cases, this determination and potential selection may factor in heat measurements of the current and other available network paths.

Abstract: According to certain implementations, a motherboard is provided that enables operation as either multiple independent single-processor systems or a single multiple-processor system. In response to a request to configure the motherboard as multiple independent single-processor systems, a control block is implemented for each processor attached to the motherboard, where the control blocks configure the processors to boot and operate independently of each other, and the processors utilize separate motherboard resources. In response to a request to configure the motherboard as multiple independent single-processor systems, a single control block is implemented all processors attached to the motherboard, where the single control block configures all processors to boot and operate in a connected state, and the processors share all motherboard resources.

Abstract: Techniques for validating data in shared environments are disclosed. In some embodiments, a system monitors data during data entry windows and sends notifications when potential a data corruption event is detected. Users may identify what data to monitor by registering queries with the system. During the registration process, the system may execute the query to determine an expected query result. The system may then execute the query one or more additional times during the data entry window to determine whether a subsequent query result diverges from the expected result. If so, then the system may trigger a notification that identifies the potential data corruption event. Users may define notification lists for registered queries to identify recipients of the event notifications, which may span members of multiple teams in a development environment.

Abstract: Techniques for implementing an infrastructure orchestration service are described. A scheduler can receive a configuration file, which can include a first release identifier, for a first deployment of resources at an execution target. The resources can be deployed at the execution target according to the file. A current state of the resources can be stored. The scheduler can receive a second version of the file, which can include a second release identifier, for a new deployment at the execution target. At least one worker node can execute a plugin to compare the first identifier to the second identifier. If the first identifier is different than the second identifier, the plugin can compare a current state of the resources with a desired state according to the second identifier. If the desired state is different than the current state, the resources are deployed at the execution target according to the second identifier.

Abstract: Systems, methods, and other embodiments associated with an adaptive search system are described. In one embodiment, user actions are monitored on a search results list in a graphical user interface, wherein the search results list is obtained based on a query vector representing a search query. The query vector is dynamically modified in response to the user actions on a selected result document by shifting the query vector away from the selected result document in a vector space in response to the user rejecting the selected result document. A revised search results list is then generated without the user changing the search query by executing the modified query vector in a search.

Abstract: Using a computer system, an instruction is received to define or modify a permission constraint corresponding to one or more files. A permission-instruction data set representing the permission constraint is stored in a data store. Subsequent to storing the permission-instruction data, a user request to access a particular file is intercepted. The data store is queried to determine whether any pending permission-instruction data set corresponds to the particular file. In response to the query, it is determined that the permission-instruction data set corresponds to the particular file. A permission constraint of the particular file is added or modified based on the permission-instruction data set. Based on the modified or added permission constraint, it is determined whether and/or an extent to which the user request is authorized. A response to the user request based on the determination as to whether and/or an extent to which the user request is authorized.

Abstract: A framework for managing authorization for performance of actions with a computing system. For example, techniques for performing authorization of users and/or clients for access to an infrastructure service provided by a cloud servicer provider (CSP) and/or for performance of actions with the infrastructure service.

Abstract: Systems and methods described herein support compartment quotas in a cloud infrastructure environment. Cloud administrators do not generally have the ability to restrict resource usage in existing clouds. Granting a user permission to create resources allows them to create any number of resources up to a predefined account limit. Compartment quotas allow admins to restrict a user's resource usage to the appropriate level allowing fine-tuned cost control.

Abstract: Techniques are disclosed for using a multi-tenant framework for microservices in a microservices-based application to handle tenant-specific circuit breaking. The microservices-based application can include at least one microservice that incorporates the multi-tenant framework. The multi-tenant framework includes software components configured to provide multi-tenant functionality for the microservice. A first microservice may receive an indication associated with a tenant that a second microservice is overloaded. The first microservice can then receive a request containing tenant context data at an interface. A first software component of the multi-tenant framework can extract the tenant context data from the request. The first microservice may determine whether the tenant context data corresponds to the tenant. The first microservice can then trigger a circuit breaker for the second microservice.

Abstract: Systems and methods for providing a universal format driven data transformation. In conventional ETL operations, the transform process that transforms data from the source format to the destination format is based on a transformation program. Conventionally, transform logic is developed around the chosen transform program. In accordance with an embodiment, a universal, format-driven data transform can be achieved through the use of a data transformation format. In accordance with an embodiment, a method for providing a universal format driven data transformation can include providing a transformation format in a file, wherein the transformation format is in a human-readable form; and providing, in the transformation format, keywords defining a target table type, a dataset list, and dataset operations to be performed on a dataset from the dataset list.