Evaluating Top-k Queries over Web-Accessible Databases

DMCA

Evaluating Top-k Queries over Web-Accessible Databases (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Amélie Marian , Nicolas Bruno , Luis Gravano

Venue:	ACM TRANS. ON DATABASE SYSTEMS
Citations:	252 - 15 self

BibTeX

@INPROCEEDINGS{Marian04evaluatingtop-k,
    author = {Amélie Marian and Nicolas Bruno and Luis Gravano},
    title = {Evaluating Top-k Queries over Web-Accessible Databases },
    booktitle = {ACM TRANS. ON DATABASE SYSTEMS},
    year = {2004},
    pages = {319--362},
    publisher = {}
}

OpenURL

Abstract

... 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 observe that any sequential top-k query processing strategy is bound to require unnecessarily long query processing times, since web accesses exhibit high and variable latency. Fortunately, web sources can be probed in parallel, and each source can typically process concurrent requests, although sources 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.

Keyphrases

top-k query web-accessible database sequential query processing technique web access target value autonomous source sourceaccess parallelism efficient algorithm sequential top-k query processing strategy query response time web source concurrent request sequential algorithm variable latency access interface source-access constraint

DMCA