Data management system comprising a trie data structure, integrated circuits and methods therefor
AssigneeFreescale Semiconductor, Inc.
InventorsADI KATZ, EVGENI GINZBURG
Life of this patent
Estimating the term…
Abstract
A data management system comprises a trie data structure. The trie data structure comprises a plurality of interconnected nodes wherein at least a portion of said plurality of interconnected nodes is configured as parent nodes and child nodes, wherein at least one child node comprises an identifier of its parent node.
Claims20
A data management system comprising a trie data structure, the trie data structure comprising a plurality of interconnected nodes wherein at least a portion of said plurality of interconnected nodes is configured as parent nodes and child nodes, wherein at least one child node comprises an identifier of its parent node.
An integrated circuit comprising a memory, the memory comprising a plurality of interconnected nodes with data stored in a trie data structure wherein at least a portion of said plurality of interconnected nodes is configured as parent nodes and child nodes, wherein at least one child node comprises an identifier of its parent node.
An integrated circuit comprising a processor engine for interfacing with a memory comprising a plurality of interconnected nodes with data stored in a trie data structure wherein at least a portion of said plurality of interconnected nodes is configured as parent nodes and child nodes, the processor engine comprising at least one of:
- a search engine, a modify engine, configured to:
- receive a tree key identifying a child node;
- convert the tree key to a hash key;
- and
- for a search engine access a parent node of the child node identified by the hash key.
A method of accessing data in a trie data structure, wherein the trie data structure comprises a plurality of interconnected nodes wherein at least a portion of said plurality of interconnected nodes is configured as parent nodes and child nodes, the method comprising:
- accessing a child node;
- obtaining an identifier of the accessed child node;
- and
- determining from the accessed child node an identifier of a parent node of the accessed child node.
Dependencies are inferred from the claim text.