243 search results - page 33 / 49 » Selectivity Estimation for Boolean Queries |
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
A “plan diagram” is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. In this paper, we present and an...
108
click to vote
ISORC
2007
IEEE
15 years 3 months ago
2007
IEEE
Many emerging applications operate on continuous unbounded data streams and need real-time data services. Providing deadline guarantees for queries over dynamic data streams is a ...
SBBD
2003
14 years 11 months ago
2003
A common requirement of many scientific applications is the ability to process queries involving expensive predicates corresponding to user programs. Optimizing such queries is ha...
59
Voted
IADIS
2004
14 years 11 months ago
2004
The success of Web search is often limited by a variety of factors. Typical queries are vague and imprecise. At the same time, the Web is a dynamic and unmoderated collection and ...
VLDB
1994
ACM
15 years 1 months ago
1994
ACM
In existing relational database systems, processing of group-by and computation of aggregate functions are always postponed until all joins are performed. In this paper, we presen...