公开(公告)号：US20090287721A1

公开(公告)日：2009-11-19

申请号：US12380858

申请日：2009-03-03

申请人： Lukasz Golab ,  Howard Karloff ,  Philip Korn ,  Divesh Srivastava ,  Bei Yu

发明人： Lukasz Golab ,  Howard Karloff ,  Philip Korn ,  Divesh Srivastava ,  Bei Yu

IPC分类号： G06F17/30

CPC分类号： G06F17/30604

摘要： Techniques are disclosed for generating conditional functional dependency (CFD) pattern tableaux having the desirable properties of support, confidence and parsimony. These techniques include both a greedy algorithm for generating a tableau and, for large data sets, an “on-demand” algorithm that outperforms the basic greedy algorithm in running time by an order of magnitude. In addition, a range tableau, as a generalization of a pattern tableau, can achieve even more parsimony.

摘要翻译： 公开了用于产生具有所需性质的支持，置信和简约的条件功能依赖（CFD）模式表的技术。 这些技术既包括用于生成表格的贪心算法，又包括用于大数据集的“按需”算法，其在运行时间上超过基本贪心算法一个数量级。 另外，作为模式表格的泛化，范围表可以实现更加简单。

公开(公告)号：US07523091B2

公开(公告)日：2009-04-21

申请号：US11108940

申请日：2005-04-19

申请人： Olga Kapitskaia ,  Raymond Ng ,  Divesh Srivastava

发明人： Olga Kapitskaia ,  Raymond Ng ,  Divesh Srivastava

IPC分类号： G06F17/30

CPC分类号： G06F17/30457 ,  G06F17/3048 ,  H04L29/06 ,  H04L61/1517 ,  H04L61/1523 ,  H04L67/2852 ,  H04L67/289 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99935 ,  Y10S707/99939 ,  Y10S707/99953

摘要： The present invention discloses the use of generalized queries, referred to as query templates, obtained by generalizing individual user queries, as the semantic basis for low overhead, high benefit directory caches for handling declarative queries. Caching effectiveness can be improved by maintaining a set of generalizations of queries and admitting such generalizations into the cache when their estimated benefits are sufficiently high. In a preferred embodiment of the invention, the admission of query templates into the cache can be done in what is referred to by the inventors as a “revolutionary” fashion—followed by stable periods where cache admission and replacement can be done incrementally in an evolutionary fashion. The present invention can lead to considerably higher hit rates and lower server-side execution and communication costs than conventional caching of directory queries—while keeping the clientside computational overheads comparable to query caching.

摘要翻译： 本发明公开了通过将各个用户查询概括化而获得的通用查询（称为查询模板）作为用于处理声明式查询的低开销，高效益目录高速缓存的语义基础。 可以通过维护一组查询的概括来将高速缓存的有效性提高，并且当它们的估计收益足够高时，将这种泛化允许缓存。 在本发明的优选实施例中，将查询模板准许到高速缓存中可以在本发明人被称为“革命性”方式的情况下完成 - 其次是稳定的时期，其中缓存允许和替换可以在进化中逐步地完成 时尚。 与传统的目录查询缓存相比，本发明可以导致相当高的命中率和较低的服务器端执行和通信成本，同时保持客户端计算开销与查询缓存相当。

公开(公告)号：US20090063681A1

公开(公告)日：2009-03-05

申请号：US11848031

申请日：2007-08-30

申请人： Kadangode Ramakrishnan ,  Samrat Bhattacharjee ,  Tae Won Cho ,  Vijay Gopalakrishnan ,  Rittwik Jana ,  Divesh Srivastava

发明人： Kadangode Ramakrishnan ,  Samrat Bhattacharjee ,  Tae Won Cho ,  Vijay Gopalakrishnan ,  Rittwik Jana ,  Divesh Srivastava

IPC分类号： G06F15/173

CPC分类号： H04L67/104 ,  H04L65/4084 ,  H04L67/108 ,  H04L67/1091 ,  H04N7/17318 ,  H04N21/26616 ,  H04N21/632

