964 search results - page 88 / 193 » Efficiently Ordering Query Plans for Data Integration |
229
click to vote
ICDE
2006
IEEE
16 years 6 months ago
2006
IEEE
We propose XSEED, a synopsis of path queries for cardinality estimation that is accurate, robust, efficient, and adaptive to memory budgets. XSEED starts from a very small kernel,...
163
click to vote
SIGMOD
2011
ACM
14 years 7 months ago
2011
ACM
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
118
click to vote
PODS
2003
ACM
16 years 4 months ago
2003
ACM
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
171
click to vote
DASFAA
2007
IEEE
15 years 11 months ago
2007
IEEE
Nearest-neighbor queries are an important query type for commonly used feature databases. In many different application areas, e.g. sensor databases, location based services or fac...
226
click to vote
ICDE
2003
IEEE
16 years 6 months ago
2003
IEEE
In order to publish a nested XML document from flat relational data, multiple SQL queries are often needed. The efficiency of publishing relies on how fast these queries can be ev...