查詢復雜性 的英文怎麼說

中文拼音 [zhāxúnfùzáxìng]
查詢復雜性 英文
query complexity
  • 查 : 查名詞1. [植物學] （山查） hawthorn; haw2. （姓氏） a surname
  • 詢 : 動詞（詢問） ask; inquire
  • 復 : Ⅰ形容詞1 （重復） repeated; double; duplicate 2 （繁復） complex; compound Ⅱ動詞1 （轉過去或轉過...
  • 雜 : Ⅰ形容詞（多種多樣的; 混雜的） miscellaneous; varied; sundry; mixed Ⅱ動詞（混合在一起; 攙雜） mix; blend; mingle
  • 性 : Ⅰ名詞1 （性格） nature; character; disposition 2 （性能; 性質） property; quality 3 （性別） sex ...
  • 查詢 : inquire about; [計算機] query; inquiry; polling
  1. 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

    因此，每個查詢只需在客戶端和服務器之間進行一次來回行程，從而使得性能可以隨著查詢復雜性的增加而伸縮。
  2. This system is set up on the existing search engine foundations through web services " technology, has solved variety and non - structural web data with xml technology, has formed web multi - level data base, and constructed the system structure in high performance of data warehouse, utilized midas technology to form the high - performance index storehouse structure, has remedied the deficiency of search engines at coverage, accuracy etc, and improved efficiency of information retrieval

    該系統通過webservices技術，建立在現有搜索引擎基礎之上，以xml技術解決了多樣性和非結構性的web數據轉換，形成了web多層次數據庫，利用了web挖掘面向結構化或半結構化數據的智能化數據抽取和知識發現過程，並且構造了數據倉庫的高性能查詢體系結構? hpqs ，利用midas技術形成了高性能索引庫結構，彌補了當前搜索引擎在覆蓋范圍、準確率、復雜查詢語言的使用和結果表現方式等方面的不足，改善了信息檢索的效率。
  3. This idea is not just exciting but practically attainable. this paper first provides an overview of our optimization strategy, andthen focuses on the key implementation issues of our rule - basedtransformation system for xml query optimization in a databaseenvironment

    Xml的樹形結構數據模型與關系模型相比本質上具有更高的復雜性，這使得xml的查詢優化空間比關系模型要大許多，從而給xml的查詢優化帶來了困難。
  4. Then we analyse the new complex queries method that support large - scale distributed p2p application. finally, we describe an efficient algorithm and data structure that support complex queries based on structured p2p network. coupled with a dynamic load balanceing mechanism, the model can handle both point and range queries regardless of the distribution of the queries

    本文首先介紹對等網路系統及其局限性，然後對最近提出的多種支持大規模對等網路的分散式哈希表查找系統進行分析，為了支持復雜查詢，在結構化對等網路環境中引入了新的數據結構和演算法，使其能支持范圍查詢和有效的相似查詢，再結合動態的負載均衡機制，很好的避免了系統瓶頸。
  5. The key to these issues is a proper context representation and reasoning model, which should satisfy the following requirements : 1 ) it should have the capability to deal with uncertainties, which is an intrinsic property of context ; 2 ) it should be first - order, since we need to discuss at the level of entities, attributes and relations. this property is also necessary for representing generally applicable context reasoning knowledge. 3 ) it should have reasonable complexity, since the application wants to now the up - to - date context

    上述問題的核心是目前缺乏一個良好形式化的上下文表示和推理模型，而這個模型必須滿足如下屬性： 1 ）能處理由於傳感器的不可靠以及不確定的知識帶來的上下文的不確定性； 2 ）具備一階（ first - order ）描述能力，這是因為上下文信息需要在實體的屬性和實體間的關系層次進行描述，同時這種能力也是使上下文推理知識具有通用性的基礎； 3 ）合理的復雜度，因為應用查詢上下文時希望了解的是即時的情況。
  6. I study mainly the storage of record and object, and bring forward the method of storage when the instance of object is embodied inside of record. 3 ) in the aspect of indexing, i presented a method that is generalized b - tree ( gbt ) and combining technique of founction template of c + + build the universal algorithm of queries, insert and delete. 4 ) finally, i analyze deeply and improve the query processing system of ormdbms, and confirm performance algorithm of linking and queries based on relational database. management system ( rdbms )

    在系統結構和特性中分析了系統所採用的兩層體系結構，並且詳細探討了在設計和實現數據庫時所涉及到的幾個主要問題：支持復雜對象、類型擴充、繼承機制和規則系統等；在存儲機制的討論中，主要研究了記錄和對象以及包含了對象實例記錄的存儲方法；在索引技術研究中，本文提出了類屬b樹的索引方法，通過c + +的函數模板技術給出了通用類屬b樹查詢、插入及其刪除的基本演算法；最後，文章以關系數據庫為基礎，深入分析並改進了在對象關系多媒體數據庫中的查詢處理系統，確定了選擇和連接操作的具體演算法。
  7. On the ground of analyzing daqing communication station ' s management course, it is to deal with relations of inquiry method ' s generalization, complexity and automation. the system can meet all kinds need of inquiry, and establishes base to obtain information effectively and precisely

    在詳細分析大慶通信站業務管理內容和過程的基礎上，著重解決查詢方法的綜合性、復雜性與智能性的關系，設計了能夠滿足實際需要的各種查詢功能系統，為高效、準確的獲得數據和信息奠定了基礎。
  8. International conference on clustercomputing and the grid ccgrid 2001, brisbane, australia, may 2001, p. 161. 15 goil s, choudhary a. an infrastructure for scalableparallel multidimensional analysis

    同時，本文還給出了基於phc存儲結構的并行區域查詢和動態更新演算法，這兩個演算法的時間復雜性均均為o logdn p 。
  9. To manage large - scale xml documents with complicated structure, this dissertation focus on the efficient structural indexing algorithm for xml data, result size estimation problem for xml structure based query optimization, result relevance ranking algorithm, and infrastructure for xml query processing for both text - rich and data - rich xml documents. to address the aforementioned issues, this dissertation makes the following contributions. first, it investigates the drawbacks of existing indexing algorithm for xml data, and propose a dynamic indexing algorithm for xml data based on d - bisimilarity, difx

    為滿足結構復雜、大規模的xml數據管理需要，本文深入研究了xml信息檢索系統中的結構索引演算法設計和結構化查詢優化中的查詢代價估計問題，以及查詢結果和查詢條件間的相關度演算法，主要取得了4個方面的成果：第一，分析了已有的xml數據索引演算法中存在的問題，提出了一種高效的動態xml結構索引演算法difx ，它採用動態後向結構相似性（ d - bisimilarity ）的概念，可以根據實際查詢需求以及索引最優化的要求動態決定索引中保存的結構信息。
  10. This paper embarks on from rationalism natural language processing and proposes the method of expressing concept using the dynamic attribute set according to the theory of conceptual dependency and complex attribute set. then the paper briefly analyzes the process of constructing the dynamic attribute set via unification, proposes the matching theory that conceptual attribute set can be applied to information retrieval, and basically discusses the realization of information retrieval based on this theory. finally the paper concludes that the necessary and sufficient condition that a document matches a query is that the document must contain all the conceptual bases that appear in the query and be consistent with the relationship among conceptual bases in query

    本論文從理性主義自然語言處理出發，根據概念依存理論和復雜特徵集提出了概念的動態特徵集表示方法，簡單的分析了利用合一運算構建動態特徵徵集的過程，提出了一種將概念特徵集應用於信息檢索的匹配理論，初步探討了基於該理論的信息檢索的實現，通過匹配過程的深入分析得出文檔與查詢語句相匹配的充要條件是文檔必須蘊含查詢語句所包含所有概念基並且必須與查詢語句中的概念基之間關聯關系相匹配的結論。
  11. In many situations, these options introduce performance problems, administrative challenges, increased query complexity, and other issues

    在許多情況下，這些選項都會導致性能問題、管理困難、查詢的復雜性增加和其他問題。
  12. Through the research in this article, if we represent web data by xml data model and transform the structured data from different data source into xml data format sources, we will realize data sharing and carry out exact and efficient data query, which will simplify our work and enhance efficiency greatly

    通過本文研究的方法，如果採用xml數據模型描述web上的數據，把不同來源的結構化的數據轉換成xml格式的數據，就能夠方便地實現數據的共享和進行精確、有效的信息查詢，將極大地簡化復雜性，提高工作效率。
分享友人
分享到 Line

分享到臉書