"Telephone, n. An invention of the devil which abrogates some of the advantages of making a disagreeable person keep his distance. "
Ambose Bierce
Make the Most of Our Site
See this month's Top Inventors and Most Cited Patents.
Stay on top of the latest innovations by subscribing to an RSS feed.
Registered users: Manage your profile.
| Number | Title | Issue Date |
| 8180744 | Managing storage of data in a data structure A particular data value is represented as a group of segments stored in corresponding entries of a data structure. Additional data values represented by corresponding groups of segments are written into the data structure. A probability of overwriting segments repre... | 05/15/2012 |
| 8171004 | Use of hash values for identification and location of content Surrogate hashing is described, including initializing one or more variables in a collection, evaluating an address associated with a host, comparing the address to the collection to determine if the address is stored in the collection, and processing the address to... | 05/01/2012 |
| 8151087 | Cache memory and method of operating the same Provided are a cache memory using a linear hash function and a method of operating the same. The cache memory includes: a first hash function module for converting a main memory address received from a central processing unit (CPU) into a first index value using a f... | 04/03/2012 |
| 8127109 | Virtual block device A virtual block device is an interface with applications that appears to the applications as a memory device, such as a standard block device. The virtual block device interacts with additional elements to do data deduplication to files at the block level such that ... | 02/28/2012 |
| 8074049 | Online backup system with global two staged deduplication without using an indexing database An encryption for a distributed global online backup system with global two-stage deduplication in the absence of an indexing database where data blocks are encrypted using their SHA-1 signatures as encryption keys. ... | 12/06/2011 |
| 8065309 | Counting unique search results The subject matter of this specification can be embodied in, among other things, a computer-implemented method for counting one or more unique search results within a plurality of search results includes creating hash values for information in each of the search res... | 11/22/2011 |
| 8005868 | System and method for multiple distinct aggregate queries There is disclosed a system and method for executing multiple distinct aggregate queries. In an embodiment, the method comprises: providing at least one Counting Bloom Filter for each distinct column of an input data stream; reviewing count values in the at least on... | 08/23/2011 |
| 7984018 | Efficient point-to-multipoint data reconciliation Efficient reconciliation of different versions of a target file or dataset can be facilitated using a hash hierarchy of a master version of the dataset. Each level of the hash hierarchy has hashes of blocks of the master version that may be sub-blocks of the hashes ... | 07/19/2011 |
| 7979671 | Dual hash indexing system and methodology A method, system and program are disclosed for accelerating data storage in a cache appliance that transparently monitors NFS and CIFS traffic between clients and NAS subsystems and caches files in a cache memory by using a dual hash technique to rapidly store and/o... | 07/12/2011 |
| 7979670 | Methods and systems for vectored data de-duplication The present invention is directed toward methods and systems for data de-duplication. More particularly, in various embodiments, the present invention provides systems and methods for data de-duplication that may utilize a vectoring method for data de-duplication wh... | 07/12/2011 |
| 7941633 | Hash optimization system and method A computer implemented method, apparatus and program product automatically optimizes hash function operation by recognizing when a first hash function results in an unacceptable number of cache misses, and by dynamically trying another hash function to determine whi... | 05/10/2011 |
| 7930516 | Linked list traversal with reduced memory accesses A linked list traversal system identifies when a linked list has become inefficient, either through attack or an undue multiplicity of collisions. A data unit is parsed to extract a key. A first hash result associated with the key is calculated based on a first hash... | 04/19/2011 |
| 7913060 | Method and apparatus for physical width expansion of a longest prefix match lookup table A lookup unit matrix combines a plurality of lookup units to provide a longest prefix match for a search key longer than the lookup unit's mapper key. A portion of the search key is provided to each of the plurality of lookup units in a single search request issued ... | 03/22/2011 |
| 7900020 | Correction of incorrect cache accesses The application describes a data processor operable to process data, and comprising: a cache in which a storage location of a data item within said cache is identified by an address, said cache comprising a plurality of storage locations and said data processor comp... | 03/01/2011 |
| 7895211 | Method and system for reinserting a chain in a hash table A method and system for reinserting a chain into a hash table of a computer system are described. The chain includes a plurality of keys. The hash table includes a key fields and link fields associated with the key fields. The hash table utilizes an initial collisio... | 02/22/2011 |
| 7873809 | Method and apparatus for de-duplication after mirror operation An amount of storage capacity used during mirroring operations is reduced by applying de-duplication operations to the mirror volumes. Data stored to a first volume is mirrored to a second volume. The second volume is a virtual volume having a plurality of logical a... | 01/18/2011 |
| 7827384 | Galois-based incremental hash module Various systems and methods for implementing a Galois-based incremental hash module are disclosed. For example, a method involves computing a first hash of a first string of an input stream. The first hash is computed by performing one or more Galois mathematical op... | 11/02/2010 |
| 7818326 | System and method for word indexing in a capture system and querying thereof Searching of objects captured by a capture system can be improved by eliminating irrelevant objects from a query. In one embodiment, the present invention includes receiving such a query for objects captured by a capture system, the query including at least one sear... | 10/19/2010 |
| 7818537 | Method and system for dynamically determining hash function values for file transfer integrity validation A method and system for dynamically determining hash values for file transfer integrity validation. In response to a request for a transfer of a data file between a first computing system and a second computing system, the first computing system loads a first portio... | 10/19/2010 |
| 7809701 | Method and system for performing exact match searches using multiple hash tables A method and system to perform exact match searches for fixed- or variable-length keys stored in a search database. The method is implemented using a plurality of hash tables, each indexed using an independent hash function. A system implementing this method provide... | 10/05/2010 |
| 7788240 | Hash mapping with secondary table having linear probing A method is described that involves hashing a key value to locate a slot in a primary table, then, hashing the key value to locate a first slot in a secondary table, then, linearly probing the secondary table starting from the first slot. ... | 08/31/2010 |
| 7752418 | Splash tables: an efficient hash scheme for processors A computer implemented method, data processing system, and computer usable program code are provided for storing data items in a computer. A plurality of hash functions of data values in a data item are computed. A corresponding memory location is determined for one... | 07/06/2010 |
| 7664927 | Hash tables 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 in... | 02/16/2010 |
| 7634632 | Aggregating data from different sources A method and system that aggregates data associated with one or more entities from different data sources are provided. The data sources include documents, web pages, or images that have information about one or more entities. The information is extracted from the d... | 12/15/2009 |
| 7606994 | Cache memory system including a partially hashed index In one embodiment, a cache memory system includes a cache memory coupled to a cache controller. The cache memory controller may receive an address and generate an index value corresponding to the address for accessing a particular entry within the cache memory. More... | 10/20/2009 |
| 7600094 | Linked list traversal with reduced memory accesses A linked list traversal system identifies when a linked list has become inefficient, either through attack or an undue multiplicity of collisions. A data unit is parsed to extract a key. A first hash result associated with the key is calculated based on a first hash... | 10/06/2009 |
| 7571299 | Methods and arrangements for inserting values in hash tables Methods and arrangements to insert values in hash tables are contemplated. Embodiments include transformations, code, state machines or other logic to insert values in a hash table stored in electronic memory by hashing a value to determine a home address of an entr... | 08/04/2009 |
| 7509477 | Aggregating data from difference sources A method and system that aggregates data associated with one or more entities from different data sources are provided. The data sources include documents, web pages, or images that have information about one or more entities. The information is extracted from the d... | 03/24/2009 |
| 7461233 | Method for identifying data characteristics for flash memory A highly efficient data characteristic identification method for flash memory is provided, including the steps of: (a) based on the LBA corresponding to the write request to the flash memory, finding K corresponding counters in the hash table through K hash function... | 12/02/2008 |
| 7454592 | Block-level and hash-based single-instance storage A method for reading data in a block-level single-instance storage system may involve receiving a first address of a data block, retrieving a signature corresponding to the first address, and reading data from a second address corresponding to the signature. A stora... | 11/18/2008 |
| 7447870 | Device for identifying data characteristics for flash memory A highly efficient data characteristic identification device for flash memory is provided, including an instruction register, a plurality of auxiliary controllers, a data register, an address register, a microprocessor, a plurality of hash function units, a hash tab... | 11/04/2008 |
| 7424022 | Method and circuit for providing a context datum of a device based on an address associated with this device A method for providing a context datum associated with a source and/or destination device based on an address datum associated with the device, including addressing, based on the address datum, a unit for providing an index, the unit containing, for each address dat... | 09/09/2008 |
| 7424591 | Splash tables: an efficient hash scheme for processors A computer implemented method, data processing system, and computer usable program code are provided for storing data items in a computer. A plurality of hash functions of data values in a data item are computed. A corresponding memory location is determined for one... | 09/09/2008 |
| 7421563 | Hashing and serial decoding techniques A technique for generating a list of all N-bit unsigned binary numbers by starting with an initial number less than some power of 2, successively multiplying the number by that power of 2 and adding the largest non-negative number less than that power of 2 such that... | 09/02/2008 |
| 7415731 | Content addressable information encapsulation, representation, and transfer One embodiment is directed to a method for use in a computer system comprising at least first and second computers, wherein the first provides content addressable storage. A request to access a unit of data stored by the first computer is issued by the second comput... | 08/19/2008 |
| 7414979 | Method and apparatus for per session load balancing with improved load sharing in a packet switched network Systems and methods for implementing per-session load balancing of packets that increase traffic sharing and reduce systematic unequal distribution of traffic are provided by virtue of one embodiment of the present invention. A method for operating a selected router... | 08/19/2008 |
| 7409526 | Partial key hashing memory A method and apparatus wherein only a partial key is stored in a hashing table is disclosed. By storing a partial key as opposed to storing the entire original key, less data is required to be stored in the hash table. This reduces the attendant memory costs. The re... | 08/05/2008 |
| 7403527 | Lookups by collisionless direct tables and cams A structure and technique for preventing collisions using a hash table in conjunction with a CAM to identify and prevent collision of binary keys. A portion of the hash value of a binary key, which does not collide with a portion of the hash value of any other refer... | 07/22/2008 |
| 7401255 | Mechanisms for recovering data from a backup by comparing transformed data to identify altered memory blocks Mechanisms for efficiently restoring one or more memory blocks of a primary computing system. In order to restore a backup memory block, the primary system accesses transformed data that represents a result of a deterministic many-to-one mapping function, such as a ... | 07/15/2008 |
| 7398391 | Content addressable information encapsulation, representation, and transfer Techniques for managing the storing of a digital asset by a first computer in a computer system that further comprises a second computer. The first computer receives a communication from the second computer including the digital asset, determines whether the digital... | 07/08/2008 |