2514 search results - page 133 / 503 » On the Computation of Approximations of Database Queries |
158
click to vote
DAWAK
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Data mining algorithms are often embedded in more complex systems, serving as the provider of data for internal decision making within these systems. In this paper we add...
203
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
175
click to vote
KDD
2002
ACM
16 years 6 months ago
2002
ACM
In the last several years, large OLAP databases have become common in a variety of applications such as corporate data warehouses and scientific computing. To support interactive ...
176
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
Skyline queries compute the set of Pareto-optimal tuples in a relation, i.e., those tuples that are not dominated by any other tuple in the same relation. Although several algorit...
207
click to vote
SIGMOD
2012
ACM
13 years 9 months ago
2012
ACM
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become inc...