A Decidable Case of Query Determinacy: Project-Select Views

Wen Zhang; Aurojit Panda; Mooly Sagiv; Scott Shenker

doi:10.48550/arxiv.2411.08874

Abstract

1 min read

Query determinacy is decidable for project-select views and a project-select-join query with no self joins, as long as the selection predicates are in a first-order theory for which satisfiability is decidable.

Open reviews(0)

Public, signed peer feedback on this preprint.

No reviews yet.

Related publications

Article2022

Balsa: Learning a Query Optimizer Without Expert Demonstrations

Zongheng Yang, Wei-Lin Chiang, Sifei Luan, Gautam Mittal, Michael Luo, Ion Stoica

Preprint2018

Learning to Optimize Join Queries With Deep Reinforcement Learning

Sanjay Krishnan, Zongheng Yang, Ken Goldberg, Joseph M. Hellerstein, Ion Stoica

Article2006

Distributed Segment Tree: Support of Range Query and Cover Query over DHT.

Changxi Zheng, Guobin Shen, Shipeng Li, Scott Shenker

Article2004

Querying at Internet scale

Brent Chun, Joseph M. Hellerstein, Ryan Huebsch, Shawn R. Jeffery, Boon Thau Loo, Sam Mardanbeigi, Timothy Roscoe, Sean Rhea, Scott Shenker, Ion Stoica