1) Continuous Approximate Query
连续近似查询
3) CKNN queries
连续k近邻查询
1.
In order to process CKNN queries on the basis of TPR-tree efficiently,a new spatio-temporal distance metrics minmaxdist(t) was presented as a pruning upper bound.
针对基于TPR树索引的连续k近邻查询,引入了一种新的时空距离度量最小最大距离函数作为TPR树索引搜索时节点剪枝上界。
2.
By introducing directional network distance measurement we proposed the directional network expansion(DNE) algorithm to reduce the network searching cost of CKNN queries processing.
基于道路网络的连续k近邻查询是移动对象数据库领域的研究重点和热点。
4) continuous nearest neighbors inquiry
连续近邻查询
5) Continuous Nearest Neighbor Search
连续最近邻查询
1.
Research on Continuous Nearest Neighbor Search;
连续最近邻查询方法研究
6) approximate query
近似查询
1.
An approximate query algorithm based on eight-neighbor grid clustering for heterogeneous XML documents is proposed.
提出了一种基于八邻域网格聚类的多样性XML近似查询算法。
2.
An approximate query algorithm for heterogeneous-oriented extensible markup language(XML) documents-TPQR was proposed.
提出了一种面向异质可扩展标记语言(XML)文档的近似查询算法(TPQR)。
3.
As data stream is a new data form,which is continuous,fast,transitory,huge size and unpredictable,as compared to traditional static data,approximate query results quickly are generated in a limited storage space far smaller than the size of the whole data set on demand.
数据流作为一种新的数据形态,不同于传统的静态数据,具有连续快速、短暂易逝、规模宏大和不可预测的特点;其研究核心是在一个远小于数据规模的有限存储空间迅速获得近似查询结果。
补充资料：近似连续性
近似连续性
approximate continuity
近似连续性【aPpro万mate continulty;..甲邢，砚ar~I.eupep‘.曰oc几] 连续性概念的一种推广，其中普通极限用近似极限(aPproximate limit)代替.函数f(x)称为在点x。是近似连续的(approximately continuous)，是指 lim aPf(x)=f(x。)· X弓xo在最简单的情形，f(x)是n维Euclid空间上的实值函数(一般地，它是向量值函数).下面的定理成立.1)实值函数f(x)在集E上Lebesgue可测的充要条件是，f在E上几乎处处近似连续(见C代naHoB一Denjoy定理(Stepanov一Denjoy theorem)).2)对于任意的有界Lebesgue可测函数f(x)，在它的每个近似连续点x。，下式成立: 。:去~lf(二)J;一f(二。)， 两风R)穿‘”’一尸其中拜是n维Lebesgue测度，R是包含x。的非退化的n维线段，而p为它的直径.【补注】有关其他参考文献，见近似极限(approximatelimit).
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条