817 search results - page 3 / 164 » Generating Efficient Plans for Queries Using Views |
ICDE
1999
IEEE
14 years 9 months ago
1999
IEEE
On the Internet, the limited query-processing capabilities of sources make answering even the simplest queries challenging. In this paper, we present a scheme called GenCompact fo...
EDBT
2009
ACM
13 years 11 months ago
2009
ACM
Many Web applications are based on dynamic interactions between Web components exchanging flows of information. Such a situation arises for instance in mashup systems or when moni...
ICRA
2000
IEEE
13 years 11 months ago
2000
IEEE
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Enabling keyword queries over relational databases (KQDB) benefits a large population of users who have difficulty in understanding the database schema or using SQLs. However, sin...
PVLDB
2010
13 years 2 months ago
2010
Experience with relational systems has shown that distribution is an effective way of improving the scalability of query evaluation. In this paper, we show how distributed query e...