Abstract: Interconnections for modular die designs are disclosed. In one aspect, a die that is a chiplet is designed and tested for suitability. After approval of the chiplet design, multiple dies or chiplets may be coupled together within a multi-die package to form a package having desired computing capabilities. After assembly, each chiplet is provided a unique identifier, such as by setting a fuse. Based on the unique identifier, each chiplet is made aware of how interfaces to other chiplets are configured so that signals may be routed appropriately. Using modular chiplets in this fashion reduces testing requirements and non-recurring expenses while increasing flexibility for design options.

Abstract: A global computer aided engineering (CAE) model representing an electronic product that contains solder joints and an individual detailed solder joint model are received. The solder joint model can include a solder ball, one or more metal pads, a portion of printed circuit board, and a portion of semiconductor chip component. The global CAE model includes locations of the solder joints to be evaluated in a drop test simulation. The solder joint model is replicated at each location to create a local CAE model via a geometric relationship between the global CAE model and the local CAE model. Simulated physical behaviors of the product under a design condition are obtained in a co-simulation using the global CAE model in a first time scale and the local CAE model in a second time scale. Simulated physical behaviors are periodically synchronized based on kinematic and force constraints.

Abstract: The disclosed embodiments provide a system for processing queries of a graph database. During operation, the system stores intermediate results of the query in a structure comprising rows in a set of tables and links between pairs of rows in different tables in the set of tables. Next, the system tracks, in the structure, representations of data, relationships, and path consistency in the query. The system then applies one or more operations to existing rows in the structure to generate a final result of the query. Finally, the system provides the final result in a response to the query.

Abstract: The disclosed technologies are capable of selectively using data structure operations for path query evaluation. One technique involves reading a query that traverses at least two nodes and at least one edge of a graph in a graph database; compiling the query into a set of variables and a set of constraints, where the set of variables and the set of constraints correspond to the two nodes and the one edge of the graph; creating an in-memory data structure that comprises a table; using the set of variables and the set of constraints to determine an operation that is performable using the in-memory data structure; checking for an existence of a condition relating to the in-memory data structure or the operation; skipping the operation if the condition exists or executing the operation if the condition does not exist; and storing a set of intermediate query results in the table.

Abstract: A determination is made whether a received database query is to be processed by either a first database, a second database, or at least in part by both the first and second databases including by determining whether the query meets criteria to split the query for processing across the first and second databases. The first and second databases store shared synchronized records, the first database configured to store the records in a column-oriented format and the second database configured to store the records in a row-oriented format. In response to a determination that the query meets the criteria to split the query, a first and second component query of the database query are generated for the first and second databases, respectively, the second component query based at least in part on a result of the first component query. The execution of the first and second component queries is pipelined.

Abstract: The disclosed technologies are capable of selectively using data structure operations for path query evaluation. One technique involves reading a query that traverses at least two nodes and at least one edge of a graph in a graph database; compiling the query into a set of variables and a set of constraints, where the set of variables and the set of constraints correspond to the two nodes and the one edge of the graph; creating an in-memory data structure that comprises a table; using the set of variables and the set of constraints to determine an operation that is performable using the in-memory data structure; checking for an existence of a condition relating to the in-memory data structure or the operation; skipping the operation if the condition exists or executing the operation if the condition does not exist; and storing a set of intermediate query results in the table.

Abstract: The disclosed technologies are capable of reading ingestion configuration data for a client of a plurality of clients of a graph database, transforming the ingestion configuration data from a declarative representation into a graph representation of the ingestion configuration data, storing the graph representation of the ingestion configuration data in the graph database, providing the graph representation of the ingestion configuration data to a data service, where the data service comprises one or more of (i) a physical grouping of at least one computing device configured to store at least a portion of the graph database, (ii) a logical grouping of at least one computing device configured to store at least a portion of the graph database, or (iii) a combination of (i) and (ii)

Abstract: A server system may include one or more hardware processors that execute computer-readable instructions from a non-transitory memory that cause the processor to receive a time component associated with a query request and one or more relational identification tags associated with a subset of a plurality of data items stored in one or more databases. The processor may then query the one or more databases to identify one or more time series data items based on the time component and the relational identification tags. After querying the databases, the processor may transmit the one or more time series data items to a computing device configured to display the one or more time series data items.

Abstract: A computing system may generate a directed graph to access data stored in multiple locations or blocks of a data storage device or system. Cost values may be determined for each of multiple paths between nodes, representing the blocks or subsets of data. In some cases, nodes having a cost value between them that is less than a threshold may be combined into a single node. A master path, linking at least two of the multiple paths, between a start node and an end node, may be generated by iteratively selecting paths with a lowest cost. The number of paths considered for determining the lowest path cost may be limited by a complexity parameter, so as to optimize the path to access the data without introducing unbeneficial computational complexity.

