NotesFAQContact Us
Collection
Advanced
Search Tips
Back to results
Peer reviewed Peer reviewed
ERIC Number: EJ605358
Record Type: Journal
Publication Date: 2000
Pages: N/A
Abstractor: N/A
ISBN: N/A
ISSN: ISSN-0306-4573
EISSN: N/A
Two Improved Access Methods on Compact Binary (CB) Trees.
Shishibori, Masami; Koyama, Masafumi; Okada, Makoto; Aoe, Jun-ichi
Information Processing & Management, v36 n3 p379-99 May 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, Mathematical Formulas, Search Strategies, Validity
Publication Type: Journal Articles; Reports - Descriptive
Education Level: N/A
Audience: N/A
Language: English
Sponsor: N/A
Authoring Institution: N/A
Grant or Contract Numbers: N/A