Edinburgh Research Explorer

BEAS: Bounded Evaluation of SQL Queries

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

Related Edinburgh Organisations

Open Access permissions

Open

Documents

http://dl.acm.org/citation.cfm?doid=3035918.3058748
Original languageEnglish
Title of host publicationSIGMOD '17 Proceedings of the 2017 ACM International Conference on Management of Data
PublisherACM
Pages1667-1670
Number of pages4
ISBN (Print)978-1-4503-4197-4
DOIs
Publication statusPublished - 9 May 2017
Event2017 ACM International Conference on Management of Data - Chicago, United States
Duration: 14 May 201719 May 2017
http://sigmod2017.org/

Conference

Conference2017 ACM International Conference on Management of Data
Abbreviated titleSIGMOD/PODS 2017
CountryUnited States
CityChicago
Period14/05/1719/05/17
Internet address

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.

Event

2017 ACM International Conference on Management of Data

14/05/1719/05/17

Chicago, United States

Event: Conference

Download statistics

No data available

ID: 31800705