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

31. 发明授权

US08825805B2 Method and mechanism for reducing client-side memory footprint of transmitted data 有权
标题翻译：减少传输数据的客户端内存占用的方法和机制
公开(公告)号：US08825805B2
公开(公告)日：2014-09-02
申请号：US11411247
申请日：2006-04-25
申请人： Sreenivas Gollapudi , Debashish Chatterjee
发明人： Sreenivas Gollapudi , Debashish Chatterjee
IPC分类号： G06F15/16
CPC分类号： G06F17/30156 , G06F17/30595 , G06F17/30902 , H04L67/2828 , H04L67/42 , H04L69/04
摘要： The present invention is directed to a method and mechanism for reducing the expense of data transmissions between a client and a server. According to an aspect of data prefetching is utilized to predictably retrieve information between the client and server. Another aspect pertains to data redundancy management for reducing the expense of transmitting and storing redundant data between the client and server. Another aspect relates to moved data structures for tracking and managing data at a client in conjunction with data redundancy management.
摘要翻译：本发明涉及一种减少客户端与服务器之间的数据传输费用的方法和机制。根据数据预取的一个方面用于可预测地在客户端和服务器之间检索信息。另一方面涉及数据冗余管理，以减少在客户端和服务器之间传输和存储冗余数据的费用。另一方面涉及移动的数据结构，用于跟踪和管理客户端的数据并结合数据冗余管理。

32. 发明授权

US08666920B2 Estimating shortest distances in graphs using sketches 有权
标题翻译：使用草图估计图中的最短距离
公开(公告)号：US08666920B2
公开(公告)日：2014-03-04
申请号：US12705630
申请日：2010-02-15
申请人： Marc A. Najork , Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
发明人： Marc A. Najork , Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
IPC分类号： G06F17/00 , G06N5/04
CPC分类号： G06N5/04 , G01C21/3446
摘要： Sketches are generated for each node in a graph. For undirected graphs, each sketch for a node may include an indicator of a node from a seed set of nodes and the shortest distance between the node and the indicated node. When a request is received for the shortest distance between two nodes of the graph, the sketches for each of the two nodes are retrieved, and nodes that are indicated in both of the sketches are determined. The distances between each of the two nodes and a determined node as indicated in the sketches is summed for each of the determined nodes, and the sum having the least distance is selected as the estimated shortest distance between the two nodes.
摘要翻译：为图中的每个节点生成草图。对于无向图，节点的每个草图可以包括来自节点的种子集合的节点的指示符以及节点和指示节点之间的最短距离。当接收到图形的两个节点之间的最短距离的请求时，检索两个节点中的每个节点的草图，并且确定在两个草图中指示的节点。两个节点中的每一个之间的距离和如草图中所示的确定的节点之间的距离对于每个确定的节点相加，并且具有最小距离的和被选择为两个节点之间的估计的最短距离。

33. 发明授权

US08583667B2 Large graph measurement 有权
标题翻译：大图测量
公开(公告)号：US08583667B2
公开(公告)日：2013-11-12
申请号：US13314555
申请日：2011-12-08
申请人： Sreenivas Gollapudi
发明人： Sreenivas Gollapudi
IPC分类号： G06F17/30 , G06F7/00
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草图，通过确定节点的邻域并使用与各个相邻节点相关联的标签生成草图来为索引中的相应节点生成邻域草图。通过使用两个节点的邻域草图计算两个节点之间的近似路径数和两个节点之间的近似路径长度来确定两个节点之间的距离。

34. 发明授权

US08458130B2 Indexing for limited search server availability 有权
标题翻译：索引有限的搜索服务器可用性
公开(公告)号：US08458130B2
公开(公告)日：2013-06-04
申请号：US13040261
申请日：2011-03-03
申请人： Krishnaram N. G. Kenthapadi , Shuai Ding , Sreenivas Gollapudi , Samuel Ieong , Alexandros Ntoulas
发明人： Krishnaram N. G. Kenthapadi , Shuai Ding , Sreenivas Gollapudi , Samuel Ieong , Alexandros Ntoulas
IPC分类号： G06F17/30
CPC分类号： G06F17/30017 , G06F17/30864
摘要： Documents are replicated among servers comprising a search engine based on the value of each document by approximating its value as one of the top search results for one or more exemplary queries. Documents are allocated among servers comprising a search engine by calculating a relevance value for each document and then distributing the documents evenly to the servers. A subset of servers are selected from among a plurality of servers comprising a search engine using term-based, server-specific histograms reflecting the number of instances of the term in each document allocated to each server, and then selecting servers to service a query based on the documents on those servers.
摘要翻译：文档在包含基于每个文档的值的搜索引擎的服务器之间通过将其值近似作为一个或多个示例性查询的顶部搜索结果之一来复制。通过计算每个文档的相关性值，然后将文档均匀地分发到服务器，在包含搜索引擎的服务器之间分配文档。从包括使用基于术语的服务器特定直方图的搜索引擎的多个服务器中选择服务器的子集，所述服务器特定的直方图反映分配给每个服务器的每个文档中的术语的实例的数量，然后选择服务于基于查询的服务器在这些服务器上的文档上。

