Method and Apparatus for Improving Performance of Approximate String Queries Using Variable Length High-Quality Grams
    1.
    发明申请
    Method and Apparatus for Improving Performance of Approximate String Queries Using Variable Length High-Quality Grams 有权
    用于提高使用可变长度高质量克的近似字符串查询性能的方法和装置

    公开(公告)号:US20100125594A1

    公开(公告)日:2010-05-20

    申请号:US12334471

    申请日:2008-12-14

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30985

    摘要: A computer process, called VGRAM, improves the performance of these string search algorithms in computers by using a carefully chosen dictionary of variable-length grams based on their frequencies in the string collection. A dynamic programming algorithm for computing a tight lower bound on the number of common grams shared by two similar strings in order to improve query performance is disclosed. A method for automatically computing a dictionary of high-quality grams for a workload of queries. Improvement on query performance is achieved by these techniques by a cost-based quantitative approach to deciding good grams for approximate string queries. An approach for answering approximate queries efficiently based on discarding gram lists, and another is based on combining correlated lists. An indexing structure is reduced to a given amount of space, while retaining efficient query processing by using algorithms in a computer based on discarding gram lists and combining correlated lists.

    摘要翻译: 称为VGRAM的计算机进程通过使用经过仔细选择的基于字符串集合中的频率的可变长度的字典来提高计算机中这些字符串搜索算法的性能。 公开了一种动态编程算法,用于计算由两个相似的字符串共享的共同数目的紧密下限,以提高查询性能。 一种用于为查询工作量自动计算高质量克词典的方法。 通过这些技术,通过基于成本的定量方法来确定查询性能的改进来确定近似字符串查询的好克数。 一种基于丢弃克列表来有效回答近似查询的方法,另一种是基于相关列表的组合。 索引结构减少到给定的空间,同时通过使用计算机中的算法保留有效的查询处理,基于丢弃克列表并组合相关列表。

    Method and apparatus for improving performance of approximate string queries using variable length high-quality grams
    2.
    发明授权
    Method and apparatus for improving performance of approximate string queries using variable length high-quality grams 有权
    使用可变长度高质量克改善近似字符串查询性能的方法和装置

    公开(公告)号:US07996369B2

    公开(公告)日:2011-08-09

    申请号:US12334471

    申请日:2008-12-14

    IPC分类号: G06F17/00

    CPC分类号: G06F17/30985

    摘要: A computer process, called VGRAM, improves the performance of these string search algorithms in computers by using a carefully chosen dictionary of variable-length grams based on their frequencies in the string collection. A dynamic programming algorithm for computing a tight lower bound on the number of common grams shared by two similar strings in order to improve query performance is disclosed. A method for automatically computing a dictionary of high-quality grams for a workload of queries. Improvement on query performance is achieved by these techniques by a cost-based quantitative approach to deciding good grams for approximate string queries. An approach for answering approximate queries efficiently based on discarding gram lists, and another is based on combining correlated lists. An indexing structure is reduced to a given amount of space, while retaining efficient query processing by using algorithms in a computer based on discarding gram lists and combining correlated lists.

    摘要翻译: 称为VGRAM的计算机进程通过使用经过仔细选择的基于字符串集合中的频率的可变长度的字典来提高计算机中这些字符串搜索算法的性能。 公开了一种动态编程算法,用于计算由两个相似的字符串共享的共同数目的紧密下限,以提高查询性能。 一种用于为查询工作量自动计算高质量克词典的方法。 通过这些技术,通过基于成本的定量方法来确定查询性能的改进来确定近似字符串查询的好克数。 一种基于丢弃克列表来有效回答近似查询的方法,另一种是基于相关列表的组合。 索引结构减少到给定的空间,同时通过使用计算机中的算法保留有效的查询处理,基于丢弃克列表并组合相关列表。

    Method for efficiently supporting interactive, fuzzy search on structured data
    3.
    发明授权
    Method for efficiently supporting interactive, fuzzy search on structured data 有权
    有效支持结构化数据的交互式,模糊搜索的方法

    公开(公告)号:US08631035B2

    公开(公告)日:2014-01-14

    申请号:US13295767

    申请日:2011-11-14

    IPC分类号: G06F17/30

    CPC分类号: G06F17/273 G06F17/30675

    摘要: A method to support efficient, interactive, and fuzzy search on text data includes an interactive, fuzzy search on structured data used in applications such as query relaxation, autocomplete, and spell checking, where inconsistencies and errors exist in user queries as well as data. It utilizes techniques to efficiently and interactively answer fuzzy queries on structured data to allow users to efficiently search for information interactively, and they can find records and documents even if these records and documents are slightly different from the user keywords.

    摘要翻译: 支持对文本数据进行高效,交互和模糊搜索的方法包括在用户查询和数据中存在不一致和错误的应用程序中使用的结构化数据的交互式模糊搜索,如查询放松,自动填充和拼写检查。 它利用技术来有效地和交互地回答结构化数据上的模糊查询,以允许用户以交互方式高效地搜索信息,即使这些记录和文档与用户关键字略有不同,它们也可以查找记录和文档。

    High Efficiency Prefix Search Algorithm Supporting Interactive, Fuzzy Search on Geographical Structured Data
    4.
    发明申请
    High Efficiency Prefix Search Algorithm Supporting Interactive, Fuzzy Search on Geographical Structured Data 审中-公开
    高效前缀搜索算法支持交互式,模糊搜索地理结构数据

    公开(公告)号:US20130262485A1

    公开(公告)日:2013-10-03

    申请号:US13993031

    申请日:2011-12-14

    申请人: Chen Li Shengyue Ji

    发明人: Chen Li Shengyue Ji

    IPC分类号: G06F17/30

    CPC分类号: G06F16/335 G06F16/29

    摘要: A computer-implemented method for retrieving information from a dataset of multiple records includes the steps of receiving a search phrase from a user or client application, the search phrase having a query keyword prefix, and traversing a multilayered spatial tree using the query keyword prefix until a termination condition occurs. The multilayered spatial tree is constructed using geographic information and has a root node and a plurality of child nodes including a plurality of leaf nodes. Each leaf node is associated with a corresponding list of records. At least some of the nodes are each associated with a corresponding hybrid filter including an object filter and a child filter. The object filter directly points to one or more records, and the child filter points to one or more child nodes for a subsequent traversal step.

    摘要翻译: 用于从多个记录的数据集检索信息的计算机实现的方法包括以下步骤:从用户或客户端应用接收搜索短语,搜索短语具有查询关键词前缀,并且使用查询关键字前缀遍历多层空间树,直到 终止条件发生。 使用地理信息构建多层空间树,并且具有根节点和包括多个叶节点的多个子节点。 每个叶节点与相应的记录列表相关联。 至少一些节点各自与包括对象过滤器和子过滤器的对应的混合过滤器相关联。 对象过滤器直接指向一个或多个记录,并且子过滤器指向一个或多个子节点用于后续遍历步骤。

    Method for Efficiently Supporting Interactive, Fuzzy Search on Structured Data
    5.
    发明申请
    Method for Efficiently Supporting Interactive, Fuzzy Search on Structured Data 有权
    有效支持结构化数据交互式模糊搜索的方法

    公开(公告)号:US20120059821A1

    公开(公告)日:2012-03-08

    申请号:US13295767

    申请日:2011-11-14

    IPC分类号: G06F17/30

    CPC分类号: G06F17/273 G06F17/30675

    摘要: A method to support efficient, interactive, and fuzzy search on text data includes an interactive, fuzzy search on structured data used in applications such as query relaxation, autocomplete, and spell checking, where inconsistencies and errors exist in user queries as well as data. It utilizes techniques to efficiently and interactively answer fuzzy queries on structured data to allow users to efficiently search for information interactively, and they can find records and documents even if these records and documents are slightly different from the user keywords.

    摘要翻译: 支持对文本数据进行高效,交互和模糊搜索的方法包括在用户查询和数据中存在不一致和错误的应用程序中使用的结构化数据的交互式模糊搜索,如查询放松,自动填充和拼写检查。 它利用技术来有效地和交互地回答结构化数据上的模糊查询,以允许用户以交互方式高效地搜索信息,即使这些记录和文档与用户关键字略有不同,它们也可以查找记录和文档。

    Method for efficiently supporting interactive, fuzzy search on structured data
    6.
    发明授权
    Method for efficiently supporting interactive, fuzzy search on structured data 有权
    有效支持结构化数据的交互式,模糊搜索的方法

    公开(公告)号:US08073869B2

    公开(公告)日:2011-12-06

    申请号:US12497489

    申请日:2009-07-02

    IPC分类号: G06F7/00

    CPC分类号: G06F17/273 G06F17/30675

    摘要: A method to support efficient, interactive, and fuzzy search on text data includes an interactive, fuzzy search on structured data used in applications such as query relaxation, autocomplete, and spell checking, where inconsistencies and errors exist in user queries as well as data. It utilizes techniques to efficiently and interactively answer fuzzy queries on structured data to allow users to efficiently search for information interactively, and they can find records and documents even if these records and documents are slightly different from the user keywords.

    摘要翻译: 支持对文本数据进行高效,交互和模糊搜索的方法包括在用户查询和数据中存在不一致和错误的应用程序中使用的结构化数据的交互式模糊搜索,如查询放松,自动填充和拼写检查。 它利用技术来有效地和交互地回答结构化数据上的模糊查询,以允许用户以交互方式高效地搜索信息,即使这些记录和文档与用户关键字略有不同,它们也可以查找记录和文档。

    Method for Efficiently Supporting Interactive, Fuzzy Search on Structured Data
    7.
    发明申请
    Method for Efficiently Supporting Interactive, Fuzzy Search on Structured Data 有权
    有效支持结构化数据交互式模糊搜索的方法

    公开(公告)号:US20100010989A1

    公开(公告)日:2010-01-14

    申请号:US12497489

    申请日:2009-07-02

    IPC分类号: G06F17/30

    CPC分类号: G06F17/273 G06F17/30675

    摘要: A method to support efficient, interactive, and fuzzy search on text data includes an interactive, fuzzy search on structured data used in applications such as query relaxation, autocomplete, and spell checking, where inconsistencies and errors exist in user queries as well as data. It utilizes techniques to efficiently and interactively answer fuzzy queries on structured data to allow users to efficiently search for information interactively, and they can find records and documents even if these records and documents are slightly different from the user keywords.

    摘要翻译: 支持对文本数据进行高效,交互和模糊搜索的方法包括在用户查询和数据中存在不一致和错误的应用程序中使用的结构化数据的交互式模糊搜索,如查询放松,自动填充和拼写检查。 它利用技术来有效地和交互地回答结构化数据上的模糊查询,以允许用户以交互方式高效地搜索信息,即使这些记录和文档与用户关键字略有不同,它们也可以查找记录和文档。