WILDCARD SEARCHES USING NUMERIC STRING HASH
    2.
    发明申请

    公开(公告)号:US20190243926A1

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

    申请号:US15891145

    申请日:2018-02-07

    CPC classification number: G06F16/90344 G06F16/2255 G06F16/243

    Abstract: Techniques herein improve computational efficiency for wildcard searches by using numeric string hashes. In an embodiment, a plurality of query K-gram tokens for a term in a query are generated. Using a first index, an intersection of hash tokens is determined, wherein said first index indexes each query K-gram token of said K-gram tokens to a respective subset of hash tokens of a plurality of hash tokens, each of hash token of said plurality of hash tokens corresponding to a term found in one or more documents of a corpus of documents. The intersection of hash tokens comprises only hash tokens indexed to all of said plurality of query K-gram tokens by said first index. Using a second index, documents of said corpus of documents that contain said term are determined, said second index indexing said hash tokens to a plurality of terms in said corpus of documents and for each term of said plurality of terms, a respective subset of documents of corpus of documents that contain said each term.

    UBIQUITOUS SEARCH ON DATA STORED IN THE RDBMS

    公开(公告)号:US20240378199A1

    公开(公告)日:2024-11-14

    申请号:US18367722

    申请日:2023-09-13

    Abstract: Techniques are provided for creating a “ubiquitous search index” which allows for full-text as well as value range-based search across all columns from multiple database tables, multiple user-defined unmaterialized views, and external sources. In one implementation, the data is indexed in a peculiarly constructed schema-based JSON format without duplicating data. The techniques maintain eventual consistency with the normalized source of truth database tables, and do not have a significant impact on the performance of transactional Data Manipulation Language (DML) operations.

    Wildcard searches using numeric string hash

    公开(公告)号:US11188594B2

    公开(公告)日:2021-11-30

    申请号:US15891145

    申请日:2018-02-07

    Abstract: Techniques herein improve computational efficiency for wildcard searches by using numeric string hashes. In an embodiment, a plurality of query K-gram tokens for a term in a query are generated. Using a first index, an intersection of hash tokens is determined, wherein said first index indexes each query K-gram token of said K-gram tokens to a respective subset of hash tokens of a plurality of hash tokens, each of hash token of said plurality of hash tokens corresponding to a term found in one or more documents of a corpus of documents. The intersection of hash tokens comprises only hash tokens indexed to all of said plurality of query K-gram tokens by said first index. Using a second index, documents of said corpus of documents that contain said term are determined, said second index indexing said hash tokens to a plurality of terms in said corpus of documents and for each term of said plurality of terms, a respective subset of documents of corpus of documents that contain said each term.

Patent Agency Ranking