Abstract: Disclosed are various embodiments for searching encrypted data. A search query containing a plaintext key can be received from a client device or other application. A request can then be sent to a storage engine for a ciphertext key of a node of a binary tree, the node representing an encrypted key-value pair that includes the ciphertext key. The ciphertext key can be decrypted using a cryptographic key to generate a decrypted ciphertext key. Then, the decrypted ciphertext key can be compared to the plaintext key. A determination can then be made as to whether the encrypted key-value pair represented by the node of the binary tree satisfies the search query based at least in part on a comparison of the decrypted ciphertext key to the plaintext key.

Abstract: A method for modifying key-value pairs of a B+ tree is provided. The method receives a request to modify a particular key-value pair. Each node of the tree has a modification number. The method traverses a path on the tree from the root node toward the particular node. The traversing includes upon reaching a parent node of the path, acquiring a shared lock on both the parent node and a child node one level below the parent node. Upon determining that the child node is the particular node, the method stores the modification number of the particular node, releases the shared lock on the particular node, compares a current modification number of the node with its stored number, and acquires an exclusive lock on the node if the numbers are the same. The method increments the current modification number of the node and modifies it while in the exclusive lock.

Abstract: The database management system (DBMS) receives a first instruction specifying anonymization rule information corresponding to a column of the relation table, among anonymization rule information that is present for each column included in the relation table and shows a plurality of generalization rules. The DBMS reads the column from the relation table in response to the first instruction, and generates a temporary result obtained by generalizing each attribute value of the column based on any of a plurality of generalization rules. The DBMS generates an aggregate result obtained by aggregating the temporary result. The DBMS generates an anonymization method including generalization information indicating a correspondence relationship of each attribute value of the column and any of the plurality of generalization rules when the aggregate result satisfies a disclosure rule. The DBMS generates anonymization information as a result of processing the relation table based on the first anonymization method.

Abstract: Disclosed herein is a computer-implemented method for storing binary tree data in memory. The binary tree data comprises parent node data, first child node data and second child node data. The computer-implemented method comprises determining a first child node memory address, the first child node memory address being less than a parent node memory address; determining a second child node memory address, the second child node memory address being greater than the parent node memory address; storing the parent node data at the parent node memory address; storing the first child node data at the first child node memory address; and storing the second child node data at the second child node memory address.

Abstract: The disclosed technology is directed towards automated configuration enforcement in wireless communication systems, which can be implemented in an audit manager (e.g. an ONAP micro-service) as part of an overall architecture. The audit manager obtains misconfiguration data representing misconfigured configurable parameter data of network elements of a radio access network, and corrective parameter data corresponding to the misconfiguration data. The audit manager issues a reconfiguration action to the network elements, which instructs the network elements to reconfigure their current configurable parameter data based on the corrective parameter data. Following reconfiguration, the audit manager operates to monitor the network elements performance, e.g., to check for performance degradation of a cell site relative to previous performance metrics.

Abstract: A computing machine stores a tree structure representing a hierarchical organization. The tree structure comprises a command node and a plurality of domain nodes below the command node. The computing machine leverages the tree structure to generate a multi-domain operational plan.

Abstract: Systems, methods, and software described herein provide graph searching via index vertices. In one implementation, a graph management system may receive a request to identify vertices of a first vertex type in a graph, wherein the request defines one or more attributes associated with the vertices. In response to the request, the graph management system may identify one or more index vertices associated with the one or more attributes, wherein the one or more index vertices is associated with one or more second vertex types. The graph management system may further identify the vertices in the graph with edges that couple to the one or more index vertices.

Abstract: Systems and methods for generating a process tree of a process are provided. An event log of the process is received. It is determined whether a base case applies to the event log and, in response to determining that the base case applies to the event log, one or more nodes are added to the process tree. In response to determining that the base case does not apply to the event log, the event log is split into sub-event logs based on a frequency of directly follows relations and a frequency of strictly indirectly follows relations for pairs of activities in the event log and one or more nodes are added to the process tree. The steps of determining whether a base case applies and splitting the event log are repeatedly performed for each respective sub-event log using the respective sub-event log as the event log until it is determined that the base case applies to the event log. The process tree is output. The process may be a robotic process automation process.

