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

1. 发明授权

US07792854B2 Query dependent link-based ranking 有权
标题翻译：查询依赖的基于链接的排名
公开(公告)号：US07792854B2
公开(公告)日：2010-09-07
申请号：US11975789
申请日：2007-10-22
申请人： Marc A. Najork
发明人： Marc A. Najork
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30864
摘要： Query dependent ranking uses weighted edges in a stochastic approach for link structure analysis (SALSA) technique. Functions describing the weights of edges into and out of a vertex are determined to define transition probability functions. The transition probability functions are used to compute authority scores for each uniform resource locator (URL) u in a base set to rank a result set to a received query.
摘要翻译：查询依赖排序使用随机方法中的加权边缘进行链路结构分析（SALSA）技术。确定描述进入和离开顶点的边的权重的函数来定义转移概率函数。转移概率函数用于计算基本集合中每个统一资源定位符（URL）u的权限分数，以将结果集排列为接收到的查询。

2. 发明申请

US20090106230A1 Query dependent link-based ranking 有权
标题翻译：查询依赖的基于链接的排名
公开(公告)号：US20090106230A1
公开(公告)日：2009-04-23
申请号：US11975789
申请日：2007-10-22
申请人： Marc A. Najork
发明人： Marc A. Najork
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： Query dependent ranking uses weighted edges in a stochastic approach for link structure analysis (SALSA) technique. Functions describing the weights of edges into and out of a vertex are determined to define transition probability functions. The transition probability functions are used to compute authority scores for each uniform resource locator (URL) u in a base set to rank a result set to a received query.
摘要翻译：查询依赖排序使用随机方法中的加权边缘进行链路结构分析（SALSA）技术。确定描述进入和离开顶点的边的权重的函数来定义转移概率函数。转移概率函数用于计算基本集合中每个统一资源定位符（URL）u的权限分数，以将结果集排列为接收到的查询。

3. 发明授权

US06910077B2 System and method for identifying cloaked web servers 失效
标题翻译：用于识别隐藏的Web服务器的系统和方法
公开(公告)号：US06910077B2
公开(公告)日：2005-06-21
申请号：US10039603
申请日：2002-01-04
申请人： Marc A. Najork
发明人： Marc A. Najork
IPC分类号： G06F17/30 , G06F15/16
CPC分类号： G06F17/30864
摘要： A search engine receives from a client a representation of a first object that was returned by a web server to the client in response to a request from the client. The search engine receives from the web server a second object in response to an identical request from the search engine, and compares the representation of the first object to a representation of the second object. The web server is determined to be cloaked if the representation of the first object does not match the representation of the second object. Typically, the client receives a URL embedded in a response to a search request submitted to the search engine. A toolbar operating in conjunction with the web browser on the client processes the URL. The processing includes: directing the web browser to obtain an object corresponding to the URL from a web server addressed by the URL; converting the object to a feature vector; and delivering the feature vector and the URL back to the search engine.
摘要翻译：搜索引擎响应于来自客户端的请求，从客户端接收由web服务器返回给客户端的第一对象的表示。搜索引擎响应于来自搜索引擎的相同请求，从web服务器接收第二对象，并将第一对象的表示与第二对象的表示进行比较。如果第一个对象的表示与第二个对象的表示不匹配，则确定该Web服务器被隐藏。通常，客户端收到嵌入到提交给搜索引擎的搜索请求的响应中的URL。与客户端的Web浏览器结合使用的工具栏处理URL。该处理包括：引导web浏览器从URL处理的web服务器获得与URL对应的对象; 将对象转换为特征向量; 并将特征向量和URL传递回搜索引擎。

4. 发明授权

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.
摘要翻译：为图中的每个节点生成草图。对于无向图，节点的每个草图可以包括来自节点的种子集合的节点的指示符以及节点和指示节点之间的最短距离。当接收到图形的两个节点之间的最短距离的请求时，检索两个节点中的每个节点的草图，并且确定在两个草图中指示的节点。两个节点中的每一个之间的距离和如草图中所示的确定的节点之间的距离对于每个确定的节点相加，并且具有最小距离的和被选择为两个节点之间的估计的最短距离。

5. 发明授权

