Title
Communication-efficient preference top-k monitoring queries via subscriptions
Abstract
With the increase of data generation in distributed fashions such as peer-to-peer systems and sensor networks, top-k query processing which returns only a small set of data that satisfies many users' preferences, becomes a substantial issue. When data are periodically updated in each epoch e.g., weather information, without any techniques, a naive solution is to aggregate all data and their updates to ensure the correctness of final answers, however, it is too costly in terms of data transfer especially for data aggregator nodes. In this paper, we propose a top-k monitoring query processing method in 2-tier distributed systems based on a publish-subscribe scheme. A set of top-k subscriptions specifying summary scope of users' interests is informed to aggregators to limit the number of transferred data records for each epoch. In addition, instead of issuing subscriptions of all queries, our method identifies a small set of minimal subscriptions resulting in lower communication overhead. Our experiments show that our technique is efficient and outperforms other comparative reactive methods.
Year
DOI
Venue
2014
10.1145/2618243.2618284
SSDBM
Keywords
Field
DocType
monitoring queries,algorithms,distributed systems,top-k queries,management
Data mining,Information retrieval,Data transmission,Computer science,Correctness,Small set,Wireless sensor network,Data aggregator,Test data generation,Database,Data records
Conference
Citations 
PageRank 
References 
1
0.35
4
Authors
3
Name
Order
Citations
PageRank
Kamalas Udomlamlert132.07
Takahiro Hara2808.02
Shojiro Nishio31853374.68