Patent classifications
G06F16/24553
Computer data system current row position query language construct and array processing query language constructs
Described are methods, systems and computer readable media for providing a current row position query language construct and array processing query language constructs and associated processing.
Clustering of structured log data by key-values
Clustering structured log data by key-values includes receiving, via a user interface, a request to apply an operator to cluster a set of raw log messages according to values for a set of keys associated with the request. At least a portion of each raw log message comprises structured machine data including a set of key-value pairs. It further includes receiving a raw log message in the set of raw log messages. It further includes determining whether to include the raw log message in a cluster based at least in part on an evaluation of values in the structured machine data of the raw log message for the set of keys associated with the request. The cluster is included in a plurality of clusters. Each cluster in the plurality is associated with a different combination of values for the set of keys associated with the request. It further includes providing, via the user interface, information associated with the cluster.
BUILDING DATA PLATFORM WITH A DISTRIBUTED DIGITAL TWIN
A method including receiving, by one or more processing circuits, building data, generating, by the one or more processing circuits, a first digital twin based on the building data, wherein a first system stores the first digital twin and a second system stores a second digital twin generated based on the building data, where the first digital twin includes a relationship that forms a connection between the first digital twin and the second digital twin by linking a first entity of the first entities of the first digital twin and a second entity of the second entities of the second digital twin, and performing, by the one or more processing circuits, one or more operations based on at least one of the first digital twin, the second digital twin, or the relationship that forms the connection between the first digital twin and the second digital twin.
THREE-DIMENSIONAL DAMAGE ASSESSMENT INTERFACE
A computing system can receive a claim trigger from a computing device of a claimant, the claim trigger indicating that a vehicular incident involving the claimant has occurred. The system provides a three-dimensional damage assessment interface for display on the computing device of the claimant, the damage assessment interface enabling the claimant to provide damage information for a vehicle based on the vehicular incident. The system receives input data indicating claimant inputs on the damage assessment interface. Based at least in part on the claimant inputs, the system generates a loss estimate for a policy provider of the claimant.
Rule Violation Detection
A method for detecting a traffic ramp-up rule violation includes receiving data element retrieval requests from an information retrieval system and determining a requests per second (RPS) for a key range. The method also includes determining a moving average of RPS for the key range. The method also includes determining a number of delta violations, each delta violation comprising a respective beginning instance in time when the RPS exceeded a delta RPS limit. For each delta violation, the method includes determining a maximum conforming load for the key range over and determining whether the RPS exceeded the maximum conforming load for the key range based on the beginning instance in time of the respective delta violation. When the RPS has exceeded the maximum conforming load, the method includes determining that the delta violation corresponds to a full-history violation indicative of a degradation of performance of the information retrieval system.
IDENTIFYING AN INFLUENCER COMBINATION HAVING A ROOT CAUSE TO A KEY PERFORMANCE INDICATOR CHANGE
A computer-implemented method, a computer program product, and a computer system for identifying an influencer combination having a root cause to a key performance indicator change. The computer system analyzes metadata to discover semantic information for each column of data, identifies candidate factors that categorize a target performance indicators (KPI), groups the candidate factors into groups based on hierarchies which are included in the semantic information. For respective ones of the hierarchies, the computer system chooses most influential levels as influencer candidates. The computer system creates a stratified sample based on a distribution of target KPI values and evaluates an influential strength to the target KPI. The computer system identifies top influencers in the influencer candidates, based on influential strengths of respective ones of the influencer candidates.
Approximate search of character strings
Systems and methods are disclosed for an approximate string searching technique to search for match results that have character differences with the search string. A cost is computed to measure the amount of character differences, and a match is recognized if the cost is below a threshold. The match is determined based on an inferred state machine, whose states are iteratively generated in computer memory for successive characters in the input text. States are added to represent modifications to the string needed to account for character differences and track the costs of the modifications. States are removed when their costs become excessive. Advantageously, the search process never generates the full state machine in memory, retaining only a selected set of best states to continue with the approximate match process. The technique thus enables a practicable implementation of approximate searching that can tolerate an arbitrary number of character deviations.
Sargable evaluation of queries submitted to an encrypted database
A database-management system provides sargable evaluation for query predicates that compare an “LHS” encrypted database-column operand to an “RHS” expression operand. The system directly compares the two operands if all their attributes match. If the operands are encrypted string-type values differing only in length, the system truncates the RHS or pads it with encrypted blanks and, if a truncation loses meaningful data, evaluates the predicate as never satisfying an equality condition. In all other cases, if all attributes of a plaintext RHS don't match those of the plaintext data encoded into the LHS column, the system attempts to cast the RHS to match the plaintext LHS data. An error condition or data loss at this step allows the system to sargably evaluate the predicate without further analysis, but if the casting is successful and error-free, the system encrypts the resulting RHS and performs a sargable predicate evaluation.
METHOD OF PROCESSING AN OBSERVATION INFORMATION, ELECTRONIC DEVICE AND STORAGE MEDIUM
A method of processing an observation information, an electronic device and a storage medium are provided, which are related to a field of data processing technology, in particular to fields of intelligent searching, cloud computing and big data. The method includes: obtaining the observation information generated in a process of processing a query request; determining a scene identification corresponding to the observation information; and outputting the observation information to a corresponding target position for storage according to the scene identification.
Data analysis and visualization using structured data tables and nodal networks
Disclosed methods and systems describe an analytics server that generates an inter-related nodal data structure. The analytics server receives an electronic template having a set of input fields, the electronic template identifying at least a portion of data stored within a database and its corresponding domain data table and a display attribute, the electronic template further identifying a database storing the data; retrieves the data from the database; parses the data into a set of unique domain data tables having a first criterion and a set of unique dimension tables having a second criterion; generates a nodal network comprising a set of nodes where each node represents at least a portion of the retrieved data, each node having metadata comprising a unique identifier corresponding to a unique domain table and a unique dimension table corresponding to data associated with each node; links one or more nodes based their respective metadata.