期刊名称：International Journal of New Computer Architectures and their Applications
印刷版ISSN：2220-9085
出版年度：2011
卷号：1
期号：4
页码：1011-1017
出版社：Society of Digital Information and Wireless Communications
摘要：Currently, many government offices and companies use mailing lists for reaching their clients. Any mailing list needs continuous updates that include removing unsubscribed emails, inserting new coming emails, and removing duplications. Duplication can occur when merging two mailing lists into one master mailing list, where both the merged lists contain the same email more than one or when any one of the mailing lists contain the same email many times. Existing algorithms for removing duplications in mailing list require time complexity greater than linear. Most of them sort emails in alphabetical order and then remove the duplication in O(n log n). However, we are able to reduce the time complexity to O(n) using hashing. This saves the time and the efforts of the senders.
关键词：Mailing list; linear time; sorting; ; duplication
