47 results about "Linked data structure" patented technology

Mass data (the contents of arrays, large data structures, linked data structures and similar data structures stored in memory) are common targets for attack. The invention presents a method and system of protecting mass data by mapping virtual addresses onto randomly or pseudo-randomly selected actual addresses. This mapping distributes data values throughout the memory so an attacker cannot locate the data he is seeking, or identify patterns which might allow him to obtain information about his target (such as how the software operates, encryption keys, biometric data or passwords stored therein, or algorithms it uses). Additional layers of protection are described, as well as efficient techniques for generating the necessary transforms to perform the invention.

In one embodiment, systems and methods are provided for nonlinear journaling. In one embodiment, groups of data designated for storage in a data storage unit are journaled into persistent storage. In one embodiment, the journal data is recorded nonlinearly. In one embodiment, a linked data structure records data and data descriptors in persistent storage.

In a computer system having different memory address spaces, for example, user space and kernel space, a method and system is provided for communicating data. A data structure is defined in the kernel space to store data. The data structure is virtually mapped to an application in user space such that the application can access the data structure through virtual memory addresses. By directly accessing the data structure, data transfers between the address spaces using system calls and/or interrupts can be reduced.

A system and method for dynamically enumerating the links in arbitrary hyperlinked data structures using parsing rules are provided. A hyperlinked data structure may be enumerated by reading one or more data objects through an object access interface, parsing the one or more data objects in the data structure, identifying two or more data elements in the one or more data objects, combining one or more data elements to obtain one or more hyperlink addresses, and reading the one or more hyperlink addresses to enumerate the one or more data objects. In one embodiment, hyperlinked structures such as Websites, may be enumerated using configuration templates. The templates may include heuristic parsing rules. The definition of the templates may be independent of the evolution of the data objects over time.

The invention is applicable to the technical field of data structures in cloud computing, and provides a data structure based on a cloud computing database system. The data structure comprises a primary key and a data sheet, wherein the primary key is used for storing data information with the unique identification in a binary code form and serves as a retrieval index; the data structure further comprises a primary key control module which is used for transforming data containing the time attribute in data information of the primary key into binary codes and storing the binary codes into the primary key in a hash distribution way. According to the design method and the system of the data structure, the primary key structure of transaction data and statistical data is the core of the data structure, and storage and retrieval efficiencies of a big data system during cloud computing can be greatly improved.

A method and system for sub-circuit pattern recognition in integrated circuit design is disclosed. In one embodiment, a method for recognizing a pattern circuit in a target circuit, includes encoding the pattern circuit and the target circuit by processing a first netlist of the pattern circuit and a second netlist of the target circuit, generating a cross-linked data structure based on attributes and connectivity information of at least two devices and at least one net from the first netlist, and identifying an instance of the pattern circuit in the target circuit based on an associative mapping between the pattern circuit and a sub-circuit of the target circuit using a device integer array and a net integer array. Each of the first netlist and the second netlist is based on the at least two devices and the at least one net connecting the at least two devices.

A method includes performing a lookup using a key into a root node of a multi-tier data structure, to find a partition for performing an insert. A lookup for the key is performed on a first level index that is part of a linked data structure. A payload or reference is added to the linked data structure based on data structure criterion, otherwise the key and the payload are added to the linked data structure if the key is not found. A new first level index is created and added to the linked data structure upon the linked data structure remaining unchanged. The key and the payload or reference are added to the new index. Based on merge criterion, a new second level index is created and a portion of content from selected first level and second level indexes are merged for combining into the new second level index.

The invention relates to a data processing method and a data processing system. The data processing method includes A, establishing a tree-shaped data structure and transmitting the tree-shaped data structure to a memory to store the tree-shaped data structure; B, transmitting corresponding a control instruction according to operation implemented by a client; C, receiving the control instruction, performing corresponding operation on data stored in the memory and transmitting an operation result to the client. The data processing method and the data processing system have the advantages that the data processing method and the data processing system bring convenience for maintaining the data, and the data can be quickly, conveniently and effectively managed.

A method for executing operations upon a linked data structure having at least one element such that the time during which the linked data structure is locked is reduced. The method includes performing a first set of operation tasks in a first phase, the first set of operation tasks being operable to effect a first set of element state transitions. A second set of operation tasks is developed in the first phase, the second set of operation tasks being operable to effect a second set of element state transitions, the second set of element state transitions being distinct from the first set of element state transitions. The second set of operation tasks is performed in a second phase. The method finds particular implementation in the rebalancing of tree data structures.

