METHOD OF QUERYING INFORMATION, ELECTRONIC DEVICE, AND STORAGE MEDIUM

    公开(公告)号:US20240338360A1

    公开(公告)日:2024-10-10

    申请号:US18748967

    申请日:2024-06-20

    发明人: Jing QU

    摘要: A method of querying an information, an electronic device, and a storage medium are provided, which relate to a field of artificial intelligence technology, in particular to fields of large language model, information processing and intelligent office technologies. The method includes: acquiring a time period to be queried, a number of items to be queried and an object identification of a target object corresponding to the information query request, in response to receiving the information query request from the target object; processing the time period to be queried, the number of items to be queried, the object identification and a predetermined parameter format text to obtain a target parameter, where the target parameter represents an input parameter of a query interface of an information query system; and acquiring, by invoking the query interface, a target information from the information query system based on the target parameter.

    DYNAMIC DATA QUERY ROUTING FOR MANAGING ACCESS TO DATASETS HAVING MULTIPLE VERSIONS

    公开(公告)号:US20240281423A1

    公开(公告)日:2024-08-22

    申请号:US18170842

    申请日:2023-02-17

    申请人: PAYPAL, INC.

    IPC分类号: G06F16/21 G06F16/2453

    CPC分类号: G06F16/219 G06F16/2453

    摘要: There are provided systems and methods for dynamic data query routing for managing access to datasets having multiple versions. A service provider, such as an electronic transaction processor for digital transactions, may provide data for different applications including local device-side software applications and web-based or server-side applications. The data may be read and provided within the application, for example, for output or processing, as well as operated on in the applications to update, add to, or delete from corresponding records. When retrieving or loading data, a data quantum may be used in a data mesh to abstract database physical locations and utilize logical names that allow for applications to code and query for data without direct entanglement with databases and corresponding stored datasets for the data. A router may then be used to route requests and queries for the data to optimized databases for the data.

    Volume Placement Failure Isolation and Reporting

    公开(公告)号:US20240264998A1

    公开(公告)日:2024-08-08

    申请号:US18441163

    申请日:2024-02-14

    申请人: NetApp, Inc.

    IPC分类号: G06F16/22 G06F16/2453

    摘要: Systems, methods, and machine-readable media are disclosed for isolating and reporting a volume placement error for a request to place a volume on a storage platform. A volume placement service requests information from a database using an optimized database query to determine an optimal location to place a new volume. The database returns no results. The volume placement service deconstructs the optimized database query to extract a plurality of queries. The volume placement service iterates over the plurality queries, combining queries in each iteration, to determine a cause for the database to return no results. The volume placement service determines based on the results of each iterative database request a cause the database to return an empty result. The volume placement service provides an indication of the cause for returning an empty result.

    AUTOSCALING OF ELASTIC COMPUTE RESOURCES
    4.
    发明公开

    公开(公告)号:US20240220330A1

    公开(公告)日:2024-07-04

    申请号:US18401598

    申请日:2023-12-31

    申请人: Teradata US, Inc.

    IPC分类号: G06F9/50 G06F16/2453

    摘要: A system may include a storage device. The system may include a plurality of processing nodes. The plurality of processing nodes communicates with the storage device. At least one processing node schedules a group of compute nodes to be active during a selected time window. The at least one processing node receives a query and determines that the query is to be executed by one of the plurality of processing nodes and the group of compute nodes. The at least one processing node schedules the query to be executed by the determined one of the plurality of processing nodes or the group of compute nodes. A method and computer-readable medium are also disclosed.

    LEARNED WORKLOAD SYNTHESIS
    6.
    发明公开

    公开(公告)号:US20240168948A1

    公开(公告)日:2024-05-23

    申请号:US18058359

    申请日:2022-11-23

    摘要: Learned workload synthesis is disclosed. In an aspect of the present disclosure, a time series dataset corresponding to a target workload is received. A set of performance characteristics is determined from the time series dataset. A call is provided to a prediction model to determine a candidate query sequence based on the determined set of performance characteristics. A synthetic workload is generated based on the determined candidate query sequence. A synthetic workload is generated based on the determined candidate query sequence. A first similarity between a first performance profile of the synthetic workload and a second performance profile of the target workload meets a workload performance threshold condition. A performance insight is determined based on the synthetic workload. In a further aspect, the prediction model is trained to predict performance profiles based on workload profiles generated by executing benchmark queries using hardware and/or software configurations.

    ACCURATE AND QUERY-EFFICIENT MODEL AGNOSTIC EXPLANATIONS

    公开(公告)号:US20240168940A1

    公开(公告)日:2024-05-23

    申请号:US18057776

    申请日:2022-11-22

    IPC分类号: G06F16/23 G06F16/2453

    CPC分类号: G06F16/2365 G06F16/2453

    摘要: One or more systems, devices, computer program products and/or computer-implemented methods of use provided herein relate to a process for providing an explanation result for an analytical model. A system can comprise a memory that stores computer executable components, and a processor that executes the computer executable components stored in the memory, wherein the computer executable components can comprise an uncertainty component that determines an uncertainty score for a distribution of samples that neighbor a selected input to an analytical model, a sampling component that identifies a subset of the distribution of samples based on the uncertainty score, and an explanation component that generates an explanation of an output of the analytical model, corresponding to the selected input, based on use of a sample from the subset of the distribution of samples.

    MACHINE LEARNING FOR DYNAMIC INFORMATION RETRIEVAL IN A COLD START SETTING

    公开(公告)号:US20240152512A1

    公开(公告)日:2024-05-09

    申请号:US17980487

    申请日:2022-11-03

    申请人: Zulily, LLC

    IPC分类号: G06F16/2453 G06Q30/02

    CPC分类号: G06F16/2453 G06Q30/0201

    摘要: Methods and systems described herein may improve search results for items newly added to a database by using machine learning to map historical items in the database to the newly added items. For example, non-conventional methods and systems described herein may use machine learning generated embeddings (e.g., vector representations of items) to determine the extent to which two items are similar to each other. The computing system may assign engagement data associated with a first item to a second item that lacks engagement data. By doing so, the computing system may enable improved search results because the position of items that lack engagement data (e.g., newly added items) may be adjusted based on engagement data associated with similar items.

    AUTOMATED ENFORCEMENT OF RANGE-KEYED DATA
    10.
    发明公开

    公开(公告)号:US20240111764A1

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

    申请号:US17959551

    申请日:2022-10-04

    发明人: Daniel S. Tow

    摘要: Techniques are disclosed hereafter for efficiently enforcing a “WITHOUT OVERLAP” range constraint by confirming primary-key integrity for a new or modified row (the “target row”) by checking just two neighboring index entries, using a new “two-sided halted range scan” of the same key index on entities which have range-endpoints data as part of their primary key. Techniques are described for reducing search time and resources in situations where a query specifies an entity and a point within a non-overlapping range. Techniques are also described for optimized handling of queries that do not specify a primary key but have both a range condition and a filter on a non-key column.