Database Paper Browser

Back to papers

Test Data for Relational Queries (Extended abstract)

Summary: Generates compact, per-query test databases that are complete w.r.t. given dependencies and exercise every distinct execution path/operator of the query, avoiding massive generic corpora. Achieves this via Armstrong-relation characterization and a construction for SPJ queries where each relation schema appears at most once. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
760
Venue
PODS
Year
1986
Pagerank
6.0291138e-05
Overall Rank
4,638 | 67.74%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
2,035 Generating Example Data for Dataflow Programs 2009 SIGMOD 9.7149269e-05
4,517 Generating Databases for Query Workloads 2010 VLDB 6.1178732e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
416 Computing Queries from Derived Relations 1985 VLDB 0.0002380776
14,268 SMALL ARMSTRONG RELATIONS FOR DATABASE DESIGN (Extended abstract) 1985 PODS -
Previous Page 1 / 1 Next

Semantically Similar Papers