Sciweavers

342 search results - page 1 / 69
» Branch-and-bound processing of ranked queries
Sort
View
ICDE
2010
IEEE
254views Database» more  ICDE 2010»
14 years 4 months ago
Efficient Rank Based KNN Query Processing Over Uncertain Data
Uncertain data are inherent in many applications such as environmental surveillance and quantitative economics research. As an important problem in many applications, KNN query has...
Ying Zhang, Xuemin Lin, Gaoping ZHU, Wenjie Zhang,...
SIGMOD
2005
ACM
164views Database» more  SIGMOD 2005»
14 years 5 months ago
RankSQL: Query Algebra and Optimization for Relational Top-k Queries
This paper introduces RankSQL, a system that provides a systematic and principled framework to support efficient evaluations of ranking (top-k) queries in relational database syst...
Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas...
TKDE
2010
274views more  TKDE 2010»
13 years 3 months ago
Ranked Query Processing in Uncertain Databases
—Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to “certain” data, the ...
Xiang Lian, Lei Chen 0002
FUIN
2006
139views more  FUIN 2006»
13 years 4 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
IS
2007
13 years 4 months ago
Branch-and-bound processing of ranked queries
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
Yufei Tao, Vagelis Hristidis, Dimitris Papadias, Y...