Abstract: An example embodiment performed by a proxy server application of a remote network management platform may involve receiving a message from a third-party application directed to an address of the proxy server application and containing an identifier related to a particular entity. The embodiment may also involve using a template associated with a protocol type of the message to parse the message and determine the identifier. The embodiment may also involve comparing the identifier to mapping data that defines pairwise associations between each of a plurality of identifiers and computational instances of a plurality of computational instances. Each such computational instance may be communicatively coupled and dedicated to a respective managed network controlled by a particular entity.

Abstract: The disclosed embodiments provide a system for processing queries of a graph database. During operation, the system stores intermediate results of the query in a structure comprising rows in a set of tables and links between pairs of rows in different tables in the set of tables. Next, the system tracks, in the structure, representations of data, relationships, and path consistency in the query. The system then applies one or more operations to existing rows in the structure to generate a final result of the query. Finally, the system provides the final result in a response to the query.

Abstract: An archival data storage service identifies, in response to a request to retrieve data previously archived by the service, a set of data storage devices that collectively include the data. From the set of data storage devices, the archival data storage service identifies a set of bins, where a subset of the set of bins includes the data. Based on a deadline for fulfillment of the request, the archival data storage service generates a schedule for retrieval of the set of bins for obtaining the data. The schedule is provided to cause retrieval of the set of bins in accordance with the schedule.

Abstract: The disclosed embodiments provide a system for processing queries of a graph database. During operation, the system stores intermediate results of the query in a structure comprising rows in a set of tables and links between pairs of rows in different tables in the set of tables. Next, the system tracks, in the structure, representations of data, relationships, and path consistency in the query. The system then applies one or more operations to existing rows in the structure to generate a final result of the query. Finally, the system provides the final result in a response to the query.

Abstract: Systems and methods are disclosed for encrypting portions of data for storage and processing in a remote network. For example, methods may include receiving a message that includes data for forwarding to a server device; encrypting a portion of the data to determine an encrypted portion; determining metadata based on the portion of the data, wherein the metadata indicates one or more properties of the portion of the data and enables one or more operations to be performed by the server device that depend on the one or more properties; determining a payload including the data with both the encrypted portion and the metadata substituted for the portion of the data; and transmitting the payload to the server device.

Abstract: The disclosed embodiments provide a system for processing queries of a graph database. During operation, the system stores intermediate results of a query in a structure comprising rows in a set of tables. Next, the system applies one or more operations to existing rows in the structure to generate additional rows in additional tables of the structure. The system also tracks inputs and outputs associated with the one or more operations in a set of relationships between rows of different tables in the structure. Finally, the system uses the rows and the set of relationships to generate a final result of the query and provides the final result in a response to the query.

Abstract: The disclosed embodiments provide a system for processing queries of a graph database. During operation, the system stores intermediate results of the query in a structure comprising rows in a set of tables and links between pairs of rows in different tables in the set of tables. Next, the system tracks, in the structure, representations of data, relationships, and path consistency in the query. The system then applies one or more operations to existing rows in the structure to generate a final result of the query. Finally, the system provides the final result in a response to the query.

Abstract: A system and method for encrypting portions of data for storage in a remote network have been provided. The system comprises a memory with instructions executable by a processor to receive data for forwarding to a server device, wherein the received data comprises an indication of one or more portions of the received data to be encrypted; identify a portion comprising the one or more portions of the received data based at least in part on the indication; encrypt the identified portion of the data; generate a payload that comprises the encrypted portion and one or more unencrypted portions of the received data; and transmit, to the server device, the payload.

Abstract: A server system may include one or more hardware processors that execute computer-readable instructions from a non-transitory memory that cause the processor to receive a time component associated with a query request and one or more relational identification tags associated with a subset of a plurality of data items stored in one or more databases. The processor may then query the one or more databases to identify one or more time series data items based on the time component and the relational identification tags. After querying the databases, the processor may transmit the one or more time series data items to a computing device configured to display the one or more time series data items.

Abstract: The disclosed embodiments provide a system for managing inter-process communication. During operation, the system executes a block storage manager for managing shared memory that is accessed by a write process and multiple read processes. Next, the block storage manager manages one or more data structures storing mappings that include block identifiers (IDs) of blocks representing chunks of the shared memory, files in the blocks, and directories containing the files. The block storage manager then applies an update by the write process to a subset of the blocks by atomically replacing, in the one or more data structures, a first directory containing an old version of the subset of the blocks with a second directory containing a new version of the subset of the blocks.