Deciding Monotone Duality and Identifying Frequent Itemsets in Quadratic Logspace
Summary: Shows monotone duality/hypergraph transversal testing is in DSPACE[log^2 n] via Boros–Makino problem decomposition, giving a quadratic‑logspace algorithm. Consequence: given maximal frequent and minimal infrequent itemsets, existence of any other (in)frequent itemset decidable in quadratic logspace. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Georg Gottlob (Oxford Man Institute; University of Oxford)
BibTeX Citation
@inproceedings{gottlob_pods13,
address = {New York, NY, USA},
series = {{PODS} '13},
title = {{Deciding Monotone Duality and Identifying Frequent Itemsets in Quadratic Logspace}},
url = {https://dl.acm.org/doi/10.1145/2463664.2463673},
doi = {10.1145/2463664.2463673},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Gottlob, Georg},
year = {2013}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,633 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD | 0.00010164289 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 12,229 | The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity | 2013 | PODS |
| 2 | 4,683 | False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams | 2004 | VLDB |
| 3 | 4,969 | Optimization of Constrained Frequent Set Queries with 2-variable Constraints | 1999 | SIGMOD |
| 4 | 9,703 | Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs | 2017 | SIGMOD |
| 5 | 10,174 | A Unifying Algorithm for Hierarchical Queries | 2026 | PODS |
| 6 | 7,522 | The Complexity of Mining Maximal Frequent Subgraphs | 2013 | PODS |
| 7 | 2,579 | Inference of Monotonicity Constraints in Datalog Programs (Extended Abstract) | 1989 | PODS |
| 8 | 10,154 | Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum | 2026 | PODS |
| 9 | 11,636 | New Algorithms for Monotone Classification | 2021 | PODS |
| 10 | 8,551 | Computational Complexity of Itemset Frequency Satisfiability | 2004 | PODS |