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

1. 发明申请

US20100070511A1 REDUCING USE OF RANDOMNESS IN CONSISTENT UNIFORM HASHING 审中-公开
标题翻译：减少使用一致性冲突中的随机性
公开(公告)号：US20100070511A1
公开(公告)日：2010-03-18
申请号：US12211814
申请日：2008-09-17
申请人： Mark Steven Manasse , Frank D. McSherry , Kunal Talwar
发明人： Mark Steven Manasse , Frank D. McSherry , Kunal Talwar
IPC分类号： G06F7/20 , G06F7/58 , G06F17/30
CPC分类号： G06F16/951 , G06F16/325
摘要： Documents that are near-duplicates may be determined using techniques involving consistent uniform hashing. A biased bit may be placed in the leading position of a sequence of bits that may be generated and subsequently used in comparison techniques to determine near-duplicate documents. Unbiased bits may be used in subsequent positions of the sequence of bits, after the biased bit, for use in comparison techniques. Samples may be used collectively, as opposed to individually, in the generation of biased bits. Sequences of bits may thus be produced not on a single sample basis, but for multiple samples, thereby amortizing the cost of generating randomness for the samples. Less than one bit of randomness per sample may be used.
摘要翻译：可能使用涉及一致均匀散列的技术来确定几乎重复的文档。偏置位可以被放置在可以被生成并且随后用于比较技术中的位序列的引导位置以确定近似重复的文档。在比较技术中使用偏置位之后，可以在位序列的后续位置中使用无偏置位。与产生偏置位相比，样本可以单独使用，而不是单独使用。因此，可能不是在单个样本基础上产生比特序列，而是针对多个样本产生比特序列，从而对生成样本的随机性的成本进行摊销。可以使用每个样品少于一位的随机性。

2. 发明授权

US07730058B2 Searching for information utilizing a probabilistic detector 失效
标题翻译：使用概率检测器搜索信息
公开(公告)号：US07730058B2
公开(公告)日：2010-06-01
申请号：US11243924
申请日：2005-10-05
申请人： Gaurav Sareen , Mark Steven Manasse , Martin Abadi , Michael A. Isard
发明人： Gaurav Sareen , Mark Steven Manasse , Martin Abadi , Michael A. Isard
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30687
摘要： A probabilistic detector is utilized to query a database. Utilization of a probabilistic detector provides assurance with 100 per cent probability that a search expression in the query is not in the database index. The probabilistic detector is implemented in the form of a Bloom filter. The probabilistic detector is created by hashing expressions in the database index and mapping the resulting hash values into the probabilistic detector. Upon receiving a query, expressions of the query are hashed. The probabilistic detector is queried using these hash values. If the results of querying the probabilistic detector indicate that searched for information may be in the database, the database is not queried. If the results of querying the probabilistic detector indicate that the information may be in the database, the database is queried for the information using the original query. This technique is advantageous in mitigating detrimental effects of denial of service attacks.
摘要翻译：利用概率检测器查询数据库。概率检测器的利用率提供了100％的可能性，即查询中的搜索表达式不在数据库索引中。概率检测器以Bloom滤波器的形式实现。概率检测器是通过在数据库索引中散列表达式并将生成的散列值映射到概率检测器中创建的。在接收到查询后，查询的表达式将被哈希。使用这些散列值查询概率检测器。如果查询概率检测器的结果表明搜索到的信息可能在数据库中，则不会查询数据库。如果查询概率检测器的结果表明信息可能在数据库中，则使用原始查询查询数据库中的信息。这种技术有利于减轻拒绝服务攻击的有害影响。

3. 发明授权