Abstract: The lock time of a database upon the execution of a series of processes is decreased, and the load of the implementation/modification of the database server device upon changing the application destination of the Web system is reduced. A database server provides a prescribed simple API, and comprises a request processing unit, an SQL creation unit, and an SQL processing unit. In the database server device 120, when a plurality of divided requests are received from the Web server device as the request for requesting a series of processing, the SQL processing unit executes SQL integration processing of temporarily storing the generated SQL sentences until generation of the SQL sentences is ended for all of the plurality of divided requests, and integrating and editing the plurality of temporarily stored SQL sentences and creating the whole SQL sentence after generation of the SQL sentence is ended for all of the requests.

Abstract: Some embodiments provide a method for quantifying complexity of database queries that reference database objects in a database. The method identifies a database query that includes a reference to a set of one or more database objects in the database. The method identifies a set of properties associated with a set of components of the identified query, and computes, from the identified set of properties, a complexity indicator that represents a complexity expression of the database query.

Abstract: Systems and methods for providing object versioning in a storage system may support the logical deletion of stored objects. In response to a delete operation specifying both a user key and a version identifier, the storage system may permanently delete the specified version of an object having the specified key. In response to a delete operation specifying a user key, but not a version identifier, the storage system may create a delete marker object that does not contain object data, and may generate a new version identifier for the delete marker. The delete marker may be stored as the latest object version of the user key, and may be addressable in the storage system using a composite key comprising the user key and the new version identifier. Subsequent attempts to retrieve the user key without specifying a version identifier may return an error, although the object was not actually deleted.

Abstract: The present disclosure relates to executing concurrent database operations in a database system during a time window. The database operations are configured to use storage units of a storage space of the database system. A first usage speed of free storage units is determined to be used by at least one first database operation and a second usage speed of free storage units to be used by a second database operation. The first and second usage speeds may be used for determining a maximum number of free storage units to be used by the second database operation during the time window. The second database operation may be executed during the time window in accordance with the maximum number. The first database operation may be executed, wherein the execution of the first database operation during the time window being limited to the storage units of the storage space.

Abstract: An in-memory graph query runtime is integrated inside a database management system and is capable of performing simple patter-matching queries against homogeneous graphs. The runtime efficiently combines breadth-first (BFS) and depth-first (DFS) neighbor traversal algorithms to achieve a hybrid runtime that takes the best from both sides. As a result, the hybrid runtime is able to process arbitrarily large queries with a fixed amount of memory, optimizing for memory locality.

Abstract: An in-memory graph query runtime is integrated inside a database management system and is capable of performing simple patter-matching queries against homogeneous graphs. The runtime efficiently combines breadth-first (BFS) and depth-first (DFS) neighbor traversal algorithms to achieve a hybrid runtime that takes the best from both sides. As a result, the hybrid runtime is able to process arbitrarily large queries with a fixed amount of memory, optimizing for memory locality.

Abstract: A method for providing a notification associated with at least one of a plurality of connected devices is provided. The method includes obtaining, by one or more computing devices, data from one or more connected devices. The method further includes determining, by the one or more computing devices, occurrence of an event based, at least in part, on the data obtained from the one or more connected devices. In addition, the method includes accessing, by the one or more computing devices, a multi-tier notification tree. The method further includes providing, by the one or more computing devices, a notification indicative of the event to one or more recipients included in the multi-tier notification tree.

Abstract: Aspects of the present disclosure provide for operations of a key-value store (KVS) that uses journaling with storage of data (e.g., key data or value data of a key-value pair) in different types of data storage objects (e.g., data storage formats) selected based on one or more criteria.

Abstract: The embodiments disclosed herein relate to predictive rate limiting. A workload for completing a request is predicted based on, for example, characteristics of a ruleset to be applied and characteristics of a target set upon which the ruleset is to be applied. The workload is mapped to a set of tokens or credits. If a requestor has sufficient tokens to cover the workload for the request, the request is processed. The request may be processed in accordance with a set of processing queues. Each processing queue is associated with a maximum per-tenant workload. A request may be added to a processing queue as long as adding the request does not result in exceeding the maximum per-tenant workload. Requests within a processing queue may be processed in a First In First Out (FIFO) order.

