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

61. 发明申请

US20120078927A1 LARGE GRAPH MEASUREMENT 有权
标题翻译：大图测量
公开(公告)号：US20120078927A1
公开(公告)日：2012-03-29
申请号：US13314555
申请日：2011-12-08
申请人： Sreenivas Gollapudi
发明人： Sreenivas Gollapudi
IPC分类号： G06F17/30
CPC分类号： G06F17/30876 , G06F17/30873
摘要： As provided herein, a pairwise distance between nodes in a large graph can be determined efficiently. URL-sketches are generated for respective nodes in an index by extracting labels from respective nodes, which provide a reference to a link between the nodes, aggregating the labels into sets for respective nodes, and storing the sets of labels as URL-sketches. Neighborhood-sketches are generated for the respective nodes in the index using the URL-sketches, by determining a neighborhood for a node and generating a sketch using labels that are associated with the respective neighboring nodes. A distance between two nodes is determined by computing an approximate number of paths and an approximate path length between the two nodes, using the neighborhood sketches for the two nodes.
摘要翻译：如本文所提供的，可以有效地确定大图中的节点之间的成对距离。通过从相应节点提取标签，提供对节点之间的链接的引用，将标签聚集到各个节点的集合中，并将标签集合存储为URL草图，从而为索引中的相应节点生成URL草图。通过使用URL草图，通过确定节点的邻域并使用与各个相邻节点相关联的标签生成草图来为索引中的相应节点生成邻域草图。通过使用两个节点的邻域草图计算两个节点之间的近似路径数和两个节点之间的近似路径长度来确定两个节点之间的距离。

62. 发明申请

US20110314012A1 DETERMINING QUERY INTENT 有权
标题翻译：确定查询内容
公开(公告)号：US20110314012A1
公开(公告)日：2011-12-22
申请号：US12816389
申请日：2010-06-16
申请人： Krishnaram N. G. Kenthapadi , Panayiotis Tsaparas , Sreenivas Gollapudi , Rakesh Agrawal
发明人： Krishnaram N. G. Kenthapadi , Panayiotis Tsaparas , Sreenivas Gollapudi , Rakesh Agrawal
IPC分类号： G06F17/30
CPC分类号： G06F17/30979
摘要： A tree structure has a node associated with each category of a hierarchy of item categories. Child nodes of the tree are associated with sub-categories of the categories associated with parent nodes. Training data including received queries and indicators of a selected item category for each received query is combined with the tree structure by associating each query with the node corresponding to the selected category of the query. When a query is received, a classifier is applied to the nodes to generate a probability that the query is intended to match an item of the category associated with the node. The classifier is applied until the probability is below a threshold. One or more categories associated with the nodes that are closest to the intent of the received query are selected and indicators of items of those categories that match the received query are output.
摘要翻译：树结构具有与项目类别的层次结构的每个类别相关联的节点。树的子节点与与父节点相关联的类别的子类别相关联。通过将每个查询与对应于所选择的查询类别的节点相关联，将包括接收到的查询和针对每个接收到的查询的所选项目类别的指示符的训练数据与树结构组合。当接收到查询时，分类器被应用于节点以产生查询旨在匹配与节点相关联的类别的项目的概率。应用分类器直到概率低于阈值。选择与接收到的查询的意图最接近的节点相关联的一个或多个类别，并输出与接收到的查询匹配的那些类别的项目的指示符。

63. 发明授权

US08073832B2 Estimating rank on graph streams 有权
标题翻译：估计图流的排名
公开(公告)号：US08073832B2
公开(公告)日：2011-12-06
申请号：US12434691
申请日：2009-05-04
申请人： Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
发明人： Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
IPC分类号： G06F17/30
CPC分类号： G06F17/30958
摘要： The rank of nodes in a graph may be inferred from a calculated probability that each node in the graph appears in a single random walk of the graph. Short random walks may be generated for each node in the graph. The generated random walks may be combined to form a longer single random walk. Multiple single random walks may be generated in this fashion. The probability of each node appearing in a single random may be calculated from the generated single random walks. The rank of each node may then be inferred from the calculated probabilities.
摘要翻译：图中节点的等级可以从图中的每个节点出现在图的单个随机游走中的计算概率推断。可以为图中的每个节点生成短随机散步。所产生的随机散步可以组合以形成更长的单次随机游走。可以以这种方式产生多个单个随机散步。可以从生成的单个随机游走中计算每个节点出现在单个随机中的概率。然后可以从计算的概率推断每个节点的等级。

64. 发明申请

