Proceedings 1996 Asia-Pacific Software Engineering Conference (1996)
Seoul, SOUTH KOREA
Dec. 4, 1996 to Dec. 7, 1996
K.P. Chow , University of Hong Kong
T.W. Lam , University of Hong Kong
K.H. Lee , University of Hong Kong
This paper is concerned with the design and performance of the telephone directory inquiry system newly adopted in Hong Kong. This system maintains three million telephone records and supports over forty thousand inquiries per hour at the peak. In the Hong Kong society the uses of English and Chinese (in particular, Cantonese) has been blending in a thrust of exciting language culture, giving rise to a variety of telephone inquires that traditional B-tree or hashing based telephone directory inquiry systems fail to handle. The efficiency and flexibility achieved by the new system stem from hosting all indexing data structures in the main memory; these data structures occupy about half giga-bytes and would have been considered too expensive to be placed in the main memory in the past.
data structures, telephone directory enquiry, trie, keyword searching, on-line updating, multi-threaded process
T. Lam, K. Lee and K. Chow, "The Telephone Directory Enquiry System of Hong Kong," Proceedings 1996 Asia-Pacific Software Engineering Conference(APSEC), Seoul, SOUTH KOREA, 1996, pp. 268.