294 search results - page 13 / 59 » Efficiently Processing Queries on Interval-and-Value Tuples ... |
172
click to vote
ICDE
2003
IEEE
15 years 10 months ago
2003
IEEE
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
147
click to vote
VLDB
2001
ACM
15 years 9 months ago
2001
ACM
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...
154
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....
154
click to vote
ICDE
2004
IEEE
15 years 10 months ago
2004
IEEE
Edge computing pushes application logic and the underlying data to the edge of the network, with the aim of improving availability and scalability. As the edge servers are not nec...
96
Voted
PODS
2008
ACM
15 years 9 months ago
2008
ACM
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...