摘要
针对银行业卡BIN数据的存储、增删和搜索提出一种建立在十叉树结构的高效处理方法及其相关算法。该方法具有易用、节省存储、快速查询和可扩展的应用特征,解决了银行业卡BIN数据的存储和搜索效率难题,为银行卡BIN的规则变化和拓展提供了一种可用的技术解决方案。
Aiming at the storage, adding and deleting and search of BIN data of the card in banking sector, we present an efficient processing method and related algorithms which is established in a decimal tree structure. The method has following application features: easy to use, storage saving, quick search and scalable. It solves the poser of storage and search efficiency in regard to BIN data of the card in banking sector, and provides an available technology solution to changes and expansion of the bank card BIN rules.
出处
《计算机应用与软件》
CSCD
北大核心
2013年第1期294-296,共3页
Computer Applications and Software