DATA STORAGE SYSTEM FOR PROVIDING LOW LATENCY SEARCH QUERY RESPONSES

    公开(公告)号:WO2019204629A1

    公开(公告)日:2019-10-24

    申请号:PCT/US2019/028160

    申请日:2019-04-18

    Abstract: A method for providing low-latency responses to queries to a data search system comprises storing first digital data in a first digital data repository using a first column-oriented storage format; storing second digital data in a second digital data repository using a second column-oriented storage format, wherein the second column-oriented storage format is different from the first column-oriented storage format; generating a plurality of pre-computed views based on both the exposure data and the risk item data; storing the plurality of pre-computed views in the second data repository using the second column-oriented storage format; and in response to receiving a search query, determining a result set that is responsive to the query based on one or more particular pre-computed views of the plurality of pre-computed views and providing the result set to another computer or display device as output.

    ROUTING REQUESTS IN SHARED-STORAGE DATABASE SYSTEMS

    公开(公告)号:WO2019067106A1

    公开(公告)日:2019-04-04

    申请号:PCT/US2018/047354

    申请日:2018-08-21

    Abstract: Techniques are described herein for routing queries to particular nodes of a multi-node database system based on the query. A database table is partitioned into a plurality of affinity groups. Each affinity group is assigned a particular node as the master node of the affinity group. A mapping is sent to a query router indicating the master node for each affinity group of the plurality of affinity groups. The query router determines, for a particular query, a target node to which to send the particular query based on the mapping and the particular query.

    DECISION TREE TRAINING USING A DATABASE SYSTEM

    公开(公告)号:WO2020131386A1

    公开(公告)日:2020-06-25

    申请号:PCT/US2019/064552

    申请日:2019-12-04

    Abstract: In an embodiment, a method for training a decision tree comprising a plurality of nodes using a database system comprises: storing in a database input data for training the decision tree, the input data comprising a plurality of feature values corresponding to a plurality of features; generating a particular node of the plurality of decision nodes by: selecting a subset of the plurality of features and a subset of the input data; using one or more queries to the database system, for each feature of the subset of the plurality of features, calculating an information gain associated with the feature based on the subset of the input data; identifying a particular feature of the subset of the plurality of features associated with the highest information gain; associating the particular node with the particular feature, wherein the particular node causes the decision tree to branch based on the particular feature.

    GENERATING AND VALIDATING A VIRTUAL 3D REPRESENTATION OF A REAL-WORLD STRUCTURE

    公开(公告)号:WO2020123137A1

    公开(公告)日:2020-06-18

    申请号:PCT/US2019/063092

    申请日:2019-11-25

    Applicant: HOVER INC.

    Abstract: A computer system maintains structure data indicating geometrical constraints for each structure category of a plurality of structure categories. The computer system generates a virtual 3D representation of a structure based on a set of images depicting the structure. For each image in the set of images, one or more landmarks are identified. Based on the landmarks, a candidate structure category is selected. The virtual 3D representation is generated based on the geometrical constraints of the candidate structure category and the landmarks identified in the set of images.

    GRAPH-BASED DATA ANALYSIS BASED ON INTERPRETING A STRUCTURE DEFINITION LANGUAGE

    公开(公告)号:WO2019210290A1

    公开(公告)日:2019-10-31

    申请号:PCT/US2019/029548

    申请日:2019-04-28

    Abstract: A method for graph-based data analysis based on interpreting a structure definition language comprises storing a plurality of structures, wherein the plurality of structures define a plurality of positions and a plurality of relationships between the plurality of positions; generating one or more compiled structures based on the plurality of structures; receiving, from a client computing device, a query specifying one or more input positions; in response to receiving the query: selecting, based on the one or more input positions, one or more particular compiled structures of the one or more compiled structures; determining a result set for the query based on executing the one or more particular compiled structures, wherein executing the one or more particular compiled structures causes evaluating at least the one or more input positions; and causing the result set to be provided to the client computing device.

    EXECUTION OF TRAINED NEURAL NETWORKS USING A DATABASE SYSTEM

    公开(公告)号:WO2020117989A1

    公开(公告)日:2020-06-11

    申请号:PCT/US2019/064550

    申请日:2019-12-04

    Abstract: In an embodiment, a computer-implemented method for efficient execution of a trained neural network using a database system, the trained neural network comprising a plurality of layers and programmed at each of the layers to execute an affine transformation of an activation function and an input value, comprises: for a particular layer of the trained neural network, dividing the affine transformation into a plurality of transformation pieces; executing each of the transformation pieces to result in computed pieces and writing the computed pieces to a first database table; using one or more database queries, combining the computed pieces and applying the activation function to generate a set of output data; writing the output data to one of a plurality of different second database tables that respectively correspond to the layers; repeating the dividing, executing, combining, applying and writing for all layers of the trained neural network.

    TEMPORAL GRAPH SYSTEM TO FACILITATE NETWORK DATA FLOW ANALYTICS

    公开(公告)号:WO2018236764A1

    公开(公告)日:2018-12-27

    申请号:PCT/US2018/038109

    申请日:2018-06-18

    Abstract: A method for performing network analysis comprising: receiving telemetry information for a computer network, the telemetry information comprising network device state information for internetworking devices in the computer network and network traffic flow information for data packet flows through the computer network; transforming the telemetry information into a temporal graph that is digitally stored in computer memory; receiving, from a client computing device, a request for network analytics information for the computer network; in response to receiving the request for network analytics information, generating network analytics information for the computer network based on the temporal graph and sending the network analytics information to the client computing device.

    DETECTING COMPROMISED CREDENTIALS BY IMPROVED PRIVATE SET INTERSECTION

    公开(公告)号:WO2020163087A1

    公开(公告)日:2020-08-13

    申请号:PCT/US2020/014622

    申请日:2020-01-22

    Abstract: In an embodiment, a method is configured to detect compromised credentials, comprising: generating a plurality of bloom filters, wherein each bloom filter corresponds to a particular subset of a set of compromised credentials; receiving an index value from a client computing device; in response to receiving the index value, determining a target bloom filter corresponding to the index value, and sending the target bloom filter to the client computing device; receiving a first value from the client computing device; in response to receiving the first value, generating a second value based on the first value, and sending the second value to the client computing device.

    STRUCTURED SCHEMA FOR TEMPORAL GRAPH STORAGE AND RETRIEVAL

    公开(公告)号:WO2018236768A1

    公开(公告)日:2018-12-27

    申请号:PCT/US2018/038116

    申请日:2018-06-18

    Abstract: Method for performing network analysis comprising: receiving telemetry information for a computer network, the telemetry information comprising network device state information for internetworking devices in the computer network and network traffic flow information for data packet flows through the computer network; transforming the telemetry information into a temporal graph that is digitally stored in computer memory, wherein the temporal graph comprises a plurality of graph elements include a plurality of vertices and a plurality of edges, each of the vertices representing an internetworking device, each of the edges representing one or more portions of a data packet flow; digitally storing graph element metadata corresponding to the plurality of graph elements in a structured format, the graph element metadata comprising temporal data for each graph element of the plurality of graph elements, the temporal data comprising a modification time value specifying a modification time that is associated with each graph element.

    FLEXIBLE IN-MEMORY COLUMN STORE PLACEMENT
    10.
    发明申请
    FLEXIBLE IN-MEMORY COLUMN STORE PLACEMENT 审中-公开
    灵活的记忆中柱存储放置

    公开(公告)号:WO2018063723A1

    公开(公告)日:2018-04-05

    申请号:PCT/US2017/049464

    申请日:2017-08-30

    Abstract: Techniques are described herein for distributing distinct portions of a database object across volatile memories of selected nodes of a plurality of nodes in a clustered database system. The techniques involve storing a unit-to-service mapping that associates a unit (a database object or portion thereof) to one or more database services. The one or more database services are mapped to one or more nodes. The nodes to which a service is mapped may include nodes in disjoint database systems, so long as those database systems have access to a replica of the unit. The database object is treated as in-memory enabled by nodes that are associated with the service, and are treated as not in-memory enabled by nodes that are not associated with the service.

    Abstract translation: 本文描述了用于跨集群数据库系统中的多个节点的选定节点的易失性存储器分布数据库对象的不同部分的技术。 这些技术涉及存储将单元(数据库对象或其部分)与一个或多个数据库服务相关联的单元到服务的映射。 一个或多个数据库服务被映射到一个或多个节点。 服务映射到的节点可以包括不相交数据库系统中的节点,只要这些数据库系统可以访问该单元的副本。 数据库对象被视为内存使能,由与服务关联的节点启用,并被视为不与服务关联的节点启用内存。

Patent Agency Ranking