Speeding up symbolic reasoning for relational queries

Abstract

The ability to reason about relational queries plays an important role across many types of database applications, such as test data generation, query equivalence checking, and computer-assisted query authoring. Unfortunately, symbolic reasoning about relational queries can be challenging because relational tables are multisets (bags) of tuples, and the underlying languages, such as SQL, can introduce complex computation among tuples.

Document Details

Document Type
Pub Defense Publication
Publication Date
Oct 24, 2018
Source ID
10.1145/3276527

Entities

People

  • Alvin Cheung
  • Chenglong Wang
  • Rastislav Bodík

Organizations

  • Defense Advanced Research Projects Agency
  • National Science Foundation
  • University of Washington
  • Wind Energy Technologies Office

Tags

Fields of Study

  • Computer science

Readers

  • Agent-Based Social Robotics and Mobile-Assisted Learning in Virtual Environments.
  • Database Systems and Applications
  • Distributed Systems and Data Platform Development