Abstract: The present disclosure relates generally to managing access to an enterprise system using remote devices. Techniques are disclosed for provisioning applications on remote devices to access resources in an enterprise system. Specifically, applications may be automatically configured with access information (e.g., account information) and connection information to access a resource in an enterprise system using a remote device. Configuring an application may include determining an account for accessing a resource using the application. An account may be provisioned if one has not been established. Upon configuring an application, the device access management system may provide a configured application to the remote device(s) for which the application is configured. Once the configured application is received, the application may be automatically installed on the remote device, after which the application may be executed to access a resource.

Abstract: A method may include dividing code into trusted and untrusted components, and identifying a dynamic invocation in a first component of the code. The first component may be an untrusted component. The method may further include extracting dynamic information from the dynamic invocation, and identifying, using the dynamic information and metadata describing a dynamic behavior of the code, a target for the dynamic invocation. The target may correspond to a second component of the code. The method may further include determining that the target matches the dynamic invocation, and in response to determining that the target matches the dynamic invocation, adding, to a call graph generated from the code, an edge from the dynamic invocation to the target.

Abstract: An embodiment controls access to a resource, the access controlled by a multi-tenant system. Embodiments receive, at a web server, a request for the resource from a user via a web browser, the request including a Uniform Resource Locator (“URL”) associated with the resource and an identity of a tenant corresponding to the user. Embodiments determine an access policy for authenticating the user that is associated with the resource, the access policy based in part on the identity of the tenant. Embodiments then authenticate the user based on the determined access policy.

Abstract: In accordance with an embodiment, described herein is a system and method for loading and transforming data to a cloud database, using a hybrid set-based extract, load, transform approach. During the loading and transforming of large amounts of data, from one or more data sources, a data synchronization application sends small batches of data, in parallel streams, to the database, which operates as a transformation engine to load the data. Each stream can be associated with a separate staging table in the database. For each staging table, the subset of data therein is transformed and loaded, before the next subset is processed. A transform and merge process operating at the database can then be used to transform and merge the data, from each of the staging tables, to the target table.

Abstract: Disclosed are methods and apparatuses to provide a redo repeater that allows for no data loss protection without the performance impact to the primary database even when a significant geographical distance separates the primary and standby databases. The Repeater is a lightweight entity that receives redo from the primary database with the purpose of redistributing that redo throughout the primary/standby system configuration. The Repeater able to extend no data loss protection and switchover functionality to terminal standby databases even though the primary database does not need to have a direct connection with those destinations.

Abstract: A one-sided outer-join-based query is rewritten using a materialized view (MV), the definition of which includes the join but does not include a filter predicate from the query. The rewritten query nullifies data from the include-matching table, included in the MV, that does not satisfy the filter predicate. To improve accuracy of the query results, certain rows are removed from intermediate results of the query. To facilitate revising the query results for accuracy, the MV includes a unique column from the include-all table and also an indicator column that indicates whether a given row of the MV is an inner-join-type row or an anti-join-type row. The rewritten query adjusts the indicator values, in the indicator column, of MV rows that do not satisfy the filter to reflect a modified anti-join-type indicator value. Based on the modified indicator values and unique columns from include-all tables, accuracy of query results is attained.

Abstract: A method for determining power dissipation within a computer system is disclosed. A circuit block may receive a regulated voltage level on a power supply signal generated by a voltage regulator circuit. A power control circuit may measure a current drawn by the circuit block, and determine a real-time voltage level for the power supply signal using the current and based on a slope value and a zero-load voltage level. Additionally, power control circuit may determine a power dissipation for the circuit block using the current and the real-time voltage level, and adjust an operation parameter of the circuit block based on the power dissipation.

Abstract: Region summaries of database data are stored in persistent memory of a storage cell. Because the region summaries are stored in persistent memory, when a storage cell is powered off and data in volatile memory is not retained, region summaries are nevertheless preserved in persistent memory. When the storage cell comes online, the region summaries already exist and may be used without the delay attendant to regenerating the region summaries stored in volatile memory.

