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

1. 发明申请

US20110184969A1 TECHNIQUES FOR FAST AND SCALABLE XML GENERATION AND AGGREGATION OVER BINARY XML 有权
标题翻译：用于二进制XML的快速和可扩展的XML生成和聚合的技术
公开(公告)号：US20110184969A1
公开(公告)日：2011-07-28
申请号：US12692549
申请日：2010-01-22
申请人： Sam Idicula , Sandeep Mane , Bhushan Khaladkar , Nipun Agarwal
发明人： Sam Idicula , Sandeep Mane , Bhushan Khaladkar , Nipun Agarwal
IPC分类号： G06F17/30
CPC分类号： G06F17/30938
摘要： Techniques for fast and scalable generation and aggregation of XML data are described. In an example embodiment, an XML query that requests data from XML documents is received. The XML query is evaluated to determine one or more XML results. For each particular XML result, evaluating the XML query comprises: instantiating a particular data structure that represents the particular XML result, where the particular data structure is encoded in accordance with tags specified in the XML query but does not store the tags; and storing, in the particular data structure, one or more locators that respectively point to one or more fragments in the XML documents, where the particular data structure stores the one or more locators but does not store the one or more fragments. On demand, in response to a request indicating the particular XML result, a serialized representation of the particular XML result is generated based at least on the particular data structure.
摘要翻译：描述了用于快速和可扩展的XML数据生成和聚合的技术。在示例实施例中，接收从XML文档请求数据的XML查询。评估XML查询以确定一个或多个XML结果。对于每个特定的XML结果，评估XML查询包括：实例化表示特定XML结果的特定数据结构，其中特定数据结构根据XML查询中指定的标签进行编码，但不存储标签; 以及在所述特定数据结构中存储分别指向所述XML文档中的一个或多个片段的一个或多个定位符，其中所述特定数据结构存储所述一个或多个定位符，但不存储所述一个或多个片段。根据需要，响应于指示特定XML结果的请求，至少基于特定数据结构生成特定XML结果的序列化表示。

2. 发明授权

US08417714B2 Techniques for fast and scalable XML generation and aggregation over binary XML 有权
标题翻译：用于通过二进制XML实现快速可扩展的XML生成和聚合的技术
公开(公告)号：US08417714B2
公开(公告)日：2013-04-09
申请号：US12692549
申请日：2010-01-22
申请人： Sam Idicula , Sandeep Mane , Bhushan Khaladkar , Nipun Agarwal
发明人： Sam Idicula , Sandeep Mane , Bhushan Khaladkar , Nipun Agarwal
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30938
摘要： Techniques for fast and scalable generation and aggregation of XML data are described. In an example embodiment, an XML query that requests data from XML documents is received. The XML query is evaluated to determine one or more XML results. For each particular XML result, evaluating the XML query comprises: instantiating a particular data structure that represents the particular XML result, where the particular data structure is encoded in accordance with tags specified in the XML query but does not store the tags; and storing, in the particular data structure, one or more locators that respectively point to one or more fragments in the XML documents, where the particular data structure stores the one or more locators but does not store the one or more fragments. On demand, in response to a request indicating the particular XML result, a serialized representation of the particular XML result is generated based at least on the particular data structure.
摘要翻译：描述了用于快速和可扩展的XML数据生成和聚合的技术。在示例实施例中，接收从XML文档请求数据的XML查询。评估XML查询以确定一个或多个XML结果。对于每个特定的XML结果，评估XML查询包括：实例化表示特定XML结果的特定数据结构，其中特定数据结构根据XML查询中指定的标签进行编码，但不存储标签; 以及在所述特定数据结构中存储分别指向所述XML文档中的一个或多个片段的一个或多个定位符，其中所述特定数据结构存储所述一个或多个定位符，但不存储所述一个或多个片段。根据需要，响应于指示特定XML结果的请求，至少基于特定数据结构生成特定XML结果的序列化表示。

3. 发明申请

US20080033932A1 CONCEPT-AWARE RANKING OF ELECTRONIC DOCUMENTS WITHIN A COMPUTER NETWORK 审中-公开
标题翻译：电脑网络中电子文件的概念排名
公开(公告)号：US20080033932A1
公开(公告)日：2008-02-07
申请号：US11769509
申请日：2007-06-27
申请人： Colin DeLong , Sandeep Mane , Jaideep Srivastava
发明人： Colin DeLong , Sandeep Mane , Jaideep Srivastava
IPC分类号： G06F17/30
CPC分类号： G06F16/951
摘要： Techniques are described for ranking the relevance of electronic documents, such as web pages. An algorithm extracts keywords and recurring phrases from the anchor tag data in electronic documents to define a set of concepts. The algorithm then uses link, concept pairs to create nodes in a graph. In this graph, edges can represent both explicit and implicit conceptual links between nodes. By including conceptual data, the algorithm may model and utilize inter-concept relationships when using graph ranking algorithms. This may improve result accuracy by not only retrieving links which are more authoritative given a users' context, but also by utilizing a larger pool of web pages that are limited by concept-space, rather than keyword-space.
摘要翻译：描述了用于对电子文档（例如网页）的相关性进行排名的技术。一种算法从电子文档中的锚标签数据中提取关键字和重复的短语，以定义一组概念。然后，该算法使用链接，概念对在图中创建节点。在该图中，边缘可以表示节点之间的显式和隐式概念链接。通过包含概念数据，当使用图表排序算法时，算法可以建模和利用概念间关系。这可以通过不仅检索给予用户上下文更权威的链接，而且通过利用由概念空间而不是关键字空间限制的更大的网页池来提高结果准确性。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式