An Index Structure of the PATRICIA Trie with Nodes of Variable Length Using Front Compression of Keys
-
- CHENG Yafei
- Department of Electrical and Electronics Engineering, Chiba University
-
- HIGAKI Yasuhiko
- Department of Electrical and Electronics Engineering, Chiba University
-
- IKEDA Hiroaki
- Department of Electrical and Electronics Engineering, Chiba University
Bibliographic Information
- Other Title
-
- 前方圧縮を用いた可変長節パトリシアトライ索引構造
Search this article
Description
A new index structure of the Patricia trie based on the front compression of keys is proposed. Search, insertion and deletion algorithms for the proposed index structure are described. The most importent feature of the proposed method is that required memory is significantly much lower than the traditional Patricia trie, and that the retrieval time is the same.
Journal
-
- IEICE technical report. Data engineering
-
IEICE technical report. Data engineering 95 (81), 1-7, 1995-05-26
The Institute of Electronics, Information and Communication Engineers
- Tweet
Details 詳細情報について
-
- CRID
- 1570291227453517184
-
- NII Article ID
- 110003188731
-
- NII Book ID
- AN10012921
-
- Text Lang
- ja
-
- Data Source
-
- CiNii Articles