In this paper , we present a layer - partition index which can be searched efficiently , allowing us to build index in excess of ram size 本文提出了一种分层的索引结构,使用这种结构能够建立超过内存容量的索引,而且能有效得执行各种数据搜索。
The spatial data index betakes the spatial data structure based on the improved r - tree structure , and the property index uses the b + tree data structure 空间数据索引采用基于改进r - tree的空间数据索引结构，属性数据索引采用b ~ +树数据结构。
Index structure atpr - tree which supports asynchronous update of moving objects is proposed to process queries about the present and the anticipated future information in 在tpr * - tree基础上提出支持移动对象异步更新的索引结构atpr - tree管理移动对象当前以及未来信息。
Report ucb csd - 01 - 1141 , university of california , berkeley , usa , 2001 . 8 cuenca - acuna f m , nguyen t d . text - based content search and retrieval in ad hoc p2p communities 本文针对上述问题,提出对等数据系统中的摘要索引结构及建立在此基础上的基于内容的近似查询处理方法。
Of 3 . this index structure supports an efficient search for all items containing indexed words and advanced search operations , such as phrase searches and proximity searches 此索引结构支持对包含索引词的所有项进行高效搜索，并支持高级搜索操作，例如短语搜索和邻近搜索。
To maximize the efficiency of lookups , only a subset of the tokens in each row in the table is indexed in the inverted index structure that the fuzzy lookup transformation uses to locate matches 若要最大程度提高查找效率，请以模糊查找转换查找匹配项时所用的倒排索引结构仅对表内每行中的一个令牌子集建立索引。
We also explore memory management in the application of our index structure . finally , we show experimentally that our index can be built effectively with sequences whose index size exceeds the available ram 在最后的实验部分中,使用本文的索引结构和建立方法建立了比内存更大的索引,并在时间和空间上都获得良好的效果。
Instead of constructing a b - tree structure based on a value stored in a particular row , msftesql builds an inverted , stacked , compressed index structure based on individual tokens from the text being indexed Msftesql不是基于某一特定行中存储的值来构造b树结构，而是基于要索引的文本中的各个标记来创建倒排、堆积且压缩的索引结构。
The article introduces in detail the structure of index , and its realization of algorithm and schematic of program structure of self organizing map ( som ) ; and explains the feasibility of som through examples 文章详细介绍了索引结构及自组织特征映射网络( selforganizingmap ， som ) ，阐述了它在本软件中的实现算法和程序结构简图。
The feasibility of the procedural knowledge retrieve in design problem domain was analyzed in cbid theory , then the user ’ s design problems domain in nc machine tools industrial design through the experiment was analyzed 其后通过数控机床工业设计领域用户问题域实验分析,提取了该领域的典型设计问题域并在此基础上构建了程序型知识索引结构模型。
