In general the technology includes obtaining a detachable library, where the detachable library includes data files each of which are associated with a library scope identifier (ID). The technology further includes reattaching the detachable library to a node server, assigning a node scope ID and a cluster scope ID to each of the data files in the detachable library, creating a mapping index using the node scope IDs, the cluster scope IDs, and the library scope IDs, where each of mapping index entry in the mapping index is associated with a type, and processing a request from a client using the mapping index, wherein the request includes a cluster scope ID.

A database-based system is provided for performing an opinion collecting service that provides information necessary for deciding and presenting opinions of users and collecting information containing the opinions of the users. The system consists of a server, a plurality of user terminals connected to the server over a network, and a database configured to store information containing the opinions of the users. The database for the system is designed with three different phases: 1) conceptual design of a survey database; 2) logical/physical design for the survey database; and 3) construction of the survey database.

In an example embodiment, a request is received, via a graphical user interface, to add a new object to a directory of objects, the new object having a first category in a hierarchical taxonomy of categories and objects. Then one or more questions previously assigned to the first category and/or one or more existing objects within the first category are retrieved. Each of the retrieved one or more questions and information about the new object are then fed into a first machine learned model trained to output a probability that a question is applicable to an object. One or more questions are generated for the new object based on the probability for each of the retrieved one or more questions. At least one of the one or more generated questions is then assigned to the new object.

Approaches presented herein enable optimization of a cache of compiled XML Path Language (XPath) expressions by removing variability from XPath expressions. More specifically, XPath expressions are identified that are the same but for one or more hardcoded values. These hardcoded values are identified and replaced in an identified XPath expression with an identifier to form a cache optimized XPath expression that lacks the hardcoded value variability of the identified XPath expressions. This cache optimized XPath expression is inserted into a cache optimized function that receives the hardcoded value as arguments and assigns the received hardcoded value to the identifier in the cache optimized XPath expression. The identified XPath expressions are then rewritten as calls to the cache optimized function or to another function wrapping the cache optimized function. Therefore, only the cache optimized XPath expression, instead of several of the identified XPath expressions, is stored in the XPath expression cache.

In an example embodiment, a request is received, via a graphical user interface, to add a new object to a directory of objects, the new object having a first category in a hierarchical taxonomy of categories and objects. Then one or more questions previously assigned to the first category and/or one or more existing objects within the first category are retrieved. Each of the retrieved one or more questions and information about the new object are then fed into a first machine learned model trained to output a probability that a question is applicable to an object. One or more questions are generated for the new object based on the probability for each of the retrieved one or more questions. At least one of the one or more generated questions is then assigned to the new object.

The present technical solution relates to user interfaces in general and more specifically to user interfaces related to dealing with data in computer information systems. A method of preparing documents written in markup languages during implementing a user interface for dealing with data of an information system, wherein: forming metadata for at least one operation; forming a template for representing said operation, the template including at least one document written in at least one markup language; forming and storing a link between the template and at least one operation; displaying the template, forming and storing links between the template elements and operations, wherein selecting a template element and displaying information about operations available for links forming; selecting an operation; forming and storing the link comprising the identifier for the template element selected previously and the identifier for the operation selected previously. The technical result is increasing the efficiency of preparing documents written in markup languages while implementing a user interface for dealing with data of an information system, optimizing time for preparing the documents and simplifying their further maintenance.

Approaches presented herein enable optimization of a cache of compiled XML Path Language (XPath) expressions by removing variability from XPath expressions. More specifically, XPath expressions are identified that are the same but for one or more hardcoded values. These hardcoded values are identified and replaced in an identified XPath expression with an identifier to form a cache optimized XPath expression that lacks the hardcoded value variability of the identified XPath expressions. This cache optimized XPath expression is inserted into a definition of a cache optimized function. The optimized XPath expression receives values as arguments of the cache optimized Xpath function and passes the received values to the variable identifier in the cache optimized XPath expression. The identified XPath expressions can then be rewritten as calls to the cache optimized function. Therefore, only the cache optimized XPath expression, instead of several of the identified XPath expressions, is stored in the cache.

Disclosed herein are methods, systems, and processes to distribute and disperse search loads to optimize security event processing in cybersecurity computing environments. A search request that includes a domain specific language (DSL) query directed to a centralized search cluster by an event processing application is intercepted. The event processing application is inhibited from issuing the search request to the centralized search cluster if a structured or semi-structured document matches the DSL query.

A cloud resource join query for join operations across cloud resources is parsed to extract join rules and queries to each cloud resource in the cloud resource join query. Results from the individual cloud queries are dynamically indexed based on pairs of cloud resources indicated in the join rules. A search engine applies first order predicates in the join rules using the dynamic indexes to generate pairwise join results corresponding to the query. A result for the cloud resource join query comprises the pairwise join results after merging.

The problem of distinct value estimation has many applications, but is particularly important in the field of database technology where such information is utilized by query planners to generate and optimize query plans. Introduced is a novel technique for estimating the number of distinct values in a given dataset without scanning all of the values in the dataset. In an example embodiment, the introduced technique includes gathering multiple intermediate probabilistic estimates based on varying samples of the dataset, 2) plotting the multiple intermediate probabilistic estimates against indications of sample size, 3) fitting a function to the plotted data points, and 4) determining an overall distinct value estimate by extrapolating the objective function to an estimated or known total number of values in the dataset.