Publication 2014 Issue No. 5 - May Abstract - Range Aggregation With Set Selection
 This Article Share Bibliographic References Add to: Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb Search Similar Articles Articles by Chin-Wan Chung Articles by Jong-Ryul Lee Articles by Cheng Sheng Articles by Yufei Tao
Range Aggregation With Set Selection
May 2014 (vol. 26 no. 5)
pp. 1-1
 ASCII Text x Chin-Wan Chung, Jong-Ryul Lee, Cheng Sheng, Yufei Tao, "Range Aggregation With Set Selection," IEEE Transactions on Knowledge and Data Engineering, vol. 26, no. 5, pp. 1-1, May, 2014.
 BibTex x @article{ 10.1109/TKDE.2013.125,author = {Chin-Wan Chung and Jong-Ryul Lee and Cheng Sheng and Yufei Tao},title = {Range Aggregation With Set Selection},journal ={IEEE Transactions on Knowledge and Data Engineering},volume = {26},number = {5},issn = {1041-4347},year = {2014},pages = {1-1},doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2013.125},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Knowledge and Data EngineeringTI - Range Aggregation With Set SelectionIS - 5SN - 1041-4347SP1EP1EPD - 1-1A1 - Chin-Wan Chung, A1 - Jong-Ryul Lee, A1 - Cheng Sheng, A1 - Yufei Tao, PY - 2014KW - SiliconKW - AggregatesKW - ArraysKW - FacebookKW - AgingKW - IndexingKW - TheoryKW - Range AggregationKW - IndexVL - 26JA - IEEE Transactions on Knowledge and Data EngineeringER -
Chin-Wan Chung, , Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea
Jong-Ryul Lee, , Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea
Cheng Sheng, , Google, Zürich, Switzerland
Yufei Tao, , Chinese University of Hong Kong, Hong Kong
In the classic range aggregation problem, we have a set $S$ of objects such that, given an interval $I$ , a query counts how many objects of $S$ are covered by $I$ . Besides COUNT, the problem can also be defined with other aggregate functions, e.g., SUM, MIN, MAX and AVERAGE. This paper studies a novel variant of range aggregation, where an object can belong to multiple sets. A query (at runtime) picks any two sets, and aggregates on their intersection. More formally, let $S_{1},\ldots, S_{m}$ be $m$ sets of objects. Given distinct set ids $i$ , $j$ and an interval $I$ , a query reports how many objects in $S_{i}\mathop{\rm\cap\kern 0pt}\displaylimits S_{j}$ are covered by $I$ . We call this problem range aggregation with set selection (RASS). Its hardness lies in that the pair $(i, j)$ can have ${m\choose 2}$ choices, rendering effective indexing a non-trivial task. The RASS problem can also be defined with other aggregate functions, and generalized so that a query chooses more than 2 sets. We develop a system called RASS to power this type of queries. Our system has excellent efficiency in both theory and practice. Theoretically, it consumes linear space, and achieves nearly-optimal query time. Practically, it outperforms existing solutions on real datasets by a factor up to an order of magnitude. The paper also features a rigorous theoretical analysis on the hardness of the RASS problem, which reveals invaluable insight into its characteristics.
Index Terms: