公开(公告)号：US08694507B2

公开(公告)日：2014-04-08

申请号：US13287656

申请日：2011-11-02

申请人： Dmitriy Meyerzon ,  Mihai Petriuc ,  Nicolai Bodd

发明人： Dmitriy Meyerzon ,  Mihai Petriuc ,  Nicolai Bodd

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

CPC分类号： G06F17/30867 ,  G06F17/30011 ,  G06F17/30321 ,  G06F17/3053 ,  G06F17/30864

摘要： This disclosure describes methods and systems for searching documents in a multi-tenant hosting environment. According to embodiments, to conserve hardware resources, a plurality of documents associated with a plurality of tenants may be mapped to the same search index in the multi-tenant hosting environment. In order to search documents associated only with a single tenant in the multi-tenant hosting environment, a tenant identifier is prepended to every key stored in the search index that is associated with the plurality of documents of the single tenant. Moreover, where one document links to another document within the multi-tenant hosting environment, the link is stored in a web graph when a source tenant identifier matches a target tenant identifier for the link. According to embodiments, when conducting a search, the link is resolved only if the link is stored in the web graph.

摘要翻译： 本公开描述了用于在多租户托管环境中搜索文档的方法和系统。 根据实施例，为了节省硬件资源，可以将与多个租户相关联的多个文档映射到多租户托管环境中的相同搜索索引。 为了搜索仅在多租户托管环境中与单个租户相关联的文档，预先将租户标识符存储在与单个租户的多个文档相关联的搜索索引中存储的每个密钥。 此外，当一个文档链接到多租户托管环境中的另一个文档时，当源租户标识符与链接的目标租户标识符匹配时，链接被存储在网页图中。 根据实施例，当进行搜索时，仅当链接被存储在网络图中时才解决链接。

公开(公告)号：US20130110828A1

公开(公告)日：2013-05-02

申请号：US13287656

申请日：2011-11-02

申请人： Dmitriy Meyerzon ,  Mihai Petriuc ,  Nicolai Bodd

发明人： Dmitriy Meyerzon ,  Mihai Petriuc ,  Nicolai Bodd

IPC分类号： G06F17/30

CPC分类号： G06F17/30867 ,  G06F17/30011 ,  G06F17/30321 ,  G06F17/3053 ,  G06F17/30864

摘要： This disclosure describes methods and systems for searching documents in a multi-tenant hosting environment. According to embodiments, to conserve hardware resources, a plurality of documents associated with a plurality of tenants may be mapped to the same search index in the multi-tenant hosting environment. In order to search documents associated only with a single tenant in the multi-tenant hosting environment, a tenant identifier is prepended to every key stored in the search index that is associated with the plurality of documents of the single tenant. Moreover, where one document links to another document within the multi-tenant hosting environment, the link is stored in a web graph when a source tenant identifier matches a target tenant identifier for the link. According to embodiments, when conducting a search, the link is resolved only if the link is stored in the web graph.

摘要翻译： 本公开描述了用于在多租户托管环境中搜索文档的方法和系统。 根据实施例，为了节省硬件资源，可以将与多个租户相关联的多个文档映射到多租户托管环境中的相同搜索索引。 为了搜索仅在多租户托管环境中与单个租户相关联的文档，预先将租户标识符存储在与单个租户的多个文档相关联的搜索索引中存储的每个密钥。 此外，当一个文档链接到多租户托管环境中的另一个文档时，当源租户标识符与链接的目标租户标识符匹配时，链接被存储在网页图中。 根据实施例，当进行搜索时，仅当链接被存储在网络图中时才解决链接。

公开(公告)号：US20100121838A1

公开(公告)日：2010-05-13

申请号：US12690100

申请日：2010-01-19

申请人： Vladimir Tankovich ,  Dmitriy Meyerzon ,  Mihai Petriuc

发明人： Vladimir Tankovich ,  Dmitriy Meyerzon ,  Mihai Petriuc

IPC分类号： G06F17/30

CPC分类号： G06F17/30864

摘要： Technologies are described herein for providing a more efficient approach to ranking search results. An illustrative technology reduces an amount of ranking data analyzed at query time. In the technology, a term is selected, at index time, from a master index. The term corresponds to a number of documents greater than a threshold. A set of documents that includes the term is selected based on the master index. A rank is determined for each document in the set of documents that contains the term. Each document in the set of documents that contains the term is assigned to a top document list or a bottom document list based on the rank. Predefined values of at least part of the rank are stored in the top document list for documents in the top document list and are not stored in the bottom document list for documents in the bottom document list.

摘要翻译： 本文描述了技术，以提供用于对搜索结果进行排名的更有效的方法。 说明性技术减少了在查询时间分析的排名数据量。 在技​​术中，在索引时间，从主索引中选择一个术语。 该术语对应于大于阈值的多个文档。 根据主索引选择一组包含该术语的文档。 在包含该术语的文档集中的每个文档确定排名。 包含该术语的文档集中的每个文档都会根据排名分配给顶级文档列表或底部文档列表。 至少部分等级的预定义值存储在顶部文档列表中的文档的顶部文档列表中，并且不存储在底部文档列表中的文档的底部文档列表中。