US07783671B2 Deletion and compaction using versioned nodes 有权
标题翻译：使用版本控制的节点进行删除和压缩
公开(公告)号：US07783671B2
公开(公告)日：2010-08-24
申请号：US11376920
申请日：2006-03-16
申请人： Marc A. Najork , Chandramohan A. Thekkath
发明人： Marc A. Najork , Chandramohan A. Thekkath
IPC分类号： G06F17/30
CPC分类号： G06F17/30961 , Y10S707/99944
摘要： An information management system includes a database comprising a B-Tree data structure. The B-Tree includes a plurality of nodes associated with disk blocks, handles stored in the nodes, and version numbers attached to each of the handles and disk blocks. In addition, a method is provided that can include initially assigning version numbers to disk blocks, wherein the disk blocks are associated with nodes in a B-Tree data structure, and then performing an allocate operation whereby a handle identifying a disk block is returned along with the disk block's version number.
摘要翻译：信息管理系统包括包含B-Tree数据结构的数据库。 B树包括与磁盘块相关联的多个节点，存储在节点中的句柄以及附加到每个句柄和磁盘块的版本号。另外，提供了一种可以包括首先将版本号分配给磁盘块的方法，其中磁盘块与B-Tree数据结构中的节点相关联，然后执行分配操作，由此将标识磁盘块的句柄返回与磁盘块的版本号。

6. 发明授权

US07072904B2 Deletion and compaction using versioned nodes 有权
标题翻译：使用版本控制的节点进行删除和压缩
公开(公告)号：US07072904B2
公开(公告)日：2006-07-04
申请号：US10308291
申请日：2002-12-02
申请人： Marc A. Najork , Chandramohan A. Thekkath
发明人： Marc A. Najork , Chandramohan A. Thekkath
IPC分类号： G06F17/50
CPC分类号： G06F17/30961 , Y10S707/99944
摘要： An information management system includes a database comprising a B-Tree data structure. The B-Tree includes a plurality of nodes associated with disk blocks, handles stored in the nodes, and version numbers attached to each of the handles and disk blocks. In addition, the system includes a mechanism for initially assigning each disk block a first prescribed version number (e.g., version number 0), and a mechanism for performing an allocate operation whereby a handle identifying a disk block is returned along with the disk block's version number. The system may also include a mechanism for performing a deallocate operation that increments the disk block's version number, as well as a mechanism for performing a read operation that returns a disk block's version number in addition to the node stored at that disk block. Moreover, a caller of the read operation checks whether the version number returned by the read operation matches the version number of the handle that was read. The caller is preferably restarted if the version numbers do not match, thus indicating that the node has been deleted and subsequently deallocated by a different thread. The caller may be a lookup operation, an insert operation, or a delete operation.
摘要翻译：信息管理系统包括包含B-Tree数据结构的数据库。 B树包括与磁盘块相关联的多个节点，存储在节点中的句柄以及附加到每个句柄和磁盘块的版本号。此外，该系统包括用于首先为每个磁盘块分配第一规定版本号（例如，版本号0）的机制，以及用于执行分配操作的机制，由此识别磁盘块的句柄与磁盘块的版本一起返回数。系统还可以包括用于执行增加磁盘块的版本号的释放操作的机制，以及除了存储在该磁盘块中的节点之外还执行返回磁盘块的版本号的读取操作的机制。此外，读操作的调用者检查读操作返回的版本号是否与读取的句柄的版本号相匹配。如果版本号不匹配，则优选地重新启动呼叫者，从而指示该节点已经被删除并且随后由不同的线程释放。呼叫者可以是查找操作，插入操作或删除操作。

7. 发明授权

US07007027B2 Algorithm for tree traversals using left links 有权
公开(公告)号：US07007027B2
公开(公告)日：2006-02-28
申请号：US10308293
申请日：2002-12-02
申请人： Marc A. Najork , Chandramohan A. Thekkath
发明人： Marc A. Najork , Chandramohan A. Thekkath
IPC分类号： G06F17/30
CPC分类号： G06F17/30958 , Y10S707/918 , Y10S707/99944
摘要： An information management system includes a computer and a database comprising a B-Tree data structure comprising a plurality of nodes associated with disk blocks and handles stored in the nodes. At least one left-link handle, hleft, stored in each node points to a left sibling of that node. A mechanism for performing a lookup operation with respect to a key, k, traverses the B-Tree and refers to the left-link handle, hleft, of a node to access a left sibling of the node if the key k is less than or equal to a value kmin stored in the node. Mechanisms are also provided for performing insert and delete operations, and the lookup, insert, and delete operations detect if the key range of an index node, A, does not include the key k that the operation is trying to locate, and follow a handle A.hleft to the left sibling when k≦A.kmin.

