An Efficient Method for Processing Multiple Continuous Top-K Queries
碩士 === 國立清華大學 === 資訊工程學系 === 94 === Recently, querying and analyzing data streams are widely applied in various applications. Most of these applications issue continuous top-k queries over multiple data streams. A top-k query is one that finds the k highest ranked answers to a user defined aggregate...
Main Authors: | Jin-Hsiung Shen, 沈進雄 |
---|---|
Other Authors: | Arbee L.P. Chen |
Format: | Others |
Language: | en_US |
Published: |
2006
|
Online Access: | http://ndltd.ncl.edu.tw/handle/14701599805813002730 |
Similar Items
-
MTopS: Multi-Query Optimization for Continuous Top-K Query Workloads
by: Shastri, Avani
Published: (2011) -
Continuous Top-K Query in Peer-to-Peer Systems
by: Jyun-Bo Chen, et al.
Published: (2006) -
Efficient Multidimensional Top-k Query Processing in Wireless Multihop Networks
by: Daichi Amagata, et al.
Published: (2015-01-01) -
Efficient and Secure Top-k Query Processing on Hybrid Sensed Data
by: Haiqin Wu, et al.
Published: (2016-01-01) -
Continuous Top-k Contour Regions Querying in Sensor Networks
by: Shangfeng Mo, et al.
Published: (2013-05-01)