Two Access Methods Using Compact Binary Trees

No abstract is available for this paper.

• Publication year

  1987

• Venue

  IEEE Transactions on Software Engineering

• Publication date

  1987-07-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/TSE.1987.233491
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• An effective way to represent quadtrees

  1982cited by this paper
• Trie hashing

  1981influential reference
• Linear Hashing with Partial Expansions

  1980cited by this paper
• Extendible hashing—a fast access method for dynamic files

  1979cited by this paper
• Ubiquitous B-Tree

  1979influential reference
• Prefix B-trees

  1977influential reference
• The art of computer programming: sorting and searching (volume 3)

  1973cited by this paper

• Data Structures and Lookup Algorithms Investigation for the IEEE 802.15.4 Security Procedures Implementation

  2021cites this paper
• Enhancement of HCB Tree for Improving Retrieval Performance and Dynamic Environments

  2015cites this paper
• Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence

  2013influential citation
• Redesigning the string hash table, burst trie, and BST to exploit cache

  2011cites this paper
• Depth Coding based on Binary Tree Decomposition

  2010cites this paper
• Fast Depth Map Compression and Meshing with Compressed Tritree

  2009cites this paper
• String algorithms and data structures

  2008cites this paper
• A compression algorithm using integrated record information for translation dictionaries

  2004cites this paper
• Compact searchable static binary trees

  2004cites this paper
• A dynamic construction algorithm for the Compact Patricia trie using the hierarchical structure

  2002cites this paper
• An Efficient Trie Construction for Natural Language Dictionaries

  2002cites this paper
• An Efficient Retrieval Algorithm of Compound Words Using Extendible Hashing

  2000cites this paper
• Two improved access methods on compact binary (CB) trees

  2000influential citation
• Cache Conscious Indexing for Decision-Support in Main Memory

  1999cites this paper
• A Substring search Algorithm in Extendible Hashing

  1998cites this paper
• COMPACT O-COMPLETE TREES

  1998cites this paper
• Level compression-based image representation and its applications

  1998cites this paper
• An order searching algorithm of extensible hashing

  1997cites this paper
• Efficient search algorithm on compact S-trees

  1997cites this paper
• An efficient compression method for Patricia tries

  1997cites this paper
• Improvement of binary digital search trees using hierarchical structures

  1997cites this paper
• A key search algorithm using the compact Patricia trie

  1997cites this paper
• Finding neighbors on bincode-based images in O(n log log n) time

  1996cites this paper
• A Trie Compaction Algorithm for a Large Set of Keys

  1996cites this paper
• Storage Overhead of O-Trees, B-Trees and Prefix B-Trees: A Comparative Analysis

  1996cites this paper
• A compact and fast structure for trie retrieval algorithms

  1996cites this paper
• An efficient method of compressing binary tries

  1996cites this paper
• A fast search algorithm on modified S-trees

  1995cites this paper
• A hierarchical clustering strategy for very large fuzzy databases

  1995cites this paper
• A method of compressing trie structures

  1994cites this paper
• An algorithm for dynamic processing of dawg's

  1994cites this paper
• An introduction to the S SPIN hash function: making more out of the multidimensional array

  1994cites this paper
• Compact Balanced Tries

  1992cites this paper
• Encoding and Manipulating Pictorial Data with S+-trees

  1991cites this paper
• A compendium of key search references

  1990cites this paper
• An Efficient Digital Search Algorithm by Using a Double-Array Structure

  1989cites this paper
• A fast digital search algorithm using a double-array structure

  1989cites this paper
• Locally Balanced Compact Trie Hashing

  1988cites this paper
• Compact 0-Complete Trees

  1988cites this paper
• An efficient digital search algorithm by using a double-array structure

  1988cites this paper