中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

13 records (took 0.021 seconds)

    Systems, devices, and methods for content indexing and querying in a search system
    1.
    发明授权
    Systems, devices, and methods for content indexing and querying in a search system 有权

    公开(公告)号：US10747750B2

    公开(公告)日：2020-08-18

    申请号：US15787804

    申请日：2017-10-19

    Applicant: Oath INC.

    Inventor： Edward Bortnikov ,  Ohad Shacham ,  Dmitry Basin ,  Gali Sheffi ,  Yonatan Gottesman

    IPC: G06F16/93 ,  G06F16/248 ,  G06F16/9535 ,  G06F16/2457 ,  G06F16/23 ,  G06F16/22

    Abstract: Systems and methods for indexing content in a personal search system are disclosed. In one embodiment, the method comprises receiving a content item from a data source; extracting, from the content item, at least one document appearing in the content item, the at least one document including a first timestamp; storing the document in a content index; retrieving an event associated with the document from an event index, the event including a second timestamp and one or more attributes; generating an updated document based on the one or more attributes, the updated document including the second timestamp and the one or more attributes; and replacing the document stored in the content index with the updated document if the second timestamp is later than the first timestamp.

    METHOD AND SYSTEM FOR KEY-VALUE STORAGE
    4.
    发明申请
    METHOD AND SYSTEM FOR KEY-VALUE STORAGE 审中-公开

    公开(公告)号：US20200333968A1

    公开(公告)日：2020-10-22

    申请号：US16386505

    申请日：2019-04-17

    Applicant: Oath Inc.

    Inventor： Edward Bortnikov ,  Eshcar Hillel ,  Anastasia Braginsky ,  Eran Gilad ,  Idit Keidar ,  Yonatan Gottesman

    IPC: G06F3/06 ,  G06F16/9035 ,  G06F16/903 ,  G06F16/901

    Abstract: The present teaching relates to a method, system and programming for operating a data storage. The data storage comprises of different portions including: a first portion having a plurality of metadata objects stored therein, each of the metadata objects being associated with a filter and corresponding to a range of keys, wherein at least one of the metadata objects is associated with a data structure, and a second portion having a plurality of files stored therein, each of the plurality of files being associated with one of the plurality of metadata objects; The data storage synchronizes a scan request with respect to one or more write requests based on a parameter associated with the scan request and each of the one or more write requests.

    METHOD AND SYSTEM FOR SEARCHING A KEY-VALUE STORAGE
    6.
    发明申请
    METHOD AND SYSTEM FOR SEARCHING A KEY-VALUE STORAGE 审中-公开

    公开(公告)号：US20200334258A1

    公开(公告)日：2020-10-22

    申请号：US16386496

    申请日：2019-04-17

    Applicant: Oath Inc.

    Inventor： Edward Bortnikov ,  Eshcar Hillel ,  Anastasia Braginsky ,  Eran Gilad ,  Idit Keidar ,  Yonatan Gottesman

    IPC: G06F16/2455 ,  G06F16/2458

    Abstract: The present teaching relates to a method, system and programming for searching a data storage. A key is extracted from a request and a metadata object associated with the key is identified. Further, a determination is made as to whether the metadata object is associated with a data structure stored in a first portion of the data storage. In response to a successful determination, the data structure is searched to retrieve a value associated with the key from the first portion. In response to an unsuccessful determination, a cache is searched to retrieve the value associated with the key, and in response to the key being absent in the cache, a file associated with the metadata object is searched to retrieve the value associated with the key, wherein the file is stored in a second portion of the data storage.

    Method for approximate k-nearest-neighbor search on parallel hardware accelerators
    7.
    发明授权
    Method for approximate k-nearest-neighbor search on parallel hardware accelerators 有权

    公开(公告)号：US10510017B2

    公开(公告)日：2019-12-17

    申请号：US14945221

    申请日：2015-11-18

    Applicant: Oath Inc.

    Inventor： Edward Bortnikov ,  Alexander Libov ,  Ohad Shacham

    IPC: G06F17/30 ,  G06N20/00 ,  G06F17/10 ,  G06K9/00 ,  G06K9/62 ,  G06F16/903

    Abstract: In one embodiment, a processor of a computing device receives a query. The computing device may compare a centroid of each of a plurality of clusters to the query such that a subset of the plurality of clusters is selected, each of the plurality of clusters having a set of data points. An assignment of the subset of the plurality of clusters may be communicated to a hardware accelerator of the computing device. A plurality of threads of the hardware accelerator of the computing device may generate one or more distance tables that store results of intermediate computations corresponding to the query and the subset of the plurality of clusters. The distance tables may be stored in shared memory of the hardware accelerator. A plurality of threads of the hardware accelerator may determine a plurality of data points using the distance tables. The processor may provide query results pertaining to at least a portion of the plurality of data points.

    Top-k query processing with conditional skips
    8.
    发明授权
    Top-k query processing with conditional skips 有权

    公开(公告)号：US10459959B2

    公开(公告)日：2019-10-29

    申请号：US15345277

    申请日：2016-11-07

    Applicant: Oath Inc.

    Inventor： David Carmel ,  Guy Gueta ,  Edward Bortnikov

    IPC: G06F16/33 ,  G06F16/93

    Abstract: Methods and apparatus for performing top-k query processing include pruning a list of documents to identify a subset of the list of documents, where pruning includes, for other query terms in the set of query terms, skipping a document in the list of documents based, at least in part, on the contribution of the query term to the score of the corresponding document and the term upper bound for each other query term, in the set of query terms, that matches the document.

    SYSTEM AND METHOD FOR TOP-K SEARCHING USING PARALLEL PROCESSING
    9.
    发明申请
    SYSTEM AND METHOD FOR TOP-K SEARCHING USING PARALLEL PROCESSING 审中-公开

    公开(公告)号：US20190294691A1

    公开(公告)日：2019-09-26

    申请号：US15928723

    申请日：2018-03-22

    Applicant: Oath Inc.

    Inventor： Edward Bortnikov ,  David Carmel ,  Gali Sheffi ,  Idit Keidar ,  Dmitry Basin

    IPC: G06F17/30

    Abstract: Methods, systems, and programming for retrieving content items for a search are described herein. In a non-limiting embodiment, a query including a plurality of terms may be received. For each of the plurality of terms, a posting list of one or more content items may be obtained. The posting list may include a ranked list of term scores corresponding to the one or more content items, each of the term scores being indicative of a level of relevance of a corresponding content item to a term associated with the posting list. A list of relevant content items for the query may be determined based on the term scores in each posting list for the one or more content items identified with respect to each term. At least one of the relevant content items may be provided as a response to the query.

Patent Agency Ranking