A computer program and related data processing methods adapted for computational decision-making including a graphical programming interface, a data structure and a program execution engine. The program uses a hierarchical structure of positions and arguments along with linkages which define functional relationships between different positions and arguments. The positions are primarily characterized by position values that may represent outputs although the positions also have other functional features. The arguments are characterized by argument values that may represent inputs. The values of the arguments are associated with each position are combined to determine the value of that position. A data structure is utilized that is comprised of position and argument data tables and a linkage data structure including data arrays associated with each type of linkage. The position and argument data tables store basic position and argument data such as value. The data arrays of the linkage data structures store the basic data entries by linkage type specifying the linkage connections and in accordance with index values that may be used in identifying the data entries.

A driver assistance system for a vehicle including: a detection device for detecting the vehicle surroundings, a position determination device for determining a vehicle position relative to the vehicle surroundings, a database having an ontological data structure in which traffic rules are implemented, a linker for linking the detected vehicle surroundings and the vehicle position to the ontological data structure to form a linked data structure, and an evaluator for evaluating the linked data structure. Also described is a method for operating a driver assistance system for a vehicle.

Embodiments of the present invention provide an information generation and delivery system and method. The information generation and transmission system comprises a main network and a plurality of sub-networks respectively connected with the main network. The sub-network includes a plurality of peer nodes. The peer nodes are configured to generate information. A subnetwork is configured to link and store information based on a directed acyclic graph. The sub-network is also configured to pass information to the primary network. The primary network is configured to link and store information in a block-chain linked data structure. The peer nodes can be used to quickly generate information. With directed acyclic graphs, multiple link paths can be provided to obtain concurrent information processing capabilities. The primary network may link and store information from the sub-network in the block-chain linked data structure to improve data reliability.

A system and method for asynchronously traversing a disjoint linked data structure is presented. A synergistic processing unit (SPU) includes a handler that works in conjunction with a memory flow controller (MFC) to traverse a disjoint linked data structure. The handler compares a search value with a node value, and provides the MFC with an effective address of the next node to traverse based upon the comparison. In turn, the MFC retrieves the corresponding node data from system memory and stores the node data in the SPU's local storage area. The MFC stalls processing and sends an asynchronous event interrupt to the SPU which, as a result, instructs the handler to retrieve and compare the latest node data in the local storage area with the search value. The traversal continues until the handler matches the search value with a node value or until the handler determines a failed search.

The invention discloses a security data storage method. The method comprises the following steps: A) carrying out data combination on a data sequence incrementally downloaded to the local and a locally stored data sequence according to a time sequence; B) performing binary memory compression on the merged data sequence to obtain compressed data; C) calculating index parameter information of the compressed data; D) writing the index parameter information, a data check code from a download service and a corresponding data timestamp in an index area; And E) according to the index parameter information, writing the compressed data into corresponding data blocks, wherein the data block adopts a dynamic division mode. By implementing the security data storage method, the security data storage method has the beneficial effects of having data verification capability, being irrelevant to a data structure, being capable of realizing dynamic expansion and realizing efficient compressed storage.

A system and method for maintaining information of pending operations are described. A buffer uses multiple linked lists implementing a single logical queue for a single requestor. The buffer maintains multiple head pointers and multiple tail pointers for the single requestor. Data entries of the single logical queue are stored in an alternating pattern among the multiple linked lists. During the allocation of buffer entries, the tail pointers are selected in the same alternating manner, and during the deallocation of buffer entries, the multiple head pointers are selected in the same manner.

A technique for atomically moving a linked data element may include providing an atomic-move wrapper around the data element, along with an existence header whose status may be permanent, outgoing or incoming to indicate whether the data element is not in transition, or if in transition is either outgoing or incoming. The existence header may reference an existence group having a state field that changes state using a single store operation. A first state may indicate that the data element exists if its existence header is outgoing, and does not exist if its existence header is incoming. A second state may indicate that the data element exists if its existence header is incoming, and does not exist if its existence header is outgoing. Following the state change, the existence group and any atomic-move wrapper containing an outgoing existence header and data element may be freed following an RCU grace period.

A data structure includes data that allows specific users to access data items that are part of the data structure and allows the users to store data items in association with the data structure. The data structure includes a root node which is the genesis of the data structure. The data structure further includes an access node for each user granted access rights to the data structure. An access node granting a user access rights to the data structure is directly connected to the root node. For a user whose access rights to the data structure are revoked, the data structure includes an additional access node directly connected to the access node that gave the user access rights. The data structure also includes a record node for each data item that is part of the data structure. Each record node is connected to the root node directly or indirectly.