Making Queries Tractable on Big Data with Preprocessing (through the eyes of complexity theory)
Summary: Introduces PiT0Q: queries answerable in NC after PTIME preprocessing, with PiT0Q ⊊ P unless P=NC. NC-style refactorization yields PiTQ=P, showing every PTIME query class can become tractable for big data. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Wenfei Fan (Beihang University; University of Edinburgh)
- 2. Floris Geerts (University of Antwerp)
- 3. Frank Neven (Hasselt University; Transnational University of Limburg)
BibTeX Citation
@article{fan_vldb13,
title = {{Making Queries Tractable on Big Data with Preprocessing (through the eyes of complexity theory)}},
author = {Fan, Wenfei and Geerts, Floris and Neven, Frank},
journal = {PVLDB},
series = {{VLDB} '13},
volume = {6},
number = {9},
pages = {685--696},
doi = {10.14778/2536360.2536368},
url = {https://doi.org/10.14778/2536360.2536368},
year = {2013}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,452 | Bounded Conjunctive Queries | 2014 | VLDB | 6.5938977e-05 |
| 6,954 | Querying Big Data by Accessing Small Data | 2015 | PODS | 5.6350266e-05 |
| 7,610 | On Scale Independence for Querying Big Data | 2014 | PODS | 5.4844912e-05 |
| 12,327 | Logical Aspects of Massively Parallel and Distributed Systems | 2016 | PODS | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5 | Optimal Aggregation Algorithms for Middleware [Extended Abstract] | 2001 | PODS | 0.0010679641 |
| 24 | Data Integration: A Theoretical Perspective | 2002 | PODS | 0.00055043581 |
| 563 | Graph Summarization with Bounded Error | 2008 | SIGMOD | 0.00016327158 |
| 977 | Parallel Evaluation of Conjunctive Queries | 2011 | PODS | 0.00012731794 |
| 1,317 | Incremental Graph Pattern Matching | 2011 | SIGMOD | 0.00011050011 |
| 1,375 | Query Preserving Graph Compression | 2012 | SIGMOD | 0.00010877488 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,870 | On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates | 1998 | PODS |
| 2 | 642 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS |
| 3 | 11,832 | The Complexity of Conjunctive Queries with Degree 2 | 2022 | PODS |
| 4 | 3,046 | Tractable Query Languages for Complex Object Databases | 1991 | PODS |
| 5 | 12,195 | The Tractability Frontier of Well-designed SPARQL Queries | 2018 | PODS |
| 6 | 2,517 | On the Enumeration Complexity of Unions of Conjunctive Queries | 2019 | PODS |
| 7 | 1,065 | The Dichotomy of Conjunctive Queries on Probabilistic Structures | 2007 | PODS |
| 8 | 6,954 | Querying Big Data by Accessing Small Data | 2015 | PODS |
| 9 | 4,698 | Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries | 2021 | PODS |
| 10 | 7,794 | Tractable Lineages on Treelike Instances: Limits and Extensions | 2016 | PODS |