35. 发明授权

US08139495B2 Determining quality of communication 有权
标题翻译：确定沟通质量
公开(公告)号：US08139495B2
公开(公告)日：2012-03-20
申请号：US11854918
申请日：2007-09-13
申请人： Sreenivas Gollapudi , Alan D. Halverson , Krishnaram G. Kenthapadi
发明人： Sreenivas Gollapudi , Alan D. Halverson , Krishnaram G. Kenthapadi
IPC分类号： H04L1/00 , H04J3/14 , G01R31/08 , G06F11/00 , G08C15/00
CPC分类号： H04L41/5093 , H04L41/5038 , H04L51/04
摘要： A method, computer-readable medium, and system for providing a quality measurement based on communications within a communication application. Communication attributes that include information associated with a user's communications are obtained. In embodiments, such communication attributes may pertain to communication duration and communication frequency. Upon obtaining communication attributes, a quality measurement may be determined based on the communication attributes. Such a quality measurement provides an indication of the quality of the user's communications. In embodiments, the quality measurement may be stored, communicated to a user, or implemented within a communication application.
摘要翻译：一种用于基于通信应用内的通信提供质量测量的方法，计算机可读介质和系统。获得包括与用户通信相关联的信息的通信属性。在实施例中，这种通信属性可以涉及通信持续时间和通信频率。在获得通信属性时，可以基于通信属性来确定质量测量。这样的质量测量提供了用户通信的质量的指示。在实施例中，质量测量可以被存储，传达给用户或在通信应用程序内实现。

36. 发明申请

US20110307517A1 RELAXATION FOR STRUCTURED QUERIES 有权
标题翻译：结构性质疑的放松
公开(公告)号：US20110307517A1
公开(公告)日：2011-12-15
申请号：US12796678
申请日：2010-06-09
申请人： Alexandros Ntoulas , Sreenivas Gollapudi , Samuel Ieong , Stelios Paparizos , John Christopher Shafer
发明人： Alexandros Ntoulas , Sreenivas Gollapudi , Samuel Ieong , Stelios Paparizos , John Christopher Shafer
IPC分类号： G06F17/30
CPC分类号： G06F17/30451 , G06F17/30861 , G06F17/30864
摘要： A structured query may specify attribute values for attributes. An estimate of the number of items that will match the structured query if it is applied to a structured database is determined. If the estimated number of items is below a threshold, the structured query may be relaxed to form new candidate structured queries. The number of candidate queries may be determined based on a desired running time. Each of the candidate structured queries may be determined by changing one or more attribute values of the attributes of the structured query. Estimates of the number of items each of the candidate structured queries will match is determined, and the candidate structured query that has the highest matching estimation is used to query the database. The matching results may be output.
摘要翻译：结构化查询可以指定属性的属性值。确定将结构化查询与应用于结构化数据库时匹配的项目数量的估计。如果估计的项目数量低于阈值，则可以放宽结构化查询以形成新的候选结构化查询。可以基于期望的运行时间来确定候选查询的数量。可以通过改变结构化查询的属性的一个或多个属性值来确定每个候选结构化查询。确定每个候选结构化查询将匹配的项目的数量的估计，并且使用具有最高匹配估计的候选结构化查询来查询数据库。可以输出匹配结果。

37. 发明申请

US20100153370A1 SYSTEM OF RANKING SEARCH RESULTS BASED ON QUERY SPECIFIC POSITION BIAS 审中-公开
标题翻译：基于查询特定位置偏移的搜索结果排序系统
公开(公告)号：US20100153370A1
公开(公告)日：2010-06-17
申请号：US12335396
申请日：2008-12-15
申请人： Sreenivas Gollapudi , Rina Panigrahy
发明人： Sreenivas Gollapudi , Rina Panigrahy
IPC分类号： G06F17/30
CPC分类号： G06F16/958
摘要： A model based on a generalization of the Examination Hypothesis is disclosed that states that for a given query, the user click probability on a document in a given position is proportional to the relevance of the document and a query specific position bias. Based on this model the relevance and position bias parameters are learned for different queries and documents. This is done by translating the model into a system of linear equations that can be solved to obtain the best fit relevance and position bias values. A cumulative analysis of the position bias curves may be performed for different queries to understand the nature of these curves for navigational and informational queries. In particular, the position bias parameter values may be computed for a large number of queries. Such an exercise reveals whether the query is informational or navigational. A method is also proposed to solve the problem of dealing with sparse click data by inferring the goodness of unclicked documents for a given query from the clicks associated with similar queries.
摘要翻译：披露了基于考试假设泛化的模型，其中指出，对于给定查询，给定位置上的文档上的用户点击概率与文档的相关性和查询特定位置偏差成比例。基于此模型，针对不同的查询和文档学习相关性和位置偏差参数。这是通过将模型转换成可以解决以获得最佳拟合相关性和位置偏差值的线性方程组的系统来完成的。可以对不同的查询执行位置偏差曲线的累积分析，以了解导航和信息查询的这些曲线的性质。特别地，可以针对大量查询来计算位置偏差参数值。这样的练习揭示了查询是信息还是导航。还提出了一种通过从与类似查询相关联的点击推断给定查询的未点击文档的良好性来解决处理稀疏点击数据的问题的方法。