US20110264639A1 LEARNING DIVERSE RANKINGS OVER DOCUMENT COLLECTIONS 审中-公开
标题翻译：学习文档集合中的多样性排名
公开(公告)号：US20110264639A1
公开(公告)日：2011-10-27
申请号：US12764112
申请日：2010-04-21
申请人： Aleksandrs Slivkins , Sreenivas Gollapudi , Filip Radlinski
发明人： Aleksandrs Slivkins , Sreenivas Gollapudi , Filip Radlinski
IPC分类号： G06F17/30
CPC分类号： G06F16/9535
摘要： A document selector selects and ranks documents that are relevant to a query. The document selector executes an instance of a multi-armed bandits algorithm to select a document for each slot of a results page according to one or more strategies. The documents are selected in an order defined by the results page and documents selected for previous slots are used to guide the selection of a document for a current slot. If a document in a slot is subsequently selected, the strategy used to select the document is rewarded with positive feedback. When the uncertainty in an estimate of the utility of a strategy is less than the variation between documents associated with the strategy, the strategy is subdivided into multiple strategies. The document selector is able to “zoom in” on effective strategies and provide more relevant search results.
摘要翻译：文档选择器选择和排序与查询相关的文档。文档选择器执行多武装强盗算法的实例，以根据一个或多个策略为结果页面的每个时隙选择文档。文档按照结果页面定义的顺序进行选择，为先前的插槽选择的文档用于指导当前插槽文档的选择。如果随后选择了插槽中的文档，则用于选择文档的策略将获得积极的反馈。当战略效用估计的不确定性低于与战略相关的文件之间的变化时，该策略被细分为多种策略。文档选择器能够“放大”有效策略并提供更相关的搜索结果。

65. 发明授权

US07743333B2 Suspending a result set and continuing from a suspended result set for scrollable cursors 有权
标题翻译：暂停结果集并从可滚动光标的挂起结果集继续
公开(公告)号：US07743333B2
公开(公告)日：2010-06-22
申请号：US11097065
申请日：2005-04-01
申请人： Mehul D. Bastawala , Lakshminarayanan Chidambaran , Sreenivas Gollapudi , Sanjay Kaluskar , Srinath Krishnaswamy , Debashish Chatterjee
发明人： Mehul D. Bastawala , Lakshminarayanan Chidambaran , Sreenivas Gollapudi , Sanjay Kaluskar , Srinath Krishnaswamy , Debashish Chatterjee
IPC分类号： G06F3/00
CPC分类号： G06F17/30457
摘要： A system, method, computer program and system for suspending a result set and continuing from a suspended result set for a scrollable cursor is disclosed. The rows from a row source corresponding to the scrollable cursor result set are suspended into storage so that when a fetch is requested the data can be sent (continued) from the suspended storage and does not depend on the original scrollable cursor row source or session to be available.
摘要翻译：公开了一种用于暂停结果集并从用于可滚动游标的暂停结果集继续的系统，方法，计算机程序和系统。来自与可滚动光标结果集相对应的行源的行被暂停到存储器中，使得当请求提取时，可以从挂起的存储器发送（继续）数据，并且不依赖于原始可滚动光标行源或会话能得到的。

66. 发明授权

US07613710B2 Suspending a result set and continuing from a suspended result set 有权
标题翻译：暂停结果集并从暂停的结果集继续
公开(公告)号：US07613710B2
公开(公告)日：2009-11-03
申请号：US11097422
申请日：2005-04-01
申请人： Mehul D. Bastawala , Lakshminarayanan Chidambaran , Sreenivas Gollapudi , Sanjay Kaluskar , Srinath Krishnaswamy , Debashish Chatterjee
发明人： Mehul D. Bastawala , Lakshminarayanan Chidambaran , Sreenivas Gollapudi , Sanjay Kaluskar , Srinath Krishnaswamy , Debashish Chatterjee
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30501 , G06F17/3041
摘要： A system, method, computer program and system for suspending a result set and continuing from a suspended result set for a cursor is disclosed. The rows from a row source corresponding to the cursor result set are suspended into storage so that when a fetch is requested the data can be sent (continued) from the suspended storage and does not depend on the original cursor row source or session to be available.
摘要翻译：公开了一种系统，方法，计算机程序和系统，用于暂停结果集并从停止的游标结果集继续。来自与光标结果集相对应的行源的行被暂停到存储器中，使得当请求提取时，可以从挂起的存储器发送（继续）数据，并且不依赖于原始光标行源或会话可用。

67. 发明授权

US07580971B1 Method and apparatus for efficient SQL processing in an n-tier architecture 有权
标题翻译：用于在n层体系结构中进行有效的SQL处理的方法和装置
公开(公告)号：US07580971B1
公开(公告)日：2009-08-25
申请号：US09953490
申请日：2001-09-10
申请人： Sreenivas Gollapudi , Debashis Saha , Anindo Roy , Lakshminarayanan Chidambaran , Debashish Chatterjee
发明人： Sreenivas Gollapudi , Debashis Saha , Anindo Roy , Lakshminarayanan Chidambaran , Debashish Chatterjee
IPC分类号： G06F15/16
CPC分类号： G06F17/30474 , G06F17/3048 , H04L67/1097
摘要： A method and apparatus for efficiently processing data requests in a network oriented n-tier database environment is presented. According to one embodiment of the invention, certain or all data from the tables of a database server device can be maintained in tables on the client device in a client side database cache server system. This local cache allows the network oriented n-tier database system to eliminate the expense of repetitive network transmissions to respond to duplicate queries for the same information. Additionally, the local client device may also keep track of what data is cached on peer network nodes. This allows the client to request that data from a peer database cache server and off load that burden from the database server device. Moreover, the local client may also keep statistics regarding the frequency of requested data in order to optimize the data set maintained in the local database cache server.
摘要翻译：提出了一种在面向网络的n层数据库环境中有效处理数据请求的方法和装置。根据本发明的一个实施例，来自数据库服务器设备的表的某些或所有数据可以在客户机侧数据库高速缓存服务器系统中的客户端设备的表中维护。该本地缓存允许面向网络的n层数据库系统消除重复网络传输的费用，以响应相同信息的重复查询。此外，本地客户端设备还可以跟踪在对等网络节点上高速缓存哪些数据。这允许客户端从对等数据库缓存服务器请求数据，并从数据库服务器设备卸载负担。此外，本地客户端还可以保持关于所请求数据的频率的统计信息，以便优化本地数据库缓存服务器中维护的数据集。

