Compressed Representations of Conjunctive Query Results
Summary: Introduces parameterized compressed representations for conjunctive-query outputs, trading storage space against access time/delay for specified patterns. Exploits query structure and decompositions to compactly support reuse of massive join results. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Shaleen Deep (University of Wisconsin)
- 2. Paraschos Koutris (University of Wisconsin)
BibTeX Citation
@inproceedings{deep_pods18,
address = {New York, NY, USA},
series = {{PODS} '18},
title = {{Compressed Representations of Conjunctive Query Results}},
url = {https://dl.acm.org/doi/10.1145/3196959.3196979},
doi = {10.1145/3196959.3196979},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Deep, Shaleen and Koutris, Paraschos},
year = {2018}
}Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,745 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB | 8.1747954e-05 |
| 3,136 | Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries | 2020 | PODS | 7.7210541e-05 |
| 3,453 | On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms | 2023 | PODS | 7.4004131e-05 |
| 5,601 | Optimal Join Algorithms Meet Top-k | 2020 | SIGMOD | 6.1540123e-05 |
| 7,195 | Space-Time Tradeoffs for Conjunctive Queries with Access Patterns | 2023 | PODS | 5.6765621e-05 |
| 9,472 | Indexing for Keyword Search with Structured Constraints | 2023 | PODS | 5.2634238e-05 |
| 9,961 | Threshold Queries in Theory and in the Wild | 2022 | VLDB | 5.1879626e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 60 | Integrating Compression and Execution in Column-Oriented Database Systems | 2006 | SIGMOD | 0.0003955489 |
| 411 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.00018902089 |
| 536 | Learning Linear Regression Models over Factorized Joins | 2016 | SIGMOD | 0.0001693369 |
| 636 | Answering Conjunctive Queries under Updates | 2017 | PODS | 0.0001551856 |
| 860 | Aggregation and Ordering in Factorised Databases | 2013 | VLDB | 0.00013560445 |
| 2,392 | FDB: A Query Engine for Factorised Relational Databases | 2012 | VLDB | 8.6404947e-05 |
| 2,854 | Extracting and Analyzing Hidden Graphs from Relational Databases | 2017 | SIGMOD | 8.0350257e-05 |
| 4,973 | GraphGen: Exploring Interesting Graphs in Relational Data | 2015 | VLDB | 6.4187713e-05 |
| 7,022 | SPARTex: A Vertex-Centric Framework for RDF Data Analytics | 2015 | VLDB | 5.7242241e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,173 | CompressDB: Enabling Efficient Compressed Data Direct Processing for Various Databases | 2022 | SIGMOD |
| 2 | 6,009 | Optimization of Conjunctive Predicates for Main Memory Column Stores | 2016 | VLDB |
| 3 | 610 | Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences | 1997 | SIGMOD |
| 4 | 5,357 | Joins on Encoded and Partitioned Data | 2014 | VLDB |
| 5 | 8,728 | Computing A Well-Representative Summary of Conjunctive Query Results | 2024 | PODS |
| 6 | 7,195 | Space-Time Tradeoffs for Conjunctive Queries with Access Patterns | 2023 | PODS |
| 7 | 7,161 | Computing the Difference of Conjunctive Queries Efficiently | 2023 | SIGMOD |
| 8 | 10,182 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS |
| 9 | 921 | Query Optimization In Compressed Database Systems | 2001 | SIGMOD |
| 10 | 10,296 | Succinct Structure Representations for Efficient Query Optimization | 2026 | SIGMOD |