Abstract: A computing device responds to a membership overlap query. A list of unique member identifiers included in a plurality of datasets is created. A list of datasets of the plurality of datasets is defined for each unique member identifier. Each dataset included in the list of datasets includes a unique member associated with a respective unique member identifier. A unique list of datasets is defined from each list of datasets. A number of occurrences of each unique list of datasets is determined. A number of datasets included in each unique list of datasets is determined. Intersection data is created that includes a dataset list of each unique list of datasets in association with the number of occurrences of each respective, unique list of datasets and with the number of datasets included in each respective, unique list of datasets. An overlap response is determined using the created intersection data.

Abstract: This invention relates to a system, method and computer program product for parsing a message against a message model, the message model including a choice block of element options and guide field for guiding the parse, the method including: parsing a message against a message model until the choice block of element options and associated guide field is located in the message model; determining element options associated with a particular guide field value located in the message, each element option having an associated frequency of occurring within a body of messages; choosing the most frequently occurring element option for the located guide field value; and further parsing the choice block of element options against the chosen element option.

Abstract: A method for visualizing and managing entities and connections between entities based on a graphical user interface (GUI) node editor includes constructing an entity datablock, wherein the entity datablock is a data structure describing an entity and comprises entity descriptive information, an entity category, an entity name, entity relationships, and an entity identifier. The method includes establishing the entity relationships as bi-directional relationships, wherein the bi-directional relationships link two disparate entities. The method further includes representing the entity datablock as a node and the bi-directional relationships as lines connecting two nodes, wherein the node comprises at least one of the entity descriptive information, the entity category, or the entity name.

Abstract: In example embodiments, techniques are provided for decoupling user access to infrastructure models from proprietary software that maintains and updates the infrastructure models. A backend application may include an infrastructure modeling backend module that, among other functions, handles communication with an infrastructure modeling frontend module of a frontend application that provides user access to the infrastructure model, infrastructure modeling hub services that maintain repositories for the infrastructure model, and an infrastructure modeling native module that creates, performs operations upon, and updates local instances of a database that stores the infrastructure model.

Abstract: A system and method for supporting data MapReduce operations in a tuple space/coordinated namespace (CNS) extended memory storage architecture. The system-wide CNS provides an efficient means for storing and communicating data generated by local processes running at the nodes, and coordinated to provide MapReduce operations in a multi-nodal system. A hardware accelerated mechanism supports map reduce sorting/shuffle operations and reduce operations according to an aggregate function. Local processes running at a node generate a tuple corresponding to data generated by a process, each tuple having a tuple name and tuple data value corresponding to the generated data. Each tuple is processed and stored at the node or another node, dependent upon its tuple name. Tuple records associated with a tuple name are accumulated at one or more nodes according to a linked list structure at each that is accessible via a hash table index pointer at the node.

Abstract: A new snapshot of a storage volume is created by suppressing write requests. Once pending write requests from the computing nodes are completed, storage nodes create a new snapshot for the storage volume by allocating a new segment to the new snapshot. Subsequent write requests to the storage volume are then performed on the segments allocated to the new snapshot. An orchestration layer implements a bundled application that is provisioned with storage volumes and containers. A snapshot of the application may be created and used to rollback or clone the application. De-duplication may be performed by creating a signature map and identifying duplicated blocks. Blocks of segments containing duplicated blocks are copied to pool segments and metadata of those segments of the same logical storage unit may be consolidated to pool metadata segments. The identification of duplicate blocks may be performed in a cloud computing platform.

Abstract: An enterprise risk management (ERM) system performs real-time self-diagnosis of functional code of the ERM system that controls the policy enforcement actions within the ERM system. Real-time execution effectiveness of at least one control instance of the ERM system at operationally mitigating real-time authentication services security risk(s) and user access compliance risk(s) is determined. At least one code modification to a control class definition is identified that adjusts one or more real-time operational control aspects of the at least one control instance and that improves real-time execution effectiveness and operational capabilities of a new control instance instantiated from an updated control class definition at operationally mitigating the respective real-time authentication services security risk(s) and user access compliance risk(s) within the ERM system.