摘要： A method of providing content comprises making the content available on a central server, and surveying a plurality of peers for a portion of the content. The portion of the content from one of the peers is obtained when the portion of the content is available from the one of the peers, and obtained from the central server when the portion of the content is not available from the plurality of peers.

摘要翻译： 提供内容的方法包括使内容在中央服务器上可用，以及对一部分内容的多个对等体进行测量。 当内容的一部分从对等体中的一个可用时获得来自一个对等体的内容的部分，并且当内容的部分不能从多个对等体获得时从中央服务器获得。

公开(公告)号：US07451214B1

公开(公告)日：2008-11-11

申请号：US11589016

申请日：2006-10-27

申请人： Charles D. Cranor ,  Theodore Johnson ,  Oliver Spatscheck ,  Divesh Srivastava

发明人： Charles D. Cranor ,  Theodore Johnson ,  Oliver Spatscheck ,  Divesh Srivastava

IPC分类号： G06F15/173

CPC分类号： H04L43/00 ,  H04L43/106

摘要： A method and system for monitoring traffic in a data communication network and for extracting useful statistics and information is disclosed. In accordance with an embodiment of the invention, a network interface card has a run-time system and one or more processing blocks executing on the network interface. The run-time system module feeds information derived from a network packet to the processing modules which process the information and generate output such as condensed statistics about the packets traveling through the network.

摘要翻译： 公开了一种用于监视数据通信网络中的业务并提取有用统计信息的方法和系统。 根据本发明的实施例，网络接口卡具有运行时系统和在网络接口上执行的一个或多个处理块。 运行时系统模块将从网络数据包导出的信息提供给处理信息的处理模块，并生成关于通过网络传播的数据包的统计信息的输出。

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

公开(公告)号：US20080140619A1

公开(公告)日：2008-06-12

申请号：US11608142

申请日：2006-12-07

申请人： Divesh Srivastava ,  Suresh Venkatasubramanian

发明人： Divesh Srivastava ,  Suresh Venkatasubramanian

IPC分类号： G06F17/30

CPC分类号： G06F17/30861 ,  G06F17/30283 ,  G06F17/30864 ,  G06F17/30882 ,  G06F17/30997

摘要： A method and apparatus for using tag topology for enhancing search capabilities, e.g., searching over the web, are disclosed. For example, the present method receives a user query contain a search term from a user. The method then generates a search result containing at least one entity, wherein the at least one entity is found based on a plurality of user provided tags that is associated with the at least one entity.

摘要翻译： 公开了一种使用标签拓扑来提高搜索能力的方法和装置，例如在网上搜索。 例如，本方法从用户接收包含搜索项的用户查询。 该方法然后生成包含至少一个实体的搜索结果，其中基于与至少一个实体相关联的多个用户提供的标签来找到至少一个实体。

公开(公告)号：US6167397A

公开(公告)日：2000-12-26

申请号：US935827

申请日：1997-09-23

申请人： Guy Jacobson ,  Balachander Krishnamurthy ,  Divesh Srivastava

发明人： Guy Jacobson ,  Balachander Krishnamurthy ,  Divesh Srivastava

IPC分类号： G06F17/30

CPC分类号： G06F17/3071 ,  Y10S707/99935

摘要： A method of presenting clusters of documents in response to a search query where the documents within a cluster are determined to be related to one another. This relationship is assessed by comparing documents which match one or more terms in the query to determine the extent to which the documents have commonality with respect to terms appearing infrequently in the collection of documents. As a consequence, the cluster of documents represents a response or query result that is split across multiple documents. In a further variation the cluster can be constituted by a structured document and an unstructured document.

公开(公告)号：US5999192A

公开(公告)日：1999-12-07

申请号：US640411

申请日：1996-04-30

申请人： Peter Gilman Selfridge ,  Divesh Srivastava

发明人： Peter Gilman Selfridge ,  Divesh Srivastava

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

CPC分类号： G06F17/30572

