Abstract: Implementations of the present disclosure include methods, systems, and computer-readable storage mediums for receiving goal data and start-up information, the goal data indicating a goal to be achieved during a penetration test, the start-up information indicating initial data for beginning the penetration test, receiving tool data from a register of tools, the tool data including one or more tools that can be used during the penetration test, and, for each tool, input data required to execute the tool and output data provided by the tool, processing the goal data, the start-up information and the tool data to automatically generate attack tree data, the attack tree data including a plurality of data sets and links between data sets, and providing the attack tree data to display a graphical representation of an attack tree on a display.

Abstract: A database architecture includes at least an in-memory database and a disk-based database (also referred to as “hot” and “warm” data stores). In the database architecture, data can be partitioned (and re-partitioned) and/or moved within and among the in-memory and disk-based databases, based on query access patterns derived from received database queries. The partitions and inter-database movements can be based at least in part on clustered, dynamic data units that are defined using shared individual attribute values of data records, and updated based on the received queries.

Abstract: A plurality of free list data structures are maintained in a multi-processor computing system that each correspond to one processor of the multi-processor computing system and that each comprise an ordered queue of processor-specific items. Thereafter, a number of processor-specific items allocated to each free list data structure is calculated. Processor-specific items allocated to a first of the free list data structures are moved to a second of the free list data structures when the number of calculated processor-specific items in the first free data structure exceeds a first threshold. In addition, processor-specific items allocated to the second of the free list data structures are moved to the first of the free list data structures when the number of calculated processor-specific items in the first free data structure is below a second threshold. Related apparatus, systems, techniques and articles are also described.

Abstract: Data is received that includes a multi-dimensional data set having data at different hierarchy levels. Using the received data, a first view of a chart having a branch corresponding to each dimension within the data set is rendered in a graphical user interface. Each branch extends outwardly from a center point and has graphical indicators corresponding to each corresponding hierarchy level. The hierarchy levels are arranged in order such that a highest hierarchy level is closest to the center point and a lowest hierarchy level is closest to or at a termination point of the corresponding branch. Related apparatus, systems, techniques and articles are also described.

Abstract: In one general aspect, a method can include receiving at least one set of correction instructions, validating the at least one set of correction instructions for use by a debugger when debugging an application program, and generating a debug script. The debug script can include text for automatically implementing the validated at least one set of correction instructions in the debugger when debugging an application program. The method can further include generating a plurality of data structures for use by the debug script based on the validated at least one set of correction instructions, and outputting the debug script to the debugger for use by the debugger when debugging the application program.

Abstract: Total global minimum costs can be determined for multiple sub-plans for completing a multi-operation database process to be performed in a distributed database management system that includes a plurality of nodes. The multiple sub-plans can include different distributions of node locations of a plurality of operators among the plurality of nodes. An optimal plan having a lowest total minimum global cost can be selected from the multiple sub-plans.

Abstract: Various embodiments of systems, computer program products, and methods for encrypting data in a multi-tenant cloud environment are described herein. In an aspect, an encryption time frame to encrypt data associated with a user in a multi-tenant cloud environment may be retrieved. Based on the encryption time frame, a list of object types to be encrypted may be identified. A batch encryption period may be determined for encrypting data corresponding to the list of object types. Further, batches are sequentially selected based on the batch encryption period, for a selected batch: one or more data records may be retrieved based on the batch encryption period and the one or more data records may be encrypted in groups based on at least one throttling value.

Abstract: Methods, systems, apparatus, and computer programs encoded on computer storage medium for automatically migrating on-premise data objects used by an on-premise application to on-demand data objects used by an on-demand application including retrieving mapping rules corresponding to the on-premise data objects from a rule repository; extracting data corresponding to on-premise data objects that are affected during execution of the on-premise application, the on-premise application being executed within an on-premise computing environment, the data being stored in an on-premise database based on an on-premise database schema; generating an export file comprising the data; generating an import file based on the export file and the mapping rules, the import file comprising the data; and providing the import file to an on-demand computing environment that hosts the on-demand application, the import file being process-able by the on-demand computing environment to write the data from the import file into an on-dema

Abstract: The disclosure generally describes methods, software, and systems, including a method for updating an application. At least one application instance of an application is managed. Each application instance is associated with a plurality of executing work processes connected with a first database schema. A bridge database schema is generated that is related to the first database schema. The bridge database schema represents a copy of the first database schema and is generated in response to initiation of an update to the application. In response to determining that the generation of the bridge database schema is complete, for each of the plurality of work processes, a commit work action performed by the particular work process is determined. In response to determining performance of the commit work action, the particular work process is connected to the bridge database schema.