Abstract: A data access method in a file system comprises receiving a data access request including an identifier of a to-be-accessed node, obtaining access permission for the to-be-accessed node based on the identifier of the to-be-accessed node, wherein when a permission version number of the to-be-accessed node is not the latest in permission version numbers of all nodes indicated by path information of the to-be-accessed node in a file system, the access permission for the to-be-accessed node inherits a permission record corresponding to a parent node that is of the to-be-accessed node and that has a latest permission version number, and performing authentication based on the access permission for the to-be-accessed node, and accessing data of the to-be-accessed node after the authentication succeeds.

Abstract: Methods and systems are provided for creating and editing a visual interlocking block based program in a collaborative communication session. The visual interlocking block based program utilizes a single-page interface divided into an available segments region and a workspace region. Users drag visual program blocks from the available segments region into the workspace region in forming a visual program. The visual program blocks automatically interlock with one another in a pipeline to form an ordered sequence of visual program blocks making up the visual program. Each visual program block includes an icon that defines a specific programming function for a particular type of the visual program block. When arranged in the ordered sequence of the pipeline, the icons of the visual program blocks align to form a hieroglyph that identifies the visual program, a functionality of the visual program, and execution speeds of the visual program.

Abstract: A detection method is presented that combines two non-linear approaches, the Sphere Decoder (SD) and the K-best algorithms, to identify symbols transmitted over a communication channel in a multiple input-multiple output (MIMO) communication system. A parallel implementation on a x86 computer system is presented, which reduces the number of evaluations by branching over plural symbols and diversifies the search process, which may rapidly reduce the radius and thus, the time complexity of the computer system.

Abstract: A computing device includes a processor and a medium storing instructions. The instructions are executable by the processor to: detect an information technology (IT) event associated with an IT system; determine an event class for the IT event; identify a plurality of event-procedure relations associated with the determined event class, each of the plurality of event-procedure relations having an associated success score; select a first event-procedure relation having a highest success score, wherein the first event-procedure relation specifies a relation between the determined event class and a first remediation procedure; and execute the selected first remediation procedure to remediate the IT event.

Abstract: A method and an apparatus for building a decision tree for packet classification are provided. According to an example of the present disclosure, a first type decision tree is generated by performing tree building for a classification rule set based on a non-template dimension of the classification rule set; a second type decision tree is generated by performing tree building for each leaf node in the first type decision tree based on a template dimension of the classification rule set; a plurality of leaf nodes that are mutually of the to each other in the first type decision tree are associated with a same second type decision tree. The plurality of leaf nodes that are SPSR to each other indicate that classification rule sets respectively included in the plurality of leaf nodes are SPSR to each other.

Abstract: A data management system including an AP server and a DB server. The AP server sends business data to the DB server and requests registration. The business data includes combination of parent data and a plurality of pieces of child data with mutual relevance, and each child data has ID of the parent data. In registering business data, the AP server first tries to register each child data, and requests registration of the parent data when a notification of registration completion of all pieces of the child data arrives from the DB server. When the notification of registration completion of any of the child data has not arrived, the AP server cancels the registration of the parent data. In referring to the business data, the AP server sets only child data with related parent data registered therein as a target.

Abstract: A computer-implemented method includes generating one or more process trees based on one or more processes associated with one or more change events within a cluster computing system, performing mutation event detection by comparing a root of each of the one or more process trees with one or more external commands, and generating a mutation event report based on the comparison.

Abstract: A compute unit includes single-instruction-multiple-data (SIMD) lanes that implement a pipeline. The compute unit also includes a scheduler to schedule the SIMD lanes to apply a binary associative operation to pairs of elements associated with ordered sets of elements. Subsets of the SIMD lanes concurrently apply the binary associative operation to pairs of elements at different levels of upsweep trees associated with the ordered sets of elements. Application of the binary associative operation is used to perform a reduction operation or a scan operation on the ordered sets of elements. In the case of a scan operation, the scheduler schedules the SIMD lanes to concurrently apply the binary associative operation to pairs of elements at different levels of downsweep trees associated with the ordered sets of elements subsequent to applying the binary associative operation at different levels of the upsweep trees.

Abstract: A data set may be partitioned according to relative differences indicated by a cover tree. A cover tree may be generated for a data set. Items in the data set may be stored at the same or different nodes according to the relative difference between the items indicated in the cover tree. Portions of the cover tree may be assigned to different nodes storing the data set. Access requests for the data set may be performed by sending the access requests to nodes identified according to the assigned portions of the cover tree.