摘要： A data exploration tool which has a graphical user interface that employs directed graphs to provide histories of the data exploration operations. Nodes in the directed graphs represent operations on data; the edges represent relationships between the operations. One type of the directed graphs is the derivation graph, in which the root of the graph is a node representing a data set and an edge leading from a first node to a second node indicates that the operation represented by the second node is performed on the result of the operation represented by the first node. Operations include query, segmentation, aggregation, and data view operations. A user may edit the derivation graph and may select a node for execution. When that is done, all of the operations represented by the nodes between the root node and the selected node are performed as indicated in the graph. The operations are performed using techniques of lazy evaluation and encachement of results with the nodes. Another type of the directed graphs is the subsumption graph, in which an edge leading from a first node to a second node indicates that the second node stands in a subsumption relationship to the first node. If a result of the operation represented by the first node has been computed, the result is available to calculate the result of the operation represented by the second node.

摘要翻译： 数据探索工具，其具有图形用户界面，其使用有向图来提供数据勘探操作的历史。 有向图中的节点表示对数据的操作; 边缘表示操作之间的关系。 一种类型的有向图是导出图，其中图的根是表示数据集的节点，从第一节点到第二节点的边缘指示由第二节点表示的操作在 由第一节点表示的操作结果。 操作包括查询，分段，聚合和数据视图操作。 用户可以编辑推导图并且可以选择要执行的节点。 当这样做时，根节点和所选节点之间的节点所表示的所有操作如图所示执行。 这些操作使用懒惰评估技术和结点与节点的结合来执行。 另一类型的有向图是包含图，其中从第一节点到第二节点的边缘指示第二节点处于与第一节点的包含关系中。 如果已经计算了由第一节点表示的操作的结果，则结果可用于计算由第二节点表示的操作的结果。

公开(公告)号：US5970489A

公开(公告)日：1999-10-19

申请号：US879500

申请日：1997-05-20

申请人： Guy Jacobson ,  Balachander Krishnamurthy ,  Divesh Srivastava ,  Dan Suciu

发明人： Guy Jacobson ,  Balachander Krishnamurthy ,  Divesh Srivastava ,  Dan Suciu

IPC分类号： G06F17/30

CPC分类号： G06F17/30864 ,  Y10S707/99933 ,  Y10S707/99939

摘要： A method improves a search in a hierarchical structure by focusing the search to selected regions within the structure. The method defines one or more region-sets and uses the region-set(s) as either a filter for the results of a key-word search or an integrated part of a search engine to increase the efficiency of the search engine. The method also provides for dynamic creation of new region-sets from existing region-sets using a prescribed set of operators.

公开(公告)号：US09348891B2

公开(公告)日：2016-05-24

申请号：US13311034

申请日：2011-12-05

申请人： Divesh Srivastava ,  Xin Dong ,  Xuan Liu

发明人： Divesh Srivastava ,  Xin Dong ,  Xuan Liu

IPC分类号： G06F17/30

CPC分类号： G06F17/30634

摘要： An online data fusion system receives a query, probes a first source for an answer to the query, returns the answer from the first source, refreshes the answer while probing an additional source, and applies fusion techniques on data associated with an answer that is retrieved from the additional source. For each retrieved answer, the online data fusion system computes the probability that the answer is correct and stops retrieving data for the answer after gaining enough confidence that data retrieved from the unprocessed sources are unlikely to change the answer. The online data fusion system returns correct answers and terminates probing additional sources in an expeditious manner without sacrificing the quality of the answers.

摘要翻译： 在线数据融合系统接收查询，探索第一个来源以获得查询的答案，从第一个源返回答案，在探索附加的源时刷新答案，并对与检索到的答案相关联的数据应用融合技术 从额外的来源。 对于每个检索到的答案，在线数据融合系统计算出答案正确的概率，并且在获得足够的信心从而从未处理的源中检索的数据不太可能改变答案之后，停止检索答案数据。 在线数据融合系统返回正确的答案，并以迅速的方式终止探测附加来源，而不牺牲答案的质量。