817 search results - page 34 / 164 » Generating Efficient Plans for Queries Using Views |
182
Voted
PDIS
1996
IEEE
15 years 7 months ago
1996
IEEE
Users today are struggling to integrate a broad range of information sources providing di erent levels of query capabilities. Currently, data sources with di erent and limitedcapa...
104
Voted
AIPS
2008
15 years 5 months ago
2008
When controlling an autonomous system, it is inefficient or sometimes impossible for the human operator to specify detailed commands. Instead, the field of AI autonomy has develop...
126
Voted
DKE
2006
15 years 2 months ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
180
Voted
ICDE
2011
IEEE
14 years 6 months ago
2011
IEEE
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
140
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...