1) progressive query
渐近查询
2) 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.
数据流作为一种新的数据形态,不同于传统的静态数据,具有连续快速、短暂易逝、规模宏大和不可预测的特点;其研究核心是在一个远小于数据规模的有限存储空间迅速获得近似查询结果。
3) nearest neighbor query
近邻查询
1.
According to the abstract degree, nearest neighbor query has three main categories: nearest neighbor query between point and point, nearest neighbor query between point and line segment, and nearest neighbor query between line segment and line segment.
空间数据库的近邻查询近几年受到人们越来越多的关注。
2.
In this paper we proposed a new method,dimensionality reduction with DCT,and further provided the method of similarity search about range query and nearest neighbor query.
提出了一种新的方法,利用离散余弦变换(DCT)进行维归约,并在此基础上给出了对时序数据进行范围查询和近邻查询的相似性搜索方法。
4) approximate querying
近似查询
1.
An approach to approximate querying of general graph structured semistructured data is proposed based on a relational database system.
提出一种利用关系数据库系统在一般图结构的半结构化数据上进行近似查询的途径。
5) nearby inquiry
就近查询
6) nearest neighbor queries
最近邻查询
1.
The algorithm efficiently solves reverse nearest neighbor queries for continuously moving points in the plane.
为研究动态环境下解决反向最近邻查询的算法,采用TPR-树索引结构给出了解决动态环境下的最近邻查询算法,并提出反向最近邻查询算法。
补充资料：查询权和监督、质询权
查询权和监督、质询权：股东有权查阅公司章程、股东大会会议记录和财务会议报告对公司的经营提出建议或者质询。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条