Abstract: 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.

Abstract: When accepting a write request including a data, an apparatus 100A acquires a first hash value based on a first hash function and, meanwhile, acquires a second hash value based on a second hash function. When a storage device 110A has not stored the acquired first hash value and second hash value in correlation with each other, the apparatus correlates the data, the first hash value, the second hash value, and information of referenced times, and then stores the correlated items into the storage device. On the other hand, when the storage device has stored the acquired first hash value and second hash value in correlation with each other, the apparatus changes the information of referenced times stored in correlation with the first hash value and the second hash value so as to add one to the number of times denoted by the information of referenced times.

Abstract: A method (and structure) of storing schema-less data of a dataset in a relational database, includes constructing a hash table for the schema-less data, using a processor on a computer. Data in the dataset is stored in a tuple format including a subject along with at least one other entity associated to the subject. Each row of the hashtable will be dedicated to a subject of the dataset, and at least one of the at least one other entity associated with the subject in the row is to be stored in a pair-wise manner in that row of the hashtable. In an exemplary embodiment, RDF data that uses triples (subject, predicate, object) is stored with the predicate/object stored in the pair-wise manner in its associated subject row.

Abstract: A network optimization device may receive a stream of data and generate a signature for a plurality of fixed length overlapping windows of the stream of data. The device may select a predetermined number of the generated signatures for each Ln-byte segment of the data stream, wherein Ln is greater than a length of each of the windows. The network device may store the selected signatures in a bucketed hash table that includes a linked-list of entries for each bucket.

Abstract: Method, system, and computer program product embodiments for facilitating data compression are provided. A set of logical extents, each having compressed logical tracks of data, is mapped to a head physical extent and, if the head physical extent is determined to have been filled, to at least one overflow extent having spatial proximity to the head physical extent. Pursuant to at least one subsequent write operation and destage operation, the at least one subsequent write operation and destage operation determined to be associated with the head physical extent, the write operation is mapped to one of the head physical extent, the at least one overflow extent, and an additional extent having spatial proximity to the at least one overflow extent.

Abstract: The present invention is directed towards systems and methods for discovering story trends. The method and system according to one embodiment includes receiving a fixed size data stream, identifying a first set of words within the data stream and electronically determining which words in the first set of words are present in a word cache. The method and system then identifies a second set of words within the data stream for each word present within the word cache and electronically determines which words in the second set of words are present in a subword cache, updating the subword cache based on the determination and identifying a third set of words based on the determination. The method and system then electronically determines at least one story trend associated with the third set of words and electronically generating a story hash associated with the third set of words. Finally, the method and system stores the third set of words in a story lookup table and stores the story hash in a story trend cache.

Abstract: Techniques are described herein for efficient and scalable processing of complex sets of XML schemas. The techniques described herein provide for reducing duplication of schema elements in volatile memory by building an XML schema in-memory model that stores repeating schema elements in in-memory data structures that are separate from in-memory data structures that store the parent schema elements which logically include or otherwise refer to the repeating schema elements. The techniques described herein also provide for faster generation of an in-memory model of an XML schema by pre-loading, in data structures on persistent storage, of schema elements from dependent XML schemas that are referenced and/or incorporated by the XML schema.

Abstract: A system and method for identifying data fields for remote address cleansing, whereby a plurality of address file hash values are stored and associated with a plurality of known address data file profiles. An uploaded address file is received at the processing site from a sender who wishes to have his address list processed. A received address data file profile is identified for the uploaded address file. A first hash value is calculated based on the identified received address data file profile. The first hash value is compared with the stored plurality of address file hash values. If the first hash value matches one of the stored plurality of hash values, then the known address data profile of the matching stored hash value is associated with the uploaded address file. If the first hash value does not match any of the stored plurality of hash values, then preparing a new address file profile, generating a new hash of the new profile, and storing the new profile along with the associated new hash.

Abstract: The present invention provides a search device, a search method and a program which improves the search speed in a longest prefix or suffix match search. At the time of registration, the search device stores an inputted registered pattern, generates one or more set of a first character string which has a length of a multiple of a predetermined number of characters and a remaining second character string by dividing the registered pattern into two, obtains a plurality of hash values by applying a plurality of hash functions to the first character string, and updates the contents which the plurality of hash values indicate.

