 Application of simulated annealing to clustering tuples in databasesD. A. Bell, F. J. McErlean, P. M. Stewart and S. I. McClean Journal of the American Society for Information Science, 1990, vol. 41, issue 2, 98-110 Abstract: Techniques for general purpose optimization have been derived from the Metropolis Monte Carlo method of simulating the behavior of particles in substances as they are slowly cooled to form crystals. Simulated Annealing is such a derivative and its value for placement problems (e.g., in circuit board layout design) suggests that it could be advantageously applied to clustering tuples in databases in order to enhance responsiveness to queries. In this article we investigate this issue and compare the performance of this technique with a Graph‐Collapsing clustering method which is known to perform very well, in order to gain insights into which approach is better for incorporation in a performance‐oriented database design tool. We judge that, whilst the new method does give superior results to the graph‐based method in many cases, these improvements are gained at such a very considerable expense of algorithm run time as to rule the new technique out of our consideration as a real world general purpose design tool (but perhaps not for some special‐purpose databases). © 1990 John Wiley & Sons, Inc. Date: 1990 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:bla:jamest:v:41:y:1990:i:2:p:98-110 Ordering information: This journal article can be ordered from Access Statistics for this article More articles in Journal of the American Society for Information Science from Association for Information Science & Technology |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.