Abstract: A two phase move technique for moving groups of tables may reduce cross-host communication and length of table locks. A group including a first table and a second table may be moved to the destination host system. This is done by creating a third table replicating the first table and creating a fourth table replicating the second table on the destination host, and replicas of other tables in the group. The tables in the group are not locked against modifications during the creation of the replica tables. After the creation of the replicas, roles of the original tables and the created tables are switched such that the original tables are set to the replica role and the created tables stored on the destination are set to the source role. The original tables are dropped after the switching of the roles.

Abstract: A terminal device includes a first application and at least one second application. The at least one second application accesses a service in the first application. The at least one second application sends an access request to the first application through cross-process communication. Because the access request includes an identifier uniquely corresponding to a target service interface of the service, the first application determines the target service interface based on the identifier, and executes a method object corresponding to the target service interface to generate an execution result.

Abstract: Storage management techniques involve determining, if it is determined that lock information associated with a lock operation performed on an object is to be inserted into a storage device, a target digest for representing the lock information; determining whether an idle index not associated with a historical digest exists in an index array for indicating a plurality of storage positions in the storage device; and inserting, if it is determined that an idle index exists in the index array, the lock information into a target storage position in the plurality of storage positions by associating the target digest with the idle index. Accordingly, lock information can be quickly inserted and cleared, thereby improving the system performance.

Abstract: A computer-implemented semantic analysis system for ranking search results has instructions including the steps: receive a query about a first document authored by a person; read in data identifying the first document; read in a second document about the person authored after the first document; identify indicator terms in the second document related to whether or not there is a significant discrepancy between the second document and the first document; read in weighting factors for the identified indicator terms; determine an aggregate weighting factor that decreases with an increasing number of indicator terms found; and calculate a score of how much of a discrepancy there is between the second document and the first document using the weighting factors. When multiple first documents are returned for multiple persons, present the links in order from high score to low score.

Abstract: Techniques performed by a computing device of storing data in a data storage system are provided. A method includes (a) storing references to write commands within entries of a first chained hash table (CHT), the first CHT being pointed to by a first data structure representative of a logical disk; (b) keeping track of a load factor of the first CHT during operation; and (c) in response to determining that the load factor of the first CHT has transitioned outside of predetermined bounds: (1) creating a second CHT and a second data structure representative of the logical disk, the second CHT being pointed to by the second data structure; (2) linking the second data structure to the first data structure via a linked list; and (3) storing references to new write commands directed at the logical disk within entries of the second CHT rather than the first CHT.

Abstract: Methods and systems for fixed delay storage operations such as lookup and insertion and their applications to advertisement exchange systems are disclosed. In one aspect, a method is provided for inserting a key into a corresponding location in a storage within a fixed delay. The method may determine the corresponding location for inserting the key by a first hashing function and a second hashing function. The method may also utilize an eviction criterion for evicting collided hashed values of the key to ensure the insertion time for operations related to inserting the key to be bounded by a fixed delay, which may be within a fixed time interval, or within a fixed number of steps.

Abstract: In a method for managing a network device a current hash value is determined for a current key to be inserted into a lookup table. The current hash value associated with a current set of memory locations in the lookup table, wherein the current set of memory locations includes a memory location corresponding to the current hash value and one or more other memory locations. In response to determining that each memory location in the current set of memory location is occupied, one or multiple previously stored keys in the lookup table are iteratively moved to other memory locations in the lookup table to free up a memory location in the current set of memory locations, the current key is inserted into the freed up memory location.

Abstract: In an embodiment, a method of updating a memory with a plurality of memory lines, the memory storing a tree, a plurality of buckets, and a plurality of rules, can include maintaining a copy of the memory with a plurality of memory lines. The method can further include writing a plurality of changes to at least one of the tree, the plurality of buckets, and the plurality of rules to the copy. The method can additionally include determining whether each of the plurality of changes is an independent write or a dependent write. The method can further include merging independent writes to the same line of the copy. The method further includes transferring updates from the plurality of lines of the copy to the plurality of lines of the memory.

