964 search results - page 17 / 193 » Efficiently Ordering Query Plans for Data Integration |
VLDB
2002
ACM
14 years 9 months ago
2002
ACM
Star queries are the most prevalent kind of queries in data warehousing, OLAP and business intelligence applications. Thus, there is an imperative need for efficiently processing ...
SIGMOD
2001
ACM
15 years 9 months ago
2001
ACM
Over the last decades, improvements in CPU speed have outpaced improvements in main memory and disk access rates by orders of magnitude, enabling the use of data compression techn...
ICDT
2007
ACM
15 years 3 months ago
2007
ACM
We consider the problem of querying data sources that have limited capabilities and can thus only be accessed by complying with certain binding patterns for their attributes. This ...
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....
151
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...