교통카드 블랙리스트 체크를 위한 알고리즘에 관한 연구 = A research on the algorithm of traffic card for blacklist checking

다국어 초록 (Multilingual Abstract)

The research which sees is to paying in advance and or the after non traffic card use composes shortens about the method which sorts the difference of the method which with the thing is proposing from card system of existing and that system improves only the unable card or serviceable card information and the response time of the system operation and to improve the method which composes information, control method preparation improved a updating speed and effectiveness of system improvement at the time. The respectively file composed with the multiple mind section from the research which sees hereupon and also each section composed of the multiple mind block and each block multiple mind divided at size of the unit which will count and with the index father whom composes more kicked a low-end ratio use wrongly or in serviceable card information and the low to compose with the data bringing up for discussion territory which composes of information the efficiency of system, improved.

참고문헌 (Reference)

1 Du, Ding-Zhu, "Theory of Computational Complexity" John Wiley & Sons 2000

2 문병로, "Introduction to Algorithms" 한빛미디어 2006

3 Ellis Horowitz, "Fundamentals Of Computer Algorithms"

4 Knuth, Donald, "Fundamental Algorithms" Addison-Wesley 1997

5 Arora, Sanjeev, "Complexity Theory: A Modern Approach" Cambridge University Press 2009