Abstract: The subject matter disclosed herein provides methods for the dual storage of data using an in-memory array and an on-disk page structure. An in-memory array holding a column of data can be maintained. One or more pages can be maintained. Each of the one or more pages can have one or more rows for storing the column of data. Random access can be provided to a subset of the one or more rows by at least loading the subset of rows from the one or more pages to the in-memory array without loading all of the rows from the one or more pages. Related apparatus, systems, techniques, and articles are also described.

Abstract: Described herein is a transcompiling framework. In accordance with one aspect, the framework generates a source abstract syntax representation corresponding to source code written in a source language. The framework may determine validity of constraints of a common denominator language by parsing the source abstract syntax representation, wherein the common denominator language is a set of intersects provided by the source language and reachable by a target language. In response to determining the constraints are valid, the source abstract syntax representation may be transformed to a target syntax representation associated with the target language. The target syntax representation is then printed as transcompiled source code in the target language.

Abstract: Systems and methods for generating and distributing graphic representations of planograms used for the configuration, maintenance, and compliance confirmation in the display of merchandise and advertisements, are disclosed. Based on predefined merchandizing agreements, planograms are designed to define specific configurations of products and advertising collateral in specific locations. By referencing an identifier associated with a location, a corresponding planogram can be retrieved and used to generate a graphic representation of the planogram. The graphic representation of the planogram can be adjusted and superimposed onto a live or captured image of the location to indicate where objects should be placed or rearranged. Each object specified in the planogram can be visually represented as a picture superimposed in a position over an image or live view of the location captured by a client computing device by a user.

Abstract: Disclosed herein are system, method, and computer program product embodiments for bloom filter versioning. A request to add a new value to a first bitmap is received, wherein the first bitmap includes a bit sequence corresponding to a most recently added value. It is determined that the first bitmap has exceeded a threshold. A second bitmap is generated, the second bitmap including more bits than the first bitmap. The first bitmap is deleted based upon a determination that a number of readers accessing the first bitmap is zero.

Abstract: Innovations in the area of query processing for a database management system (“DBMS”) are presented herein. For example, for a database query, a query engine generates query code in an imperative language (such as a procedural, scripting language) based on query code in a declarative language (such as a structured query language). The query engine can embed the imperative-language query code in an intermediate representation of the database query, which is executed by the DBMS. In many instances (e.g., for non-linear operations of a database query), the imperative-language query code can be executed by the DBMS more quickly and efficiently than the original declarative-language query code. The DBMS returns results of the execution of the database query.

Abstract: In accordance with aspects of the disclosure, systems and methods are provided for managing forensic investigations of client assets associated with a client based on a forensic service agreement between the client and a cloud service provider, including establishing the forensic service agreement between the client and the cloud service provider for servicing the forensic investigations of the client assets associated with the client, acquiring forensic data related to each client asset associated with the client, and generating one or more client inventory records for each client asset based on the forensic data related to each client asset, and generating one or more client evidence records for each client asset based on each client inventory record generated for each client asset.

Abstract: A system includes a first node including a first processor and a first memory, and a second node including a second processor and a second memory. A worker thread of the first processor calls an allocation API to allocate a portion of the first memory, and calls a first allocator of a first memory manager associated with the first node to allocate a specified size of the first memory. The first memory manager calls an operating system function to reserve a memory segment of the specified size, sets a first Non-Uniform Memory Access policy of the first node to preferred, binds the reserved memory segment to the first node, adds the memory segment to a global freelist, and returns an address pointer of the reserved memory segment to the worker thread.

Abstract: Various embodiments of systems and methods to provide pseudo internal numbering for uniquely and continuously numbering of legally bound documents are described herein. In one aspect, an external numbering range object (NRO) is generated in a computer system. The range of numbers assignable by the external NRO is split into a set of intervals based on a prefix. In another aspect, an internal NRO is generated corresponding to a subset of the intervals of the external NRO. The correspondence between the internal NRO and the subset of intervals is determined by a part of the prefix. In yet another aspect, the unique and continuous numbers generated by the internal NRO are correlated with the numbers in the intervals of the subset of intervals of the external NRO based on a correspondence between values of the prefix of the external NRO and a prefix of the internal NRO.

Abstract: Described herein is a framework for transforming a web application (App) into a hybrid mobile App. The framework is used in a process for generating a hybrid mobile App package in a container, such as a Cordova container. The hybrid mobile App package includes a transformation interface with a transformation mapping database which provides a one-to-one mapping of data services utilized by the transformed hybrid mobile App. During runtime, a runtime interface retrieves the data configuration information of the hybrid mobile App based on the transformation mapping database. As such, the transformation is achieved without modifying source code of the original web App.

Abstract: A system, a method, and a computer program product for providing a layered business configuration are disclosed. A configuration information for configuring an application object of a software application is obtained. The configuration information is arranged in at least one configuration staging table. The configuration staging table contains at least one configuration object. The configuration object contained in the configuration staging table is activated. Based on the activated configuration object, at least one configuration runtime table for configuring the application object is generated.