BEAS: Bounded Evaluation of SQL Queries

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

doi:10.1145/3035918.3058748

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 proceeding › Conference contribution

Abstract

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 language	English
Title of host publication	SIGMOD '17 Proceedings of the 2017 ACM International Conference on Management of Data
Publisher	ACM
Pages	1667-1670
Number of pages	4
ISBN (Print)	978-1-4503-4197-4
DOIs	https://doi.org/10.1145/3035918.3058748
Publication status	Published - 9 May 2017
Event	2017 ACM International Conference on Management of Data - Chicago, United States Duration: 14 May 2017 → 19 May 2017 http://sigmod2017.org/

Conference

Conference	2017 ACM International Conference on Management of Data
Abbreviated title	SIGMOD/PODS 2017
Country/Territory	United States
City	Chicago
Period	14/05/17 → 19/05/17
Internet address	http://sigmod2017.org/

Access to Document

10.1145/3035918.3058748

paper-18Accepted author manuscript, 2.51 MB

http://dl.acm.org/citation.cfm?doid=3035918.3058748

GRACE-Resource Bounded Graph Query Answering
Fan, W. (Principal Investigator)
EU government bodies
1/11/15 → 31/10/21
Project: Research
VADA: Value Added Data Systems: Principles and Architecture
Libkin, L. (Principal Investigator), Buneman, P. (Co-investigator), Fan, W. (Co-investigator) & Pieris, A. (Co-investigator)
EPSRC
1/04/15 → 30/09/20
Project: Research

Cite this

@inproceedings{d56763a3ba174d4cbfd5a4e063556522,

title = "BEAS: Bounded Evaluation of SQL Queries",

abstract = "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.",

author = "Yang Cao and Wenfei Fan and Yanghao Wang and Tengfei Yuan and Yanchao Li and Chen, {Laura Yu}",

year = "2017",

month = may,

day = "9",

doi = "10.1145/3035918.3058748",

language = "English",

isbn = "978-1-4503-4197-4",

pages = "1667--1670",

booktitle = "SIGMOD '17 Proceedings of the 2017 ACM International Conference on Management of Data",

publisher = "ACM",

note = "2017 ACM International Conference on Management of Data, SIGMOD/PODS 2017 ; Conference date: 14-05-2017 Through 19-05-2017",

url = "http://sigmod2017.org/",

}

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

T2 - 2017 ACM International Conference on Management of Data

Y2 - 14 May 2017 through 19 May 2017

ER -

BEAS: Bounded Evaluation of SQL Queries

Abstract

Conference

Access to Document

Fingerprint

Projects

GRACE-Resource Bounded Graph Query Answering

VADA: Value Added Data Systems: Principles and Architecture

Cite this