公开(公告)号：US09009131B1

公开(公告)日：2015-04-14

申请号：US14248552

申请日：2014-04-09

申请人： Garry Carl Kaufmann

发明人： Garry Carl Kaufmann

IPC分类号： G06F17/30

CPC分类号： G06F17/3069

摘要： A system, method and computer program product for a search engine utilizing a large number of key words or phrases, and having the search engine program, in an initial search, individually search each of the key words through an initial database. Documents found as a result of each individual key word search are placed in a smaller more relevant database, after eliminating duplicate documents. Each document will contain at least one of the key words being searched. In a secondary search the remainder of the key words are searched through each document in the smaller more relevant database. The search engine notes the occurrence of any key word in each document without regard to frequency of occurrence. A relevancy factor for each document is determined based on the percentage of the total individual key words, disregarding frequency, that appear in each document. The cumulative total of key word appearances for all key words in each document is then determined. A ranking number is calculated as the product of each documents total cumulative key word count and its relevancy factor. The results progressing from highest to lowest ranking number are returned to the searcher.

摘要翻译： 利用大量关键词或短语的搜索引擎的系统，方法和计算机程序产品，并且在初始搜索中具有搜索引擎程序，通过初始数据库单独搜索关键词。 在删除重复的文档后，将每个关键字搜索结果发现的文档放在更小的更相关的数据库中。 每个文件将包含至少一个正在搜索的关键词。 在次要搜索中，通过相对较小的数据库中的每个文档搜索剩余的关键词。 搜索引擎注意到每个文档中任何关键字的出现，而不考虑发生频率。 每个文档的相关因子是根据出现在每个文档中的无关的频率的总个别关键词的百分比来确定的。 然后确定每个文件中所有关键词的关键词出现的累积总和。 排名数字计算为每个文档总累积关键字数及其相关因子的乘积。 从最高到最低排名数字的结果返回给搜索者。

公开(公告)号：US09298833B1

公开(公告)日：2016-03-29

申请号：US14677879

申请日：2015-04-02

申请人： Garry Carl Kaufmann

发明人： Garry Carl Kaufmann

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30675

摘要： A system, method, and computer program product for a search engine of Boolean nature wherein a multiplicity of key words are searched through a database. The results of each key word search become the database for searching with the next key word. In a normal Boolean search documents not found to contain a searched key word are immediately disposed of. In this method documents not containing the key word being searched are held until it has been determined if other documents containing the key word have been found. If so then the documents not containing the key word are disposed of; if not, all the documents of the database being searched are retained and become the database to be searched by the next word. Every key word is searched through the database resulting from the previous search. There are no search failures and results are always generated.

摘要翻译： 一种用于布尔性质的搜索引擎的系统，方法和计算机程序产品，其中通过数据库搜索多个关键词。 每个关键字搜索的结果成为用于搜索下一个关键词的数据库。 在正常的布尔搜索文件中找不到包含搜索到的关键字的立即处理。 在该方法中，保存不包含正在搜索的关键字的文档，直到确定是否已经找到包含关键字的其他文档。 如果是，则不包含关键词的文件被处理; 如果不是，正在搜索的数据库的所有文档都被保留，并成为下一个字搜索的数据库。 通过从先前搜索得到的数据库搜索每个关键字。 没有搜索失败，总是生成结果。