68. 发明申请

US20090157644A1 EXTRACTING SIMILAR ENTITIES FROM LISTS / TABLES 有权
标题翻译：从列表/表提取类似实体
公开(公告)号：US20090157644A1
公开(公告)日：2009-06-18
申请号：US11954218
申请日：2007-12-12
申请人： Sreenivas Gollapudi , Alan Halverson
发明人： Sreenivas Gollapudi , Alan Halverson
IPC分类号： G06F7/06
CPC分类号： G06F17/30663
摘要： Large numbers of lists of entities may be mined for similar entities to related searches. A representation for each list may be determined to provide for a comparison between lists and to support membership checks. A score for an element in a list may be computed that represents the validity of an item in the corpus of lists. Thus, a spurious element would receive a very low score, where a valid element would receive a higher score. A list weight is then computed using the constituent element weights, and the element and list weight are used to compute the nearest neighbors of a given query element.
摘要翻译：大量的实体清单可以被开采用于相关实体进行相关搜索。可以确定每个列表的表示以提供列表之间的比较并且支持成员资格检查。可以计算列表中的元素的分数，其表示列表语料库中的项目的有效性。因此，假元素将获得非常低的分数，其中有效元素将获得更高的分数。然后使用组成元素权重计算列表权重，并使用元素和列表权重来计算给定查询元素的最近邻居。

69. 发明授权

US07502824B2 Database shutdown with session migration 有权
标题翻译：数据库关闭与会话迁移
公开(公告)号：US07502824B2
公开(公告)日：2009-03-10
申请号：US11415557
申请日：2006-05-01
申请人： Sanjay Kaluskar , Dmitry Frumkin , Sreenivas Gollapudi , Srinath Krishnaswamy
发明人： Sanjay Kaluskar , Dmitry Frumkin , Sreenivas Gollapudi , Srinath Krishnaswamy
IPC分类号： G06F15/16 , G06F12/00
CPC分类号： G06F17/30289
摘要： When a request for a shutdown of a server (e.g. database server) is requested, existing sessions established for the clients are migrated to another server. Some sessions may not be migrated for various reasons; these sessions may be terminated without migrating them.
摘要翻译：当请求关闭服务器（例如数据库服务器）时，为客户端建立的现有会话被迁移到另一个服务器。由于各种原因，某些会话可能无法迁移; 这些会话可能会被终止而不迁移它们。

70. 发明授权

US07433869B2 Method and apparatus for document clustering and document sketching 有权
标题翻译：用于文档聚类和文档素描的方法和装置
公开(公告)号：US07433869B2
公开(公告)日：2008-10-07
申请号：US11427781
申请日：2006-06-29
申请人： Sreenivas Gollapudi
发明人： Sreenivas Gollapudi
IPC分类号： G06F17/30
CPC分类号： G06F17/30616 , G06F17/3071 , Y10S707/99933 , Y10S707/99935 , Y10S707/99942 , Y10S707/99943
摘要： A first embodiment of the invention provides a system that automatically classifies documents in a collection into clusters based on the similarities between documents, that automatically classifies new documents into the right clusters, and that may change the number or parameters of clusters under various circumstances. A second embodiment of the invention provides a technique for comparing two documents, in which a fingerprint or sketch of each document is computed. In particular, this embodiment of the invention uses a specific algorithm to compute the document's fingerprint, One embodiment uses a sentence in the document as a logical delimiter or window from which significant words are extracted and, thereafter, a hash is computed of all pair-wise permutations. Words are extracted based on their weight in the document, which can be computed using measures such as term frequency and the inverse document frequency.
摘要翻译：本发明的第一实施例提供了一种系统，其基于文档之间的相似性自动地将集合中的文档分类成簇，该文档将新文档自动分类到正确的集群中，并且可以在各种情况下改变集群的数量或参数。本发明的第二实施例提供了一种用于比较两个文档的技术，其中计算每个文档的指纹或草图。特别地，本发明的该实施例使用特定的算法来计算文档的指纹。一个实施例将文档中的句子用作提取有效字的逻辑定界符或窗口，此后，计算所有对 - 明智的排列。根据文档中的权重提取单词，可以使用诸如术语频率和逆文档频率等度量来计算单词。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式