Improved Approximation Algorithms for Relational Clustering

Summary: Relational k-median and k-means clustering without join materialization. Relational k-median: first efficient relative-approximation; relational k-means: improved (1+ε)γ-approximation with faster runtime via fractional hyper-tree width fhw; runtime ~O(k^2 N fhw)+T_γ(k^2). (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 1981
Venue: PODS
Year: 2024
Pagerank: 5.093636e-05
Overall Rank: 11,144 | 23.55%
DOI: 10.1145/3695831

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Aryan Esmailpour (University of Illinois Chicago)
2. Stavros Sintos (University of Illinois Chicago)

BibTeX Citation

@inproceedings{esmailpour_pods24,
        address = {New York, NY, USA},
        series = {{PODS} '24},
        title = {{Improved Approximation Algorithms for Relational Clustering}},
        url = {https://dl.acm.org/doi/10.1145/3695831},
        doi = {10.1145/3695831},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Esmailpour, Aryan and Sintos, Stavros},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
8,728	Computing A Well-Representative Summary of Conjunctive Query Results	2024	PODS	5.3766157e-05
9,719	Subset Sampling over Joins	2026	PODS	5.2319816e-05
10,153	Faster Relational Algorithms Using Geometric Data Structures	2026	PODS	5.093636e-05
10,176	Clustering with Set Outliers and Applications in Relational Clustering	2026	PODS	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
321	Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems	2018	PODS	0.00021283186
536	Learning Linear Regression Models over Factorized Joins	2016	SIGMOD	0.0001693369
715	Learning Generalized Linear Models Over Normalized Data	2015	SIGMOD	0.00014655327
802	Random Sampling over Joins Revisited	2018	SIGMOD	0.00013907725
835	Scaling Factorization Machines to Relational Data	2013	VLDB	0.00013721583
2,085	Scalable K-Means++	2012	VLDB	9.1943614e-05
2,266	On Functional Aggregate Queries with Additive Inequalities	2019	PODS	8.8391372e-05
2,745	Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries	2020	VLDB	8.1747954e-05
2,927	In-Database Learning with Sparse Tensors	2018	PODS	7.9531195e-05
4,781	Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries	2021	PODS	6.5116536e-05
5,918	Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue	2024	PODS	6.0427671e-05
6,412	Ranked Enumeration of Join Queries with Projections	2022	VLDB	5.8836116e-05
7,286	Efficient Computation of Quantiles over Joins	2023	PODS	5.655242e-05
8,728	Computing A Well-Representative Summary of Conjunctive Query Results	2024	PODS	5.3766157e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	1,646	Fast Algorithms for Projected Clustering	1999	SIGMOD
2	10,186	Accelerating Approximate Analytical Join Queries over Unstructured Data with Statistical Guarantees	2026	SIGMOD
3	3,610	Merging the Results of Approximate Match Operations	2004	VLDB
4	7,286	Efficient Computation of Quantiles over Joins	2023	PODS
5	1,532	Summarizing Relational Databases	2009	VLDB
6	11,143	k-Clustering with Comparison and Distance Oracles	2024	PODS
7	2,253	Approximation Algorithms for Clustering Uncertain Data	2008	PODS
8	8,728	Computing A Well-Representative Summary of Conjunctive Query Results	2024	PODS
9	10,176	Clustering with Set Outliers and Applications in Relational Clustering	2026	PODS
10	10,153	Faster Relational Algorithms Using Geometric Data Structures	2026	PODS