Abstract: Systems and methods for conversion and importation of models that describe system behavior into a UML meta model-based representation, include parsing through the textual model for the plurality of elements, searching for an element semantic definition, element view definitions corresponding to a semantic definition, or an element view containing diagram definition within the textual model for each of the plurality of elements, generating element reference nodes for placement on an internally constructed custom tree, attaching a listener to each of the element reference nodes, wherein the listener is configured to await population of the element reference node with an equivalent unified modeling language semantic element, wherein a listener awaiting population is an awaiting sequenced listener, completing an inheritance hierarchy between the element reference nodes up to a parent node inferred from the diagramming definitions and resolving awaiting sequenced listeners that are made aware of an awaited unified

Abstract: The system enables a data processing framework that polls for files using a listener, controls the workflow using event driven logic, processes financial transactions, and creates a business to business trading partner network. The listener ensures the reliability and data integrity of input files and performs archiving functions. The payment management functions automatically processes transactions, including payor (e.g., the buyer) initiated payments to a payee (e.g., a supplier) by utilizing a flexible, decoupled processing architecture. A payment management computer identifies a universal identifier for each entity and forms relationships and hierarchies in order to increase efficiency of the trading partner network. Metadata describes the format, validation and relationships for a wide variety of financial account data.

Abstract: 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.

Abstract: Prefixes are registered on a first list as index elements for respective registration patterns. Each prefix is selected as the longest of different-length prefixes that are extractable from a registration pattern in accordance with an extraction rule. Suffixes, which are the remaining parts of the registration patterns excluding the respective prefixes, are registered on a second list. Using different-length prefixes that are extracted from a retrieval key in accordance with the extraction rule, a prefix retriever searches the first list to retrieve a registration pattern whose prefix matches any of the prefixes of the retrieval key. A suffix checker carries out a check on the suffix of the registration pattern retrieved by the prefix retriever, among the suffixes on the second list, as to whether the suffix of the registration pattern matches the suffix of the retrieval key.

Abstract: An approach is provided for reducing decision diagram related communication traffic and cost by querying unknown hash identifiers. A hash identifier application receives a hash identifier that is computed based on a reduced ordered binary decision diagram constructed for a resource description framework graph. The hash identifier application determines whether the received hash identifier matches a predetermined one of a plurality of hash identifiers. The hash identifier application reconstructs or queries for the decision diagram, when there is no match.

Abstract: An achieve device includes: a storage for storing divided data and attribute information, the divided data being received from an external device and divided from original data by a predetermined size, the attribute information being associated with a hash value and identification information, the hash value being calculated from the divided data, the identification information identifying the original data before being divided; and a controller for calculating a hash value for divided data that is received from the external device, writing the divided data and the attribute information corresponding to the divided data to the storage when the calculated hash value is not included in the attribute information stored in the storage, and adding the identification information corresponding to the calculated hash value to the attribute information when the calculated hash value is included in the attribute information stored in the storage.

Abstract: Methods and apparatus for enhanced overlay state maintenance in a peer-to-peer overlay network. A first method includes inferring that a first node is leaving the overlay network, and transmitting a decrement message to decrement a size counter value. A second method includes identifying a set of nodes associated with a first node of an overlay network, obtaining a segment length associated with each node of the set of nodes, and determining a size of the overlay network by dividing the total number of nodes in the set of nodes by the sum of the segment lengths. A third method includes identifying a set of nodes associated with a first node of an overlay network, obtaining a size estimate associated with the first node and with each node of the set of nodes, and determining a size of the overlay network by averaging the size estimates.

Abstract: A method to improve the effectiveness of hash-based data structures includes configuration of a data structure and transformation of hash codes as produced by a hash function, to yield a more uniform distribution of data amongst the slots in a data structure. Transformation results in a non-uniform but predictable distribution of hash codes. Configuration exploits the predictable nature of the transformed hash codes to accomplish more uniform and therefore more efficient distribution of items stored in a hash-based data structure.

Abstract: A system and method for recognizing an entity rising in public awareness and tracking the growth of such awareness through the automated analysis and collection of quantitative and contextual frame-related data, and for presenting an objective measurement to one or more users of such system. A first portion of the invention is directed toward initial recognition of an entity wherein the system detects proper nouns of a person, place, or thing using natural language algorithms to detect patterns. A second portion of the invention is directed toward detection of popularity lift wherein the system uses a variety of methods to detect popularity lift, including frequency of mentions in RSS feeds, search engine reporting, and various user inputs such as user-generated content, data available in various social media forums, and Internet usage patterns.

Abstract: Techniques for checking content for style. Content that identifies a rule set is identified. The rule set includes rules of differing scope. The scope for some rules may be paragraph scope while the scope for other rules may be document scope. Conditions of rules of the rule set having differing scopes are checked. When conditions for one or more of the rules are met, actions specified for corresponding rules are performed. Users may be provided tools for creating or customizing rules.

