query complexity 中文意思是什麼

query complexity 解釋
查詢復雜性
  • query : n 1 質問；詢問；疑問，懷疑。2 敢問，請問〈在疑問句前單獨使用〉。3 【印刷】（打在原稿或校樣上的）...
  • complexity : n. 1. 復雜性，復合狀態。2. 復合物；復雜的事物[情況]。
  1. Fractal coding has been proved useful for image compression. it is also proved effective for content - based image retrieval. in the paper, we present a block - constrained fractal coding scheme and a matching strategy for content - based image retrieval. in this coding scheme, an image is partitioned into non - overlap blocks of a size close to that of a query iconic image. fractal codes are generated for each block independently. in the similarity measure of fractal codes, an improved nona - tree decomposition scheme is adopted to avoid matching the fractal codes globally in order to reduce computational complexity. our experimental results show that our coding scheme and the matching strategy we adopted is useful for image retrieval, and is compared favorably with other two methods tested in terms of storage usage and computing time

    分形編碼在圖像壓縮方面取得了很好的效果，同時，分形編碼也能夠用於基於內容的圖像檢索.本文提出了一種基於塊限制的分形編碼演算法和匹配策略，並將它們用於圖像檢索.在我們編碼演算法中，圖像會被預先分成互相不重疊的子圖像塊，然後對這些子圖像進行獨立地分形編碼，從而獲得整幅圖像的分形碼.該編碼演算法能夠在很大程度上減少編碼時間.在進行圖像間相似性的匹配時，我們採用改進的基於九叉樹的分配策略，從而避免全局地進行分形碼的匹配，減少了計算量.實驗結果說明，我們的編碼演算法和匹配策略能夠比較有效地應用於基於內容的圖像檢索，在計算時間和存儲時間上都優于實驗中其它兩種方法
  2. Many mature technologies on this level have been brought out, such as the relational algebra law, the improved logical query plan, the cost estimation of operation, the selective plan based on cost and order of joint, etc. although many methods have been tried out, no remarkable result or noteworthy technology has come to reality because of complexity of data decomposition and network effects

    例如，從物理查詢計劃的底層磁盤輸入輸出到語法分析階段的語法分析樹、用於改進查詢計劃的代數定律、邏輯查詢計劃的改進，以及操作代價的估計、基於代價的計劃和連接順序的選擇等全過程，都進行了不懈的努力。在這方面的研究已經非常成熟。
  3. As a result, only a single round trip between the client and the server is required for each query, resulting in scalable performance as queries increase in complexity

    因此，每個查詢只需在客戶端和服務器之間進行一次來回行程，從而使得性能可以隨著查詢復雜性的增加而伸縮。
  4. ( 2 ) the query function find of matlab is flexibly applied in general topological analysis and sharply reduce the code and complexity of program

    （ 2 ）靈活運用matlab的矩陣查詢函數find ，對常規拓撲分析演算法進行了改進，大幅度減少了程序代碼和復雜度。
  5. In the thesis, compatible data storage fashion and data structure for a large - scale 3d scene is discussed firstly. then the process technique for dem, spatial object geometry data, texture image data and scene metadata are discussed in turn. finally, a new nested index, scene pyramid + sub scene regular dividing quad - tree is brought forward, which consumes less memory and reduces the complexity of spatial data query

    本文首先確定了適用於大規模三維場景可視化的數據結構和存儲方式；然後分別針對dem數據、地物模型數據、紋理影像數據及場景元數據論述了分割與lod處理的方法；最後給出場景金字塔與子場景規則分割四叉樹兩套索引的建立以及具體應用策略，該索引機制減少了內存消耗，降低了數據查找的復雜性。
  6. As to the sting algorithm, the tune complexity of clustering is o ( n ), but the time complexity of query is o ( g ), where g is the number of grid cells at the lowest level and g is far smaller than n.

    如sting演算法，產生聚類的時間復雜度為o （ n ） ，但查詢處理時間是o （ g ） ， g是最低層網格單元的數目，通常g遠遠小於n 。
  7. In many situations, these options introduce performance problems, administrative challenges, increased query complexity, and other issues

    在許多情況下，這些選項都會導致性能問題、管理困難、查詢的復雜性增加和其他問題。
  8. Up to 32 levels of nesting is possible, although the limit varies based on available memory and the complexity of other expressions in the query

    盡管根據可用內存和查詢中其他表達式的復雜程度的不同，嵌套限制也有所不同，但嵌套到32層是可能的。
分享友人
分享到 Line

分享到臉書