research-article

An Effective Syntax for Bounded Relational Queries

Authors:

Wenfei FanAuthors Info & Claims

SIGMOD '16: Proceedings of the 2016 International Conference on Management of Data

Pages 599 - 614

https://doi.org/10.1145/2882903.2882942

Published: 14 June 2016 Publication History

Abstract

A query Q is boundedly evaluable under a set A of access constraints if for all datasets D that satisfy A, there exists a fraction D_Q of D such that Q(D) = Q(D_Q), and the size of D_Q and time for identifying D_Q are both independent of the size of D. That is, we can compute Q(D) by accessing a bounded amount of data no matter how big D grows. However, while desirable, it is undecidable to determine whether a query in relational algebra (RA) is bounded under A.

In light of the undecidability, this paper develops an effective syntax for bounded RA queries. We identify a class of covered RA queries such that under A, (a) every boundedly evaluable RA query is equivalent to a covered query, (b) every covered RA query is boundedly evaluable, and (c) it takes PTIME in |Q| and |A| to check whether Q is covered by A. We provide quadratic-time algorithms to check the coverage of Q, and to generate a bounded query plan for covered Q. We also study a new optimization problem for minimizing access constraints for covered queries. Using real-life data, we experimentally verify that a large number of RA queries in practice are covered, and that bounded query plans improve RA query evaluation by orders of magnitude.

References

[1]

http://data.gov.uk/dataset/naptan.

[2]

http://data.gov.uk/dataset/road-accidents-safety-data.

[3]

www.transtats.bts.gov/DatabaseInfo.asp?DB_ID=110.

[4]

www.transtats.bts.gov/DatabaseInfo.asp?DB_ID=120.

[5]

S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.

Digital Library

[6]

M. Armbrust, K. Curtis, T. Kraska, A. Fox, M. J. Franklin, and D. A. Patterson. PIQL: Success-tolerant query processing in the cloud. PVLDB, 5(3), 2011.

Digital Library

[7]

M. Armbrust, A. Fox, D. A. Patterson, N. Lanham, B. Trushkowsky, J. Trutna, and H. Oh. SCADS: Scale-independent storage for social computing applications. In CIDR, 2009.

[8]

G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation,Combinatorial optimization problems and their approximability properties. Springer, 1999.

Digital Library

[9]

G. Ausiello, P. G. Franciosa, and D. Frigioni. Directed hypergraphs: Problems, algorithmic results, and a novel decremental approach. In ICTCS, 2001.

Digital Library

[10]

M. Benedikt, P. Bourhis, and C. Ley. Analysis of schemas with access restrictions. TODS, 40(1):5, 2015.

Digital Library

[11]

M. Benedikt, J. Leblay, and E. Tsamoura. Querying with access patterns and integrity constraints. PVLDB, 8(6), 2015.

Digital Library

[12]

A. Cal;ı and D. Martinenghi. Querying data under access limitations. In ICDE, 2008.

[13]

Y. Cao, W. Fan, J. Huai, and R. Huang. Making pattern queries bounded in big graphs. In ICDE, 2015.

[14]

Y. Cao, W. Fan, and W. Yu. Bounded conjunctive queries. PVLDB, 2014.

Digital Library

[15]

M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li. Approximation algorithms for directed steiner problems. In SODA, 1998.

Digital Library

[16]

Facebook, 2013. http://newsroom.fb.com.

[17]

Facebook. Introducing graph search. https://en-gb.facebook.com/about/graphsearch, 2013.

[18]

W. Fan, F. Geerts, Y. Cao, T. Deng, and P. Lu. Querying big data by accessing small data. In PODS, 2015.

Digital Library

[19]

W. Fan, F. Geerts, and L. Libkin. On scale independence for querying big data. In PODS, 2014.

Digital Library

[20]

A. V. Gelder and R. W. Topor. Safety and translation of relational calculus queries. TODS, 16(2), 1991.

Digital Library

[21]

I. Grujic, S. Bogdanovic-Dinic, and L. Stoimenov. Collecting and analyzing data from e-government facebook pages. In ICT Innovations, 2014.

[22]

A. Gubichev and T. Neumann. Exploiting the query structure for efficient join ordering in SPARQL queries. In EDBT, 2014.

[23]

Y. Huhtala, J. Karkkainen, P. Porkka, and H. Toivonen. TANE: An efficient algorithm for discovering functional and approximate dependencies. Comput. J., 42(2):100--111, 1999.

[24]

I. Ileana, B. Cautis, A. Deutsch, and Y. Katsis. Complete yet practical search for minimal query reformulations under constraints. In SIGMOD, pages 1015--1026, 2014.

Digital Library

[25]

C. Li. Computing complete answers to queries in the presence of limited access patterns. VLDB J., 12(3), 2003.

Digital Library

[26]

J. Liu, J. Li, C. Liu, and Y. Chen. Discover dependencies from data - A review. TKDE, 24(2), 2012.

Digital Library

[27]

G. Moerkotte, P. Fender, and M. Eich. On the correct and complete enumeration of the core search space. In SIGMOD, 2013.

Digital Library

[28]

A. Nash and B. Ludascher. Processing first-order queries under limited access patterns. In PODS, 2004.

Digital Library

[29]

C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.

[30]

L. Popa. Object/relational query optimization with chase and backchase. IRCS Technical Reports Series, 2001.

[31]

R. Ramakrishnan and J. Gehrke. Database management systems. McGraw Hill, 2000.

