Abstract
Visitor Location Register (VLR) is a system that stores the subscriber’s information temporarily if the subscriber in the digital mobile communication system or the Personal Communication Service (PCS) moves into the area that is managed by VLR. The Database Management System (DBMS) of this VLR should be able to have a large number of mobile subscribers, and it should be able to process the data of the mobile subscribers in the real time. In order to satisfy this request, the quick hash access method has been already developed in VLR DBMS. This paper analyzes the algorithm and the problem of the quick hash access method, and it suggests a new access method that can process the data of the mobile subscribers in the real time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S.K. Lee, S.H. Kim, S.B. Lim, S.J. Lim, and H.J. Lee, “Research of the Database in the Digital Mobile System”, Proc. the Korean Institute of Communication Sciences, 1990., pp. 318–321
W. Litwin, “’Linear Hashing : A New Tool for File and Table Addressing,” Proc. 6th Intl. Conf Very Large Data Bases, 1980., pp. 212–223
P. Larson, “Dynamic Hash Tables,” Comm. of ACM, Vol. 31, No. 4, pp. 446–457, 1988.
R. Fagin, J. Nievergelt, N. Pippenger, and H. R. Strong, “Extendible Hashing : A Fast Access Method for Dynamic Files,“ ACM Trans. On Database Systems, Vol.4, No.3, 1979., pp. 315–344
D. Knuth., “The Art of Programming-Sorting and Searching”, Addison-Wesley Publishing Co. Inc., 1973.
T. J. Lehman and M. J. Carey, “A Study of Index Structures for Main Memory Database Management Systems,” Proc. 12th Intl. Conf Very Large Data Bases, 1986., pp. 294–303
A. V. Aho, J. E. Hopcroft, J. D. Ullman, “The Hash Table Data Structure,” Data Structures and Algorithms, 1985., pp. 122–134
K.Y. Whang, C.W. Chang, Y.K. Lee, and W.Y.Kim, “Storage System for Main Memory Database”, Korea Information Science Society Review, Vol.14, No.2, 1996., pp.5–13
Editor information
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Lee, KY., Park, MJ., Cho, SC. (2002). Chained Bucket Hashing Method for Real Time Processing in Mobile Telecommunication. In: Harindranath, G., et al. New Perspectives on Information Systems Development. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0595-2_28
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0595-2_28
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5149-8
Online ISBN: 978-1-4615-0595-2
eBook Packages: Springer Book Archive