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

51. 发明授权

US07444326B1 Method of performing approximate substring indexing 有权
标题翻译：执行近似子串索引的方法
公开(公告)号：US07444326B1
公开(公告)日：2008-10-28
申请号：US11314759
申请日：2005-12-21
申请人： Hosagrahar Visvesvaraya Jagadish , Nikolaos Koudas , Shanmugavelayutham Muthukrishnan , Divesh Srivastava
发明人： Hosagrahar Visvesvaraya Jagadish , Nikolaos Koudas , Shanmugavelayutham Muthukrishnan , Divesh Srivastava
IPC分类号： G06F17/30
CPC分类号： G06F17/30637 , Y10S707/99933 , Y10S707/99943
摘要： Approximate substring indexing is accomplished by decomposing each string in a database into overlapping “positional q-grams”, sequences of a predetermined length q, and containing information regarding the “position” of each q-gram within the string (i.e., 1st q-gram, 4th q-gram, etc.). An index is then formed of the tuples of the positional q-gram data (such as, for example, a B-tree index or a hash index). Each query applied to the database is similarly parsed into a plurality of positional q-grams (of the same length), and a candidate set of matches is found. Position-directed filtering is used to remove the candidates which have the q-grams in the wrong order and/or too far apart to form a “verified” output of matching candidates. If errors are permitted (defined in terms of an edit distance between each candidate and the query), an edit distance calculation can then be performed to produce the final set of matching strings.
摘要翻译：通过将数据库中的每个字符串分解为重叠的“位置q-gram”，预定长度q的序列，并且包含关于字符串中每个q-gram的“位置”的信息（即，1 ^{st q-gram，4 nd q-gram等）。然后由位置q-gram数据（例如，B树索引或散列索引）的元组形成索引。应用于数据库的每个查询也被类似地解析为多个位置q-gram（相同长度），并且找到候选的匹配集合。位置定向滤波用于去除具有错误顺序的q-gram和/或相距太远的候选，以形成匹配候选的“验证”输出。如果允许错误（根据每个候选者和查询之间的编辑距离定义），则可以执行编辑距离计算以产生最终匹配的字符串。}

52. 发明申请

US20080140619A1 METHOD AND APPARATUS FOR USING TAG TOPOLOGY 有权
标题翻译：使用标签拓扑学的方法和装置
公开(公告)号：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.
摘要翻译：公开了一种使用标签拓扑来提高搜索能力的方法和装置，例如在网上搜索。例如，本方法从用户接收包含搜索项的用户查询。该方法然后生成包含至少一个实体的搜索结果，其中基于与至少一个实体相关联的多个用户提供的标签来找到至少一个实体。

53. 发明授权

US6167397A Method of clustering electronic documents in response to a search query 失效
公开(公告)号：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.

54. 发明授权

US5999192A Interactive data exploration apparatus and methods 失效
标题翻译：交互式数据挖掘设备和方法
公开(公告)号：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.
摘要翻译：数据探索工具，其具有图形用户界面，其使用有向图来提供数据勘探操作的历史。有向图中的节点表示对数据的操作; 边缘表示操作之间的关系。一种类型的有向图是导出图，其中图的根是表示数据集的节点，从第一节点到第二节点的边缘指示由第二节点表示的操作在由第一节点表示的操作结果。操作包括查询，分段，聚合和数据视图操作。用户可以编辑推导图并且可以选择要执行的节点。当这样做时，根节点和所选节点之间的节点所表示的所有操作如图所示执行。这些操作使用懒惰评估技术和结点与节点的结合来执行。另一类型的有向图是包含图，其中从第一节点到第二节点的边缘指示第二节点处于与第一节点的包含关系中。如果已经计算了由第一节点表示的操作的结果，则结果可用于计算由第二节点表示的操作的结果。

55. 发明授权

US5970489A Method for using region-sets to focus searches in hierarchical structures 失效
公开(公告)号：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.

56. 发明授权

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

57. 发明授权

