Skip Navigation

The Computer Journal 1988 31(3):253-257; doi:10.1093/comjnl/31.3.253
© 1988 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (7)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bell, D. A.
Right arrow Articles by Arbuckle, W.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Clustering Related Tuples in Databases

D. A. Bell *, F. J. McErlean, P. M. Stewart and W. Arbuckle

Department of Information Systems, University of Ulster at Jordanstown, Shore Road, Newtownabbey, Co. Antrim BT37 0QB, Northern Ireland, UK

This paper presents empirical results obtained using a heuristic graph-collapsing technique for placing data on storage devices. Previous experiments using this technique worked on small datasets. We have set out to gain further experience with the graph-collapsing algorithm using more realistic data sizes. These experiments have given us promising results and stimulated ideas which should be beneficial to the database designer in the future.

Received November 1986. revised December 1986.

* To whom correspondence should be addressed.

§ Department of Information Systems, University of Ulster at Jordanstown, Shore Road, Newtownabbey, Co. Antrim BT37 0QB, Northern Ireland


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.