In order to verify the effectiveness of abstract indices , a simulator of 10 , 000 peers , over 3 million documents is made , and several metrics are proposed . the experimental results show that abstract indices work well in various p2p data systems 从查询处理技术角度，对等数据系统可以分为基于文档元数据的查询基于文档数字标识或者键值的查询基于内容的查询方法，以及关系数据上的查询。
On the basis of analysis by consistent query answer of inconsistent database , and of nonaggregate constraints , keyword as metadata , the principle of the b - tree and binary tree , found a new research method to inconsistent database 摘要在分析非一致性数据库一致性查询方法的基础上，结合非聚集约束条件，以关键词为元数据，利用b -树与二叉树的原理，提出一种新的针对非一致性数据库的查询方法。
This is usually done via setter injection calling setter methods on the new bean passing in the dependencies as arguments , though spring supports other forms of injection such as constructor injection and lookup - method injection . see resources 这通常是透过setter内置完成的（调用新bean的setter方法，把依存项作为参数传递进去） ，虽然spring支援其他形式的内置，例如构造函数内置和查询方法内置（请参阅
20 wang s , gao y , chen t y , zhang k l . study of two - layer trust model in service grid based on behavior . computer applications , 2005 , 25 : 1974 - 1977 . 21 qin b , wang s , du x y . materialized view maintenance in peer data management systems 提出一种可扩展的分布式数据结构linknet ，以支持大规模p2p系统的搜索，提出一种高效率的分层的top - k查询方法，另外，在信任管理更新管理节点间知识共享等方面都做了创新的工作。
The public void doget triggerrequest treq , triggerresponse tresp method is called by the subscriptionservicebean query method . it retrieves information stored in the trigger handler and puts that information into the trigger response object 公用的空doget ( triggerrequest treq , triggerresponse tresp )方法，它由subscriptionservicebean查询方法调用，负责检索存储在触发器处理程序里的信息，然后将这些信息放到触发器响应对象中。
Content - based retrieval has become the most active research problem in the field of multimedia information searches . in this paper , we first discusssed some key technologies of query and retrieval on multimedia database . then we focus on content - based retrieval 本文首先讨论了多媒体数据库查询检索的一些相关技术问题，然后重点讨论了基于内容的检索，并结合qbe （ querybyexample ）查询方法，设计了一个基于内容的多媒体查询语言。
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 在详细分析大庆通信站业务管理内容和过程的基础上，着重解决查询方法的综合性、复杂性与智能性的关系，设计了能够满足实际需要的各种查询功能系统，为高效、准确的获得数据和信息奠定了基础。
This method can greatly improve the speed of rule inquiry and spend the same inquiry time on every rule . knowledge reduction and inconsistent degree are used to reduce fuzzy rule table , which avoids some problems such as vast search space and rule blast because of too much input variables . simultaneously , mea , which is superior to genetic algorithm in compute efficiency and astringency , is used to optimize parameters of fuzzy control 该控制策略利用t - s模糊模型易于表达非线性系统动态特性的优点，离线建立模糊查询表来实现实时查找在线控制，并且提出一种新颖的快速查询方法?列存储下标查询法，该方法可以大大提高规则查找的速度，而且任一规则均花费相同的查询时间；充分利用粗糙集知识约简和不相容度的理论，对模糊规则表进行约简，避免由于输入变量过多而导致搜索空间巨大、规则爆炸等问题；同时利用思维进化算法优化模糊控制的参数，这种算法在计算效率和收敛性方面都优于遗传算法。
Comparing with the traditional statistic and query methods , data mining concerns multiple subjects , congregating some research results of artificial intelligence , pattern distinguishing , database , machine study and management information system , etc . data mining is a newly - established frontier subject 与传统的统计、查询方法相比，数据挖掘技术涉及到多个学科，汇集了人工智能、模式识别、数据库、机器学习以及管理信息系统等学科的成果。数据挖掘是一个新兴的边缘学科，其应用领域非常广泛，并且具有良好的应用前景。
The conventional ways has low efficiency , which result in the application of overlap grid in moving - grid problem , which need re - disposes the interpolating connection in every step in time direction , is very difficult considering the computational efficiency . aim at the above problem in application of overlap grid , this paper using an new manner rooting in analysissitus to put forward a “ method of distinguishing points of intersection ” and develop corresponding computational soft , which could realize the automatic and shape - independent pre - disposal process for overlap grid . to deal with the problem of low efficiency for pre - disposal process in moving - grid , this paper bring forward the “ mosaic ” method and adt method which based on the huge memory of modern computer 对于重叠网格在动网格应用中的计算效率问题,本文通过进一步研究插值信息的高速查询方法,提出不同于传统算法思路,以现代计算机大内存为基础,用计算机物理内存空间换计算时间的” mosaic ”方法以及应用基于二叉树数据结构的adt ( alternatingdigitaltree )方法两类方法,成功的将原处理时间提高了两个数量级? ?即将网格规模在百万量级的重叠网格预处理时间从传统方法的耗时30 60分钟提高到几十秒钟,从而成功解决了这一问题。
