964 search results - page 89 / 193 » Efficiently Ordering Query Plans for Data Integration |
130
click to vote
SIGMOD
1998
ACM
15 years 9 months ago
1998
ACM
Remote data access from disparate sources across a widearea network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack o...
146
click to vote
IRI
2008
IEEE
15 years 11 months ago
2008
IEEE
Although the ever growing Web contain information to virtually every user’s query, it does not guarantee effectively accessing to those information. In many situations, the user...
238
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
153
click to vote
PAKDD
2010
ACM
15 years 6 months ago
2010
ACM
Recent studies have proposed different methods for mining frequent episodes. In this work, we study the problem of mining closed episodes based on minimal occurrences. We study the...
159
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...