Abstract: A method for execution by a dispersed storage and task (DST) processing unit includes obtaining distributed storage and task network (DSTN) address range information for each memory device of a set of memory devices associated with a storage unit targeted for an upgrade; obtaining a list of slice names associated with selected slices stored in each memory device of the storage unit; retrieving the selected slices associated with the list of slice names; generating an integrity check value for the selected slices; storing one or more of: the integrity check value, the selected slices, or the list of slice names as original integrity information in a memory; and enabling an upgrade sequence of the DST execution unit.

Abstract: An apparatus for inline compression and deduplication includes a memory unit and a processor coupled to the memory unit. The processor is configured to receive a subset of data from a data stream and select a reference data block corresponding to the subset of data, in which the reference data block is stored in a memory buffer resident in the memory unit. The processor is also configured to compare a first hash value computed for the subset of data to a second hash value computed for the reference data block, in which the first hash value and the second hash value are stored in separate hash tables and generate a compressed representation of the subset of data by modifying header data corresponding to the subset of data responsive to a detected match between the first hash value and the second hash value in one of the separate hash tables.

Abstract: A method for data storage includes, in a storage device that communicates with a host over a storage interface for executing a storage command in a memory of the storage device, estimating an expected data under-run between fetching data for the storage command from the memory and sending the data over the storage interface. A data size to be prefetched from the memory, in order to complete uninterrupted execution of the storage command, is calculated in the storage device based on the estimated data under-run. The storage command is executed in the memory while prefetching from the memory data of at least the calculated data size.

Abstract: Embodiments relate to scheduling operations to perform on objects. A method for scheduling operations to perform on objects is provided. The method identifies a plurality of operations to perform on a plurality of objects each having at least one attribute. At least one of the operations has scheduling dependency on another operation. The method generates a numeric value for each of the objects from the attribute of the object. The method schedules the operations to perform on the objects based on the numeric values of the objects and the scheduling dependency.

Abstract: Systems and methods for correlating and distributing intrusion alert information among collaborating computer systems are provided. These systems and methods provide an alert correlator and an alert distributor that enable early signs of an attack to be detected and rapidly disseminated to collaborating systems. The alert correlator utilizes data structures to correlate alert detections and provide a mechanism through which threat information can be revealed to other collaborating systems. The alert distributor uses an efficient technique to group collaborating systems and then pass data between certain members of those groups according to a schedule. In this way data can be routinely distributed without generating excess traffic loads.

Abstract: Examples include techniques for compressing counter values included in cryptographic metadata. In some examples, a cache line to fill a cache included in on-die processor memory may be received. The cache arranged to store cryptographic metadata. The cache line includes a counter value generated by a counter. The counter value to serve as version information for a memory encryption scheme to write a data cache line to a memory location of an off-die memory. In some examples, the counter value is compressed based on whether the counter value includes a pattern that matches a given pattern and is then stored to the cache. In some examples, a compression aware and last recently used (LRU) scheme is used to determine whether to evict cryptographic metadata from the cache.

Abstract: Methods, computing systems and computer program products implement embodiments of the present invention that include configuring a storage system to store multiple storage entities, and defining, in a memory, a lookup table including multiple entries, each of the entries referencing a unique storage entity. Upon receiving a storage entity to be stored on the storage system, a compressibility of the received storage entity is determined upon detecting that the received storage entity is not identical to any of the unique storage entities referenced by the lookup table, and an entry referencing the received storage entity is added to the lookup table upon meeting a duplication condition based on the determined compressibility.

Abstract: A method for communicating data in a processing architecture comprising a plurality of interconnected IP blocks. Transmitting IP blocks may transmit messages to a shared receive queue for a first IP block. Receipt of the messages at the shared receive queue may be controlled based on receive credits allocated to each transmitting IP block. The allocation of receive credits for each transmitting IP block may dynamically managed such that the allocation of receive credits may be dynamically adjusted for each transmitting IP block based at least in part on message traffic associated with each transmitting IP block and/or a priority associated with each transmitting IP block.

Abstract: The present disclosure involves systems, software, and computer implemented methods for generating a hash identifier. One example method includes: identifying a record to include in a table, the record associated with two or more primary key fields that are concatenated to create a concatenated key, wherein the table includes one or more hash columns for storing hash identifiers; applying a hash function to the concatenated key to create a new hash value; determining whether a record in the table has a hash value matching the new hash value; in response to determining that a hash value of a record matches the new hash value and the concatenated key of the identified record does not match the concatenated key of any existing record, adding a counter to the new hash value to generate a unique hash ID; and storing the record, including the unique hash ID, in the table.

