76 search results - page 4 / 16 » Boolean ranking: querying a database by k-constrained opti... |
153
click to vote
SIGMOD
2006
ACM
15 years 9 months ago
2006
ACM
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank...
SSDBM
2005
IEEE
15 years 3 months ago
2005
IEEE
Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a pr...
FUIN
2006
14 years 9 months ago
2006
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...
116
click to vote
COCO
2000
Springer
15 years 1 months ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...