A heuristic file reorganization algorithm based on record clustering-Reference-Cited by-同舟云学术

A heuristic file reorganization algorithm based on record clustering

Published:1989-09 Issue:3 Volume:29 Page:428-447
ISSN:0006-3835
Container-title:BIT
language:en
Short-container-title:BIT

Author:

Scheuermann Peter,Park Young Chul,Omiecinski Edward

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software

Link

http://link.springer.com/content/pdf/10.1007/BF02219229.pdf

Reference9 articles.

1. M. Jakobsson,Reducing block accesses in inverted files by partial clustering, Information Systems, Vol. 5, 1980, pp. 1–5.

2. T. Merrett, Y. Kambayashi and H. Yasuura,Scheduling of page-fetches in join operations, VLDB Conference Proceeding, Cannes, France, 1981, pp. 488–498.

3. E. Omiecinski,Incremental file reorganization schemes, VLDB Conference Proceedings, Stockholm, Sweden, 1985, pp. 346–357.

4. E. Omiecinski and P. Scheuermann,A global approach to record clustering and file reorganization, inResearch and Development in Information Retrieval, ed. C. J. van Rijsbergen, Cambridge Press, 1984, pp. 201–219.

5. S. Pramanik and D. Ittner,Use of graph-theoretic models for optimal relational database accesses to perform join, ACM Tods, Vol. 10, No. 1, 1985, pp. 57–74.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Online reorganization of databases;ACM Computing Surveys;2009-07

2. Performance analysis of a concurrent file reorganization algorithm for record clustering;IEEE Transactions on Knowledge and Data Engineering;1994-04

3. Adaptive load balancing in disk arrays;Foundations of Data Organization and Algorithms;1993