Digital Library

[32]

A. P. Stolboushkin and M. A. Taitslin. Finite queries do not have effective syntax. In PODS, 1995.

Digital Library

[33]

R. R. Stoll. Set theory and logic. W. H. Freeman and Co., San Francisco, Calif.-London, 1961.

[34]

J. D. Ullman. Principles of Database Systems, 2nd Edition. Computer Science Press, 1982.

Digital Library

[35]

J. D. Ullman. Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press, 1988.

Digital Library

Cited By

Cao YFan WYuan T(2020)Bounded Evaluation: Querying Big Data with Bounded ResourcesInternational Journal of Automation and Computing10.1007/s11633-020-1236-117:4(502-526)Online publication date: 1-Aug-2020
https://dl.acm.org/doi/10.1007/s11633-020-1236-1
Guo HLi JGao H(2020)Selecting Sources for Query Approximation with Bounded ResourcesCombinatorial Optimization and Applications10.1007/978-3-030-64843-5_5(61-75)Online publication date: 11-Dec-2020
https://dl.acm.org/doi/10.1007/978-3-030-64843-5_5
Cao YFan WYuan T(2019)Block as a value for SQL over NoSQLProceedings of the VLDB Endowment10.14778/3339490.333949812:10(1153-1166)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.14778/3339490.3339498
Show More Cited By

Index Terms

An Effective Syntax for Bounded Relational Queries
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database query processing
        Query optimization
        Query planning
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query processing and optimization (theory)

Recommendations

Efficient approximations of conjunctive queries
PODS '12: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems

When finding exact answers to a query over a large database is infeasible, it is natural to approximate the query by a more efficient one that comes from a class with good bounds on the complexity of query evaluation. In this paper we study such ...
Answering Conjunctive Queries with Inequalities

In this paper, we study the complexity of answering conjunctive queries (CQ) with inequalities (ź). In particular, we are interested in comparing the complexity of the query with and without inequalities. The main contribution of our work is a novel ...
Queries and materialized views on probabilistic databases

We review in this paper some recent yet fundamental results on evaluating queries over probabilistic databases. While one can see this problem as a special instance of general purpose probabilistic inference, we describe in this paper two key database ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '16: Proceedings of the 2016 International Conference on Management of Data

June 2016

2300 pages

ISBN:9781450335317

DOI:10.1145/2882903

General Chairs:
Fatma Özcan
IBM Research, USA
,
Georgia Koutrika
HP Labs, USA
,
Program Chair:
Sam Madden
Massachusetts Institute of Technology, USA

Copyright © 2016 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 June 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conference

SIGMOD/PODS'16

Sponsor:

SIGMOD

SIGMOD/PODS'16: International Conference on Management of Data

June 26 - July 1, 2016

California, San Francisco, USA

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
462
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Cao YFan WYuan T(2020)Bounded Evaluation: Querying Big Data with Bounded ResourcesInternational Journal of Automation and Computing10.1007/s11633-020-1236-117:4(502-526)Online publication date: 1-Aug-2020
https://dl.acm.org/doi/10.1007/s11633-020-1236-1
Guo HLi JGao H(2020)Selecting Sources for Query Approximation with Bounded ResourcesCombinatorial Optimization and Applications10.1007/978-3-030-64843-5_5(61-75)Online publication date: 11-Dec-2020
https://dl.acm.org/doi/10.1007/978-3-030-64843-5_5
Cao YFan WYuan T(2019)Block as a value for SQL over NoSQLProceedings of the VLDB Endowment10.14778/3339490.333949812:10(1153-1166)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.14778/3339490.3339498
Zhu GWang QTang QGu RYuan CHuang Y(2019)Efficient and Scalable Functional Dependency Discovery on Distributed Data-Parallel PlatformsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2019.292501430:12(2663-2676)Online publication date: 1-Dec-2019
https://doi.org/10.1109/TPDS.2019.2925014
Fan W(2019)Making big data smallProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences10.1098/rspa.2019.0034475:2225(20190034)Online publication date: 8-May-2019
https://doi.org/10.1098/rspa.2019.0034
Cao YFan WGeerts FLu P(2018)Bounded Query Rewriting Using ViewsACM Transactions on Database Systems10.1145/318367343:1(1-46)Online publication date: 23-Mar-2018
https://dl.acm.org/doi/10.1145/3183673
Li KLi G(2018)Approximate Query Processing: What is New and Where to Go?Data Science and Engineering10.1007/s41019-018-0074-43:4(379-397)Online publication date: 14-Sep-2018
https://doi.org/10.1007/s41019-018-0074-4
Cao YFan W(2017)Data driven approximation with bounded resourcesProceedings of the VLDB Endowment10.14778/3099622.309962810:9(973-984)Online publication date: 1-May-2017
https://dl.acm.org/doi/10.14778/3099622.3099628
Cao YFan WWang YYuan TLi YChen LChirkova RYang JSuciu D(2017)BEASProceedings of the 2017 ACM International Conference on Management of Data10.1145/3035918.3058748(1667-1670)Online publication date: 9-May-2017
https://dl.acm.org/doi/10.1145/3035918.3058748
Chaudhuri SDing BKandula SChirkova RYang JSuciu D(2017)Approximate Query ProcessingProceedings of the 2017 ACM International Conference on Management of Data10.1145/3035918.3056097(511-519)Online publication date: 9-May-2017
https://dl.acm.org/doi/10.1145/3035918.3056097
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents