BEAS: Bounded Evaluation of SQL Queries

Yang Cao, Wenfei Fan, Yanghao Wang, Tengfei Yuan, Yanchao Li, Laura Yu Chen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

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 by
reasoning 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.
Original languageEnglish
Title of host publicationSIGMOD '17 Proceedings of the 2017 ACM International Conference on Management of Data
Number of pages4
ISBN (Print)978-1-4503-4197-4
Publication statusPublished - 9 May 2017
Event2017 ACM International Conference on Management of Data - Chicago, United States
Duration: 14 May 201719 May 2017


Conference2017 ACM International Conference on Management of Data
Abbreviated titleSIGMOD/PODS 2017
Country/TerritoryUnited States
Internet address


Dive into the research topics of 'BEAS: Bounded Evaluation of SQL Queries'. Together they form a unique fingerprint.

Cite this