Database Paper Browser

Back to papers

A Decomposition-Based Simulated Annealing Technique for Data Clustering

Summary: Recasts data clustering as a graph-partitioning problem and introduces a decomposition-based simulated annealing that randomly samples subgraphs into memory to avoid poor locality and thrashing. Dramatically cuts disk I/O while preserving high-quality clustering results. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1023
Venue
PODS
Year
1994
Pagerank
6.211957e-05
Overall Rank
4,400 | 69.43%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
285 Automating Physical Database Design in a Parallel Database 2002 SIGMOD 0.00028978423
6,073 Window Query-Optimal Clustering of Spatial Objects 1995 PODS 5.2215154e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers