Look-ahead tree structure
作者： Itzchak Gabbay , Alex Tal
DOI:
关键词:
摘要: A method and system for storing retrieving data using a radix-search tree is disclosed. The encorporates: (a) plurality of nodes, each the nodes having node-attributes, in tree, (b) node-attributes single memory access. storage module sub-trees containing node attributes, wherein attributes at least one are stored contiguous block, processor that operative to perform operations including: (i) transferring module, (ii) sub-tree s from module.
lens.org 参考文章(7)
Neil A. Burkhard, Database system with improved methods for radix sorting ,(1996)
Richard Angle, Geoff Ladwig, Method and apparatus for performing radix lookups using valid bit tables with pointers ,(1998)
Marco C. Heddes, Colin Beaton Verrilli, Piyush Chunilal Patel, Clark Debs Jeffries, Jean Louis Calvignac, Everett Arthur Corl, Mark Anthony Rinaldi, Anthony Matteo Gallo, System and method and computer program for filtering using tree structure ,(1999)
Geoffrey C. Stone, Method and apparatus for radix decision packet processing ,(1994)
Lawrence Au, Device for storage and retrieval of compact contiguous tree index records ,(1996)
Geoffrey B. Ladwig, Richard L. Angle, Edward S. Harriman, Radix tree search logic ,(1996)