Abstract: Techniques manage addresses in a storage system. In such techniques, an address page of an address pointing to target data in the storage system is determined in response to receiving an access request for accessing data in the storage system. A transaction for managing the address page is generated on the basis of the address page, here the transaction at least comprises an indicator of the address page and a state of the transaction. A counter describing how many times the address page is referenced is set. The transaction is executed at a control node of the storage system on the basis of the counter. With such techniques, the access speed for addresses in the storage system can be accelerated, and then the overall response speed of the storage system can be increased.

Abstract: Example techniques herein search a graph data structure and retrieve data associated with a result node or edge. The graph can include nodes and edges between them. A control unit can produce a discrete finite automaton (DFA) based on a query. The control unit can traverse the DFA in conjunction with the graph, from an initial DFA state and an entry-point graph node, to reach a result graph node associated with a DFA triggering state. Traversal can include, e.g., unwinding upon reaching a terminal state of the DFA. Some examples can determine a schema of output data. Some examples can store information associated with nodes while traversing, and discard the information when unwinding traversal. Some examples can process queries including edge types not members of a set of edge types associated with a graph. Some examples can apply traversal-limiting instructions specified in a query.

Abstract: Systems, methods, and computer-readable media are disclosed for an improved database. The systems, methods, and computer-readable media described herein may enhance the response time of databases and improve user experiences. In an example method described herein, a database may receive a search request for data stored in the database. The database may be stored in association with a b-tree to facilitate searching and retrieving data from the database. The method may include allocating a portion of a first memory for read ahead operations and performing the read ahead operations, wherein the read ahead operations comprise loading, into the portion of the first memory, data associated with one or more siblings of a current node, wherein the one or more siblings of the current node are one or more nodes that have a same number of parent nodes as the current node.

Abstract: The present approach improves the query performance of a database in a manner that is transparent to a user. In one aspect, this approach creates separate partition tables that are not directly accessible to a user of the database. A client-facing aspect of the database is a logical model which may correspond to a single, main table with which the user interacts. Thus, queries or operations may be generated on the client side in the context of the logical model. A database or query layer can then, transparent to the user, translate the user generated requests into query language that addresses the proper partitions to generate a result set or otherwise perform a database operation.

Abstract: A database platform receives query instructions for a query on a database, where the query instructions include a geospatial-function join that applies a geospatial-function predicate to a first relation that includes a first join key and a second relation that includes at least one row in which a second join key is a point. The database platform generates a query-execution plan by replacing the geospatial-function join with a one-sided interval join of at least a first portion of the first relation and the at least one row of the second relation in which the second join key is a point, and by also inserting a filter above the one-sided interval join to apply the geospatial-function predicate. The database platform executes the query-execution plan, and returns query results in response to the query.

Abstract: A method and system for remotely executing commands at a client computing device. The method comprises receiving a selection of commands to transmit to a group of client computing devices via a webserver. The group of client computing devices, as well as the selected commands, are associated with a group identifier. The method validates access privileges of the administrator to transmit the selected commands to the group of client computing devices. Upon receipt of the selected commands, the webserver transmits the selected commands to at least one registered proxy server. The registered proxy server then determines one or more client identifiers associated with the group identifier. Each client identifier is assigned to a client computing device. Upon receipt of the selected commands, the registered proxy server transmits the selected commands to client computing devices in the group of client computing devices matching the determined client identifiers.

Abstract: A method for visualizing and managing entities and connections between entities based on a graphical user interface (GUI) node editor includes constructing an entity datablock, wherein the entity datablock is a data structure describing an entity and comprises entity descriptive information, an entity category, an entity name, entity relationships, and an entity identifier. The method includes establishing the entity relationships as bi-directional relationships, wherein the bi-directional relationships link two disparate entities. The method further includes representing the entity datablock as a node and the bi-directional relationships as lines connecting two nodes, wherein the node comprises at least one of the entity descriptive information, the entity category, or the entity name.

Abstract: The present disclosure relates generally to vegetation management and control, in particular, to vegetation data capture, maintenance workflow generation, prioritization, passive and continuous monitoring of vegetation, and predictive analysis for vegetation that may be within or adjacent to clearance zones for railway, transportation, utility, pipeline, range & pasture, and industrial sites.