公开(公告)号：US20090327266A1

公开(公告)日：2009-12-31

申请号：US12147666

申请日：2008-06-27

申请人： Vladimir Tankovich ,  Dmitriy Meyerzon ,  Mihai Petriuc

发明人： Vladimir Tankovich ,  Dmitriy Meyerzon ,  Mihai Petriuc

IPC分类号： G06F17/30

CPC分类号： G06F17/30657

摘要： Technologies are described herein for providing a more efficient approach to ranking search results. One method reduces an amount of ranking data analyzed at query time. In the method, a term is selected, at index time, from a master index. The term corresponds to a number of documents greater than a threshold. A set of documents that includes the term is selected based on the master index. A rank is determined for each document in the set of documents that contains the term. Each document in the set of documents that contains the term is assigned to a high ranking index or a low ranking index based on the simple rank.

摘要翻译： 本文描述了技术，以提供用于对搜索结果进行排名的更有效的方法。 一种方法减少了在查询时分析的排名数据量。 在该方法中，在索引时间，从主索引选择一个项。 该术语对应于大于阈值的多个文档。 根据主索引选择一组包含该术语的文档。 在包含该术语的文档集中的每个文档确定排名。 包含该术语的文档集中的每个文档被分配到基于简单等级的高排名索引或低排名索引。

公开(公告)号：US20060200464A1

公开(公告)日：2006-09-07

申请号：US11072734

申请日：2005-03-03

申请人： Michal Gideoni ,  David Lee ,  Dmitriy Meyerzon ,  Mihai Petriuc ,  Kyle Peltonen

发明人： Michal Gideoni ,  David Lee ,  Dmitriy Meyerzon ,  Mihai Petriuc ,  Kyle Peltonen

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

CPC分类号： G06F16/338 ,  G06F16/345

摘要： A text document is segmented into word and sentence information when the document is first presented and indexed. A memory stream is generated for the document. The memory stream includes document title information, word offsets, sentence offsets, the alternate list, and the contents of the document. The memory stream is used to determine which sentences in the document include query terms. The sentences that include query terms are ranked according to a ranking algorithm. The ranking algorithm determines which sentences include the highest number of query terms and the number of occurrences of the query terms in each sentence. A predetermined number of sentences that together contain as many query terms as possible are selected such that the sentences that are most representative of the document with respect to the query are included in the summary. The summary is generated at query time by concatenating the selected sentences with the query terms highlighted.

摘要翻译： 当文档首次呈现和索引时，文本文档被分割成单词和句子信息。 为文档生成内存流。 存储器流包括文档标题信息，字偏移，句子偏移，备用列表和文档的内容。 内存流用于确定文档中包含查询条款的哪些句子。 根据排序算法对包含查询项的句子进行排序。 排序算法确定哪个句子包括查询词的最高数目和每个句子中查询词的出现次数。 选择一起包含尽可能多的查询词语的预定数量的句子，使得相对于查询最有代表文档的句子被包括在摘要中。 通过将所选择的句子与突出显示的查询字词相连，在查询时生成摘要。

公开(公告)号：US08171031B2

公开(公告)日：2012-05-01

申请号：US12690100

申请日：2010-01-19

申请人： Vladimir Tankovich ,  Dmitriy Meyerzon ,  Mihai Petriuc

发明人： Vladimir Tankovich ,  Dmitriy Meyerzon ,  Mihai Petriuc

IPC分类号： G06F17/30

CPC分类号： G06F17/30864

摘要： Technologies are described herein for providing a more efficient approach to ranking search results. An illustrative technology reduces an amount of ranking data analyzed at query time. In the technology, a term is selected, at index time, from a master index. The term corresponds to a number of documents greater than a threshold. A set of documents that includes the term is selected based on the master index. A rank is determined for each document in the set of documents that contains the term. Each document in the set of documents that contains the term is assigned to a top document list or a bottom document list based on the rank. Predefined values of at least part of the rank are stored in the top document list for documents in the top document list and are not stored in the bottom document list for documents in the bottom document list.

摘要翻译： 本文描述了技术，以提供用于对搜索结果进行排名的更有效的方法。 说明性技术减少了在查询时间分析的排名数据量。 在技​​术中，在索引时间，从主索引中选择一个术语。 该术语对应于大于阈值的多个文档。 根据主索引选择一组包含该术语的文档。 在包含该术语的文档集中的每个文档确定排名。 包含该术语的文档集中的每个文档都会根据排名分配给顶级文档列表或底部文档列表。 至少部分等级的预定义值存储在顶部文档列表中的文档的顶部文档列表中，并且不存储在底部文档列表中的文档的底部文档列表中。

公开(公告)号：US08161036B2

公开(公告)日：2012-04-17

申请号：US12147666

申请日：2008-06-27

申请人： Vladimir Tankovich ,  Dmitriy Meyerzon ,  Mihai Petriuc