Abstract: Techniques for described for invoking a chatbot in a chatbot system, in response to an event notification from a software application. The event notification can be sent to the chatbot system based on the software application determining that one or more conditions associated with an event are satisfied. In certain embodiments, the event notification contains information indicating a dialog flow state for starting a new conversation between a particular chatbot and a user. The event notification can also identify the user and/or the particular chatbot. In some instances, a prompt is output to the user requesting the user to confirm a start of the new conversation. Whether the prompt is output or not can depend on whether there is an existing conversation between the user and a chatbot in the chatbot system.

Abstract: Disclosed techniques relate to managing a dialogue between a user device and an autonomous agent. For instance, a computing device creates a discourse tree from a body of text that includes fragments. The discourse tree includes a root node, nonterminal nodes, and terminal nodes. Each nonterminal node represents a rhetorical relationship between two of the fragments and each terminal node is associated with one of the fragments. The computing device determines a main topic of the body of text from the discourse tree. The computing device provides the main topic to the user device, and in response, receives a user utterance. The computing device determines an intent from the user utterance and navigates the discourse tree to locate relevant information consistent with the intent.

Abstract: Database transaction records that are received for committing data to a database may be associated with one or more validation tasks. When one of the validation tasks fails, the fault is detected and processing of the transaction record is halted. Instead of terminating the transaction record and requiring the submitting system to reinitiate the process, the system may use a mapping table to determine whether an automatic resubmission is possible. A new transaction record may be generated that copies an invocation context from the original transaction record, and portions of the transaction payload may be copied to the new transaction record with changes that ensure the new transaction record will pass the validation tasks. The new transaction record can then be submitted through the same interface that received the original transaction record, and the original transaction record can be removed from a transaction data store.

Abstract: The embodiments disclosed herein relate to identifying phrases in an electronic document, where each token is one or more characters. Phrases are formed from the tokens, based on a position of each token relative to other tokens in the document. If the horizontal space between two tokens is less than a threshold, the two tokens are identified as a phrase. Information identifying phrases and tokens can be stored in a marked-up document. Value phrases can be identified by the content of the phrase. Thereafter, a label phrase can be identified based on proximity to the value phrase and/or the presence of an association symbol in the phrase. The label phrase and value phrase can be identified as a label-value pair, where the label identifies the type of content in the value phrase. A reading order of the document can be determined through the use of a binary tree.

Abstract: The embodiments disclosed herein relate to extracting table data from an electronic document. Tables are detected based on identification of the column headers, of the table, that correspond to known fields. Once a table is detected, values corresponding to the column headers are extracted and stored in association with the known fields.

Abstract: Implementations generally relate to a spreadsheet add-in that provides data entry validation. As described in more detail herein, the spreadsheet add-in integrates a spreadsheet-based table component with a remote web service. The spreadsheet add-in uses web service metadata to validate data that a user enters into the spreadsheet. The spreadsheet add-in provides immediate feedback on errors in an interactive fashion for the user. Furthermore, during a data upload process, any errors that are reported by the web service are displayed in context such that the user may quickly affect corrections.

Abstract: A method is provided for space-efficient bookkeeping using bit-level locking. Each row of a bookkeeping table stores binary data comprising a plurality of bits. Each bit of the plurality of bits corresponds to a particular message and a particular consumer of the message, and indicates whether the particular message has been dequeued by the particular consumer. The bookkeeping table is stored on-disk and data corresponding to the bookkeeping table is stored in volatile memory. When a message is dequeued the in-memory bookkeeping data is updated, and the bookkeeping table is updated based on the in-memory bookkeeping data when the dequeue is committed.