Abstract: In general, the invention relates to supporting multiple different character encodings in the same file system. In one embodiment, a method is provided for filename lookup that supports multiple character encodings. The method comprises storing filename data in a first character encoding into an indexed data structure. The method further comprises receiving filename data in a second encoding. The method also comprises looking up filename data in the indexed data structure using the second encoding.

Abstract: A system and method for efficiently executing a plurality of live parallel Internet content usage experiments using a large pool of randomly selected participating users (separated into control and test groups) while minimally disturbing offered content is provided. In an illustrative implementation, a content provider communicates the parameters for a content usage experiment to a content server. A complimentary test subject verification script operates on the content server that determines which client computing devices are to be included in the experiment group. In operation, a participating client computing device requests content from the content provider's server. The content provider's server executes the test subject verification script to determine if the client computing device is to be considered as a test subject. The content usage of the experiment content and non-experiment content is tracked and compared to each other to determine if the experiment content impacted content usage.

Abstract: A document checking apparatus includes a keyword appearance position extracting unit that extracts keywords and the appearance positions of the keywords from a target document including a confidential document; a keyword pair extracting unit that treats each keyword of the appearance positions of the extracted keywords as a target and determines whether there is another extracted keyword within a predetermined range before and after the target keyword; a feature element matrix creating unit that generates, when it is determined that there is the another keyword, combination information obtained by combining the determination target keyword and the another keyword in association with anteroposterior information of the appearance positions of the keywords; and a computing unit that determines whether the number of combination information, among the plurality of combination information of the generated target document, identical to the combination information of the confidential document is not less than a prede

Abstract: A recording medium stores a program that causes a processer to execute a procedure. The procedure includes: calculating registration positions of data based on a total amount of data of existing tables and a hash method, and registering the data at the registration positions, when registering the data in a plurality of tables; adding or deleting a table from the plurality of tables; calculating the registration position of the data based on the total amount of data of the existing tables and the hash method and judging whether data to be referred to is present at the registration position, when data registered in a table is referred to after the table is added or deleted; and when the data to be referred to is not present at the registration position, recalculating the registration position of the data.

Abstract: An electronic document processing apparatus includes: a document set storage unit storing hash tables including hash values of documents to be processed; a content extraction unit for extracting body contents from a newly input electronic document; and a sentence separation unit for separating sentences from the extracted body contents. The apparatus further includes a duplicate document determination unit for converting the separated sentences into unique hash values by a hash algorithm, determining each of the separated checking if there is a duplicate sentence depending on whether or not there is a collision between the converted hash values and the hash values in the hash tables of the document set storage unit, and determining if the electronic document is a duplicate document based on the ratio of duplicate sentences to all of the sentences in the electronic document.

Abstract: A computer-implemented method for searching a plurality of stored objects. Data objects are placed in a hash table, an ordered sequence of locations (probing sequence) in the hash table from a query object is generated and data objects in the hash table locations in the generated ordered sequence are examined to find objects whose relationships with the query object satisfy a certain predetermined function defined on pairs of objects.

Abstract: Arrangements (1) comprising comparators (11) for comparing content identifiers with each other, such as audio/video fingerprints, unique identifiers, hash algorithms, cyclic redundancy checks, titles, names, durations, sizes, album names and artist names of files such as audio/video/data files, are provided with selectors (12) for selecting, 5 from groups of content identifiers, in dependence of values of parameters of the content identifiers, sub-groups of content identifiers, to increase flexibilities. Calculators (13) calculate functions of the values of the parameters and further comparators (14) compare the functions with thresholds. Content identifiers may be defined by cost and accuracy parameters. Then, calculators (13) calculate first functions of the values of the cost 10 parameters and calculate second functions of the values of the accuracy parameters and further comparators (14) compare the first functions with first thresholds and compare the second functions with second thresholds.

Abstract: A distributed hash table infrastructure is described that supports pluggable modules for various services. Transport providers, security providers, and other service providers may be swapped, providing flexibility in supporting various devices and networking configurations.

Abstract: A deterministic UDF processing mechanism processes user-defined functions (UDFs) using multiple hash tables. Data access patterns for a UDF are collected, and an appropriate hash table set is then determined for the UDF from the data access patterns. If a UDF accesses some similar columns and some disjoint columns, the similar columns are grouped together, and one or more hash tables are allocated to the similar columns. Disjoint columns are allocated their own hash tables. In addition, the allocation of hash tables may be adjusted based on historical access patterns collected over time. By dynamically allocating and adjusting sets of hash tables to a deterministic UDF, the performance of the UDF is greatly increased.

