C Wang, A Cheung, R Bodik - Proceedings of the 38th ACM SIGPLAN …, 2017 - dl.acm.org
SQL is the de facto language for manipulating relational data. Though powerful, many users find it difficult to write SQL queries due to highly expressive constructs. While using the …
Abstract GQL (Graph Query Language) is being developed as a new ISO standard for graph query languages to play the same role for graph databases as SQL plays for relational. In …
Proof assistants based on dependent type theory provide expressive languages for both programming and proving within the same system. However, all of the major …
TPC-H continues to be the most widely used benchmark for relational OLAP systems. It poses a number of challenges, also known as" choke points", which database systems have …
Deciding query equivalence is an important problem in data management with many practical applications. Solving the problem, however, is not an easy task. While there has …
Query rewriting transforms a relational database query into an equivalent but more efficient one, which is crucial for the performance of database-backed applications. Such rewriting …
We report on the development of the HoTT library, a formalization of homotopy type theory in the Coq proof assistant. It formalizes most of basic homotopy type theory, including …
Deciding the equivalence of SQL queries is a fundamental problem in data management. As prior work has mainly focused on studying the theoretical limitations of the problem, very few …