US07640354B2 Scalable differential compression of network data 有权
标题翻译：可扩展差分压缩的网络数据
公开(公告)号：US07640354B2
公开(公告)日：2009-12-29
申请号：US11565867
申请日：2006-12-01
申请人： Nikolaj Skallerud Bjorner , Mark Steven Manasse , Guilherme Issao Camarinha Fujiwara
发明人： Nikolaj Skallerud Bjorner , Mark Steven Manasse , Guilherme Issao Camarinha Fujiwara
IPC分类号： G06F15/16
CPC分类号： H03M7/30 , H03M7/3088 , H04L67/28 , H04L67/288 , Y10S707/99937
摘要： The present invention extends to methods, systems, and computer program products for scalable differential compression for network data. Network data exchanged between Wide Area Network (“WAN”) acceleration devices is cached at physical recordable-type computer-readable media having (potentially significantly) larger storage capacities than available system memory. The cached network data is indexed through features taken from a subset of the cached data (e.g., per segment) to reduce overhead associated with searching for cached network data to use for subsequent compression. When a feature match is detected between received and cached network data, the cached network data can be loaded from the physical recordable-type computer-readable media into system memory to facilitate data compression between Wide Area Network (“WAN”) acceleration devices more efficiently.
摘要翻译：本发明扩展到用于网络数据的可伸缩差分压缩的方法，系统和计算机程序产品。在广域网（“WAN”）加速设备之间交换的网络数据被缓存在具有比可用系统存储器更大的存储容量（可能显着地）的物理可记录型计算机可读介质上。缓存的网络数据通过从缓存数据的子集（例如，每个段）获取的特征来索引，以减少与搜索用于后续压缩的缓存的网络数据相关联的开销。当在接收和缓存的网络数据之间检测到特征匹配时，缓存的网络数据可以从物理可记录型计算机可读介质加载到系统存储器中，以便于更有效地在广域网（“WAN”）加速设备之间进行数据压缩。

4. 发明申请

US20080133536A1 SCALABLE DIFFERENTIAL COMPRESSION OF NETWORK DATA 有权
标题翻译：网络数据的可分级差分压缩
公开(公告)号：US20080133536A1
公开(公告)日：2008-06-05
申请号：US11565867
申请日：2006-12-01
申请人： Nikolaj Skallerud Bjorner , Mark Steven Manasse , Guilherme Issao Camarinha Fujiwara
发明人： Nikolaj Skallerud Bjorner , Mark Steven Manasse , Guilherme Issao Camarinha Fujiwara
IPC分类号： G06F15/16 , G06F17/30
CPC分类号： H03M7/30 , H03M7/3088 , H04L67/28 , H04L67/288 , Y10S707/99937
摘要： The present invention extends to methods, systems, and computer program products for scalable differential compression for network data. Network data exchanged between Wide Area Network (“WAN”) acceleration devices is cached at physical recordable-type computer-readable media having (potentially significantly) larger storage capacities than available system memory. The cached network data is indexed through features taken from a subset of the cached data (e.g., per segment) to reduce overhead associated with searching for cached network data to use for subsequent compression. When a feature match is detected between received and cached network data, the cached network data can be loaded from the physical recordable-type computer-readable media into system memory to facilitate data compression between Wide Area Network (“WAN”) acceleration devices more efficiently.
摘要翻译：本发明扩展到用于网络数据的可伸缩差分压缩的方法，系统和计算机程序产品。在广域网（“WAN”）加速设备之间交换的网络数据被缓存在具有比可用系统存储器更大的存储容量（可能显着地）的物理可记录型计算机可读介质上。缓存的网络数据通过从缓存数据的子集（例如，每个段）获取的特征来索引，以减少与搜索用于后续压缩的缓存的网络数据相关联的开销。当在接收和缓存的网络数据之间检测到特征匹配时，缓存的网络数据可以从物理可记录型计算机可读介质加载到系统存储器中，以便于更有效地在广域网（“WAN”）加速设备之间进行数据压缩。

5. 发明授权

