Database Paper Browser

Back to papers

Semantic Complexity of Classes of Relational Queries and Query Independent Data Partitioning

Summary: Defines a VC-style semantic complexity for classes of selection queries to lift uniform-convergence bounds from single queries to whole classes, enabling one-sample selectivity estimation and small representative samples. Shows finite-complexity classes admit query-independent horizontal partitions that evenly balance workload; common hash families satisfy the combinatorial constraint. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
943
Venue
PODS
Year
1991
Pagerank
5.2518232e-05
Overall Rank
5,965 | 58.51%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
4,253 The Power of Sampling in Knowledge Discovery 1994 PODS 6.323083e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

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

Rank Cited Paper Year Venue Pagerank
628 A Benchmark of NonStop SQL on the Debit Credit Transaction 1988 SIGMOD 0.00018947564
1,701 Optimal File Distribution For Partial Match Retrieval 1988 SIGMOD 0.00010856554
3,043 Declustering Using Error Correcting Codes 1989 PODS 7.6679843e-05
Previous Page 1 / 1 Next

Semantically Similar Papers