Trie

This paper presents a tree data structure so called trie like tree , used for Chinese character input with " full pinyin " method .

汉字带联想的全拼输入法的外码到机内码的转换，可采用改进的一种可称之为类trie树的数据结构。

Traditional trie tree is a searching tree according to the key byte by byte . It 's faster than the hash algorithm .

传统的trie树是一种按字节进行检索的多叉树，具有比hash表更快的查找速度，主要应用于变长字符串的索引。

Research of Optimization on Double - Array Trie and its Application

双数组Trie树算法优化及其应用研究

The trie tree is a data structure supporting fast searching .

检索树（trie树）是支持较快查找算法的结构。

Design and Implementation of IP Router Lookups Algorithm Based on Trie

基于Trie的路由查找算法设计与实现

Match algorithm of approximate string with wildcard based on trie data structure

基于Trie结构的带通配符的相似字符串匹配算法

The Word Segmentation System Based on the Dictionary Search Mechanism of Three Array Trie Index Tree

基于三数组Trie索引树词典查询机制的分词系统

A fast content routing lookup algorithm on hash and trie tree basis

一种基于哈希表和Trie树的快速内容路由查找算法

Analysis of average path length for Trie Hashing structure

TrieHashing结构平均路径长度分析

Development of Automatic Marking Machine for Trie A Study on Tire-coupled Whole Vehicle Simulation

轮胎全自动打号机的研制轮胎耦合整车模拟试验研究

Research of Chinese Word Segmentation Based on Double-Array Trie

基于双数组Trie树中文分词研究

A Rapid Multi-Dimensional Packet Classification Based on Location Code and Multi-Branch Trie

基于定位代码和多分支Trie的快速多维数据包分类

Packet classification using parallel level compression trie

并行层压缩树包分类算法

According to the characteristics of meteorological data , design a file merging algorithm based on the trie tree .

根据气象数据的特点将设计基于Trie树变形的文件合并算法。

Trie application offers more efficient means to measure flux of well and well with injection of polymer .

该仪器的应用为油水井及注聚合物井的流量测试提供了更为有效的手段和方法。

A parallel multi-dimensional packet classification based on trie

基于Trie结构的并行多维数据包分类

Applications of Trie Tree Index in Real-time Billing

键树索引在实时计费中的应用

Expanded Compressed Trie Algorithm & a Trie-based Fast Routing Lookup Algorithm

扩展压缩树算法&一种基于树型结构的快速路由查找算法

Ethernet MAC Address Lookup Architecture Based on Compacted Trie

基于压缩Trie树的以太网地址查找结构

A kind of TRIE structure

一种Trie结构

Group Statistics The PBT algorithm is a multi-dimensional packet classification algorithm based on Patricia trie .

该算法是基于Patricia树的多维分组分类算法。

But trie has many disadvantages as well , and wasting memory space is the biggest disadvantage .

但是，Trie结构在高效处理字符串的同时，也存在很多缺点。对存储空间的浪费就是Tire结构的最大缺点。

Trie is a key data structure to implement rapid routing lookups and fording packets .

Trie数据结构是实现高速路由查找和分组转发的关键。

Trie indexes increase performance by reducing the need for key value comparisons and practically eliminating innode processing .

Trie索引可以减少键值比较，并且几乎可以消除节点内处理，从而能够提高性能。

A Data Structure and Algorithm of Indexes and Split Multibit Trie for Longest Matching Prefix Lookup

最长前缀匹配查找的索引分离trie树结构及其算法

The efficient method for collecting trie information to be measured is one of the main factors that ensure the measuring system with high precision and efficiency .

在检测系统中，有效的被测信息提取方法是保证检测具有高精度和高效率的主要因素之一。

An Improved Searching Algorithm for the Address-mapping Table in NAT-PT Based on Patricia Trie

NAT-PT中一种改进的地址映射表查找算法

The research shows the lookup algorithm for IPv6 route lookup with compression trie has reasonable memory space and fast lookup time .

研究表明，基于分段压缩的路由查找算法支持IPv6路由查找，具有合理的存储容量和快速的查找时间；

Virtual trie hashing method

虚拟检索散列方法

Optimized D sign of Spring by the Dual Method of the G om trie Programming with the Positive Term Formula of Constraint

用约束正定式几何规化对偶法对弹簧优化设计