Presentation 1995/5/26
An Index Structure of the PATRICIA Trie with Nodes of Variable Length Using Front Compression of Keys
Yafei Cheng, Yasuhiko Higaki, Hiroaki Ikeda,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) 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.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) patricia / trie / search / data structure / dictionary / front compression of key
Paper #
Date of Issue

Conference Information
Committee DE
Conference Date 1995/5/26(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Data Engineering (DE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) An Index Structure of the PATRICIA Trie with Nodes of Variable Length Using Front Compression of Keys
Sub Title (in English)
Keyword(1) patricia
Keyword(2) trie
Keyword(3) search
Keyword(4) data structure
Keyword(5) dictionary
Keyword(6) front compression of key
1st Author's Name Yafei Cheng
1st Author's Affiliation Department of Electrical and Electronics Enginerring, Chiba University()
2nd Author's Name Yasuhiko Higaki
2nd Author's Affiliation Department of Electrical and Electronics Enginerring, Chiba University
3rd Author's Name Hiroaki Ikeda
3rd Author's Affiliation Department of Electrical and Electronics Enginerring, Chiba University
Date 1995/5/26
Paper #
Volume (vol) vol.95
Number (no) 81
Page pp.pp.-
#Pages 7
Date of Issue