-
61.
公开(公告)号:US12032629B2
公开(公告)日:2024-07-09
申请号:US17874751
申请日:2022-07-27
申请人: Splunk Inc.
发明人: Ram Sriharsha
IPC分类号: G06F16/2458 , G06F9/38 , G06F9/54 , G06F16/14 , G06F16/16 , G06F16/22 , G06F16/23 , G06F16/242 , G06F16/2453 , G06F16/2455 , G06F16/28 , G06F16/901 , G06F17/16 , G06F17/18 , G06F18/21 , G06F18/214 , G06N20/00 , G06N20/20
CPC分类号: G06F16/901 , G06F9/3885 , G06F9/544 , G06F16/144 , G06F16/156 , G06F16/168 , G06F16/2246 , G06F16/23 , G06F16/2379 , G06F16/242 , G06F16/24534 , G06F16/24568 , G06F16/2465 , G06F16/285 , G06F17/16 , G06F17/18 , G06F18/2148 , G06F18/2185 , G06N20/00 , G06N20/20 , G06F16/22 , G06F16/2264 , G06F16/2282
摘要: Systems and methods are described for processing ingested data, detecting anomalies in the ingested data, and providing explanations of a possible cause of the detected anomalies as the data is being ingested. For example, a token or field in the ingested data may have an anomalous value. Tokens or fields from another portion of the ingested data can be extracted and analyzed to determine whether there is any correlation between the values of the extracted tokens or fields and the anomalous token or field having an anomalous value. If a correlation is detected, this information can be surfaced to a user.
-
公开(公告)号:US20240220500A1
公开(公告)日:2024-07-04
申请号:US18606442
申请日:2024-03-15
IPC分类号: G06F16/2453 , G06F16/2458 , G06F16/27 , H04L9/08
CPC分类号: G06F16/24542 , G06F16/2465 , G06F16/27 , H04L9/0819
摘要: A data structure is specialized in efficiently representing a key-value pair in a highly optimized way. The data structure is a pointer in a traversal graph that takes advantage of constant time traversal for all operations. The data structure has specific instructions for inserting data nodes, router nodes, and how the expansion or collapse of the graph works. The data structure can be applied where the time to get the result back is most prominent. The data structure can be used to reduce the memory footprint to reach the data that is being searched and achieve a worst-case time complexity in constant time.
-
公开(公告)号:US20240220487A1
公开(公告)日:2024-07-04
申请号:US18606905
申请日:2024-03-15
IPC分类号: G06F16/242 , G06F3/0482 , G06F3/0486 , G06F16/2453 , G06F16/2458 , G06F16/248 , G06F16/25
CPC分类号: G06F16/2428 , G06F3/0482 , G06F3/0486 , G06F16/24535 , G06F16/2458 , G06F16/248 , G06F16/258 , G06F2203/04803
摘要: Techniques for modifying queries in a set of nested queries are disclosed. A graphical user interface displays a query detail region alongside a nested query display region. The graphical user interface includes functionality to provide for modification of queries in the nested set of queries. Based on a selection by a user, a query modification tool promotes a query attribute from a child query to one or more parent queries. Based on another selection by a user associated with one query in the set of nested queries, the system deletes an attribute from each query in the set of nested queries. Responsive to a selection to create multiple conditions for a query rule, the system modifies the functionality of the user interface to enable entry of multiple condition characteristics. Based on a further selection, the system creates the multiple conditions for the query rule.
-
公开(公告)号:US12026157B2
公开(公告)日:2024-07-02
申请号:US17331719
申请日:2021-05-27
发明人: Kenta Watanabe , Takahito Tashiro , Takashi Fukuda
IPC分类号: G06F16/2453 , G06F16/93
CPC分类号: G06F16/2453 , G06F16/93
摘要: In a method for improving generation and relevancy of search results, a processor receives a search query comprising a search term. A processor generates a document group based on the search query and at least one synonym related to the search term in a synonym dictionary. The synonym dictionary may include search document attributes for base words and synonyms of the base words. A processor extracts, from the document group, an extracted document having a document attribute matching a search document attribute of the at least one synonym. A processor lists the extracted document as a search result.
-
公开(公告)号:US20240211479A1
公开(公告)日:2024-06-27
申请号:US18599389
申请日:2024-03-08
申请人: ThoughtSpot, Inc.
发明人: Naman Shah , Rakesh Kothari , Vaibhav Agarwal
IPC分类号: G06F16/2455 , G06F16/21 , G06F16/22 , G06F16/2453
CPC分类号: G06F16/2456 , G06F16/211 , G06F16/2246 , G06F16/2282 , G06F16/24534
摘要: Systems and methods for query generation based on a logical data model with one-to-one joins are described. For example, methods may include accessing a join graph representing tables in a database; receiving a first query; selecting a connected subgraph of the join graph that includes the two or more tables referenced in the first query; accessing an indication that a directed edge of the connected subgraph corresponds to a one-to-one join; modifying the connected subgraph based on the indication to obtain a modified subgraph; generating one or more leaf queries based on the modified subgraph; generating a query graph that specifies joining of results from queries based on the one or more leaf queries; invoking a transformed query on the database that is based on the query graph and the queries based on the one or more leaf queries.
-
公开(公告)号:US20240202759A1
公开(公告)日:2024-06-20
申请号:US18430186
申请日:2024-02-01
申请人: RunMyLease Inc
发明人: Alexey Plokhikh , Inesa Plokhikh , Jared Neves
IPC分类号: G06Q30/0201 , G06F16/2453 , G06Q30/0207 , G06Q30/0283 , G06Q30/0601
CPC分类号: G06Q30/0206 , G06F16/24539 , G06Q30/0207 , G06Q30/0283 , G06Q30/0611
摘要: In a caching scheme for real-time delivery of vehicle data, an application host receives a request for the vehicle data for a specific vehicle to be displayed on a website, where the vehicle data includes optimal price data for the specific vehicleThe application host retrieves a response to the request from an application cache or a database cache, if the response exists there. If not, then the application host calculates the optimal price data by determining whether meta data for the specific vehicle matches parameter values in one or more pricing rules. If so, the application host identifies the pricing rule that has the highest number of parameter values. The optimal price data for the specific vehicle is then calculated by applying the formula in this pricing rule and returned in the response.
-
公开(公告)号:US20240202203A1
公开(公告)日:2024-06-20
申请号:US18085452
申请日:2022-12-20
申请人: Snowflake Inc.
IPC分类号: G06F16/2457 , G06F16/2453 , G06F16/2455
CPC分类号: G06F16/24578 , G06F16/24542 , G06F16/24564
摘要: A search engine of a data exchange may receive from a user, a query comprising a set of search terms, and retrieve a set of data listings based on the search terms of the query. A data ranking module of the search engine may analyze each of the set of retrieved data listings to determine, for each of the set of retrieved data listings, a set of listing-specific signals and a set of external signals. Listing-specific signals may correspond to attributes or characteristics of data/content within a data listing, while external signals may correspond to a measure of activity in the data exchange that involves a data listing. Based on the listing-specific signals and the external signals analyzed for each retrieved data listing, the set of retrieved data listings may be ordered and presented to the user.
-
公开(公告)号:US20240202191A1
公开(公告)日:2024-06-20
申请号:US18544175
申请日:2023-12-18
申请人: DASSAULT SYSTEMES
IPC分类号: G06F16/2453 , G06F16/901
CPC分类号: G06F16/24537 , G06F16/24539 , G06F16/9024
摘要: A computer-implemented method for querying by a query engine on a database including relational data and graph data, the method including receiving a query by the query engine, the query being in a language compatible with a first order logic paradigm. The method further includes generating an intermediate representation, the IR being compatible with a first order logic paradigm. The method further includes using the intermediate representation of the query for executing the query on the relational data and the graph data of the database.
-
公开(公告)号:US12013876B2
公开(公告)日:2024-06-18
申请号:US17873359
申请日:2022-07-26
申请人: SNOWFLAKE INC.
IPC分类号: G06F16/27 , A61F5/56 , G06F9/48 , G06F9/50 , G06F16/14 , G06F16/182 , G06F16/21 , G06F16/22 , G06F16/23 , G06F16/2453 , G06F16/2455 , G06F16/2458 , G06F16/25 , G06F16/28 , G06F16/951 , G06F16/9535 , G06F16/9538 , H04L67/1095 , H04L67/1097 , H04L67/568
CPC分类号: G06F16/273 , A61F5/566 , G06F9/4881 , G06F9/5016 , G06F9/5044 , G06F9/5083 , G06F9/5088 , G06F16/148 , G06F16/1827 , G06F16/211 , G06F16/221 , G06F16/2365 , G06F16/24532 , G06F16/24545 , G06F16/24552 , G06F16/2456 , G06F16/2471 , G06F16/254 , G06F16/27 , G06F16/283 , G06F16/951 , G06F16/9535 , G06F16/9538 , H04L67/1095 , H04L67/1097 , H04L67/568
摘要: Example resource management systems and methods are described. In one implementation, a system includes a memory and a processing device operatively coupled to the memory. The processing device is to: provide a plurality of execution nodes, each execution node comprising a cache and a processor, each execution node communicatively coupled to a storage platform; determine at least one task associated with processing a received query referencing database data stored in the storage platform; and create a new execution node within the plurality of execution nodes to process the at least one task associated with processing the received query.
-
公开(公告)号:US12013855B2
公开(公告)日:2024-06-18
申请号:US18313753
申请日:2023-05-08
申请人: AMPERITY, INC.
发明人: Yan Yan , Aria Haghighi , Joseph Christianson
IPC分类号: G06F16/2453 , G06F16/2457 , G06F16/28
CPC分类号: G06F16/24542 , G06F16/24578 , G06F16/285
摘要: Disclosed are techniques for trimming large clusters of related records. In one embodiment, a method is disclosed comprising receiving a set of clusters, each cluster in the clusters including a plurality of records. The method extracts an oversized cluster in the set of clusters and performs a breadth-first search (BFS) on the oversized cluster to generate a list of visited records. The method terminates the BFS upon determining that the size of the list of visited records exceeds a maximum size and generates a new cluster from the list of visited records and adding the new cluster to the set of clusters. By recursively performing BFS traverse over the oversized cluster and extracting smaller new clusters from it, the oversized cluster is eventually partitioned into a set of sub-clusters with the size smaller than the predefined threshold.
-
-
-
-
-
-
-
-
-