Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 -
2 of
2
Evaluating Top-k Queries over Web-Accessible Databases
- ACM TRANS. ON DATABASE SYSTEMS
, 2004
"... ... In this article, we study how to process top-k queries efficiently in this setting, where the attributes for which users specify target values might be handled by external, autonomous sources with a variety of access interfaces. We present a sequential algorithm for processing such queries, but ..."
Abstract
-
Cited by 253 (15 self)
- Add to MetaCart
may impose some restrictions on the type and number of probes that they are willing to accept. We adapt our sequential query processing technique and introduce an efficient algorithm that maximizes sourceaccess parallelism to minimize query response time, while satisfying source-access constraints.
Parallel Probing of Web Databases for Top-k Query Processing
"... A “top-k query” specifies a set of preferred values for the attributes of a relation and expects as a result the k objects that are “closest” to the given preferences according to some distance function. In many web applications, the relation attributes are only available via probes to autonomous we ..."
Abstract
- Add to MetaCart
on the type and number of probes that they are willing to accept. These characteristics of web sources motivate the introduction of parallel top-k query processing strategies, which are the focus of this paper. We present efficient techniques that maximize source-access parallelism to minimize query response
