A Stochastic Approach for Clustering in Object Bases

ACM SIGMOD Record

Volumn 20, Issue 2, 1991, Pages 12-21

  Tsangaris, Manolis M ^a   Naughton, Jeffrey F ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976678679     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/119995.115792     Document Type: Article

References (21)

1. Arnold O. Allen. Probability, Statistics, and Queueing Theory, with Computer Science Applications. Academic Press, 1978.
2. Earl R. Barnes. Partitioning the nodes of a graph. In Proceedings of the Fifth Quadrennial International Conference on the Theory of Graphs with special emphasis on Algorithms for Computer Science Applications, pages 57-72, Kalamazoo, Michigan, June 1984.
3. Veronique Benzaken and Claude Delobel. Enhancing performance in a persistent object store: Clustering strategies in O2 Technical Report 50-90, Altair, August 1990.
4. Earl R. Barnes, A. Vannelli, and J.Q. Walker. A new procedure for partitioning the nodes of a graph. Technical Report RC 10561, IBM Thomas J. Watson Research Center, June 1984.
5. W. P. Cockshot, ?. P. Atkinson, K. J. Chisholm, P. J. Bailey, and R. Morrison. Persistent object managment system. Software Practice and Experience, 1984
6. R. G. G. Cattell. Object oriented performance measurement. In Proceedings of the 2nd International Workshop on OODBMS, pages 364-367, FRG, September 1988.
7. P. J. Denning. The working set model of program behavior. Comm. ACM, 11(5):323-333, May 1968.
8. Pamela Drew and Roger King. The performance and utility of the cactis implementation algorithms. In Proceedings of the 16-th VLDB Conference, pages 135-147, Brisbane, Australia, 1990.
9. Michael R. Garey and David S. Johnson. Computers and Intractability. W.H.Freeman and Company, 1979.
10. David D. Grossman and Harvey F. Silverman. Placement of records on a secondary storage device to minimize access time. JACM, 20(3):429-438, July 1973.
11. Scott E. Hudson and Roger King. Cactis: A self-adaptive, concurrent implementation of an object-oriented database management system. ACM Transactions on Data Base Systems, 14(3):291-321, September 1989.
12. M. F. Hornick and S. B. Zdonick. A shared, segmented memory system for an object-oriented database. ACM Transactions on Office Information Systems, 5(1), 1987.
13. B.W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49(2):291-307, February 1970.
14. E. Richardson and M. J. Carey. Persistence in the E language: Issues and implementation. Technical Report 791, University of Wisconsin-Madison, CS Department, March 1988.
15. Karen Shannon and Richard Snodgrass. Semantic clustering. In Proceedings of the 4th Int'l Workshop in Persistent Object Systems, pages 361-374, Martha's Vineyard, MA, September 1990.
16. James W. Stamos. Static grouping of small objects to enhance performance of a paged virtual memory. ACM Transactions on Computer Systems, 2(2):155-180, May 1984.
17. Manolis M. Tsangaris and Jeffrey F. Naughton. Amnesia: a stochastic access model for object stores. Unpublished Manuscript, University of Wisconsin-Madison, August 1990.
18. Manolis M. Tsangaris and Jeffrey F. Naughton. A stochastic approach for clustering in object stores. Technical Report 1017, University of Wisconsin, Computer Sciences Dept., March 1991.
19. Paul Vongsathorn and Scott D. Carson. A system for adaptive disk rearrangement. Software Practice and Experience, 20(3):225-242, March 1990.
20. C.K. Wong. Algorithmic Studies in Mass Storage Systems. Computer Science Press, 1983.
21. P.C. Yue and C.K. Wong. On the optimality of the probability ranking scheme in storage applications. JACM, 20(4):624-633, October 1973.