Sciweavers

Share
PVLDB
2010

Distributed Threshold Querying of General Functions by a Difference of Monotonic Representation

8 years 2 months ago
Distributed Threshold Querying of General Functions by a Difference of Monotonic Representation
The goal of a threshold query is to detect all objects whose score exceeds a given threshold. This type of query is used in many settings, such as data mining, event triggering, and top-k selection. Often, threshold queries are performed over distributed data. Given database relations that are distributed over many nodes, an object’s score is computed by aggregating the value of each attribute, applying a given scoring function over the aggregation, and thresholding the function’s value. However, joining all the distributed relations to a central database might incur prohibitive overheads in bandwidth, CPU, and storage accesses. Efficient algorithms required to reduce these costs exist only for monotonic aggregation threshold queries and certain specific scoring functions. We present a novel approach for efficiently performing general distributed threshold queries. To the best of our knowledge, this is the first solution to the problem of performing such queries with general s...
Guy Sagy, Daniel Keren, Izchak Sharfman, Assaf Sch
Added 30 Jan 2011
Updated 30 Jan 2011
Type Journal
Year 2010
Where PVLDB
Authors Guy Sagy, Daniel Keren, Izchak Sharfman, Assaf Schuster
Comments (0)
books