专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07356528B1 Phrase matching in documents having nested-structure arbitrary (document-specific) markup 失效
标题翻译：具有嵌套结构任意（文档特定）标记的文档中的短语匹配
公开(公告)号：US07356528B1
公开(公告)日：2008-04-08
申请号：US10765675
申请日：2004-01-27
申请人： Sihem Amer-Yahia , Maria F. Fernandez , Divesh Srivastava , Yu Xu
发明人： Sihem Amer-Yahia , Maria F. Fernandez , Divesh Srivastava , Yu Xu
IPC分类号： G06F7/00
CPC分类号： G06F17/30938 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： A method of searching a document having nested-structure document-specific markup (such as Extensible Markup Language (XML)) involves 112 receiving a query that designates at least (A) a phrase to be matched in a phrase matching process, and (B) a selective designation of at least a tag or annotation that is to be ignored during the phrase matching process. The method further involves 114 deriving query-specific indices based on query-independent indices that were created specific to each document, and 116 carrying out the phrase matching process using the query-specific indices on the document having the nested-structure document-specific markup.
摘要翻译：搜索具有嵌套结构文档特定标记（例如可扩展标记语言（XML））的文档的方法涉及112接收在短语匹配处理中至少指定（A）要匹配的短语的查询，并且（B ）选择性地指定短语匹配过程中至少要被忽略的标签或注释。该方法还包括基于针对每个文档特定创建的独立于查询的索引来导出查询特定索引，以及116使用具有嵌套结构文档特定标记的文档上的查询特定索引进行短语匹配处理。

2. 发明申请

US20080154891A1 PHRASE MATCHING IN DOCUMENTS HAVING NESTED-STRUCTURE ARBITRARY (DOCUMENT-SPECIFIC) MARKUP 有权
标题翻译：具有结构化仲裁（文件特定）标记的文档中的相关匹配
公开(公告)号：US20080154891A1
公开(公告)日：2008-06-26
申请号：US12042287
申请日：2008-03-04
申请人： Sihem Amer-Yahia , Maria F. Fernandez , Divesh Srivastava , Yu Xu
发明人： Sihem Amer-Yahia , Maria F. Fernandez , Divesh Srivastava , Yu Xu
IPC分类号： G06F17/30
CPC分类号： G06F17/30938 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： A method of searching a document having nested-structure document-specific markup (such as Extensible Markup Language (XML)) involves 112 receiving a query that designates at least (A) a phrase to be matched in a phrase matching process, and (B) a selective designation of at least a tag or annotation that is to be ignored during the phrase matching process. The method further involves 114 deriving query-specific indices based on query-independent indices that were created specific to each document, and 116 carrying out the phrase matching process using the query-specific indices on the document having the nested-structure document-specific markup.
摘要翻译：搜索具有嵌套结构文档特定标记（例如可扩展标记语言（XML））的文档的方法涉及112接收在短语匹配处理中至少指定（A）要匹配的短语的查询，并且（B ）选择性地指定短语匹配过程中至少要被忽略的标签或注释。该方法还包括基于针对每个文档特定创建的独立于查询的索引来导出查询特定索引，以及116使用具有嵌套结构文档特定标记的文档上的查询特定索引进行短语匹配处理。

3. 发明授权

US08549006B2 Phrase matching in documents having nested-structure arbitrary (document-specific) markup 有权
标题翻译：具有嵌套结构任意（文档特定）标记的文档中的短语匹配
公开(公告)号：US08549006B2
公开(公告)日：2013-10-01
申请号：US12042287
申请日：2008-03-04
申请人： Sihem Amer-Yahia , Maria F. Fernandez , Divesh Srivastava , Yu Xu
发明人： Sihem Amer-Yahia , Maria F. Fernandez , Divesh Srivastava , Yu Xu
IPC分类号： G06F7/00
CPC分类号： G06F17/30938 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： A method of searching a document having nested-structure document-specific markup (such as Extensible Markup Language (XML)) involves 112 receiving a query that designates at least (A) a phrase to be matched in a phrase matching process, and (B) a selective designation of at least a tag or annotation that is to be ignored during the phrase matching process. The method further involves 114 deriving query-specific indices based on query-independent indices that were created specific to each document, and 116 carrying out the phrase matching process using the query-specific indices on the document having the nested-structure document-specific markup.
摘要翻译：搜索具有嵌套结构文档特定标记（例如可扩展标记语言（XML））的文档的方法涉及112接收在短语匹配处理中至少指定（A）要匹配的短语的查询，并且（B ）选择性地指定短语匹配过程中至少要被忽略的标签或注释。该方法还包括基于针对每个文档特定创建的独立于查询的索引来导出查询特定索引，以及116使用具有嵌套结构文档特定标记的文档上的查询特定索引进行短语匹配处理。

