✦ LIBER ✦

Compressed Binary Bit Trees: A New Data Structure For Accelerating Database Searching

✍ Scribed by Smellie, Andrew

Book ID: 127106513
Publisher: American Chemical Society
Year: 2009
Tongue: English
Weight: 452 KB
Volume: 49
Category: Article
ISSN: 0095-2338
DOI: 10.1021/ci800325v

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient compression scheme for data

An efficient compression scheme for data communication which uses a new family of self-organizing binary search trees

✍ Luis Rueda; B. John Oommen 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 253 KB

Data mining and accelerated electronic s

Data mining and accelerated electronic structure theory as a tool in the search for new functional materials

✍ C. Ortiz; O. Eriksson; M. Klintenberg 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 549 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

[Lecture Notes in Computer Science] Fron

[Lecture Notes in Computer Science] Frontiers in Algorithmics Volume 4613 || A New Fuzzy Decision Tree Classification Method for Mining High-Speed Data Streams Based on Binary Search Trees

✍ Preparata, Franco P.; Fang, Qizhi 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 392 KB