An Efficient Digital Search Algorithm by Using a Double-Array Structure
IEEE Transactions on Software Engineering
A compendium of key search references
ACM SIGIR Forum
A fast search algorithm on modified S-trees
Pattern Recognition Letters
Finding neighbors on bincode-based images in O (n log log n) time
Pattern Recognition Letters
A Trie Compaction Algorithm for a Large Set of Keys
IEEE Transactions on Knowledge and Data Engineering
A dynamic construction algorithm for the compact patricia trie using the hierarchical structure
Information Processing and Management: an International Journal
Cache Conscious Indexing for Decision-Support in Main Memory
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
A compression algorithm using integrated record information for translation dictionaries
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Informatics and computer science intelligent systems applications
Redesigning the string hash table, burst trie, and BST to exploit cache
Journal of Experimental Algorithmics (JEA)
Fast depth map compression and meshing with compressed tritree
ACCV'09 Proceedings of the 9th Asian conference on Computer Vision - Volume Part II
Hi-index | 0.00 |
It is shown how a highly compact representation of binary trees can be used as the basis of two access methods for dynamic files, called BDS-trees and S-trees, respectively. Both these methods preserve key-order and offer easy and efficient sequential access. They are different in the way the compact binary trees are used for searching. With a BDS-tree the search is a digital search using binary digits. Although the S-tree search is performed on a bit-by-bit basis as well, it will appear to be slightly different. Actually, with S-trees the compact binary trees are used to represent separators at low storage costs. As a result, the fan-out, and thus performance, of a B-tree can be improved by using within each index page an S-tree for representing separators efficiently.