Abstract: Methods and apparatus for providing a network attached storage system which does not require specialized hardware to operate. In one embodiment, a downloadable software package is provided via a web interface. After a user has downloaded and installed the software package, a sharable volume is created upon a host system. In one embodiment, the sharable volume is adapted to present the contents of one or more remote systems to the host system as a local file, drive, or directory. One or more processes resident in the host system are adapted to intercept a command interpretable by the host system and translate the command into one or more commands interpretable by at least one remote system. The one or more commands are then serviced by at least one remote system and a result set is generated. The result set may then be converted into a format interpretable by the host system and output accordingly.

Abstract: Embodiments select demand forecast parameters for a demand model for one or more items, receive historical sales data for the items on a per store basis and receive a plurality of seasonality curves for a first item. Embodiments determine a repeatability of each of the seasonality curves using a correlation of each seasonality curve over year to year demand and retain a first seasonality curve based on the repeatability. Embodiments determine a smoothness of the first seasonality curve and determine a sparsity of the first seasonality curve. Based on the determined repeatability, smoothness and sparsity, embodiments determine that the first seasonality curve is reliable and repeat the receiving the plurality of seasonality curves, determining the repeatability, determining the smoothness, and determining the sparsity to determine a plurality of reliable seasonality curves. Embodiments use the demand model and the reliable seasonality curves and determine a demand forecast for the first item.

Abstract: Techniques are disclosed for serializing assertion-triggering transactions by locking special purpose resources (i.e. other than rows or tables), which enables a high level of concurrency for these transactions while at the same time ensuring correctness of the SQL assertion validation code. The techniques involve creating objects referred to therein as “Assertion-Locking Memory-Objects” or “ALMOs”. The database server causes each assertion-triggering transaction to obtain locks on one or more ALMOs prior to determining whether the changes made by assertion-triggering transaction violates the assertion. Because locks on the ALMOs are finer than the table locks, fewer transactions are blocked by ALMO locks.

Abstract: A hashing scheme includes a cache-friendly, latchless, non-blocking dynamically resizable hash index with constant-time lookup operations that is also amenable to fast lookups via remote memory access. Specifically, the hashing scheme provides each of the following features: latchless reads, fine grained lightweight locks for writers, non-blocking dynamic resizability, cache-friendly access, constant-time lookup operations, amenable to remote memory access via RDMA protocol through one sided read operations, as well as non-RDMA access.

Abstract: System and method for supporting scalable representation of switch port status in a high performance computing environment. In accordance with an embodiment, a scalable representation of switch port status can be provided. By adding a scalable representation of switch port status at each switch (both physical and virtual)—instead of getting all switch port changes individually, the scalable representation of switch port status can combine a number of ports that can scale by just using a few bits of information for each port's status.

Abstract: A method of clustering call stacks from a memory dumps resulting from out-of-memory errors includes accessing a memory dump resulting from an out-of-memory error; identifying call stacks in the memory dump that are associated with the out-of-memory error; accessing call stacks from one or more other memory dumps that were determined to be associated with other out-of-memory errors; generating clusters of call stacks based on a similarity score; and providing a cluster for an analysis of the out-of-memory error.

Abstract: Techniques for transforming data based on a virtual topology are disclosed. A computer network is associated with a physical topology and a virtual topology. A physical topology is a particular arrangement of digital devices. A virtual topology is a description of a particular arrangement of virtual topology entities (VTEs). VTEs of the virtual topology are instantiated on digital devices of the physical topology. A processing component associated with a particular VTE processes data to perform one or more functions of the particular VTE. An emulation component associated with the particular VTE modifies the data to emulate performance of the functions by the particular VTE.

Abstract: Techniques are described for generating period profiles. According to an embodiment, a set of time series data is received, where the set of time series data includes data spanning a plurality of time windows having a seasonal period. Based at least in part on the set of time-series data, a first set of sub-periods of the seasonal period is associated with a particular class of seasonal pattern. A profile for a seasonal period that identifies which sub-periods of the seasonal period are associated with the particular class of seasonal pattern is generated and stored, in volatile or non-volatile storage. Based on the profile, a visualization is generated for at least one sub-period of the first set of sub-periods of the seasonal period that indicates that the at least one sub-period is part of the particular class of seasonal pattern.

