提出了一种基于XML文档聚类的XML近似查询算法。
An approximate XML query algorithm based on clustering of XML documents is proposed.
提出一种基于关系矩阵的异构本体信息系统间近似查询方法。
An approximate approach of querying between heterogeneous ontology-based information systems based on an association matrix is proposed.
提出一种利用关系数据库系统在一般图结构的半结构化数据上进行近似查询的途径。
An approach to approximate querying of general graph structured semistructured data is proposed based on a relational database system.
滑动窗口是对数据流进行连续查询处理、得出近似查询结果的一种常用的数据采样技术。
Sliding window is often used as a sampling method for query processing and obtaining approximate answers over data stream.
针对数据流上近似查询中的梗概计算，提出了一种新的基于最小误差的维压缩小波变换算法(MEDC)。
Aiming at synopsis computation of approximate query in data stream, a novel wavelet transformation algorithm, Minimum Error based Dimension Compression (MEDC) algorithm, is proposed in this paper.
讨论了目前聚集查询处理的两种方法，即实化视图和近似查询，总结了国内外对其研究现状，并对未来的研究方向提出看法。
This paper deals with two ways to manage aggregate queries: materialized view and approximate query, concludes the processing methods of each way and presents future research directions.
这使得查询优化器可以更有效地分析复杂的查询，因为现在统计信息近似地反映实际成本。
This allows the query optimizer to do a better job of analyzing the complex query, as the statistics can now closely reflect the actual cost.
高速数据流聚集查询：目前已有的聚集算法绝大多数是采用近似技术，以牺牲精度来换取速度的提高。
Aggregation query over high rate data streams: basically, most existing aggregation algorithms adopt the approximation technology to obtain the advancement of rate by sacrificing the accuracy.
本文主要探索了如何使用有限的内存在数据流上进行聚集s QL查询，以获得近似的结果。
In this paper, we explore primarily how to obtain approximate results of aggregate SQL queries over data streams with limited memory.
采用滑动窗口技术对数据流进行近似，提出了两种数据流上的轮廓查询方法：CCS算法和PCS算法。
We use slide window to approximate the data stream and propose two skyline query algorithms on data stream called CCS and PCS.
在压缩数据库中利用查询处理的特点构建自适应直方图以便于查询优化或近似回答查询是尚待解决的问题。
It is an unsolved problem using batched queries in compressed databases to construct an adaptive histogram to optimize query processing or answer queries approximately.
研究了聚集查询重写的特征，根据数据仓库环境下聚集查询需要快速计算结果的特点，给出了一个基于聚集查询重写的快速近似计算模型。
This paper researches into the characteristic of aggregate query rewriting and gives a kind of rapidly approximate query computing model based on aggregate query rewriting under the data warehouse.
我们用SPARQL查询rdf数据库，它的语句格式被设计成近似SQL，但因为它迄今为止十分年轻，所以还不是很强大。
SPARQL is what we use to query the RDF repository. Its syntax has been designed close to SQL but since it is quite young it is by far not as powerful yet.
这专题要求改做「近似」星型图为星型图及使用C-Store查询优化器，设计一种有效评价查询的方案。
In this project, you would devise a scheme to efficiently evaluate queries over schemas that are "near" star schemas by transforming them to star schemas and using the C-Store query optimizer.
这专题要求改做「近似」星型图为星型图及使用C-Store查询优化器，设计一种有效评价查询的方案。
In this project, you would devise a scheme to efficiently evaluate queries over schemas that are "near" star schemas by transforming them to star schemas and using the C-Store query optimizer.
应用推荐