Abstract: Server computers often include one or more input/output (I/O) adapter devices for communicating with a network or directly attached storage device. The data transfer latency for request can be reduced by utilizing ingress data placement logic to bypass the processor of the I/O adapter device. For example, host memory descriptors can be stored in a content addressable memory unit of the I/O adapter device to facilitate placement of requested data.

Abstract: Systems and methods disclosed herein related to a fraud detection system that receives data from multiple sources and normalizes the data to create transaction data using overlapping data from the multiple sources. Fraud analysis is performed using a probabilistic approach to alert generation, wherein alerts are only sent to customers when the probability of fraud exceeds a threshold. As a result, false positives are avoided.

Abstract: Improved techniques are provided for storing metadata associated with a plurality of sub-files associated with a single shared file in a parallel file system. The shared file is generated by a plurality of applications executing on a plurality of compute nodes. A compute node implements a Parallel Log Structured File System (PLFS) library to store at least one portion of the shared file generated by an application executing on the compute node and metadata for the at least one portion of the shared file on one or more object storage servers. The compute node is also configured to implement a partitioned data store for storing a partition of the metadata for the shared file, wherein the partitioned data store communicates with partitioned data stores on other compute nodes using a message passing interface. The partitioned data store can be implemented, for example, using Multidimensional Data Hashing Indexing Middleware (MDHIM).

Abstract: A request associated with a revocation of a key may be received. A hash value corresponding to the key that is stored in a memory may be identified. Furthermore, the hash value that is stored in the memory may be corrupted in response to the request associated with the revocation of the key.

Abstract: One embodiment of the present invention includes a hash selector that facilitates performing effective hashing operations. In operation, the hash selector creates a transformation matrix that reflects specific optimization criteria. For each hash value, the hash selector generates a potential hash value and then computes the rank of a submatrix included in the transformation matrix. Based on this rank in conjunction with the optimization criteria, the hash selector either re-generates the potential hash value or accepts the potential hash value. Advantageously, the optimization criteria may be tailored to create desired correlations between input patterns and the results of performing hashing operations based on the transformation matrix.

Abstract: A method and system for dynamic flow control using credit sharing that includes allocating portions of credits to senders, wherein each of the credits is for communicating with a receiver; transmitting, by a first sender of the senders, a first message to the receiver using a first credit of a first portion of the credits; decrementing, in response to transmitting the first message, a credit balance of the first sender by one; and determining that the credit balance of the first sender is zero. The method also includes sending to a second sender of the senders, by the first sender, in response to the credit balance being zero, a first request for a second credit; receiving from the second sender, in response to the first request, a first response comprising the second credit; and transmitting, by the first sender, a second message to the receiver using the second credit.

Abstract: An approach for managing a family tree archive is provided. The approach includes creating an electronic archive based on a family tree. The approach also includes automatically discovering Internet-based data associated with at least one member of the family tree. The approach additionally includes adding the Internet-based data to the archive. The approach further includes storing the archive at a storage device.

Abstract: A pseudo-random generator may be used to generate identification values for formatted data packets. A method for transmitting data less susceptible to man-in-the-middle attacks may include receiving data for transmission over a network according to a protocol; formatting the data into one or more internet protocol (IP) packets by fragmenting the received data; and transmitting the one or more internet protocol (IP) packets. The step of formatting the data into one or more internet protocol (IP) packets may include generating a unique pseudo-random number while avoiding collisions with previously-used numbers; and inserting the pseudo-random number as an identifier in the one or more internet protocol (IP) packets corresponding to the received data.

Abstract: Methods and apparatuses for insertion, searching, deletion, and load balancing using a hierarchical series of hash tables are described herein. The techniques disclosed provide nearly collision free or deterministic hash functions using a bitmap as a pre-filter. The hash functions have different priorities and one hashing result will be used to perform main memory access. For the hash functions, two hash bitmaps are used to store valid data and collision information. There is no collision allowed in the hash tables except for the hash table with the lowest priority. The hash tables and bitmaps may be stored in one or more caches in (e.g., a cache of a CPU, Block RAMs in FPGAs, etc.) which perform much faster than main memory.

