A Framework for Processing K-Best Site Query
نویسندگان
چکیده
منابع مشابه
A Framework for Processing K-best Site Query
A novel query in spatial databases is the K-Best Site Query (KBSQ for short). Given a set of objects O, a set of sites S, and a user-given value K, a KBSQ retrieves the K sites from S such that the total distance from each object to its closest site is minimized. The KBSQ is indeed an important type of spatial queries with many real applications. In this paper, we investigate how to efficiently...
متن کاملBest position algorithms for efficient top-k query processing
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The main algorithm proposed so far for answering top-k queries over sorted lists is the Threshold Algorithm (TA). However, TA may still incur a lot of useless accesses to the lists. In this paper, we propose two algorithms that are much more efficient than TA. First, we propose ...
متن کاملA Framework for Adaptive Crowd Query Processing
Search engines can yield poor results for information retrieval tasks when they cannot interpret query predicates. Such predicates are better left for humans to evaluate. We propose an adaptive processing framework for deciding (a) which parts of a query should be processed by machines and (b) the order the crowd should process the remaining parts, optimizing for result quality and processing c...
متن کاملQuERy: A Framework for Integrating Entity Resolution with Query Processing
This paper explores an analysis-aware data cleaning architecture for a large class of SPJ SQL queries. In particular, we propose QuERy, a novel framework for integrating entity resolution (ER) with query processing. The aim of QuERy is to correctly and efficiently answer complex queries issued on top of dirty data. The comprehensive empirical evaluation of the proposed solution demonstrates its...
متن کاملParallel Algorithms for Top-k Query Processing
The general problem of answering top-k queries can be modeled using lists of objects sorted by their local scores. Fagin et al. proposed the “middleware cost” for a top-k query algorithm, and proposed the efficient sequential Threshold Algorithm (TA). However, since the size of the dataset can be incredible huge, the middleware cost of sequential TA may be intolerable. So, in this paper, we pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Database Management Systems
سال: 2013
ISSN: 0975-5705,0975-5985
DOI: 10.5121/ijdms.2013.5503