US08590049B2 Method and apparatus for providing anonymization of data 有权
标题翻译：用于提供数据匿名化的方法和装置
公开(公告)号：US08590049B2
公开(公告)日：2013-11-19
申请号：US12542173
申请日：2009-08-17
申请人： Graham Cormode , Divesh Srivastava , Ting Yu , Qing Zhang
发明人： Graham Cormode , Divesh Srivastava , Ting Yu , Qing Zhang
IPC分类号： G06F17/30
CPC分类号： G06F21/6254
摘要： A method and apparatus for providing an anonymization of data are disclosed. For example, the method receives a request for anonymizing, wherein the request comprises a bipartite graph for a plurality of associations or a table that encodes the plurality of associations for the bipartite graph. The method places each node in the bipartite graph in a safe group and provides an anonymized graph that encodes the plurality of associations of the bipartite graph, if a safe group for all nodes of the bipartite graph is found.
摘要翻译：公开了一种用于提供数据匿名化的方法和装置。例如，该方法接收匿名请求，其中该请求包括用于多个关联的二分图或编码该二分图的多个关联的表。该方法将两部分图中的每个节点放置在安全组中，并提供一个匿名图，编码两部分图的多个关联，如果发现了二分图中所有节点的安全组。

58. 发明授权

US08589443B2 Method and apparatus for providing anonymization of data 有权
标题翻译：用于提供数据匿名化的方法和装置
公开(公告)号：US08589443B2
公开(公告)日：2013-11-19
申请号：US12427448
申请日：2009-04-21
申请人： Graham Cormode , Balachander Krishnamurthy , Divesh Srivastava
发明人： Graham Cormode , Balachander Krishnamurthy , Divesh Srivastava
IPC分类号： G06F7/00
CPC分类号： G06Q10/10 , G06F21/6254 , G06Q30/02 , G06Q50/01
摘要： A method and apparatus for providing an anonymization of data are disclosed. For example, the method receives a communications graph that encodes a plurality of types of interactions between two or more entities. The method partitions the two or more entities into a plurality of classes, and applies a type of anonymization to the communications graph.
摘要翻译：公开了一种用于提供数据匿名化的方法和装置。例如，该方法接收对两个或多个实体之间的多种类型的交互进行编码的通信图。该方法将两个或多个实体分成多个类，并将一种匿名类型应用于通信图。

59. 发明申请

US20130145473A1 METHODS AND APPARATUS TO ANONYMIZE A DATASET OF SPATIAL DATA 有权
标题翻译：分析空间数据数据的方法和装置
公开(公告)号：US20130145473A1
公开(公告)日：2013-06-06
申请号：US13311388
申请日：2011-12-05
申请人： Graham R. Cormode , Cecilia M. Procopiuc , Divesh Srivastava , Entong Shen
发明人： Graham R. Cormode , Cecilia M. Procopiuc , Divesh Srivastava , Entong Shen
IPC分类号： G06F17/30 , G06F21/24
CPC分类号： G06F21/10 , G06F21/6254 , G06F21/72 , G06F2221/2111 , G06F2221/2145 , G11B20/00086
摘要： Methods and apparatus are disclosed to anonymize a dataset of spatial data. An example method includes generating a spatial indexing structure with spatial data, establishing a height value associated with the spatial indexing structure to generate a plurality of tree nodes, each of the plurality of tree nodes associated with spatial data counts, calculating a localized noise budget value for respective ones of the tree nodes based on the height value and an overall noise budget, and anonymizing the plurality of tree nodes with a anonymization process, the anonymization process using the localized noise budget value for respective ones of the tree nodes.
摘要翻译：公开了匿名化空间数据的数据集的方法和装置。示例性方法包括：利用空间数据生成空间索引结构，建立与空间索引结构相关联的高度值，以生成多个树节点，多个树节点中的每一个与空间数据计数相关联，计算局部噪声预算值基于所述高度值和总体噪声预算对所述树节点中的相应树节点进行匿名处理，以及使用所述树节点中的相应树节点的所述局部噪声预算值对所述多个树节点进行匿名化。

60. 发明申请

US20130138480A1 Method and apparatus for exploring and selecting data sources 审中-公开
标题翻译：探索和选择数据源的方法和设备
公开(公告)号：US20130138480A1
公开(公告)日：2013-05-30
申请号：US13373791
申请日：2011-11-30
申请人： Xin Luna Dong , Divesh Srivastava
发明人： Xin Luna Dong , Divesh Srivastava
IPC分类号： G06Q40/00 , G06Q10/00 , G06F17/30
CPC分类号： G06Q10/10
摘要： A system and method for choosing data sources for use in a data repository first chooses an initial selection of data sources based on keywords. An exploration tool is provided to organize the sources according to content and other attributes. The tool is used to pre-select data sources. The sources to include in the data repository are then selected based on a marginalism economic theory that considers both costs and quality of data.
摘要翻译：用于选择在数据存储库中使用的数据源的系统和方法首先基于关键字选择数据源的初始选择。提供探索工具，根据内容和其他属性组织资源。该工具用于预先选择数据源。然后根据考虑成本和数据质量的边际主义经济理论来选择数据库中包含的来源。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式