Abstract: A method for discovering and tracking addresses associated with producer network function (NF) service endpoints includes receiving a first domain name system (DNS) resolution request from a requesting node. The method further includes querying a DNS server using a fully qualified domain name (FQDN) extracted from the first DNS resolution request. The method further includes receiving a first response from the DNS server, the first response including an associated with a producer NF service endpoint associated with the FQDN and storing the address associated with the producer NF service endpoint in a database. The method further includes communicating the address associated with the producer NF service endpoint to the requesting node. The method further includes monitoring the FQDN for changes in address associated with the FQDN. The method further includes notifying the requesting node of the changes in address associated with the FQDN.

Abstract: One method occurs at a first network node in a service provider network for providing at least one service to multiple tenants. The method includes generating, using input from an administrator of the service provider network, user configuration information for a first tenant; sending, to the first tenant, at least some of the user configuration information; receiving, from the first tenant, first configuration information for configuring a first conduit for tunneling communications between the service provider network and a first site associated with the first tenant's SD-WAN; configuring, using the first configuration information, the first conduit, wherein the first network node is associated with a plurality of conduits, wherein a second conduit of the plurality of conduits is at least in part configured by a second tenant and not the first tenant; and tunneling, via the first conduit, communications between the service provider network and the first site.

Abstract: Systems and methods for performing unsupervised baselining and anomaly detection using time-series data are described. In one or more embodiments, a baselining and anomaly detection system receives a set of time-series data. Based on the set of time-series, the system generates a first interval that represents a first distribution of sample values associated with the first seasonal pattern and a second interval that represents a second distribution of sample values associated with the second seasonal pattern. The system then monitors a time-series signals using the first interval during a first time period and the second interval during a second time period. In response to detecting an anomaly in the first seasonal pattern or the second seasonal pattern, the system performs a responsive action, such as generating an alert.

Abstract: Techniques are provided herein for contextual embedding of features of operational logs or network traffic for anomaly detection based on sequence prediction. In an embodiment, a computer has a predictive recurrent neural network (RNN) that detects an anomalous network flow. In an embodiment, an RNN contextually transcodes sparse feature vectors that represent log messages into dense feature vectors that may be predictive or used to generate predictive vectors. In an embodiment, graph embedding improves feature embedding of log traces. In an embodiment, a computer detects and feature-encodes independent traces from related log messages. These techniques may detect malicious activity by anomaly analysis of context-aware feature embeddings of network packet flows, log messages, and/or log traces.

Abstract: System and method for supporting shared multicast local identifiers (MLIDs) a high performance computing environment. In accordance with an embodiment, a shared MLID range can be configured such that each subnet within a fabric can utilize an MLID within a shared MLID range without the need to utilize a TCAM, or other memory, lookup of a MGID to MLID mapping.

Abstract: The embodiments disclosed herein select and assign a floating IP address (FIP) to an application based on characteristics of the application. Floating IP addresses are assigned a classification, and one or more network adapters are mapped to a FIP according to the FIPs assigned classification. The endpoint of a connection for an application initiating a network connection with a target application may be assigned a floating IP address according to attributes of the application being consistent with the classification of a FIP. Applications may be grouped according to their respective classification, and the group of applications may share a corresponding FIP. FIPs may be dynamically configured for an application with mapped network adapters selected based on the attributes of the application. An application's characteristics may change during executions, and the network adapters mapped to the FIP assigned to the application's connection may be reassigned.