发明人： Vladimir Tankovich ,  Dmitriy Meyerzon ,  Mihai Petriuc

IPC分类号： G06F17/30

CPC分类号： G06F17/30657

摘要： Technologies are described herein for providing a more efficient approach to ranking search results. One method reduces an amount of ranking data analyzed at query time. In the method, a term is selected, at index time, from a master index. The term corresponds to a number of documents greater than a threshold. A set of documents that includes the term is selected based on the master index. A rank is determined for each document in the set of documents that contains the term. Each document in the set of documents that contains the term is assigned to a high ranking index or a low ranking index based on the simple rank.

摘要翻译： 本文描述了技术，以提供用于对搜索结果进行排名的更有效的方法。 一种方法减少了在查询时分析的排名数据量。 在该方法中，在索引时间，从主索引选择一个项。 该术语对应于大于阈值的多个文档。 根据主索引选择一组包含该术语的文档。 在包含该术语的文档集中的每个文档确定排名。 包含该术语的文档集中的每个文档被分配到基于简单等级的高排名索引或低排名索引。

公开(公告)号：US20120158748A1

公开(公告)日：2012-06-21

申请号：US13331505

申请日：2011-12-20

申请人： Ioan Smintina ,  Clement Ifrim ,  Elena Petriuc ,  Mihai Petriuc

发明人： Ioan Smintina ,  Clement Ifrim ,  Elena Petriuc ,  Mihai Petriuc

IPC分类号： G06F17/30

CPC分类号： G06Q30/0623 ,  G06Q50/16

摘要： Real estate ranking computation is calculated to sort real estate properties. Such computations use available information regarding real estate properties in any local markets and may help the real estate buyer to identify real estate properties with various ranked financial values. Suitably, a relatively small geographic area can be used based on the real estate buyer's specified criteria, and the real estate ranking computation is able to handle interactions among predictor variables, possesses suitable predictive confidence, and includes the capability for dynamically adjusting the underlying ranking computation as new patterns of real estate market emerge over time.

摘要翻译： 房地产价格计算是按房地产物业进行排序。 这种计算使用有关当地市场的房地产业务的现有信息，并可能有助于房地产买家识别具有各种排名的财务价值的房地产物业。 适当地，可以根据房地产买家的指定标准使用相对较小的地理区域，并且房地产排名计算能够处理预测变量之间的相互作用，具有适当的预测置信度，并且包括动态调整基础排名计算的能力 随着时间的推移，房地产市场的新格局出现。

公开(公告)号：US20050210006A1

公开(公告)日：2005-09-22

申请号：US10804326

申请日：2004-03-18

申请人： Stephen Robertson ,  Hugo Zaragoza ,  Michael Taylor ,  Stefan Larimore ,  Mihai Petriuc

发明人： Stephen Robertson ,  Hugo Zaragoza ,  Michael Taylor ,  Stefan Larimore ,  Mihai Petriuc

IPC分类号： G06F17/30

CPC分类号： G06F17/30722 ,  G06F17/30616 ,  Y10S707/99952

摘要： A field-weighted search combines statistical information for each term across document fields in a suitably weighted fashion. Both field-specific term frequencies and field and document lengths are considered to obtain a field-weighted document weight for each query term. Each field-weighted document weight can then be combined in order to generate a field-weighted document score that is responsive to the overall query.

摘要翻译： 场加权搜索以适当加权的方式将跨文档字段的每个术语的统计信息合并。 考虑到字段特定术语频率和字段和文档长度都可以获得每个查询项的场加权文档权重。 然后可以组合每个场加权文档权重，以便生成响应于整体查询的场加权文档得分。

公开(公告)号：US08832115B2

公开(公告)日：2014-09-09

申请号：US13331505

申请日：2011-12-20

申请人： Ioan Smintina ,  Clement Ifrim ,  Elena Petriuc ,  Mihai Petriuc

发明人： Ioan Smintina ,  Clement Ifrim ,  Elena Petriuc ,  Mihai Petriuc

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

CPC分类号： G06Q30/0623 ,  G06Q50/16

摘要： Real estate ranking computation is calculated to sort real estate properties. Such computations use available information regarding real estate properties in any local markets and may help the real estate buyer to identify real estate properties with various ranked financial values. Suitably, a relatively small geographic area can be used based on the real estate buyer's specified criteria, and the real estate ranking computation is able to handle interactions among predictor variables, possesses suitable predictive confidence, and includes the capability for dynamically adjusting the underlying ranking computation as new patterns of real estate market emerge over time.

摘要翻译： 房地产价格计算是按房地产物业进行排序。 这种计算使用有关当地市场的房地产业务的现有信息，并可能有助于房地产买家识别具有各种排名的财务价值的房地产物业。 适当地，可以根据房地产买家的指定标准使用相对较小的地理区域，并且房地产排名计算能够处理预测变量之间的相互作用，具有适当的预测置信度，并且包括动态调整基础排名计算的能力 随着时间的推移，房地产市场的新格局出现。