38. 发明申请

US20090313286A1 GENERATING TRAINING DATA FROM CLICK LOGS 审中-公开
标题翻译：从点击记录生成培训数据
公开(公告)号：US20090313286A1
公开(公告)日：2009-12-17
申请号：US12140272
申请日：2008-06-17
申请人： Nina Mishra , Rakesh Agrawal , Sreenivas Gollapudi , Alan Halverson , Krishnaram N. G. Kenthapadi , Rina Panigrahy , John C. Shafer , Panayiotis Tsaparas
发明人： Nina Mishra , Rakesh Agrawal , Sreenivas Gollapudi , Alan Halverson , Krishnaram N. G. Kenthapadi , Rina Panigrahy , John C. Shafer , Panayiotis Tsaparas
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F16/9535
摘要： Data from a click log may be used to generate training data for a search engine. The pages clicked as well as the pages skipped by a user may be used to assess the relevance of a page to a query. Labels for training data may be generated based on data from the click log. The labels may pertain to the relevance of a page to a query.
摘要翻译：来自点击日志的数据可用于生成搜索引擎的训练数据。可以使用点击的页面以及用户跳过的页面来评估页面与查询的相关性。可以根据点击日志的数据生成训练数据的标签。标签可能与页面与查询的相关性有关。

39. 发明授权

US07386615B1 Method and system for reliably de-allocating resources in a networked computing environment 有权
标题翻译：在网络化计算环境中可靠地分配资源的方法和系统
公开(公告)号：US07386615B1
公开(公告)日：2008-06-10
申请号：US10144246
申请日：2002-05-10
申请人： Kapil Surlaker , Sreenivas Gollapudi , Lakshminarayanan Chidambaran , Debashis Saha
发明人： Kapil Surlaker , Sreenivas Gollapudi , Lakshminarayanan Chidambaran , Debashis Saha
IPC分类号： G06F15/173
CPC分类号： H04L43/0811 , G06F9/5011 , H04L67/14
摘要： A system and method is disclosed that allows resources to be shared among multiple entities, but which can appropriately release system resources after the failure or shutdown of the calling entity. In one approach, a monitoring entity is available to check for session failures. If a session failure is detected, the session is identified in a shared list that is accessible to other related entities. The related entities can be configured to piggyback a message to an appropriate node to kill, shutdown, or release resources associated with the failed session. Alternatively, a related entity can be specifically initiated to send a message to the appropriate node to kill, shutdown, or release the resources.
摘要翻译：公开了一种允许在多个实体之间共享资源的系统和方法，但是可以在主叫实体的故障或关闭之后适当地释放系统资源。在一种方法中，监控实体可用于检查会话故障。如果检测到会话失败，会话在共享列表中被识别，可供其他相关实体访问。可以将相关实体配置为将消息捎带到适当的节点以终止，关闭或释放与故障会话相关联的资源。或者，可以专门启动相关实体来向适当的节点发送消息以杀死，关闭或释放资源。

40. 发明授权

US07188102B1 Method and apparatus for efficient transmission of result set data 有权
标题翻译：用于有效传输结果集数据的方法和装置
公开(公告)号：US07188102B1
公开(公告)日：2007-03-06
申请号：US10658724
申请日：2003-09-09
申请人： Sreenivas Gollapudi , Jonathan Klein , Chi Ku
发明人： Sreenivas Gollapudi , Jonathan Klein , Chi Ku
IPC分类号： G06F17/30
CPC分类号： G06F17/30501 , G06F17/3056 , G06F17/30569 , Y10S707/99931 , Y10S707/99933 , Y10S707/99935 , Y10S707/99944
摘要： A method and apparatus for efficiently transmitting a result set. A data server receives a data request from a client or another server. The data server determines whether a threshold portion of the contents of each requested row or record is being retrieved (e.g., X% of the number of columns in a table or X% of the total amount of data in a table row). The requested rows are retrieved in the same format in which they are stored (e.g., within a disk block), and streamed to the client, one row at a time. The client is then responsible for disassembling a row into its columns, reordering them if necessary, and performing any necessary post-processing (e.g., datatype conversion, data formatting) before consuming the data.
摘要翻译：一种用于有效地发送结果集的方法和装置。数据服务器从客户机或其他服务器接收数据请求。数据服务器确定是否正在检索每个请求的行或记录的内容的阈值部分（例如，表中的列数的X％或表行中的数据总量的X％）。所请求的行以它们被存储的相同格式被检索（例如，在磁盘块内），并且一次流式传输到客户端。然后，客户端负责将行拆卸到其列中，如果需要，重新排序它们，并在消费数据之前执行任何必要的后处理（例如，数据类型转换，数据格式化）。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式