8. 发明申请

US20110202846A1 ESTIMATING SHORTEST DISTANCES IN GRAPHS 有权
标题翻译：评估格局中的最短距离
公开(公告)号：US20110202846A1
公开(公告)日：2011-08-18
申请号：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分类号： G06F15/16 , G06F3/048
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.
摘要翻译：为图中的每个节点生成草图。对于无向图，节点的每个草图可以包括来自节点的种子集合的节点的指示符以及节点和指示节点之间的最短距离。当接收到图形的两个节点之间的最短距离的请求时，检索两个节点中的每个节点的草图，并且确定在两个草图中指示的节点。两个节点中的每一个之间的距离和如草图中所示的确定的节点之间的距离对于每个确定的节点相加，并且具有最小距离的和被选择为两个节点之间的估计的最短距离。

9. 发明授权

US07818334B2 Query dependant link-based ranking using authority scores 有权
标题翻译：使用权限分数的基于查询的基于链接的排名
公开(公告)号：US07818334B2
公开(公告)日：2010-10-19
申请号：US11975790
申请日：2007-10-22
申请人： Marc A. Najork
发明人： Marc A. Najork
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30864
摘要： Query dependent ranking uses an authority score. A base set is determined as the union of a result set to a received query, an inlinking-set, and an outlinked-set. The inlinking-set is determined by sampling a predetermined number of uniform resource locators (URLs) linking to each result. The outlinked-set is determined by sampling a predetermined number of URLs linked to by each result. A neighborhood graph consists of the vertices of the base set and the edges between the vertices in the base set. An authority score for each URL in the base set is computed using a Stochastic Approach to Link Structure Analysis (SALSA) technique. The authority scores are used to rank the result set.
摘要翻译：查询依赖排名使用权威分数。确定基本集作为结果集合与接收到的查询，非连接集合和超链接集合的并集。通过对连接到每个结果的预定数量的统一资源定位符（URL）进行抽样来确定所述连结集。通过对每个结果链接的预定数量的URL进行抽样来确定超链接集。邻域图由基本集合的顶点和基本集合中的顶点之间的边缘组成。使用随机方法链接结构分析（SALSA）技术计算基本集中每个URL的权威分数。权威分数用于对结果集进行排名。

10. 发明授权

US07739281B2 Systems and methods for ranking documents based upon structurally interrelated information 失效
标题翻译：基于结构相关信息对文档进行排序的系统和方法
公开(公告)号：US07739281B2
公开(公告)日：2010-06-15
申请号：US10663933
申请日：2003-09-16
申请人： Marc A. Najork
发明人： Marc A. Najork
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30864
摘要： Systems and methods for ranking Web pages based on hyperlink information in a manner that is resistant to nepotistic links are provided. In one embodiment, a Web search service is provided for returning quality query results. The vulnerability of existing ranking algorithms, such as PageRank, to Web pages that are artificially generated for the sole purpose of inflating the score of target page(s) is addressed. Intuitively, it is recognized that it is less likely to reach a particular page on a Web server having many pages via a random jump than it is to reach a particular page on a Web server having few pages, which implies that the influence of such a page upon another page by linking to, or endorsing, the other page is diminished. Thus, in various non-limiting embodiments, each Web server, not each Web page, is assigned a guaranteed minimum score. This minimum score assigned to a server can then be divided among all the pages on that Web server.
摘要翻译：提供了一种基于超链接信息对网页进行排序的系统和方法，该方法具有耐人关联的方式。在一个实施例中，提供了用于返回质量查询结果的Web搜索服务。现有的排名算法（例如PageRank）对仅为了提高目标页面得分而人为地产生的网页的漏洞被解决。直观地认识到，不太可能通过随机跳转到达具有许多页面的Web服务器上的特定页面，而不是到达具有几页的Web服务器上的特定页面，这意味着这样的通过链接到另一个页面或批注另一个页面的页面被减少。因此，在各种非限制性实施例中，每个Web服务器（而不是每个网页）被分配有保证的最小分数。分配给服务器的最小分数可以在该Web服务器上的所有页面之间分配。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式