Abstract: A method for modifying a call graph may include identifying, in source code, a first call site including a first predicate and a call from a first function to a second function. The first call site may correspond to a first edge of the call graph. The first edge may connect a first node corresponding to the first function and a second node corresponding to the second function. The method may further include modifying the call graph by labelling the first edge with a first encoding of the first predicate, and identifying, in the source code, a second call site including a second predicate and a call from a third function to the first function. The method may further include in response to determining that the first predicate is unsatisfied, modifying the call graph by labelling the second edge with a second encoding of a violation of the first predicate.

Abstract: Systems, devices, and methods discussed herein acquiring new definitions for entities from natural language queries. User input comprising a natural language expression may be obtained. A definiendum entity and one or more defining predicates may be identified from the natural language expression based at least in part on a predefined logical form template. An ontology may be search to determine whether the definiendum entity has a previously provided definition in the ontology. The defining predicates are converted to a logical form representation and optimized such that executing the optimized representation as a query against a knowledge base generates a number of results within a predefined acceptable range (e.g., meets/exceeds a lower threshold and/or meets/falls under an upper threshold). The optimized representation may then be added to the ontology.

Abstract: A browser is disclosed that provides for browsing a hierarchical dataset including potentially millions of nodes. The hierarchical dataset may be located on a machine that is remote to the machine hosting the browser. Through selective, intelligent fetching and local cache management of sparse portions of the hierarchical dataset, the browser provides consistent and predictable response times for displaying a randomly-selected node in the context of proximate nodes in the hierarchy.

Abstract: The disclosed embodiments relate to a system that camouflages EMI fingerprints in EMI emissions from a computing system to enhance system security. During operation, the system monitors the EMI emissions from the computer system during operation of the computer system to produce corresponding EMI signals. Next, the system determines a dynamic amplitude of the EMI emissions based on the EMI signals. If the dynamic amplitude of the EMI emissions drops below a threshold value, the system executes synthetic transactions, which have interarrival times that, when superimposed on a workload of the computer system, cause the computer system to produce randomized EMI emissions.

Abstract: Techniques described herein relate to systems and methods of data storage, and more particularly to providing layering of file system functionality on an object interface. In certain embodiments, file system functionality may be layered on cloud object interfaces to provide cloud-based storage while allowing for functionality expected from a legacy applications. For instance, POSIX interfaces and semantics may be layered on cloud-based storage, while providing access to data in a manner consistent with file-based access with data organization in name hierarchies. Various embodiments also may provide for memory mapping of data so that memory map changes are reflected in persistent storage while ensuring consistency between memory map changes and writes. For example, by transforming a file system disk-based storage into cloud-based storage, the file system gains the elastic nature of cloud storage.

Abstract: Techniques for handling failures in the execution flow of provisioning operations for a computer infrastructure system are disclosed. The techniques can include determining a service type of a service that generated an error during provisioning. An error handler can be selected based on the service type.

Abstract: The present disclosure provides a detailed description of techniques used in systems, methods, and in computer program products for bi-directional social media broker services that connect multiple social media sites using a common management framework. The claimed embodiments address the problem of efficiently scaling and managing bidirectional interaction with multiple social media publishing channels. More specifically, the claimed embodiments are directed to approaches for a computing platform having multiple message broker modules that enable bi-directional communication of messages between a common resource manager and a plurality of social media sites. The message broker modules can receive messages in a unified message format from the common resource manager, queue the messages for asynchronous processing, translate the messages from the unified message format to a site-specific format, and deliver the translated messages to multiple social media sites.

Abstract: In accordance with various embodiments, described herein are systems and methods for use with a multi-tenant application server environment, that support provisioning of domain partitions for use with software applications, including the provisioning of partitions with required components. Provisioning requests that are received at a lifecycle manager, and that specify the provisioning of a particular partition, can be communicated to a provisioning framework, for use in provisioning the partition, including where appropriate, the use of component-specific handlers that recognize partition provisioning events or control actions such as, for example, copying files, executing scripts, or updating configurations.

