✦ LIBER ✦

Implicit B-trees: a new data structure for the dictionary problem

✍ Scribed by Gianni Franceschini; Roberto Grossi; J.Ian Munro; Linda Pagli

Book ID: 108166475
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 318 KB
Volume: 68
Category: Article
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2003.11.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tradeoff between search and update tim

A tradeoff between search and update time for the implicit dictionary problem

✍ Allan Borodin; Faith E. Fich; Friedhelm Meyer Auf Der Heide; Eli Upfal; Avi Wigd 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 698 KB

G-tree: a new data structure for organiz

G-tree: a new data structure for organizing multidimensional data

✍ Kumar, A. 📂 Article 📅 1994 🏛 IEEE 🌐 English ⚖ 740 KB

A new data structure for the union-find

A new data structure for the union-find problem

✍ Marek J. Lao 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 967 KB

A new implicit enumeration scheme for th

A new implicit enumeration scheme for the discriminant analysis problem

✍ P. Marcotte; G. Marquis; G. Savard 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 770 KB

The string B-tree: a new data structure

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

✍ 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

The string B-tree: a new data structure

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

✍ Ferragina, Paolo; Grossi, Roberto 📂 Article 📅 1999 🏛 Association for Computing Machinery 🌐 English ⚖ 355 KB