4. 发明授权

US08005817B1 System and method for providing structure and content scoring for XML 失效
标题翻译：为XML提供结构和内容评分的系统和方法
公开(公告)号：US08005817B1
公开(公告)日：2011-08-23
申请号：US11290858
申请日：2005-11-30
申请人： Sihem Amer-Yahia , Nikolas Koudas , Amelie Marian , Divesh Srivastava , David Toman
发明人： Sihem Amer-Yahia , Nikolas Koudas , Amelie Marian , Divesh Srivastava , David Toman
IPC分类号： G06F17/30
CPC分类号： G06F17/30929
摘要： A system, method and computer readable medium are disclosed. The method embodiment relates to a method of computing score of candidate answers to a database query. The method comprises receiving a database query, assigning a first score to a match to the query, the first score being associated with a relative importance of an individual keyword in a collection of documents based on all structural and content predicates in the query, assigning a second score to the match, the second score being associated with a relative importance of a keyword in an individual document and using the assigned first score and second score to compute an answer score for the query.
摘要翻译：公开了一种系统，方法和计算机可读介质。方法实施例涉及一种计算数据库查询的候选答案的分数的方法。所述方法包括：接收数据库查询，将第一分数分配给所述查询的匹配，所述第一分数基于所述查询中的所有结构和内容谓词，在文档集合中与个别关键字的相对重要性相关联，分配所述第二分数与所述单个文档中的关键字的相对重要性相关联，并且使用所分配的第一分数和第二分数来计算所述查询的答案分数。

5. 发明授权

US06980985B1 Distributed evalulation of directory queries using a topology cache 失效
标题翻译：使用拓扑缓存对目录查询进行分布式评估
公开(公告)号：US06980985B1
公开(公告)日：2005-12-27
申请号：US09941479
申请日：2001-08-29
申请人： Sihem Amer-Yahia , Divesh Srivastava , Dan Suciu
发明人： Sihem Amer-Yahia , Divesh Srivastava , Dan Suciu
IPC分类号： G06F17/30 , H04L29/12
CPC分类号： H04L61/1523 , G06F17/30433 , G06F17/30545 , H04L29/12132 , H04L61/1552 , Y10S707/99932 , Y10S707/99934 , Y10S707/99937 , Y10S707/99938 , Y10S707/99939
摘要： A technique for performing query evaluation on distributed directories utilizes the creation of a “topology cache” defining the hierarchical relationship between the various directory servers (i.e., identifying “subordinate” and “superior” knowledge references associated with each directory server in the system). The created topology cache is then stored at each directory server, and forwarded to a client upon submitting a query to the system. Using the topology cache information at the client, a distributed query evaluation plan can be developed for use with complex queries, such as hierarchical and aggregate queries.
摘要翻译：用于对分布式目录执行查询评估的技术利用了定义各种目录服务器之间的分层关系（即，识别与系统中的每个目录服务器相关联的“从属”和“上级”知识引用）的“拓扑缓存”的创建。然后将创建的拓扑缓存存储在每个目录服务器上，并在向系统提交查询时转发给客户端。在客户端使用拓扑缓存信息，可以开发分布式查询评估计划，以便与复杂查询（如分层和聚合查询）一起使用。

6. 发明授权

