Bounded Conjunctive Queries
Summary: Defines effectively bounded conjunctive queries (SPC) under access schemas, where Q(D) = Q(D_Q) with bounded D_Q. Characterizes boundedness, and provides exact/heuristic algorithms for deciding and minimizing parameters, plus a bounded-plan generator. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yang Cao
- 2. Wenfei Fan
- 3. Tianyu Wo
- 4. Wenyuan Yu
Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,452 | What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? | 2017 | PODS | 0.00011922523 |
| 1,574 | Approximate Query Processing: No Silver Bullet | 2017 | SIGMOD | 0.00011289028 |
| 3,831 | Output-optimal Parallel Algorithms for Similarity Joins | 2017 | PODS | 6.7146681e-05 |
| 6,914 | CYADB: A Database that Covers Your Ask | 2018 | VLDB | 4.8878659e-05 |
| 7,061 | Querying Big Data by Accessing Small Data | 2015 | PODS | 4.8400281e-05 |
| 8,712 | Data Driven Approximation with Bounded Resources | 2017 | VLDB | 4.4578168e-05 |
| 8,963 | An Effective Syntax for Bounded Relational Queries | 2016 | SIGMOD | 4.4165156e-05 |
| 11,793 | BEAS: Bounded Evaluation of SQL Queries | 2017 | SIGMOD | 4.1905499e-05 |
| 11,834 | Bounded Query Rewriting Using Views | 2016 | PODS | 4.1905499e-05 |
| 11,839 | Logical Aspects of Massively Parallel and Distributed Systems | 2016 | PODS | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 212 | Join Synopses for Approximate Query Answering | 1999 | SIGMOD | 0.00033997204 |
| 360 | Histogram-Based Approximation of Set-Valued Query Answers | 1999 | VLDB | 0.00025768448 |
| 1,257 | Dynamic Sample Selection for Approximate Query Processing | 2003 | SIGMOD | 0.00013002384 |
| 1,400 | Wavelet Synopses with Error Guarantees | 2002 | SIGMOD | 0.0001219602 |
| 1,706 | SCADS: Scale-Independent Storage for Social Computing Applications | 2009 | CIDR | 0.00010806188 |
| 2,062 | PIQL: Success-Tolerant Query Processing in the Cloud | 2012 | VLDB | 9.654149e-05 |
| 4,457 | Generalized Scale Independence Through Incremental Precomputation | 2013 | SIGMOD | 6.1636855e-05 |
| 5,752 | Size and Treewidth Bounds for Conjunctive Queries | 2009 | PODS | 5.3393414e-05 |
| 7,410 | On Scale Independence for Querying Big Data | 2014 | PODS | 4.7320027e-05 |
| 12,105 | Making Queries Tractable on Big Data with Preprocessing (through the eyes of complexity theory) | 2013 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,055 | On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates | 1998 | PODS | 6.4906839e-05 |
| 11,834 | Bounded Query Rewriting Using Views | 2016 | PODS | 4.1905499e-05 |
| 603 | On the Complexity of Bounded-Variable Queries | 1995 | PODS | 0.00019334592 |
| 867 | Query Optimization in the Presence of Limited Access Patterns | 1999 | SIGMOD | 0.00015757737 |
| 12,039 | The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity | 2013 | PODS | 4.1905499e-05 |
| 9,843 | Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints | 2025 | PODS | 4.2680295e-05 |
| 10,009 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS | 4.1905499e-05 |
| 8,850 | Efficient Approximations of Conjunctive Queries | 2012 | PODS | 4.4324268e-05 |
| 7,061 | Querying Big Data by Accessing Small Data | 2015 | PODS | 4.8400281e-05 |
| 8,963 | An Effective Syntax for Bounded Relational Queries | 2016 | SIGMOD | 4.4165156e-05 |