US06269362B1 System and method for monitoring web pages by comparing generated abstracts 失效
标题翻译：通过比较生成的摘要来监控网页的系统和方法
公开(公告)号：US06269362B1
公开(公告)日：2001-07-31
申请号：US08994939
申请日：1997-12-19
申请人： Andrei Zary Broder , Steven Charles Glassman , Mark Steven Manasse
发明人： Andrei Zary Broder , Steven Charles Glassman , Mark Steven Manasse
IPC分类号： G06F1730
CPC分类号： G06F17/30864 , Y10S707/99931 , Y10S707/99933 , Y10S707/99934
摘要： Provided is a computerized method for monitoring the content of documents. A set of documents is stored in memories of server computers. The server computers can be connected to each other by a network such as the Internet. Entries are generated in a search engine for each document of the set. The search engine is also connected to the Internet. The entries are in the form of a full word index of the set of documents. The search engine also maintains a first abstract for each document that is indexed. The abstract is highly dependent on the content of each document. For example, the abstract is in the form of a sketch or a feature vector. Periodically a query is submitted to the search engine. The query locates a result set of documents that satisfy the query. A second abstract is generated for each document member of the result set. The first and second abstracts are compared to identify documents that have changed between the time the set of documents were indexed and the time the result set is generated.
摘要翻译：提供了一种用于监视文档内容的计算机化方法。一组文件存储在服务器计算机的存储器中。服务器计算机可以通过诸如因特网的网络彼此连接。条目是在搜索引擎中为集合中的每个文档生成的。搜索引擎也连接到互联网。这些条目是一组文档的完整词索引的形式。搜索引擎还为每个被索引的文档维护一个第一个摘要。摘要高度依赖于每个文档的内容。例如，抽象是草图或特征向量的形式。定期向搜索引擎提交查询。查询查找满足查询的文档的结果集。为结果集的每个文档成员生成第二个摘要。将第一和第二摘要进行比较，以识别在文档集被索引的时间与生成结果集的时间之间发生变化的文档。

6. 发明授权

US07716250B1 Erasure coding and group computations using rooted binary and ternary trees 有权
标题翻译：使用根二进制和三元树擦除编码和组计算
公开(公告)号：US07716250B1
公开(公告)日：2010-05-11
申请号：US11139914
申请日：2005-05-27
申请人： Mark Steven Manasse , Alice Silverberg , Chandramohan A Thekkath
发明人： Mark Steven Manasse , Alice Silverberg , Chandramohan A Thekkath
IPC分类号： G06F17/30
CPC分类号： G06F17/30961
摘要： High throughput in data computations and processing is maintained while minimizing latency. A binary tree architecture is provided in which two trees are used simultaneously, and initiation of the trees is staggered to allow for optimal use of bandwidth. These techniques are desirable for erasure codes and other computations where the addition operator is commutative. Additionally, a ternary tree architecture may be used, in which three trees co-exist on the same set of nodes to maintain high throughput while further improving latency.
摘要翻译：维持数据计算和处理中的高吞吐量，同时最大限度地减少延迟。提供了一种二叉树结构，其中同时使用两个树，并且树的启动是交错的，以便最佳地使用带宽。这些技术对于擦除代码和其他计算（其中加法运算符是可交换的）是理想的。另外，可以使用三元树结构，其中三个树共存在同一组节点上以保持高吞吐量，同时进一步改善等待时间。

7. 发明授权

US07664927B2 Hash tables 失效
标题翻译：哈希表
公开(公告)号：US07664927B2
公开(公告)日：2010-02-16
申请号：US11393014
申请日：2006-03-29
申请人： Ulfar Erlingsson , Mark Steven Manasse , Frank D. McSherry , Abraham D. Flaxman
发明人： Ulfar Erlingsson , Mark Steven Manasse , Frank D. McSherry , Abraham D. Flaxman
IPC分类号： G06F12/00
CPC分类号： G06F17/30949
摘要： Hash tables comprising load factors of up to and above 97% are disclosed. The hash tables may be associated with three or more hash functions, each hash function being applied to a key to identify a location in a hash table. The load factor of a hash table may be increased, obviating any need to increase the size of the hash table to accommodate more insertions. Such increase in load factor may be accomplished by a combination of increasing the number of cells per bucket in a hash table and increasing the number of hash functions associated with the hash table.
摘要翻译：公开了包含高达和高于97％的负载因子的哈希表。散列表可以与三个或更多个散列函数相关联，每个散列函数被应用于密钥以标识散列表中的位置。可以增加散列表的负载因子，从而避免了增加哈希表的大小以适应更多的插入的任何需要。负载因子的这种增加可以通过增加哈希表中的每个桶的单元数目并增加与散列表相关联的散列函数的数量的组合来实现。

8. 发明申请