US08412714B2 Adaptive processing of top-k queries in nested-structure arbitrary markup language such as XML 有权
公开(公告)号：US08412714B2
公开(公告)日：2013-04-02
申请号：US11073966
申请日：2005-03-07
申请人： Sihem Amer-Yahia , Nikolaos Koudas , Amélie Marian-Guerrier , Divesh Srivastava
发明人： Sihem Amer-Yahia , Nikolaos Koudas , Amélie Marian-Guerrier , Divesh Srivastava
IPC分类号： G06F7/00
CPC分类号： G06F17/30466 , G06F17/3053 , G06F17/30938
摘要： A method of adaptively evaluating a top-k query involves (1204) forming a servers having respective server queues storing candidate answers, processing (1322) the candidate answers, and (1232) providing a top-k set as a query evaluation. Processing includes (1402) adaptively choosing a winning server to whose queue a current candidate answer should be sent; (1404) sending the current candidate answer to the winning server's queue; (1334) adaptively choosing a next candidate answer to process from the winning server's queue; (1336) computing a join between the current candidate answer and next candidate answers at the winning server, so as to produce a new current candidate answer; and (1338) updating the top-k set with the new current candidate answer only if a score of the new current candidate answer exceeds a score of a top-k answer in a top-k set. A method of calculating scores for candidate answers is also provided.

7. 发明申请

US20060112090A1 Adaptive processing of top-k queries in nested-structure arbitrary markup language such as XML 有权
标题翻译：在嵌套结构任意标记语言（如XML）中自适应处理top-k查询
公开(公告)号：US20060112090A1
公开(公告)日：2006-05-25
申请号：US11073966
申请日：2005-03-07
申请人： Sihem Amer-Yahia , Nikolaos Koudas , Amelie Marian-Guerrier , Divesh Srivastava
发明人： Sihem Amer-Yahia , Nikolaos Koudas , Amelie Marian-Guerrier , Divesh Srivastava
IPC分类号： G06F17/30
CPC分类号： G06F17/30466 , G06F17/3053 , G06F17/30938
摘要： A method of adaptively evaluating a top-k query involves (1204) forming a servers having respective server queues storing candidate answers, processing (1322) the candidate answers, and (1232) providing a top-k set as a query evaluation. Processing includes (1402) adaptively choosing a winning server to whose queue a current candidate answer should be sent; (1404) sending the current candidate answer to the winning server's queue; (1334) adaptively choosing a next candidate answer to process from the winning server's queue; (1336) computing a join between the current candidate answer and next candidate answers at the winning server, so as to produce a new current candidate answer; and (1338) updating the top-k set with the new current candidate answer only if a score of the new current candidate answer exceeds a score of a top-k answer in a top-k set. A method of calculating scores for candidate answers is also provided.
摘要翻译：自适应地评估top-k查询的方法涉及（1204）形成具有存储候选答案的相应服务器队列的服务器，处理（1322）候选答案，以及（1232）提供top-k集合作为查询评估。处理包括（1402）自适应地选择应该发送当前候选答案的获胜服务器到其队列; （1404）将当前候选答案发送给获胜服务器的队列; （1334）自适应地从获胜服务器的队列中选择下一候选答案进行处理; （1336）计算当前候选答案和获胜服务器上的下一候选答案之间的连接，以产生新的当前候选答案; 以及（1338）如果新的当前候选答案的分数超过顶部k集合中的顶部k个答案的分数，则更新具有新的当前候选答案的顶部k集合。还提供了一种计算候选答案的分数的方法。

8. 发明授权

US08145793B1 System and method for distributed content transformation 有权
标题翻译：分布式内容转换的系统和方法
公开(公告)号：US08145793B1
公开(公告)日：2012-03-27
申请号：US10978549
申请日：2004-11-01
申请人： David Gerald Belanger , Steven Michael Bellovin , Maria F. Fernandez , Robert J. Hall , Charles Robert Kalmanek, Jr. , Kathleen McKenna , Divesh Srivastava
发明人： David Gerald Belanger , Steven Michael Bellovin , Maria F. Fernandez , Robert J. Hall , Charles Robert Kalmanek, Jr. , Kathleen McKenna , Divesh Srivastava
IPC分类号： G06F15/16 , G06F15/173
CPC分类号： H04L67/02 , H04L67/10
摘要： A distributed transformation network provides delivery of content from a content publisher to a content recipient. Content from the content publisher is received at an entry node of the distributed transformation network and transmitted to a transformation node in the distributed transformation network. The content is transformed according to publisher, recipient or network administrator specifications and transmitting to delivery nodes which deliver the transformed content to the content recipient. The published content may be in an XML-based format and transformed into an XML-related format or any other structured language format as desired in the provided specification.
摘要翻译：分布式转换网络提供从内容发布者到内容接收者的内容传递。在分布式变换网络的入口节点处接收来自内容发布者的内容，并将其发送到分布式转换网络中的转换节点。内容根据发布者，收件人或网络管理员规范进行转换，并传送到将转换后的内容传递给内容收件人的传送节点。发布的内容可以是基于XML的格式，并且根据所提供的规范中的需要转换成与XML相关的格式或任何其他结构化语言格式。

