Descriptor
| Access to Information | 1 |
| Algorithms | 1 |
| Information Retrieval | 1 |
| Information Storage | 1 |
| Mathematical Formulas | 1 |
| Search Strategies | 1 |
| Validity | 1 |
Source
| Information Processing &… | 1 |
Author
| Aoe, Jun-ichi | 1 |
| Koyama, Masafumi | 1 |
| Okada, Makoto | 1 |
| Shishibori, Masami | 1 |
Publication Type
| Journal Articles | 1 |
| Reports - Descriptive | 1 |
Education Level
Audience
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Peer reviewedShishibori, Masami; Koyama, Masafumi; Okada, Makoto; Aoe, Jun-ichi – Information Processing & Management, 2000
Discusses information retrieval and the use of binary trees as a fast access method for search strategies such as hashing. Proposes new methods based on compact binary trees that provide faster access and more compact storage, explains the theoretical basis, and confirms the validity of the methods through empirical observations. (LRW)
Descriptors: Access to Information, Algorithms, Information Retrieval, Information Storage
