基于有限状态机和Trie数的分级地址模型  

Graded address model based on finite state machine and Trie number

作　　者：张倩[1] 郭嗣琮[1] 

机构地区：[1]辽宁工程技术大学理学院,辽宁阜新123000

出　　处：《计算机应用》2013年第3期854-857,共4页journal of Computer Applications

基　　金：教育部高校博士学科点专项科研基金资助项目(20102121110002)

摘　　要：针对地理编码系统中地址正确性校验、地址不规则命名和地址跳跃的问题,提出了运用有限状态机理论建立分级地址的转换模型,同时用Trie树来建立有限状态机中各个地址的转换函数,给出了转换函数的初始化和训练过程。测试数据对模型的验证表明,使用有限状态机和Trie树建立的地址模型,初步解决了地理系统编码中的地址校验、不规则命名和地址跳跃的问题。Concerning the address correctness check of parity, address irregular naming and address jumping in the geographic coding system, this paper established a conversion model of hierarchical address by the theory of finite state machine. It also created every address conversion functions in the finite state machine through the Tile tree. Then, it gave the initialization and training process of the conversion function. Through the verification of the model, the address model established in this paper can initially solve these above problems.

关 键 词：地理信息系统 地址编码 地址匹配 缓存优化 

分 类 号：TP311.11[自动化与计算机技术—计算机软件与理论] TP305[自动化与计算机技术—计算机科学与技术]