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 associated 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 fetches DQ 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.
- S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995. Google ScholarDigital Library
- S. Agarwal, B. Mozafari, A. Panda, H. Milner, S. Madden, and I. Stoica. BlinkDB: Queries with bounded errors and bounded response times on very large data. In EuroSys, 2013. łooseness = -1 Google ScholarDigital Library
- M. Armbrust, S. Tu, A. Fox, M. J. Franklin, D. A. Patterson, N. Lanham, B. Trushkowsky, and J. Trutna. PIQL: a performance insightful query language. In SIGMOD, 2010. Google ScholarDigital Library
- BEAS.sl http://139.196.196.250:8000/BEAS.Google Scholar
- Y. Cao and W. Fan. An effective syntax for bounded relational queries. In SIGMOD, 2016. Google ScholarDigital Library
- Y. Cao, W. Fan, F. Geerts, and P. Lu. Bounded query rewriting using views. In PODS, 2016. Google ScholarDigital Library
- Y. Cao, W. Fan, T. Wo, and W. Yu. Bounded conjunctive queries. PVLDB, 2014. Google ScholarDigital Library
- W. Fan, F. Geerts, Y. Cao, and T. Deng. Querying big data by accessing small data. In PODS, 2015. Google ScholarDigital Library
- W. Fan, F. Geerts, and L. Libkin. On scale independence for querying big data. In PODS, 2014. Google ScholarDigital Library
- R. Ramakrishnan and J. Gehrke. Database Management Systems. McGraw-Hill Higher Education, 2000. Google ScholarDigital Library
- S. Zilberstein. Using anytime algorithms in intelligent systems. AI magazine, 17(3), 1996.Google Scholar
Index Terms
- BEAS: Bounded Evaluation of SQL Queries
Recommendations
Bounded Evaluation: Querying Big Data with Bounded Resources
AbstractThis work aims to reduce queries on big data to computations on small data, and hence make querying big data possible under bounded resources. A query Q is boundedly evaluable when posed on any big dataset , there exists a fraction of such ...
Comments