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

1. 发明授权

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.
摘要翻译：公开了一种系统，方法和计算机可读介质。方法实施例涉及一种计算数据库查询的候选答案的分数的方法。所述方法包括：接收数据库查询，将第一分数分配给所述查询的匹配，所述第一分数基于所述查询中的所有结构和内容谓词，在文档集合中与个别关键字的相对重要性相关联，分配所述第二分数与所述单个文档中的关键字的相对重要性相关联，并且使用所分配的第一分数和第二分数来计算所述查询的答案分数。

2. 发明申请

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集合。还提供了一种计算候选答案的分数的方法。

3. 发明授权

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使用具有嵌套结构文档特定标记的文档上的查询特定索引进行短语匹配处理。

4. 发明授权

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.
摘要翻译：用于对分布式目录执行查询评估的技术利用了定义各种目录服务器之间的分层关系（即，识别与系统中的每个目录服务器相关联的“从属”和“上级”知识引用）的“拓扑缓存”的创建。然后将创建的拓扑缓存存储在每个目录服务器上，并在向系统提交查询时转发给客户端。在客户端使用拓扑缓存信息，可以开发分布式查询评估计划，以便与复杂查询（如分层和聚合查询）一起使用。

5. 发明授权

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.

6. 发明申请

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使用具有嵌套结构文档特定标记的文档上的查询特定索引进行短语匹配处理。

7. 发明授权

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使用具有嵌套结构文档特定标记的文档上的查询特定索引进行短语匹配处理。

8. 发明授权

US08285483B2 Constructing travel itineraries from tagged geo-temporal photographs 有权
标题翻译：从标记的地理时间照片构建旅游行程
公开(公告)号：US08285483B2
公开(公告)日：2012-10-09
申请号：US12708321
申请日：2010-02-18
申请人： Sihem Amer-Yahia , Munmun De Choudhury , Moran Feldman , Nadav Golbandi , Ronny Lempel , Cong Yu
发明人： Sihem Amer-Yahia , Munmun De Choudhury , Moran Feldman , Nadav Golbandi , Ronny Lempel , Cong Yu
IPC分类号： G01C21/00 , G06F19/00
CPC分类号： G01C21/00 , G01C21/343
摘要： One embodiment accesses two or more photos taken by one or more travelers at one or more destinations and one or more points-of-interest located within the destinations; constructs one or more photo streams for each unique traveler-destination combination, wherein each one of the photo streams comprises two or more of the photos taken by the corresponding traveler at the corresponding destination; maps each one of the photos to one of the points-of-interest; constructs one or more timed paths for each unique traveler-destination combination based on the photo streams and the mapping between the photos and the points-of-interest, wherein each one of the timed paths comprises one or more of the points-of-interest located within the corresponding destination and visited by the corresponding travel; and constructs an itinerary based on a start point-of-interest, an end point-of-interest, a time constraint, and the timed paths.
摘要翻译：一个实施例访问位于目的地内的一个或多个目的地和一个或多个兴趣点的一个或多个旅行者拍摄的两张或多张照片; 为每个唯一的旅行者 - 目的地组合构建一个或多个照片流，其中每个照片流包括由相应旅行者在相应目的地拍摄的两张或更多张照片; 将每张照片映射到一个兴趣点; 基于照片流和照片和感兴趣点之间的映射来为每个唯一的旅行者 - 目的地组合构建一个或多个定时路径，其中每个定时路径包括一个或多个兴趣点位于相应目的地内并由相应旅行访问; 并基于起始兴趣点，终点感兴趣，时间约束和定时路径构建行程。

9. 发明申请

US20110179019A1 SYSTEM AND METHOD FOR FINDING UNEXPECTED, BUT RELEVANT CONTENT IN AN INFORMATION RETRIEVAL SYSTEM 有权
标题翻译：发现信息检索系统的系统和方法，但相关内容
公开(公告)号：US20110179019A1
公开(公告)日：2011-07-21
申请号：US12688364
申请日：2010-01-15
申请人： Sihem Amer-Yahia , Sergei Vassilvitskii , Cong Yu
发明人： Sihem Amer-Yahia , Sergei Vassilvitskii , Cong Yu
IPC分类号： G06F17/30
CPC分类号： G06F17/30867
摘要： An improved method for information retrieval in web query and recommendation systems, where items that are likely unfamiliar to the users of the system, but potentially relevant, are recommended. In a recommendation system having ratings by a plurality of users for a plurality of items, items are assigned to one or more data regions based on item attributes or user activity. Source regions are identified for each of the data regions. For a given user, data regions with which both the user and the user's social network are unfamiliar are identified. Within a given data region, the relevance of items to the user within such regions is evaluated using ratings provided by other users who have entered ratings similar to the user in source regions for the data region. Items receiving the highest relevance score are recommended to the user.
摘要翻译：一种改进的Web查询和推荐系统中的信息检索方法，推荐系统用户可能不熟悉的项目。在具有用于多个项目的多个用户的评级的推荐系统中，基于项目属性或用户活动将项目分配给一个或多个数据区域。为每个数据区域识别源区域。对于给定的用户，识别用户和用户的社交网络不熟悉的数据区域。在给定的数据区域内，使用在数据区域的源区域中输入与用户类似的评级的其他用户提供的评级来评估项目对这些区域内的用户的相关性。建议用户接收到最高相关性分数的项目。

10. 发明申请

US20100235317A1 DIVERSIFYING RECOMMENDATION RESULTS THROUGH EXPLANATION 有权
标题翻译：通过解释推动推荐结果
公开(公告)号：US20100235317A1
公开(公告)日：2010-09-16
申请号：US12403140
申请日：2009-03-12
申请人： Cong Yu , Sihem Amer-Yahia , Laks Lakshmanan
发明人： Cong Yu , Sihem Amer-Yahia , Laks Lakshmanan
IPC分类号： G06N5/02 , G06F17/30 , G06F17/10
CPC分类号： G06F17/30864
摘要： Methods and apparatus for making recommendations of content items to users of computer systems include compiling a database relating a list of items and corresponding explanations; receiving from a user, through a computer user interface, a request for a recommendation; extracting from the database a preliminary list of items related to the request; identifying distances between the extracted items based on the explanation corresponding to each item; and identifying a subset of the preliminary list to form a recommendation list having a limited number of recommendation results with a desired balance of both high relevancy and high diversity relative to each other.
摘要翻译：向计算机系统用户提供内容项目建议的方法和装置包括编辑与项目列表和相应说明相关的数据库; 从用户接收通过计算机用户界面的建议请求; 从数据库提取与请求相关的项目的初步列表; 基于与每个项目相对应的说明来识别所提取的项目之间的距离; 以及识别所述初步列表的子集以形成具有有限数量的推荐结果的推荐列表，其具有相对于彼此的高相关性和高分集之间的期望平衡。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式