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,442 | What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? | 2017 | PODS | 0.00011956109 |
| 1,574 | Approximate Query Processing: No Silver Bullet | 2017 | SIGMOD | 0.00011287495 |
| 3,833 | Output-optimal Parallel Algorithms for Similarity Joins | 2017 | PODS | 6.7173578e-05 |
| 6,912 | CYADB: A Database that Covers Your Ask | 2018 | VLDB | 4.8925595e-05 |
| 7,085 | Querying Big Data by Accessing Small Data | 2015 | PODS | 4.8388174e-05 |
| 8,715 | Data Driven Approximation with Bounded Resources | 2017 | VLDB | 4.4619052e-05 |
| 8,961 | An Effective Syntax for Bounded Relational Queries | 2016 | SIGMOD | 4.4206115e-05 |
| 11,785 | BEAS: Bounded Evaluation of SQL Queries | 2017 | SIGMOD | 4.1945683e-05 |
| 11,826 | Bounded Query Rewriting Using Views | 2016 | PODS | 4.1945683e-05 |
| 11,831 | Logical Aspects of Massively Parallel and Distributed Systems | 2016 | PODS | 4.1945683e-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 |
|---|---|---|---|---|
| 211 | Join Synopses for Approximate Query Answering | 1999 | SIGMOD | 0.00033981214 |
| 361 | Histogram-Based Approximation of Set-Valued Query Answers | 1999 | VLDB | 0.00025775749 |
| 1,260 | Dynamic Sample Selection for Approximate Query Processing | 2003 | SIGMOD | 0.00012993347 |
| 1,400 | Wavelet Synopses with Error Guarantees | 2002 | SIGMOD | 0.00012191684 |
| 1,711 | SCADS: Scale-Independent Storage for Social Computing Applications | 2009 | CIDR | 0.0001080509 |
| 2,056 | PIQL: Success-Tolerant Query Processing in the Cloud | 2012 | VLDB | 9.6645763e-05 |
| 4,455 | Generalized Scale Independence Through Incremental Precomputation | 2013 | SIGMOD | 6.171182e-05 |
| 5,744 | Size and Treewidth Bounds for Conjunctive Queries | 2009 | PODS | 5.3441438e-05 |
| 7,413 | On Scale Independence for Querying Big Data | 2014 | PODS | 4.7358047e-05 |
| 12,097 | Making Queries Tractable on Big Data with Preprocessing (through the eyes of complexity theory) | 2013 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,685 | Exact Cardinality Query Optimization with Bounded Execution Cost | 2019 | SIGMOD | 5.3717535e-05 |
| 11,826 | Bounded Query Rewriting Using Views | 2016 | PODS | 4.1945683e-05 |
| 602 | On the Complexity of Bounded-Variable Queries | 1995 | PODS | 0.00019352415 |
| 870 | Query Optimization in the Presence of Limited Access Patterns | 1999 | SIGMOD | 0.00015771912 |
| 12,031 | The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity | 2013 | PODS | 4.1945683e-05 |
| 9,843 | Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints | 2025 | PODS | 4.2721228e-05 |
| 10,009 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS | 4.1945683e-05 |
| 8,851 | Efficient Approximations of Conjunctive Queries | 2012 | PODS | 4.4363908e-05 |
| 7,085 | Querying Big Data by Accessing Small Data | 2015 | PODS | 4.8388174e-05 |
| 8,961 | An Effective Syntax for Bounded Relational Queries | 2016 | SIGMOD | 4.4206115e-05 |