IDEAS home Printed from https://ideas.repec.org/a/bla/jamest/v41y1990i2p98-110.html
   My bibliography  Save this article

Application of simulated annealing to clustering tuples in databases

Author

Listed:
  • D. A. Bell
  • F. J. McErlean
  • P. M. Stewart
  • S. I. McClean

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.

Suggested Citation

  • D. A. Bell & F. J. McErlean & P. M. Stewart & S. I. McClean, 1990. "Application of simulated annealing to clustering tuples in databases," Journal of the American Society for Information Science, Association for Information Science & Technology, vol. 41(2), pages 98-110, March.
    • Handle: RePEc:bla:jamest:v:41:y:1990:i:2:p:98-110
    DOI: 10.1002/(SICI)1097-4571(199003)41:23.0.CO;2-1
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1097-4571(199003)41:23.0.CO;2-1
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1097-4571(199003)41:23.0.CO;2-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:jamest:v:41:y:1990:i:2:p:98-110. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.asis.org .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.