๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The string B-tree: a new data structure for string search in external memory and its applications

โœ Scribed by Ferragina, Paolo; Grossi, Roberto


Book ID
118162613
Publisher
Association for Computing Machinery
Year
1999
Tongue
English
Weight
355 KB
Volume
46
Category
Article
ISSN
0004-5411

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The string B-tree: a new data structure
โœ Ferragina, Paolo; Grossi, Roberto ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Association for Computing Machinery ๐ŸŒ English โš– 355 KB

We introduce a new text-indexing data structure, the __String B-Tree__ , that can be seen as a link between some traditional external-memory and string-matching data structures. In a short phrase, it is a combination of B-trees and Patricia tries for internal-node indices that is made more effective