Abstract: Dynamic generation and implementation of assignment mappings of data items in large data files to distributed processors to achieve objectives such as reduced overall processing time like. Any appropriate key (e.g., character string) can be identified or obtained for each data item in a data file and the file can be segmented into sequential data blocks, where each data block includes a set of data items. The data items in each of a first plurality of the blocks (e.g., sampled block set) may be initially sorted into one of a plurality of key ranges of a search space (each corresponding to a different respective processor) and analyses conducted on the data items totals in each key range. The key range boundaries can be adjusted by accounting for uncertainty in the sample estimates to more evenly distribute data items from all blocks sent to each processor and thereby achieve the objective.

Abstract: Techniques are described herein for space-efficient encoding of label information of property graphs. In an embodiment, an input graph is received. The input graph comprises a plurality of entities and a plurality of label sets. Each entity of said plurality of entities is associated with a label set of the plurality of label sets and each label set of the plurality of label sets comprises zero or more labels of a plurality of labels. A first mapping is generated that maps each label of the plurality of labels to a label code. A second mapping is generated that maps each label integer set of a plurality of label integer sets to a label code. Each label integer set of the plurality of label integer sets corresponds to a label set of the plurality of label sets, wherein each label integer set of the plurality of label integer sets comprises label codes from the first mapping that are mapped to each label included in the corresponding label set.

Abstract: Techniques are described for generating a map of operations to ingest external data. In an embodiment, DBMS receives a query schema that specifies an external data source and client-defined columns to arrange queried data from data fields of the external data source. DBMS generates an ingest schema for the queried data of the external data source such that the ingest schema specifies ingest data fields from the data fields of the external data source to be mapped to the one or more client-defined columns. Additionally, the DBMS identifies surplus data in the external data source, which has not been specified by the ingest schema and is different from the queried data defined by the client-requested query schema. The process not only ingests the ingest data fields from the external data source but also the surplus data from the external data source. In response to receiving a query according to a different query schema, DBMS generates a result set that based on the surplus data of the external data source.

Abstract: Techniques are provided for selectively or completely redacting the text of database commands submitted to a database system. The database server receives the clear text version of the commands, parses the commands, and generates an execution plan, as normal. However, prior to providing the text of the commands to any location that is externally visible, the database server determines whether the command qualifies as “sensitive”. If the command qualifies as sensitive, then a redacted version of the command is generated. In the case of selective redaction, portions of the redacted version remain in clear text, while selected portions are replaced with encrypted text. In the case of total redaction, the entire command is replaced with encrypted text.

Abstract: Techniques for automatic extraction and verification of location data are disclosed. In some embodiments, a web crawler is configured to identify uniform resource locators (URLs), including a URL for a website associated with a target entity. The web crawler is further configured to fetch a subset of webpages from the website associated with the target entity. The web crawler may restrict the webpages that are fetched from the website based, at least in part, on patterns in the first website that are indicative of where reliable location information may be found. The web crawler further identifies a primary location of the target entity within at least one webpage in the subset of webpages, populating and/or verifying the primary location of the target entity in an entity profile. The entity profile may be consumed by client applications to execute location-aware and/or location dependent functions.

Abstract: Techniques described herein relate to systems and methods of data storage, and more particularly to providing layering of file system functionality on an object interface. In certain embodiments, file system functionality may be layered on cloud object interfaces to provide cloud-based storage while allowing for functionality expected from a legacy applications. For instance, POSIX interfaces and semantics may be layered on cloud-based storage, while providing access to data in a manner consistent with file-based access with data organization in name hierarchies. Various embodiments also may provide for memory mapping of data so that memory map changes are reflected in persistent storage while ensuring consistency between memory map changes and writes. For example, by transforming a ZFS file system disk-based storage into ZFS cloud-based storage, the ZFS file system gains the elastic nature of cloud storage.

Abstract: Systems and methods can track user login statuses across independent systems to determine whether to automatically grant access to a given domain. Specifically, when a new user device is detected at a system, one or more cookies are used to facilitate inter-system communications and to track session characteristics.