US20090132571A1 EFFICIENT USE OF RANDOMNESS IN MIN-HASHING 审中-公开
标题翻译：高效地使用最小化的随机数
公开(公告)号：US20090132571A1
公开(公告)日：2009-05-21
申请号：US11941081
申请日：2007-11-16
申请人： Mark Steven Manasse , Frank D. McSherry , Kunal Talwar
发明人： Mark Steven Manasse , Frank D. McSherry , Kunal Talwar
IPC分类号： G06F17/30
CPC分类号： G06F16/951
摘要： Documents that are near-duplicates may be determined using techniques such as min-hashing. Randomness that is used in these techniques may be based on sequences of bits. The sequences of bits may be generated from a string of bits, with the sequences determined by parsing the string at each occurrence of a particular value, such as the value “1”.
摘要翻译：几乎重复的文档可以使用诸如分哈希算法的技术来确定。在这些技术中使用的随机性可以基于比特序列。可以从一串比特生成比特序列，其中序列通过在每次出现特定值（例如值“1”）时解析字符串来确定。

9. 发明授权

US07430091B2 Method and apparatus for improving the performance of a disk drive 失效
标题翻译：用于提高磁盘驱动器性能的方法和装置
公开(公告)号：US07430091B2
公开(公告)日：2008-09-30
申请号：US11256042
申请日：2005-10-21
申请人： Mark Steven Manasse
发明人： Mark Steven Manasse
IPC分类号： G11B5/58 , G11B5/596
CPC分类号： G11B5/48 , G11B5/5578
摘要： An implementation of a disk drive with improved efficiency where a read head supported by a first positioning component is provided and a write head supported by a second positioning component is also provided. By positioning the write head behind the read head at a predetermined angle, the disk drive can execute a “read-before-write” or “read-modify-by-XOR-write” operation by before the platter has rotated a full revolution.
摘要翻译：提供了提供效率提高的盘驱动器的实现，其中由第一定位部件支撑的读取头被提供，并且还提供由第二定位部件支撑的写入头。通过将写入头定位在读取头的预定角度后，磁盘驱动器可以在盘旋转一整圈之前执行“写入前读写”或“读 - 修改 - 异或写”操作。

10. 发明授权

US07149801B2 Memory bound functions for spam deterrence and the like 有权
标题翻译：用于垃圾邮件威慑的内存绑定功能等
公开(公告)号：US07149801B2
公开(公告)日：2006-12-12
申请号：US10290879
申请日：2002-11-08
申请人： Michael Burrows , Martin Abadi , Mark Steven Manasse , Edward P. Wobber , Daniel Ron Simon
发明人： Michael Burrows , Martin Abadi , Mark Steven Manasse , Edward P. Wobber , Daniel Ron Simon
IPC分类号： G06F15/173 , H04K1/00
CPC分类号： H04L63/126 , H04L51/12
摘要： A resource may be abused if its users incur little or no cost. For example, e-mail abuse is rampant because sending an e-mail has negligible cost for the sender. Such abuse may be discouraged by introducing an artificial cost in the form of a moderately expensive computation. Thus, the sender of an e-mail might be required to pay by computing for a few seconds before the e-mail is accepted. Unfortunately, because of sharp disparities across computer systems, this approach may be ineffective against malicious users with high-end systems, prohibitively slow for legitimate users with low-end systems, or both. Starting from this observation, we identify moderately hard, memory bound functions that most recent computer systems will evaluate at about the same speed, and we explain how to use them for protecting against abuses.
摘要翻译：如果用户投入很少或没有成本，资源可能会被滥用。例如，电子邮件滥用是猖獗的，因为发送电子邮件对发件人的成本可以忽略不计。通过以中等昂贵的计算的形式引入人造成本，可能不鼓励这种滥用。因此，电子邮件的发件人可能需要在电子邮件被接受之前几秒计算才能付款。不幸的是，由于计算机系统之间的差异很大，对于具有高端系统的恶意用户来说，这种方法可能无效，对于具有低端系统的合法用户或者两者都是非常缓慢的。从这个观察开始，我们确定了最近的计算机系统以相同的速度评估的适度硬的记忆绑定功能，我们解释如何使用它们来防止滥用。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式