9. 发明申请

US20120179840A1 SYSTEM AND METHOD FOR DISTRIBUTED CONTENT TRANSFORMATION 审中-公开
标题翻译：用于分布式内容转换的系统和方法
公开(公告)号：US20120179840A1
公开(公告)日：2012-07-12
申请号：US13429975
申请日：2012-03-26
申请人： David Gerald Belanger , Steven Michael Bellovin , Maria F. Fernandez , Robert J. Hall , Charles Robert Kalmanek, JR. , Divesh Srivastava , Kathleen McKenna
发明人： David Gerald Belanger , Steven Michael Bellovin , Maria F. Fernandez , Robert J. Hall , Charles Robert Kalmanek, JR. , Divesh Srivastava , Kathleen McKenna
IPC分类号： G06F15/16
CPC分类号： H04L67/02 , H04L67/10
摘要： A distributed transformation network provides delivery of content from a content publisher to a content recipient. Content from the content publisher is received at an entry node of the distributed transformation network and transmitted to a transformation node in the distributed transformation network. The content is transformed according to publisher, recipient or network administrator specifications and transmitting to delivery nodes which deliver the transformed content to the content recipient. The published content may be in an XML-based format and transformed into an XML-related format or any other structured language format as desired in the provided specification.
摘要翻译：分布式转换网络提供从内容发布者到内容接收者的内容传递。在分布式变换网络的入口节点处接收来自内容发布者的内容，并将其发送到分布式转换网络中的转换节点。内容根据发布者，收件人或网络管理员规范进行转换，并传送到将转换后的内容传递给内容收件人的传送节点。发布的内容可以是基于XML的格式，并且根据所提供的规范中的需要转换成与XML相关的格式或任何其他结构化语言格式。

10. 发明授权

US08943081B2 User-powered recommendation system 有权
标题翻译：用户推荐系统
公开(公告)号：US08943081B2
公开(公告)日：2015-01-27
申请号：US12616892
申请日：2009-11-12
申请人： Kadangode K. Ramakrishnan , Divesh Srivastava , Tae Won Cho , Yin Zhang
发明人： Kadangode K. Ramakrishnan , Divesh Srivastava , Tae Won Cho , Yin Zhang
IPC分类号： G06F17/30 , G11B27/10 , H04N21/475 , H04N21/466
CPC分类号： G06N7/005 , G06F17/30038 , G06F17/30412 , G06F17/3097 , G11B27/105 , H04N21/4661 , H04N21/4668 , H04N21/4756
摘要： Recommendation systems are widely used in Internet applications. In current recommendation systems, users only play a passive role and have limited control over the recommendation generation process. As a result, there is often considerable mismatch between the recommendations made by these systems and the actual user interests, which are fine-grained and constantly evolving. With a user-powered distributed recommendation architecture, individual users can flexibly define fine-grained communities of interest in a declarative fashion and obtain recommendations accurately tailored to their interests by aggregating opinions of users in such communities. By combining a progressive sampling technique with data perturbation methods, the recommendation system is both scalable and privacy-preserving.
摘要翻译：推荐系统广泛应用于互联网应用。在目前的推荐系统中，用户只能发挥被动的作用，对推荐生成过程的控制有限。因此，这些系统提出的建议和实际用户兴趣之间经常存在很大的不匹配，这些建议是细粒度和不断发展的。通过用户分配的推荐体系结构，个人用户可以灵活地定义精细的社区，并以声明方式定义感兴趣的社区，通过汇总用户在这些社区的意见，获得准确定制的兴趣建议。通过将逐行采样技术与数据扰动方法相结合，推荐系统既可扩展又保密。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式