TY - GEN
T1 - BEAS: Bounded Evaluation of SQL Queries
AU - Cao, Yang
AU - Fan, Wenfei
AU - Wang, Yanghao
AU - Yuan, Tengfei
AU - Li, Yanchao
AU - Chen, Laura Yu
PY - 2017/5/9
Y1 - 2017/5/9
N2 - We demonstrate BEAS, a prototype system for querying relations with bounded resources. BEAS advocates an unconventional query evaluation paradigm under an access schema A, which is a combination of cardinality constraints and as-sociated indices. Given an SQL query Q and a dataset D, BEAS computes Q(D) by accessing a bounded fraction DQ of D, such that Q(DQ) = Q(D) and DQ is determined by A and Q only, no matter how big D grows. It identifies DQ byreasoning about the cardinality constraints of A, and fetchesDQ using the indices of A. We demonstrate the feasibility of bounded evaluation by walking through each functional component of BEAS. As a proof of concept, we demonstrate how BEAS conducts CDR analyses in telecommunication industry, compared with commercial database systems.
AB - We demonstrate BEAS, a prototype system for querying relations with bounded resources. BEAS advocates an unconventional query evaluation paradigm under an access schema A, which is a combination of cardinality constraints and as-sociated indices. Given an SQL query Q and a dataset D, BEAS computes Q(D) by accessing a bounded fraction DQ of D, such that Q(DQ) = Q(D) and DQ is determined by A and Q only, no matter how big D grows. It identifies DQ byreasoning about the cardinality constraints of A, and fetchesDQ using the indices of A. We demonstrate the feasibility of bounded evaluation by walking through each functional component of BEAS. As a proof of concept, we demonstrate how BEAS conducts CDR analyses in telecommunication industry, compared with commercial database systems.
U2 - 10.1145/3035918.3058748
DO - 10.1145/3035918.3058748
M3 - Conference contribution
SN - 978-1-4503-4197-4
SP - 1667
EP - 1670
BT - SIGMOD '17 Proceedings of the 2017 ACM International Conference on Management of Data
PB - ACM
ER -