Abstract: Techniques for implementing an infrastructure orchestration service are described. In certain embodiments, a cloud infrastructure orchestration system (CIOS) is disclosed that generates customized flock configurations for services to be deployed to different regions supported by the CIOS. The CIOS receives generic configuration information describing a set of infrastructure assets associated with a service and identifies first portions of the generic configuration information for deploying the set of infrastructure assets associated with the service that are configurable. The CIOS receives region configuration information for configuring the generic configuration information and updates the generic configuration information based on the region configuration information. The CIOS then transmits the updated configuration information to set of regions managed by the CIOS.

Abstract: Techniques for preventing concurrent execution of an infrastructure orchestration service are described. Worker nodes can receive instructions, or tasks, for deploying infrastructure resources and can provide heartbeat notifications to scheduler nodes, also considered a lease. A signing proxy can track the heartbeat notifications sent from the worker nodes to the scheduler node. The signing proxy can receive requests corresponding to a performance of the tasks assigned to the worker nodes. The signing proxy can determine whether the lease between each worker node and the scheduler is valid. If the lease is valid, the signing proxy may make a call to services on behalf of the worker node, and if the lease is not valid, the signing proxy may not make a call to services on behalf of the worker node. Instead, the signing proxy may cut off all outgoing network traffic, blocking access of the worker node to services.

Abstract: Techniques are disclosed for implementing, by a computer infrastructure orchestration service (CIOS) changes to a first service. The CIOS may manage a declarative infrastructure provisioner to deploy infrastructure resources and artifacts based at least in part on declarative instructions. CIOS may detect a first modification to a first service (e.g., a sidecar application). CIOS may identify that configuration data of a second service references (e.g., via a git submodule) the first service. In response to identifying a second modification to the second service, CIOS may present, via a graphical interface, changes comprising the first modification to the first service. User input may be received indicating acceptance or rejection of the changes of the first modification. CIOS may then implement the changes to the first service according to the user input. For example, CIOS may ensure that the first service, as modified, is deployed alongside the second service in subsequent deployments.

Abstract: Techniques are disclosed for managing dependencies in an orchestration service. A computer-implemented method can include operations performed by a declarative infrastructure provisioner (DIP). In some embodiments, the DIP parses configuration data associated with a computing system and generates a directed acyclic graph (DAG) for booting a first resource. The DAG may specify a dependency of the first resource on a capability of a second resource. The DIP may traverse the DAG and determine, based at least in part on the traversal, that the dependency has been reached. The DIP may publish, to a scheduling process, an indication that the first resource is awaiting availability of the capability of the second resource. In some embodiments, the DIP receives a subsequent indication that the capability is available, regenerates the DAG, and recommences traversal of the DAG. Additional operations for booting the first resource may be performed in accordance with the recommenced traversal.

Abstract: Techniques are disclosed for utilizing directed acyclic graphs for deployment instructions. A computer-implemented method can include various operations. Instructions may be executed by a computing device to perform parses of configuration data associated with a deployment. The computing device may cause a first directed acyclic graph (DAG) to be generated, the first DAG being utilized for deploying a first resource based on the parses. A second DAG may be generated for deploying execution targets based on the parses, the second DAG specifying dependencies between execution targets of the deployment. The computing device may generate a linked list data structure based on the parses and may deploy the computing system by traversal of the linked list data structure.

Abstract: Techniques are disclosure for a data enrichment system that enables declarative external data source importation and exportation. A user can specify via a user interface input for identifying different data sources from which to obtain input data. The data enrichment system is configured to import and export various types of sources storing resources such as URL-based resources and HDFS-based resources for high-speed bi-directional metadata and data interchange. Connection metadata (e.g., credentials, access paths, etc.) can be managed by the data enrichment system in a declarative format for managing and visualizing the connection metadata.