SSGO Binary Tree- A Small and Fast Unicode Basic Case Mapping Algorithm

Frank Yung-Fong Tang - Netscape Communications/AOL

Intended Audience: Software Engineer
Session Level: Advanced

This paper will examine how we implement the basic case mapping algorithm in Mozilla by using a SSGO Binary Tree. We compress both to-upper and to-lower Unicode basic case mapping information into a 1.2 K table, 22% memory usage of other approaches. We will first review several approaches done in the past. Then we will present the data structure of this algorithm with mapping logic. Finiall, a four steps performance optimization will be present and a demo by using Mozilla to view CSS and HTML will be shown.

When the world wants to talk, it speaks Unicode
Unicode Standard Program Conference Board Call for Papers Talks and Papers Past Conferences
Showcase Registration Accommodation Travel Sponsors Next Conference
International Unicode Conferences are organized by Global Meeting Services, Inc., (GMS). GMS is pleased to be able to offer the International Unicode Conferences under an exclusive license granted by the Unicode Consortium. All responsibility for conference finances and operations is borne by GMS. The independent conference board serves solely at the pleasure of GMS and is composed of volunteers active in Unicode and in international software development. All inquiries regarding International Unicode Conferences should be addressed to info@global-conference.com.

Unicode and the Unicode logo are registered trademarks of Unicode, Inc. Used with permission.

16 Jun 2000, Webmaster