Abstract: A system for storing a distributed hash table. The system includes a storage unit, a tablet controller, a router, and a transaction bank. The storage unit has a plurality of tablets forming a hash table and each of the tablets includes multiple records. The tablet controller maintains a relationship between each tablet and the storage unit. The router hashes a record's key to determine the tablet associated with each record. Further, the router distributes messages from clients to the storage units based on the tablet-storage unit relationship thereby serving as a layer of indirection. The transaction bank propagates updates made in one record to all other replicas of the record.

Abstract: A data store in which changes are not tracked is synchronized with a data store in which changes are tracked utilizing a shadow store. The shadow store contains shadow data indicative of the most recent synchronization operation between the data stores. The shadow data comprises hash values of the data items in the limited or non-change-tracked data store. Changes to data items in the limited or non-change-tracked data store are operated on to provide respective hash values. The hash values are compared with the hash values in the shadow data. If the hash values differ, changes are appropriately applied to the data store, and the shadow data is appropriately updated. In an example embodiment, hash values are obtained from one-way hash functions, such MD5, SHA-1, SHA-256, or the like.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for tracking documents in an on-demand service. These mechanisms and methods for tracking documents in an on-demand service can enable embodiments to provide the sharing of documents and the tracking of whether one of the shared documents was changed. The ability of embodiments to provide the sharing of documents and the tracking can enable a safeguard that a user knows whether the document that they have in their possession is the most recent version. In an embodiment, the shared documents are stored in a document management storage. In an embodiment, each file has an ID that includes version information for checking whether the document is the most recent version. In an embodiment, an application is downloaded onto the user system that automatically upon opening a document checks whether a document is the most recent version.

Abstract: A hashing method and system. The method comprises receiving by a computing system first source data. A first hash function is applied to first source data. A first hash output is generated by the first hash function as a result of applying the first hash function to first source data. The computing system performs an operation relating the first source data with at least a portion of the first hash output to generate second source data. The first hash function is applied to the second source data. A second hash output is generated as a result of applying the first hash function to the second source data.

Abstract: A method for mapping an active entry within a virtually hashed page table is disclosed. An active entry within a virtually hashed page table is populated. A link table for locating a link at an offset from an active entry is maintained. This link table continues to be maintained as a valid link table until an occupied head bucket threshold is exceeded or a collision has occurred.

Abstract: An interface is operable to receive an element for deletion from a bloom filter. The bloom filter includes multiple hash functions and an array. A processor is operable to generate hash function output values for the element using the hash functions. The hash function output values correspond to indices identifying bits in the array. A memory is operable to maintain supplemental data structure entries. The supplemental data structure has entries associated with the indices. The processor is operable to modify the supplemental data structure entries to delete the element from the bloom filter.

Abstract: Concurrent cuckoo hashing is performed on a hash table that includes a number of locations; each may hold a value. A plurality of processes may concurrently execute on the table; each process includes a sequence of operations, which are divided into a number of phases. Each phase corresponds to one operation in the sequence. An overflow buffer is provided for each location in the table. Each overflow buffer may hold a value displaced from its corresponding location in the table. A plurality of sequences of operations is concurrently executed. Each phase in a sequence executes by acquiring one or two locks on two locations in the table; a lock acts on a location and its overflow buffer. An operation of a phase is then executed. If, on conclusion of the phase execution, any overflow buffer holds a value, the execution is repeated until all overflow buffers are empty.

Abstract: A method and apparatus for augmenting a dynamic hash table (DHT) with home subscriber server (HSS) functionality for an electronic device in a peer-to-peer communications network is disclosed. The method may include, sending a DHT join query to join the peer-to-peer communications network, and determining if the DHT join query is answered. If the DHT query is not answered, the method may include assuming the role of super node, establishing a secure tunnel to an HSS and performing authentication, acquiring a secure key to communicate to the HSS, and answering queries from other nodes in the peer-to-peer communications network. Otherwise, if the DHT join query is answered, the method may include assuming a role other than the super node in the peer-to-peer communications network.

Abstract: A system, method and computer program product for moving a shared list element from a first list location to a second list location includes making the list element appear simultaneously in the first list and the second list under a first key associated with the first list, changing the first key associated with the first list to a second key associated with the second list, and making the list element appear only in the second list under the second key associated with the second list.