Abstract: Disclosed herein are system, method, and computer program product embodiments for populating a hash index and returning a handle to the hash index. An embodiment operates by determining, by at least one processor, during query optimization that a first database query has a query execution plan comprising a sub-query which executes N times a correlated predicate having an operator being one of equal and not equal to a base column. A cost of creating and probing the hash index N times and a cost of fully scanning the base column N times are compared based on the correlated predicate. Based on the comparing, it is determined whether to create on-demand a hash index.

Abstract: Embodiments of the present invention provide methods of reading data from and writing data to a memory, computer program products for performing such methods, and apparatus for reading data from and writing data to, a memory, which apparatus may be implemented, for example, as a Field Programmable Gate Array (FPGA). A key associated with data to be read from or written to the memory is converted into two separate values, which values are themselves converted into first and second index values, each having an associated signature value. The index values are used as indices to a signature table containing a signature value for each data entry stored in the memory from which data is to be read or to which data is to be written. In a read operation, a signature of the signature table which matches one of the signature values derived from the key is identified and a read address is calculated based on the index value associated with the matching signature value derived from the key.

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

Abstract: A system and method for distributing and accessing files in a distributed storage system uses an ordered list of the storage nodes in the system to determine the storage node on which a file is stored. The distributed storage system includes a cluster of storage nodes and may also include one or more client nodes that participate in the system as storage resources. Each node (client and storage) stores an ordered list of the storage nodes in the system, allowing any of the nodes to access the file. The list is updated whenever a new storage node is added to the system, an existing storage node is removed from the system, or a new storage node is swapped with an existing storage node. Each one of the nodes may independently compute a new mapping of files to the storage nodes when the ordered list is changed.

Abstract: A computerized method of adjudicating text against a policy includes receiving one or more system policies, creating a system datastructure for each received system policy, receiving an input message comprising a text to be adjudicated, selecting a system policy from the one or more received system policies based on the input message, and processing the text to be adjudicated and the system datastructure corresponding to the selected system policy to determine if a prohibited word is present in the text to be adjudicated. The one or more system policies include one or more prohibited words and a first hit value corresponding to each prohibited word. The system datastructure includes a plurality of linked lists corresponding the letters of the alphabet and a head linked list operable to store one or more found prohibited words.

Abstract: A system for extending a Time Intelligence language to provide support for period-to-date functions and for generating member sets in response to data queries is provided. The system may apply member aggregation functions and queries across a plurality of heterogeneous data sources. Each data source is aligned to a reference dimension and is said to organize data according to at least one level of granularity. In some embodiments, a member aggregation function specifies a period (e.g., year, quarter, month) and retrieves data from a data source starting with the current specified period and ending with the most recently completed period equal to the granularity of the data source. The system may allow a user to further customize a member aggregation function by specifying a granularity, a period offset, or a granularity end offset. Additionally, the system may generate a caption to display in association with the retrieved 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: 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.

Abstract: Instead of transferring a large original file, such as a virtual-machine image file, from a source system to a target system, the original file is encoded to define a recipe file that is transferred. The recipe is then decoded to yield a duplicate of the original file on the target system. Encoding involves identifying standard blocks in the original file and including standard-block identifiers for the standard blocks in the recipe in lieu of the original blocks. Decoding involves an exchange with a standard-block identifier server system, which provides standard blocks in response to received standard-block identifiers.

Abstract: A method and system for facilitating peer-to-peer networking among local peers are described. Hashes are generated from a digital content file and virtual coordinates of virtual nodes in a virtual coordinate system. The generated hashes are then used to retrieve peer connection information.

Abstract: Methods and systems for generating a hashcode for a hash table are provided to improve the hash table performance. A particular method includes receiving an input of a key; applying a hash function to the key to generate an incoming hashcode of the key; encoding a key type into the incoming hashcode to generate a first hashcode; and storing the first hashcode. A particular method includes encoding the key type into at least one bit of a bucket index portion of the incoming hashcode.

