索引結構 的英文怎麼說

中文拼音 [suǒyǐnjiēgòu]
索引結構 英文
index structure
  • : Ⅰ名詞1 (大繩子; 大鏈子) a large rope 2 (姓氏) a surname Ⅱ動詞1 (搜尋; 尋找) search 2 (要; ...
  • : Ⅰ動詞1 (牽引; 拉) draw; stretch 2 (引導) lead; guide 3 (離開) leave 4 (伸著) stretch 5 (...
  • : 結動詞(長出果實或種子) bear (fruit); form (seed)
  • : Ⅰ動詞1 (構造; 組合) construct; form; compose 2 (結成) fabricate; make up 3 (建造; 架屋) bui...
  • 索引 : index; indexing; key; repertory; subscript; concordance
  • 結構 : 1 (各組成部分的搭配形式) structure; composition; construction; formation; constitution; fabric;...
  1. 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

    本文針對上述問題,提出對等數據系統中的摘要索引結構及建立在此基礎上的基於內容的近似查詢處理方法。
  2. In the proposed join algorithms, although some algorithms such as mpmgin algorithm [ 23 ], outperform standard rdbms join algorithms, they perform a lot of unnecessary computation and i / o for matching basic structural relationships, especially in the case of parent - child relationships ; other algorithms such as the stack - tree - desc algorithm [ 24 ], represent the state - of - the - art in structural joins, however, they do not utilize indexed structures but sequentially scan the input lists. thus, i / o ' s can be wasted for scanning element that do not participate in the join, and join speed can be influenced

    另外,在所提出的演算法中,盡管有的演算法,如mpmgjn演算法[ 23 ]優于標準的rdbms連接演算法,但是該演算法為匹配基本的關系,特別是在父子關系情況下,執行了大量不必要的計算和佔用了大量的i / o資源;有的演算法雖然代表了連接演算法的先進水平,如stack - tree - desc [ 24 ]連接演算法,但是它沒有利用索引結構而是順序瀏覽輸入列表。
  3. 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

    其後通過數控機床工業設計領域用戶問題域實驗分析,提取了該領域的典型設計問題域並在此基礎上建了程序型知識索引結構模型。
  4. The first incremental outlier detection algorithm inclof is presented and compared with lof algorithm. the results from a study on synthetic data sets demonstrate that the runtime of inclof is much less than lof in dynamic and high dimensional environment where high indexing structures are ineffective

    提出了一種動態環境下局部異常的增量挖掘演算法inclof ,並通過實驗和lof算摘要法進行了比較,果表明在動態高維的環境下,當高維索引結構失效的情況下。
  5. In the first place, the paper briefly discusses issues related to the main index mechanisms in spatial and temporal, studies the access methods of spatio - temporal databases which has been presented. furthermore, the paper explains the storage mechanisms in stadbs ( spatio - temporal analysis database system ) and presents a hr - tree index structure based on main memory to realize the index mechanism of stadbs, it ' s main technologies were discussed in detail. lastly, a visual demo of hr - tree based on main memory was introduced in this paper

    本文在分析討論了主要的空間和時間技術的基礎上,研究、分析了時空數據的存取方法,對已提出的時空技術進行了分類、比較;根據時空分析數據庫stadbs存儲機制的特點,採用基於主存的hr -樹作為stadbs時空數據的索引結構,設計與實現了stadbs的時空存取方法,論文對stadbs時空機制的設計與實現作了較詳細的介紹,同時闡述了基於主存的hr -樹可視化演示程序的主要實現方法。
  6. For more information about index architecture, see

    有關索引結構的詳細信息,請參閱
  7. Dynamic packing index structure for moving objects

    一種動態緊縮的移動對象索引結構
  8. Creates and maintains the index structure

    創建並維護索引結構
  9. Nonclustered index structures

    非聚集索引結構
  10. Clustered index structures

    聚集索引結構
  11. It also implements the full - text catalogs as inverted index structures on disk

    它還會在磁盤上以倒排索引結構的形式實現全文目錄。
  12. Indexer builds the inverted index structure that is used to store the indexed tokens

    器,它生成用來存儲令牌的倒排索引結構
  13. Design and realization of the index structure of a business - field - oriented search engine

    一種面向商業領域的搜索引結構設計及實現
  14. Nonclustered indexes have a b - tree index structure similar to the one in clustered indexes

    非聚集與聚集有一個相似的b樹索引結構
  15. The depth of the index structure a measure of the amount of work that is needed to perform an index lookup

    索引結構的深度(衡量執行查找所需的工作量) 。
  16. R - tree primarily indexes on point and polygon objects. bucketfile only indexes on line objects

    基於r樹的空間索引結構主要對點對象和面對象進行; bucketfile空間索引結構主要對線對象進行
  17. 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 ) ,闡述了它在本軟體中的實現演算法和程序簡圖。
  18. Age, gender. users do not see any difference in how the two hierarchies behave, although the natural hierarchy benefits from aggregating and indexing structures hidden from the user that account for the natural relationships in the source data

    盡管自然層次是在聚合索引結構(這兩種對源數據中的自然關系進行了解釋,並且對用戶隱藏)的基礎上形成,但是用戶無法看到兩種層次的行為差異。
  19. 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

    索引結構支持對包含詞的所有項進行高效搜,並支持高級搜操作,例如短語搜和鄰近搜
  20. Proposing the multilevel indexing structure and algorithm that can effectively handle the huge user - profile files, and adopts the model of knapsack problem to solve the problem for providing suitable volume of information to users

    提出了可以高效處理大量user - profile文件的多級索引結構及演算法,用背包問題模型來解決給用戶提供恰當數量信息的問題。
分享友人