Abstract: One or more processors divide an OLAP cube into one or more cubelets. One or more processors determine a weight corresponding to each node present within each of the one or more cubelets. One or more processors determine a total cost corresponding to each of the one or more cubelets. One or more processors assign execution of a portion of a workload corresponding to each of the one or more cubelets to a data processing element. The assignment of the execution of the portion of the workload corresponding to a cubelet to a data processing element is based on the determined total cost corresponding to the cubelet.

Abstract: A portion of contents of a database is received from a first server. The received contents of the database is stored in a secondary storage system that tracks changes between different backup versions of contents of the database. A request to migrate the contents of the database to a second server is received. A version of contents of the database is provided to the second server using the secondary storage system. The secondary storage system is configured to determine an amount of changes to the database content from one of the versions of the database content provided to the second server and the amount of changes is utilized in determining whether to quiesce the database hosted on the first server.

Abstract: Embodiments describe an approach for automatically generating feedback for an online forum. Embodiments determine if a user is using a solution to a problem, wherein the solution is posted on an online forum, and responsive to determining the user is using the solution, capturing environment information associated with the user's computing device. Additionally, embodiments determine if the solution solved the problem, and responsive to determining the solution solved the problem, automatically generate feedback associated with the solution, wherein the feedback comprises the environment information and information detailing that the solution solved the problem.

Abstract: A method can include receiving measurement configurations for measuring serving/neighboring cells at a user equipment (UE) in a wireless communication system. The measurement configurations can indicate multiple measurement objects (MOs) each with a SSB measurement timing configuration (SMTC) specifying a sequence of SMTC window durations (i.e. SMTC occasions), and a sequence of gap occasions. The MOs can be measured within the SMTC occasions that overlap the gap occasions. The method can further include determining a carrier-specific scaling factor for a target MO in the multiple MOs based on candidate MOs to be measured in each of the gap occasions.

Abstract: Aspects of the present disclosure provide for operations of a key-value tree data structure that merges key-value pair data of a node, in a key-value tree data structure using counter values.

Abstract: A method includes: (a) setting up a service orchestration rule set between a home operator and a sponsor service provider, managing a service domain for obtaining a data structure for a service definition object; (b) receiving a list of available services from the sponsor service provider; (c) receiving a subscriber selection of at least one service from the list; (d) adding a first set of data including subscriber specific data to the service definition object; (e) sending a service creation request to the sponsor service provider for subscribing to the selected service; and (f) receiving a response from the sponsor service provider including the service definition object complemented with a second set of data to allow the selected service to be executed.

Abstract: Various systems are provided for optimizing the searching of a graph for a portion that matches a pattern is provided. A Graph Search Optimization System (“GSOS”) provides various techniques for reducing the computational expense when searching for patterns within a graph. The GSOS provides techniques that include an edge-count directed (“ECD”) system, a derived constraint (“DC”) system, and a sorted property (“SP”) system. The ECD system matches a pattern in a direction based on the number of edges for that direction. The DC system derives a single-element constraint from a multi-element constraints to avoid having to check multiple elements. The SP system processes edges of a graph in a sorted order based on the value of a property of the edges.

Abstract: A system for reporting for a transaction server using cluster stored and processed data. The system comprises a processor and an interface. The processor is to cause ingestion of data from an ingestion source on a cluster system and store a security definition and a transformation definition for one or more data sources that are derived from the data from the ingestion source. The security definition includes a tenant associated with each data source of the one or more data sources. The processor is further to cause execution of cluster processing associated with a report using the one or more data sources and based at least in part on a determination of authorization using the security definitions to produce an output of the cluster processing and generate a report using a transaction server process and the output of the cluster processing. The interface is to provide the report.

Abstract: Techniques for splitting a query into native query operations and post-processing operations are provided. In one embodiment, a user query including a plurality of search parameters is received. Expressions representing the plurality of search parameters in the user query are determined. A first subset and a second subset of the expressions are identified. Each expression of the first subset corresponds to one of a plurality of native query operations executable by a database platform, and each expression of the second subset corresponds to one of a plurality of predefined post-processing operations not executable by the database platform. A database query is generated based on one or more expressions of the first subset, and a post-processing query is generated based on each expression in the second subset. The database query is executed by the database platform, then the post-processing query is executed on the results from database platform.