Abstract: A method and a processing device are provided for compressing a web graph including multiple nodes and links between the multiple nodes. Nodes of the web graph may be clustered into groups including no more than a predetermined number of nodes. A list of links of the clustered nodes may be created and sorted based on a frequency of occurrence of each of the links. A prefix tree may be created based on the sorted list of links. The prefix tree may be walked to find candidate virtual nodes. The candidate virtual nodes may be analyzed according to a selection criteria and a virtual node may be selected. The prefix tree may be adjusted to account for the selection of the virtual node and the virtual node may be added to the web graph.

Abstract: A system and method for generating divorce proceedings or other paperwork. The system includes a server computer system and a user computer system coupled to a network. The server computer system includes a memory that stores location-based divorce proceeding rules, and a processor with a graphical user interface component. The user computer system includes a user interface component coupled to a processing component. The user interface component presents the graphical user interfaces generated by the graphical user interface component and receives responses to the presented graphical user interfaces. The responses include a selection for the location for the divorce proceedings. The received responses are sent to the server computer system. The graphical user interface component generates graphical user interfaces based on at least one of the location selection or other received responses. The processor automatically generates completed divorce documents based on the received responses.

Abstract: In a method and system for updating data in a distributed system, a server receives a request to read data stored in the server. A data structure is populated with the requested data, and a first unique identifier is generated by applying a hash function to the data stored in the data structure. The data and the first unique identifier are transmitted to the requesting client. From the client system, the server receives the first unique identifier and changes to the requested data performed on the client system through a web service application. The changes include an extension to the requested application data to include customer-specific data. Following receipt of the changed data and the first unique identifier, a second data structure is populated with the requested data. A second unique identifier is generated by applying a hash function to the data stored in the second data structure.

Abstract: Disclosed is a data processing system, and an article of manufacturing for use with the data processing system. The data processing system joins rows associated with a column of a source table with rows associated with a column of a target table. The data processing system includes a source node containing the source table and including a target node containing the target table.

Abstract: The present invention relates to a method of cataloguing a data structure and also preferably a method of searching through such as data structure to detect the presence of search patterns within the data structure. The catalogusing method of the present invention employs the formation of a catalogue data structure which is used to associate data items (transformed from data elements present within the data collection) with storage addresses. This catalogue data structure may be sorted to facilitate searching through same. Such searches may be completed through the formation of a plurality of search quries from a received search pattern sequence where the results of running these search queries may then be subsequently considered in conjunction with a search pattern sequence detection process.

Abstract: A method and system for reducing storage requirements and speeding up storage operations by reducing the storage of redundant data includes receiving a request that identifies one or more data objects to which to apply a storage operation. For each data object, the storage system determines if the data object contains data that matches another data object to which the storage operation was previously applied. If the data objects do not match, then the storage system performs the storage operation in a usual manner. However, if the data objects do match, then the storage system may avoid performing the storage operation.

Abstract: A method for compressing and decompressing files is provided. The method includes creating a list of shift-invariant focal points of neighborhoods in the stream and comparing those focal points to a list of focal points created using the same method on the reference stream. The method of the present invention searches for the longest sequence of focal points that appear in both files. The method of the present invention also verifies that neighborhoods contain the same focal points. The changed data and references to the reference stream are then encoded. The decompression process decodes the encoded stream of data, and using the reference stream recreates the new version of stream.

Abstract: A method and apparatus for searching a forwarding table are provided.

Abstract: Similarities among multiple near-neighbor objects are searched for based on multiple criteria. A query is received for an object closest to an object provided by a user, and weights are assigned by a user to distance functions among the multiple objects at the time of the query. Each distance function represents a different criterion. The weighted average is calculated for the distance functions, and the closest object to the query object based on the weighted average for the distance functions.

Abstract: 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 collision resolution scheme that precludes coalescing of chains. The method and system include providing a binary tree including nodes corresponding to the keys of the chain. The nodes include a root node corresponding to a root key and at least one child node corresponding to at least one child key. The method and system also include storing a pair of child keys in two empty adjacent key fields and storing a first empty adjacent key value of one of the two empty adjacent key fields in the home link field if the root node is the parent node of more than one child node.