Class / Patent application number | Description | Number of patent applications / Date published |
707698000 | Using hash function | 59 |
20100057795 | ARRANGEMENT FOR COMPARING CONTENT IDENTIFIERS OF FILES - Arrangements ( | 03-04-2010 |
20100131480 | DEDUPLICATED FILE SYSTEM - An apparatus and a method for maintaining a file system is described. An allocation module receives a request from a kernel module to allocate a block of the file system to a file. The allocation module examines an other block of the file system to determine whether the other block contain a same data as the block. The allocation module also determines an external reference count of the other block containing the same data. The other block is then allocated to the file and the external reference count is updated accordingly. | 05-27-2010 |
20100174693 | COLLABORATIVE WORKBENCH FOR MANAGING DATA FROM HETEROGENEOUS SOURCES - Disclosed is an exemplary computer program application, system and method for a unified approach to managing data from heterogeneous sources. The system includes a central, semantic data storage basing on a directed labeled graph model, a module for accessing data sources by drawing access and mapping configuration from the data storage and loading the resulting data into the data storage and a unified user interface that treats each graph node in the data storage as a separate term, visualizes and modified the term's context in the data graph using configurable user interface widgets. | 07-08-2010 |
20100205162 | System and method for quality assured media file storage - There is provided a system and method for quality assured media file storage. There is provided a method for use by a processor to verify quality of a new media file by transcoding a master media file into a first media file, determining a quality of the first media file, applying a first quality assurance scheme to the first media file for an assured quality, calculating a first hash value using a hash function for the first media file, storing the first hash value in a memory, transcoding the master media file into a new media file, calculating a test hash value using the hash function for the new media file, and searching the memory for the test hash value to decide whether the new media file has the assured quality, without having to apply the first quality assurance scheme again to the new media file. | 08-12-2010 |
20100205163 | SYSTEM AND METHOD FOR SEGMENTING A DATA STREAM - A method of limiting redundant storage of data comprises receiving a data stream and partitioning the data stream into a series of data chunks. At least one content hash value for a set of data chunks is generated based on data content of the set of data chunks. One or more data chunks are grouped into a segment with at least one boundary of the segment defined based on an evaluation of content hash values of data chunks. Content hash values of data chunks of the segment are compared to content hash values of data chunks of segments stored on a backup mass storage device. A pointer to a stored data chunk of an existing segment is stored on the backup mass storage device if a content hash value of a data chunk of the segment matches the content hash value of the stored data chunk. | 08-12-2010 |
20100228704 | Recognizing a disc - A method and a system are provided for recognizing a disc. In one example, the system receives a disc, such as, for example, a Blu-ray Disc. The disc includes a content certificate and data files. The content certificate includes a unique text file that certifies the disc complies with predetermined disc parameters. The data files are the actual audio and/or video content on the disc. The system reads the content certificate or reads the data related to the data files. The system generates a hash value by applying a hash function to the content certificate or to the data related to the data files. The hash value is a unique identifier for the disc. | 09-09-2010 |
20110022574 | System and Method for Replicating Disk Images in a Cloud Computing Based Virtual Machine File System - A replicated decentralized storage system comprises a plurality of servers that locally store disk images for locally running virtual machines as well as disk images, for failover purposes, for remotely running virtual machines. To ensure that disk images stored for failover purposes are properly replicated upon an update of the disk image on the server running the virtual machine, a hash of a unique value known only to the server running the virtual machine is used to verify the origin of update operations that have been transmitted by the server to the other servers storing replications of the disk image for failover purposes. If verified, the update operations are added to such failover disk images. | 01-27-2011 |
20110029497 | Apparatus, System, and Method for Enhanced Block-Level Deduplication - An apparatus, system, and method are disclosed for enhanced block-level deduplication. A computer program product stores one or more express block signatures in an express directory that meet a reference count requirement. The computer program product also stores one or more primary block signatures and one or more reference counts for the primary block signatures in a primary directory. Each primary block signature has a corresponding reference count. The computer program product determines whether a block signature for a data block matches one of the one or more express block signatures stored in the express directory. | 02-03-2011 |
20110055179 | System for and method of partial file hashing - A system for and method of partial file hashing is presented. The system and method may generate a hash table file using a hash algorithm on portions of a file before transmitting the file. The receiving system may calculate hash values on one or more portions of a file and compare the values to the values in the hash table file. | 03-03-2011 |
20110106776 | INCREMENTAL IMPLEMENTATION OF UNDO/REDO SUPPORT IN LEGACY APPLICATIONS - Systems and methods are described for incremental implementation of undo\redo support in legacy applications. In one implementation, a system enables a per-object undo/redo process to be realized in pre-existing computer programs that have limited or no undo/redo functionality, while minimizing changes to such pre-existing computer programs. An innovative process stores an undo/redo instruction for each user-initiated operation in a data structure, classifies each undo/redo instruction under one or more objects affected by the operation, or vice/versa, and verifies the validity of each undo/redo instruction before performing an undo/redo. In one implementation, the process stores only undo/redo instructions in the data structure for those operations that can be validated beforehand as being undoable/redoable. Various data structure schemes are available, each of which may increase performance while implementing the undo-redo support for a given legacy software, e.g., by increasing speed and/or decreasing data size, memory consumption, disk consumption, power consumption, and so forth. The ability to validate undoability/redoability before performing an undo/redo operation gives the architecture versatility for updating many different applications. | 05-05-2011 |
20110167050 | SECURE SYSTEM FOR ALLOWING THE EXECUTION OF AUTHORIZED COMPUTER PROGRAM CODE - Systems and methods for allowing authorized code to execute on a computer system are provided. According to one embodiment, file or operating system activity relating to a code module is intercepted. A cryptographic hash value of the code module is authenticated with reference to a multi-level whitelist, which includes a remote global whitelist and a local whitelist. The remote global whitelist is maintained by a trusted service provider and contains cryptographic hash values of approved code modules known not to contain malicious code. The local whitelist is accessible by computer systems within the LAN and contains cryptographic hash values of a subset of the approved code modules. The cryptographic hash value is checked against the local whitelist. If no match is found, it is checked against the global whitelist. The code module is allowed to be loaded and executed if the cryptographic hash value corresponds to an approved code module. | 07-07-2011 |
20110238639 | INFORMATION PROCESSING APPARATUS - When accepting a write request including a data, an apparatus | 09-29-2011 |
20110246433 | RANDOM NUMBER BASED DATA INTEGRITY VERIFICATION METHOD AND SYSTEM FOR DISTRIBUTED CLOUD STORAGE - A data integrity verification method and system based on a root random number to ensure secure distributed data storage on a public cloud. A new root random number can be generated in response to receiving a file for storage to the public cloud. A unique random number tag for each data chunk associated with the file can be calculated via a shift operation and the tag can be added to the data chunk. A hash function (message digests) can be then generated and concatenated with the data chunk and the random number tag. The data chunk in conjunction with the hash and the random number tag can be encrypted by an encryption module and stored to the public cloud in order to provide multiple levels of security with respect to the distributed public cloud storage. Upon file retrieval, the encryption module decrypts all data chunks and recalculates the hash in order to verify the data integrity of the file. | 10-06-2011 |
20110264637 | METHOD AND A SYSTEM FOR INFORMATION IDENTIFICATION - A method for detecting an information item within an information sequence obtained from a digital medium, said information item comprising any one of a specified set of prestored information items, comprising: transforming each of the set of prestored information items into a respective representation, in accordance with a predetermined transformation format; transforming the information sequence obtained from the digital medium, in accordance with the transformation format; and determining the presence of one or more of the prestored information items within the transformed information sequence, utilizing the respective representation, wherein the information items are divided into sets, and applying a security policy that depends on the number of detected information items that belong to the same set. | 10-27-2011 |
20110270811 | METHOD AND APPARATUS FOR ADDING A DATABASE PARTITION - A data repository system and method are provided. A method in accordance with an embodiment includes an operation that can be used to port data from one or more existing database partitions to new database partitions according to a minimally progressive hash. The method can be used to increase the overall size of databases while a system runs hot, with little or no downtime. | 11-03-2011 |
20120005173 | DETERMINING EQUIVALENCE OF LARGE STATE REPOSITORIES UTILIZING THE COMPOSITION OF AN INJECTIVE FUNCTION AND A CRYPTOGRAPHIC HASH FUNCTION - An injective function can execute against two different data repositories to generate a textual state representation for each of the different data repositories. The injective function can be a function that preserves distinctness, where the distinctiveness can be a one-to-one mapping of each element within the element domain to one element of a co-domain. The hash function can be executed for each of the different textual state representations to generate a corresponding hash number. The hash numbers can be compared to each other. When results from the comparing indicate the hash numbers are equivalent, the two different data repositories can be determined to be equivalent to each other and when results indicates the hash numbers are not equivalent, the two different data repositories can be determined to be not equivalent to each other. | 01-05-2012 |
20120016852 | COLLABORATIVE, DISTRIBUTED, DATA DE-DUPLICATION - Example apparatus, methods, and computers participate in collaborative, distributed, data de-duplication. One example method includes initializing a layered parser in a first node in a collaborative distributed data de-duplication (CDDD) topology with a first set of de-duplication control parameters. After transmitting some information to another node in the CDDD topology, the method includes selectively reconfiguring the layered parser in response to feedback acquired from the second node in the CDDD topology. The feedback concerns the data provided by the layered parser. | 01-19-2012 |
20120047116 | VALIDATING SENSOR DATA REPRESENTED BY CHARACTERISTIC FUNCTIONS - According to certain embodiments, a characteristic function representing data is received. A first hash code calculated from the characteristic function is received. The characteristic function is transformed to an arithmetic function. A second hash code is calculated from the arithmetic function. If the first hash code equals the second hash code, the data is designated as valid; otherwise, the data is designated as invalid. | 02-23-2012 |
20120078863 | APPLICATION CONTROL CONSTRAINT ENFORCEMENT - Systems and methods for performing application control constraint enforcement are provided. According to one embodiment, file system or operating system activity of a computer system is intercepted relating to a code module. A cryptographic hash value of the code module is checked against a local whitelist database containing cryptographic hash values of approved code modules, which are known not to contain viruses or malicious code. The local whitelist database also contains execution constraint information. When the cryptographic hash value matches one of the cryptographic hash values of approved code modules, authority of the computer system or an end user of the computer system to execute the code module is further validated if the execution constraint information so indicates by performing a constraint check regarding the code module. If the authority is affirmed by the constraint check, then allowing the code module to be executed. | 03-29-2012 |
20120084272 | FILE SYSTEM SUPPORT FOR INERT FILES - A method for storing a file on a data storage device. The method includes: storing the file in one of a first and a second file system; calculating a hash value; and storing the hash value on a storage device if it is stored in the second file system. A data processing system includes a first file system and a second file system wherein the data processing system calculates and stores a hash value when the file is stored in the second file system. A method for reading a file from a file system including: receiving a read command; reading a first hash value from a storage device; reading the file from the storage device; calculating a second hash value; returning the file when the first hash value equals the second hash value and returning an error when it does not equal the second hash value. | 04-05-2012 |
20120136846 | METHODS OF HASHING FOR NETWORKS AND SYSTEMS THEREOF - Example embodiments are directed to methods of hashing for networks and systems thereof. At least one example embodiment provides a method of processing elements in a system. The method includes receiving a first element, generating a first plurality of hash values based on the first element and a first plurality of hash functions, determining a first plurality of buckets in a table based on the first plurality of hash values, each of the first plurality of buckets associated with a different one of the hash values, selecting one of the first plurality of buckets, storing a first associated value in the selected bucket, the first associated value being associated with the first element, and encoding an identifier (ID) of the hash function generating the hash value associated with the selected bucket into a filter based on the hash value. | 05-31-2012 |
20120173497 | DEFENSE-IN-DEPTH SECURITY FOR BYTECODE EXECUTABLES - Defense-in Depth security defines a set of graduated security tasks, each of which performs a task that must complete before another task can complete. Only when these tasks complete successfully and in the order prescribed by Defense-in-Depth security criteria is a final process allowed to execute. Through such Defense-in-Depth security measures, vulnerable software, such as bytecode, can be verified as unaltered and executed in a secure environment that prohibits unsecured access to the underlying code. | 07-05-2012 |
20120203748 | SURROGATE HASHING - Surrogate hashing is described, including running a hashing algorithm against a portion of a file to generate a hash value, determining whether the hash value is substantially similar to a stored hash value associated with another portion of another file, the portion and the another portion being standardized, and identifying a location of the another file if the hash value is substantially similar to the stored hash value associated with the another portion of the another file. | 08-09-2012 |
20120226672 | Method and Apparatus to Align and Deduplicate Objects - In deduplicating data including objects, the system obtains information of the location of the objects and uses the information in calculating the hash value. The hash value calculation program divides data from the boundary location to chunks to match the boundary location of the objects subject to deduplication and the hash value is calculated from each chunk. | 09-06-2012 |
20120259825 | DATA MANAGEMENT METHOD AND DATA MANAGEMENT SYSTEM - A data management system respectively computes first hash values while sliding a window a prescribed amount at a time with respect to a prescribed range from a start location of a data block to a prescribed size. The system extracts, from among the first hash values, a first hash value, which is equivalent to a characteristic value, and partitions the data block into a first chunk of data at a location corresponding to this first hash value. The system determines coincidence between a first chunk of data and a stored second chunk of data, and prevents duplicate data from being stored twice. | 10-11-2012 |
20130036103 | Software Part Validation Using Hash Values - A system and method for validating software parts on an aircraft. A first hash value is calculated for a software part on the aircraft. A determination is made on the aircraft as to whether the first hash value matches a second hash value from a software integrity data structure stored on the aircraft. The software integrity data structure comprises the hash values that are not determined on the aircraft for the software parts used by the aircraft. A validation status is provided based on whether the first hash value matches the second hash value. An operation is performed on the software part on the aircraft only if the first hash value matches the second hash value. | 02-07-2013 |
20130036104 | METHOD AND APPARATUS FOR MANAGING DATA OBJECTS OF A DATA STORAGE SYSTEM - Techniques for managing data objects of a data storage system are described herein. According to one embodiment, a hash function is generated for a plurality of data objects by analyzing each of the data objects stored in the data storage system. For each of the data objects, a hash operation is performed on the data object using the hash function, generating a hash value. The hash value is associated with a predetermined attribute of the data object, such that the predetermined attribute of the data object is uniquely identified using the hash function subsequently in response to a request for accessing the predetermined attribute of the data object. The data object is then stored at a persistent storage location of the data storage system, wherein the persistent storage location is identifiable based on a hash value obtained from the hash function. | 02-07-2013 |
20130086017 | GENERATING PROGRESSIVELY A PERFECT HASH DATA STRUCTURE, SUCH AS A MULTI-DIMENSIONAL PERFECT HASH DATA STRUCTURE, AND USING THE GENERATED DATA STRUCTURE FOR HIGH-SPEED STRING MATCHING - A multi-dimensional perfect hash table construction technique is based on which the well-known AC automaton, and can be implemented by very compact perfect hash tables. The technique may place transitions, each from a source state to a destination state, of an automaton into a hash table to generate a perfect hash table by: (a) dividing the transitions into multiple independent sets according to their respective source states; (b) ordering the sets of transitions based on the number of transitions belonging to the set, thereby defining an order of the sets from largest to smallest; and (c) constructing a perfect hash table by, for each of the sets of transitions, in the order from largest to smallest, hashing the transitions of the set into the hashing table to generate a perfect hashing table. | 04-04-2013 |
20130138620 | OPTIMIZATION OF FINGERPRINT-BASED DEDUPLICATION - Described are embodiments of an invention for identifying chunk boundaries for optimization of fingerprint-based deduplication in a computing environment. Storage objects that are backed up in a computing environment are often compound storage objects which include many individual storage objects. The computing device of the computing environment breaks the storage objects into chunks of data by determining a hash value on a range of data. The computing device creates an artificial chunk boundary when the end of data of the storage object is reached. When an artificial chunk boundary is created for the end of data of a storage object, the computing device stores a pseudo fingerprint for the artificial chunk boundary. If a hash value matches a fingerprint or a pseudo fingerprint, then the computing device determines that the range of data corresponds to a chunk and the computing system defines the chunk boundaries. | 05-30-2013 |
20130212078 | Detecting and Combating Attack In Protection System of an Industrial Control System - A method for detecting and combating an attack in an industrial control system includes sending a command stream from a protection network of an industrial control system to at least one zone, the command stream comprising at least one command; concatenating the at least one command into at least one sequential command package comprising units or work; passing the at least one sequential command package to a crypto hash generator; generating at least one of unit of work hash codes or sequence hash codes; comparing the generated hash codes against a database of existing valid unit of work hash codes and sequence hash codes; and if a command stream fault is detected, generating an alert and accessing a database comprising emergency procedures. | 08-15-2013 |
20130226888 | SYSTEMS AND METHODS FOR CACHING DATA FILES - Systems and methods including storage systems that employ local file caching processes and that generate state variables to record, for subsequent use, intermediate states of a file hash process. In certain specific examples, there are systems that interrupt a hash process as it processes the data blocks of a file, and stores the current product of the interrupted hash process as a state variable that represents the hash value generated from the data blocks processed prior to the interruption. After interruption, the hash process continues processing the file data blocks. The stored state variables may be organized into a table that associates the state variables with the range of data blocks that were processed to generate the respective state variable. Such exemplary systems can be used with any type of storage system, including filers, database systems or other storage applications. | 08-29-2013 |
20130246378 | PARTIAL HASH SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT - A system, method, and computer program product are provided for outputting a signal based on a partial hash comparison. In use, data is identified. In addition, a partial hash is determined utilizing a portion of the data. Further, the partial hash is compared with a plurality of known partial hashes, and an additional hash is conditionally determined based on the comparison. Still yet, a signal is output based on the comparison. | 09-19-2013 |
20130262421 | CHECKSUM AND HASHING OPERATIONS RESILIENT TO MALICIOUS INPUT DATA - A resilient hashing system leverages a fast, non-cryptographic hash/checksum function that has good diffusion properties while remaining reasonably efficient on modern central processing units (CPUs). The hash function uses random secret data so that hash keys for particular data are difficult to predict. Due to its internal structure, well-chosen random secret data is difficult for an attacker to counter without having access to the direct output of the hash function. At every stage of the block function, there are at least two operations that can be performed in parallel, increasing performance on modern superscalar CPUs. Thus, the resilient hashing system provides a hash table and checksum that can be used in Internet-facing or other vulnerable sources of input data to manage performance in the face of malicious attacks. | 10-03-2013 |
20130282679 | METHOD AND SYSTEM FOR ANONYMIZING DATA DURING EXPORT - The present invention refers to a computer-implemented method of anonymizing data of a database ( | 10-24-2013 |
20130290285 | DIGEST GENERATION - In one embodiment, circuitry may generate digests to be combined to produce a hash value. The digests may include at least one digest and at least one other digest generated based at least in part upon at least one CRC value and at least one other CRC value. The circuitry may include cyclical redundancy check (CRC) generator circuitry to generate the at least one CRC value based at least in part upon at least one input string. The CRC generator circuitry also may generate the at least one other CRC value based least in part upon at least one other input string. The at least one other input string resulting at least in part from at least one pseudorandom operation involving, at least in part, the at least one input string. Many modifications, variations, and alternatives are possible without departing from this embodiment. | 10-31-2013 |
20130297579 | CODE REGENERATION DETERMINATION FROM SELECTED METADATA FINGERPRINTS - A fingerprint is computed from selected metadata of binary files, and used in determining whether to regenerate code-behind file(s). In one case, after ascertaining that a binary-file-set's current metadata-fingerprint differs from a previous metadata-fingerprint, the corresponding code-behind-file-set is regenerated. A code-behind file may also be regenerated, even though its current fingerprint matches its previous fingerprint, because its metadata has changed. If the current fingerprint matches the previous fingerprint and metadata is unchanged, regeneration can be avoided. The fingerprint may consist of, or merely contain, definitions of classes, properties, and other items, and may be limited to metadata that is used when generating the code-behind-file-set. System assemblies are not fingerprinted. Timestamps may be used. Metadata-fingerprint computation code and regeneration determination code are described. Metadata-fingerprints may be used in developing applications with web-based application code frameworks, frameworks having code for rendering a user interface, other frameworks, XAML, C#, and other programming languages. | 11-07-2013 |
20130311436 | COMPUTER INTERFACE SYSTEM - An improved computer system may include a controller including a computer processor. The system may also include a selector apparatus in communication with the controller to choose a table having a higher collision quality index than other tables under consideration by the selector apparatus. The system may further include an exchanger apparatus to configure a standby table that replaces the table chosen by the selector apparatus. The system may additionally include a switch that changes a hash function based upon the exchanger apparatus' replacement of the chosen table to enable the controller to reduce insertion times and/or collisions when interfacing with new components introduced to the controller. | 11-21-2013 |
20130325824 | OFFLINE VERIFICATION OF REPLICATED FILE SYSTEM - Embodiments of the invention include systems and methods for providing block-level verification of replicated file systems. Embodiments operate in context of data storage environments, which may typically have multiple file systems, snapshots of file systems, and replicas of file systems. In one illustrative scenario, a replica is created of a file system having multiple associated snapshots, and a user desires to verify the accuracy of the replica. A signature is created for each of the source active file system and the target replica file system, so that each signature includes records of both block-level signatures and block-level allocations. The signatures are compared to discover any differences. The differences may then be reconciled, where possible, to determine whether the differences indicate a corrupt or otherwise invalid replica. | 12-05-2013 |
20130332431 | CLOSED ITEMSET MINING USING DIFFERENCE UPDATE - Embodiments are directed to, for a database comprising a set of transactions, with each transaction including an itemset comprising one or more individual items, obtaining a set of all closed frequent itemsets by checking frequencies of transaction sets, wherein a given itemset, I, is frequent where at least some threshold number (μ) of transactions contain I, and wherein the given itemset I is closed wherein it is impossible to add any item to I without changing the frequency thereof. | 12-12-2013 |
20130332432 | CLOSED ITEMSET MINING USING DIFFERENCE UPDATE - Embodiments are directed to, for a database comprising a set of transactions, with each transaction including an itemset comprising one or more individual items, obtaining a set of all closed frequent itemsets by checking frequencies of transaction sets, wherein a given itemset, I, is frequent where at least some threshold number (μ) of transactions contain I, and wherein the given itemset I is closed wherein it is impossible to add any item to I without changing the frequency thereof. | 12-12-2013 |
20140012829 | EFFICIENT STRING HASH COMPUTATION - A method for efficiently computing a hash value for a string is disclosed. In one embodiment, such a method includes receiving an original string comprising multiple characters. The method computes an original hash value for the original string. The method produces an updated string by performing at least one of the following updates on the original string: adding leading/trailing characters to the original string; removing leading/trailing characters from the original string, and modifying characters of the original string while preserving the length of the original string. The method then computes an updated hash value for the updated string by performing at least one operation on the original hash value, wherein the at least one operation takes into account the updates that were made to the original string. A corresponding apparatus and computer program product are also disclosed. | 01-09-2014 |
20140032513 | DETERMINATION OF DIFFERENCES BETWEEN ELECTRONIC DOCUMENTS - In some example, a computerized method includes receiving a first electronic document and a second electronic document. The method also includes determining a difference between the first electronic document and the second electronic document based on matching of a component of the first electronic document to a component of the second electronic document in a hierarchical order. The method includes storing the difference in a machine-readable medium. | 01-30-2014 |
20140052706 | ARCHIVAL STORAGE AND RETRIEVAL SYSTEM - A highly reliable data archival and retrieval method that enables fine grained control over data availability is implemented across a Quality of Service driven archival system, configured to fragment the data into data and parity chunks for storing onto the storage node. The technique employed by the archival system enables files to be read without having need to access any metadata, thereby tolerating complete loss of such metadata. Further, the Quality of Service driven system architecture improves upon the system performance and throughput by means of a storage node regeneration process which ensures balanced load on participating storage node during various storage, retrieval and regeneration operations. | 02-20-2014 |
20140059026 | TEST DATA GENERATION AND SCALE UP FOR DATABASE TESTING USING UNIQUE COMMON FACTOR SEQUENCING - Embodiments of the present invention provide a system and computer program product for test data generation using unique common factor sequencing. In an embodiment of the invention, a computer program product for test data generation using unique common factor sequencing is provided. The computer program product includes loading a table for population with test data in a test data generation tool executing in memory of a computer. A column set of multiple columns in the table associated with a key to the table can be selected for processing and different cardinality sequence values are assigned to the columns in the set such that the cardinality sequence values do not share a common factor except for unity as in the case of prime numbers. | 02-27-2014 |
20140095458 | STORAGE DEVICE FOR STORING DIRECTORY ENTRIES, DIRECTORY ENTRY LOOKUP APPARATUS AND METHOD, AND STORAGE MEDIUM STORING DIRECTORY ENTRY LOOKUP PROGRAM - A storage device, a directory entry lookup method for the storage device, and a host running the method can provide a quick directory entry lookup. The host includes an interface for exchanging data with the storage device which stores a multi-level hash table comprising directory entries of each directory, and a file system module receiving a file lookup command designating a target directory and a target filename, calculating a hash value which reflects the target filename and a lookup level, and searching for a directory entry which comprises the target filename in a bucket corresponding to the hash value from among buckets at the lookup level which are included in a multi-level hash table of the target directory. If the search for the directory entry fails, the file system module increases the lookup level and again calculates the hash value and searches for the directory entry for the target filename. | 04-03-2014 |
20140181057 | SYSTEM AND METHOD FOR PREVENTING DUPLICATE UPLOADS OF MODIFIED PHOTOS IN A SYNCHRONIZED CONTENT MANAGEMENT SYSTEM - A method and system for automatically rotating image files and preventing duplicate uploads in a remote file storage system is described. The system receives an image file. The system calculates a hash value associated with newly uploaded files. The system then automatically rotates the images based on orientation data associated with the files (if included). The system then compares the hash value(s) associated with the new file(s) with the hash values from the existing files stored on the remote file storage system. If the hash values of any of the new files to be uploaded match a hash value on the hash value list, then the system prevents the new files from being uploaded to the remote file storage system. | 06-26-2014 |
20140181058 | APPARATUS FOR AUTHENTICATION OF SOLUTION TOPOLOGY - A computer implemented method is provided to verify an integrity of a solution. The computer implemented method comprises hashing, by a computer, a set of virtual machine instances in a solution topology of the solution. The computer hashes a set of connections in the solution topology. The set of connections comprising a connection between ones of the set of virtual machine instances, a connection between a first component of a first one of the set of virtual machine instances and a second component of a second one of the set of virtual machine instances, and combinations thereof. The computer hashes a set of solution-specific information, and then signs the hashes to create a first signed topology. | 06-26-2014 |
20140188828 | CONTROLLING SEGMENT SIZE DISTRIBUTION IN HASH-BASED DEDUPLICATION - Segment sizes are controlled by setting the size of a segment boundary in a hash-based deduplication system. A subsequence of size K of a sequence of characters S is set. An increasing sequence of n probabilities and a corresponding sequence of n decreasingly restrictive logical tests are chosen to be applied on the sequence of characters S. Segment boundaries are set by using the sequence of the decreasingly restrictive logical tests by deciding to declare a segment boundary at a current position if one of the sequence of the decreasingly restrictive logical tests, with a corresponding probability of the sequence of n probabilities, returns a true value when applied on the sequence of characters S. | 07-03-2014 |
20140258253 | SUMMARIZING A STREAM OF MULTIDIMENSIONAL, AXIS-ALIGNED RECTANGLES - A method for estimating aggregates over a stream of axis-aligned rectangles, includes: decomposing the stream along one-dimensional intervals, wherein vertices for the rectangle are located in a predetermined grid; assigning each grid row to buckets, wherein the one-dimensional intervals are placed into buckets according to the corresponding rows in which the one-dimensional intervals are positioned; and estimating a sum of a number of grid points touched by at least one of the rectangles in each row of the grid to approximate a volume of the axis-aligned rectangles by: using pairwise-independent hash functions in a multi-dimensional algorithm to determine buckets that include a first interval corresponding to a given rectangle, wherein the interval has hash function results that meet a predetermined threshold; and inserting a second interval for the rectangle corresponding to the first interval into a one-dimensional algorithm for the corresponding bucket meeting the predetermined threshold. | 09-11-2014 |
20140279984 | Systems And Methods For Managing Data - Systems and methods for data management are disclosed. One method can comprise receiving first data from one or more data sources and forming a classification group from the one or more data sources based upon one or more classifiers. The method can also comprise generating an identifier for the classification group by applying a function to the first data and/or the one or more classifiers. Second data can be received from the one or more data sources of the classification group and the second data can be associated with the identifier of the classification group. | 09-18-2014 |
20140279985 | Extending Platform Trust During Program Updates - An approach is provided in which a computer system generates a current hash value of a computer program in response to receiving a request to execute the computer program. Next, the computer system determines that the current hash value fails to match a reference hash value that was previously generated subsequent to installing the computer program on the computer system. Since the two hash values do not match each other, the computer system matches the current hash value to an updated hash value that was previously generated in response to modifying the computer program on the computer system. In turn, the computer system executes the computer program when the current hash value matches the updated hash value. | 09-18-2014 |
20140330801 | LOCK-FREE CREATION OF HASH TABLES IN PARALLEL - A hash table is created in parallel without requiring a lock or random accesses to memory. The hash table of a database system is logically partitioned and a separate thread is assigned to each partition of the hash table. As many separate threads as can fit their corresponding hash table partitions into the processor's cache are executed in parallel with other threads without a lock. Execution of a number of separate threads includes: scanning an input data table for a thread's partition and applying a hash function to each key, inserting data of keys that hash to the thread's partition into the thread's partition, and ignoring keys that do not hash to the thread's partition. | 11-06-2014 |
20140337301 | BIG DATA EXTRACTION SYSTEM AND METHOD - Disclosed herein are a big data extraction system and method. The big data extraction system includes a data buffer unit for hooking the file message of an operating system, extracting some data from the original data based on the hooked file message, and storing the extracted some data in memory, a data generation unit for generating hash data of the stored some data, verifying the hash data of the stored some data, and generating regeneration data corresponding to the original data based on a result of the verification, and a data storage unit for storing the regeneration data. | 11-13-2014 |
20140372393 | DATA ARCHIVING SYSTEM - An encrypted file storage solution consists of a cluster of processing nodes, external data storage, and a software agent (the “File System Watcher”), which is installed on the application servers. Cluster sizes of one node up to many hundreds of nodes are possible. There are also remote “Key Servers” which provide various services to one or more clusters. The preceding describes a preferred embodiment, though in some cases it may be desirable to “collapse” some of the functionality into a smaller number of hardware devices, typically trading off cost versus security and fault-tolerance. | 12-18-2014 |
20150095298 | Method for Tracking a Schema in a Schema-Less Database - Systems and methods are described for obtaining, for insertion into a schema-less database, a data object that comprises a plurality of key and value pairs. The method also includes hashing the keys associated with the plurality of key and value pairs. The hashing includes executing a hash function to generate a hashed data object. The method also includes comparing the hashed data object to a plurality of first hashed data objects and determining that the hashed data object does not match any of the first hashed data objects. Based on the determining, the method includes associating the hashed data object with the first hashed data objects to generate second hashed data objects and generating a schema for the database. The schema includes a hierarchy of keys that represent the second hashed data objects. | 04-02-2015 |
20150100558 | Method, Apparatus and Computer Program Product for Similarity Determination in Multimedia Content - In an example embodiment, a method, apparatus and computer program product are provided. The method includes determining an upper bound on a probability of error associated with a mapping of a data into binary codes. The mapping is performed based on a plurality of hash functions. The method further includes selecting a set of hash functions from among the plurality of hash functions associated with a minimization of the upper bound on the probability of error. | 04-09-2015 |
20150142765 | SYSTEM AND METHOD FOR ENABLING REMOTE FILE ACCESS VIA A REFERENCE FILE STORED AT A LOCAL DEVICE THAT REFERENCES THE CONTENT OF THE FILE - A computing system may include multiple computing devices. A file at a computing device may be accessed based on a reference file stored at the device that comprises a hash value of the content of the file. The hash value may be independent of the file location or file name and include a representation of the content of the file such that a given hash value is unique for given content. For example, the hash value may be generated using a hash function on the content of the file. The hash function may be generated by the hash function that reproducibly identifies the file based on the content of the file. In this manner, the reference file may be used to uniquely identify a file as well as serve as a basis for checking the integrity of files transmitted over a network from one computing device to another computing device. | 05-21-2015 |
20160070700 | TRANSACTION SUPPORT USING INTRUSIVE HASH TABLES - Disclosed herein are system, method, and computer program product embodiments for utilizing an intrusive data hash table to support processing transactions. An embodiment operates by receiving a transaction comprising a plurality of operations. Responsive to the receiving, the transaction is verified by verifying the validity of the plurality of operations. Responsive to verifying the transaction, the transaction is applied to the intrusive hash table. | 03-10-2016 |
20160171039 | GENERATING HASH VALUES | 06-16-2016 |