A stochastic approach for clustering in object bases

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A stochastic approach for clustering in object bases

Full text

Pdf (967 KB)

Source

International Conference on Management of Data archive
Proceedings of the 1991 ACM SIGMOD international conference on Management of data table of contents

Denver, Colorado, United States

Pages: 12 - 21

Year of Publication: 1991

ISBN:0-89791-425-2

Also published in ...

Authors

Manolis M. Tsangaris	Department of Computer Sciences, University of Wisconsin-Madison
Jeffrey F. Naughton	Department of Computer Sciences, University of Wisconsin-Madison

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 32, Citation Count: 23

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/115790.115792 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	All78	Arnold O. Allen, Probability, statistics, and queueing theory with computer science applications, Academic Press Professional, Inc., San Diego, CA, 1990
	Bar84	Earl 1%. Barnes. Partitioning the nodes of a graph. In Proceedings of the Fzfth Quadrennzal lnternat,onal Conference on the Theory of Graphs w~th speczal empl~asis o7~ Algorzthms for Computer Sczence Apphcatzons, pages 57-72, Kalamazoo,Michigan June 1984.
	BD90	Veronique Benzaken and Claude Delobel. Enhancing performance in a persistent object store: Clustering strategies in O.,. Technical Report 50-90, Altair, August 1990.
	BVJ84	Earl R. Barnes, A. Vannelli, and J.Q.Walker. A new procedure for partitioning the nodes of a graph. Technical Report t%C 10561, IBM Thomas J. Watson Research Center, June 1984.
	CAC+84	W. P. Cockshot, M. P. Atkinson, K. J. Chisholm, P. J. Bailey, and R. Morrison. Persistent object managment system. Software Practice a~d Expemence, 1984
	Cat88	R. G. G. Cattell, Object-oriented DBMS performance measurement, Lecture notes in computer science on Advances in object-oriented database systems, p.364-367, September 1988, Bad Mu:9Ainster am Stein-Edernburg, Germany
	Den68	Peter J. Denning, The working set model for program behavior, Communications of the ACM, v.11 n.5, p.323-333, May 1968 [doi>10.1145/363095.363141]
	DK90	Pamela Drew , Roger King , Scott E. Hudson, The performance and utility of the Cactis implementation algorithms, Proceedings of the sixteenth international conference on Very large databases, p.135-147, September 1990, Brisbane, Australia
	GJ79	Michael R. Garey and David S. Johnson. Computers and Intractability. W.H.Freeman and Company, 1979.
	GS73	David D. Grossman , Harvey F. Silverman, Placement of Records on a Secondary Storage Device to Minimize Access Time, Journal of the ACM (JACM), v.20 n.3, p.429-438, July 1973 [doi>10.1145/321765.321775]
	HK89	Scott E. Hudson , Roger King, Cactis: a self-adaptive, concurrent implementation of an object-oriented database management system, ACM Transactions on Database Systems (TODS), v.14 n.3, p.291-321, Sept. 1989 [doi>10.1145/68012.68013]
	HZ87	Mark F. Hornick , Stanley B. Zdonik, A shared, segmented memory system for an object-oriented database, ACM Transactions on Information Systems (TOIS), v.5 n.1, p.70-95, Jan. 1987 [doi>10.1145/22890.22891]
	KL70	B.W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49(2):291- 307, February 1970.
	RC88	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.
	SS90	Karen Shannon and Richard Snodgrass. Semantic clustering. In Proceedings of the 4- th Int'l Workshop in Persistent Object Systems, pages 361-374, Martha's Vineyard, MA, September 1990.
	Sta84	James W. Stamos, Static grouping of small objects to enhance performance of a paged virtual memory, ACM Transactions on Computer Systems (TOCS), v.2 n.2, p.155-180, May 1984 [doi>10.1145/190.194]
	TN90	Manolis M. Tsangaris and Jeffrey F. Naughton. Amnesia: a stochastic access model for object stores. Unpublished Manuscript, University of Wisconsin- Madison, August 1990.
	TN91	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.
	VC90	S. D. Carson, A system for adaptive disk rearrangement, Software—Practice & Experience, v.20 n.3, p.225-242, March 1990 [doi>10.1002/spe.4380200302]
	Won83	C. K. Wong, Algorithmic Studies in Mass Storage Systems, W. H. Freeman & Co., New York, NY, 1983
	YW73	P. C. Yue , C. K. Wong, On the Optimality of the Probability Ranking Scheme in Storage Applications, Journal of the ACM (JACM), v.20 n.4, p.624-633, Oct. 1973 [doi>10.1145/321784.321790]

CITED BY 23

	Mark L. Mcauliffe , Michael J. Carey , Marvin H. Solomon, Vclusters: a flexible, fine-grained object clustering mechanism, ACM SIGPLAN Notices, v.33 n.10, p.230-243, Oct. 1998
	Manolis M. Tsangaris , Jeffrey F. Naughton, On the performance of object clustering techniques, ACM SIGMOD Record, v.21 n.2, p.144-153, June 1, 1992
	Claudia Leopold, A fuzzy approach to automatic data locality optimization, Proceedings of the 1996 ACM symposium on Applied Computing, p.515-518, February 17-19, 1996, Philadelphia, Pennsylvania, United States
	Jukka Teuhola, Effective clustering of objects stored by linear hashing, Proceedings of the fourth international conference on Information and knowledge management, p.274-280, November 29-December 02, 1995, Baltimore, Maryland, United States
	William J. McIver, Jr. , Roger King, Self-adaptive, on-line reclustering of complex object data, ACM SIGMOD Record, v.23 n.2, p.407-418, June 1994
	Michael Ley, The term retrieval abstract machine, ACM SIGMOD Record, v.21 n.2, p.154-163, June 1, 1992
	Adel Shrufi, Performances of clustering policies in object bases, Proceedings of the third international conference on Information and knowledge management, p.80-87, November 29-December 02, 1994, Gaithersburg, Maryland, United States
	Vassilios Tzerpos , Richard C. Holt, Automatic architectual clustering of software, Advances in software engineering, Springer-Verlag New York, Inc., New York, NY, 2002
	Yoshinori Hara , Arthur M. Keller , Gio Wiederhold, Implementing hypertext database relationships through aggregations and exception, Proceedings of the third annual ACM conference on Hypertext, p.75-90, December 15-18, 1991, San Antonio, Texas, United States
	Mohana K. Lakhamraju , Rajeev Rastogi , S. Seshadri , S. Sudarshan, On-line reorganization in object databases, ACM SIGMOD Record, v.29 n.2, p.58-69, June 2000
	Jonathan E. Cook , Alexander L. Wolf , Benjamin G. Zorn, Partition selection policies in object database garbage collection, ACM SIGMOD Record, v.23 n.2, p.371-382, June 1994
	Kien A. Hua , S. D. Lang , Wen K. Lee, A decomposition-based simulated annealing technique for data clustering, Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.117-128, May 24-27, 1994, Minneapolis, Minnesota, United States
	Alfons Kemper , Donald Kossmann, Adaptable pointer swizzling strategies in object bases: design, realization, and quantitative analysis, The VLDB Journal — The International Journal on Very Large Data Bases, v.4 n.3, July 1995
	Jonathan E. Cook , Alexander L. Wolf , Benjamin G. Zorn, A Highly Effective Partition Selection Policy for Object Database Garbage Collection, IEEE Transactions on Knowledge and Data Engineering, v.10 n.1, p.153-172, January 1998
	Shashi Shekhar , Duen-Ren Liu, CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations, IEEE Transactions on Knowledge and Data Engineering, v.9 n.1, p.102-119, January 1997
	Athman Bouguettaya, On-Line Clustering, IEEE Transactions on Knowledge and Data Engineering, v.8 n.2, p.333-339, April 1996
	Sandeep Purao , Hemant K. Jain , Derek L. Nazareth, An Approach to Distribution of Object-Oriented Applications in Loosely Coupled Networks, Journal of Management Information Systems, v.18 n.3, p.195-234, Number 3/Winter 2001/02
	Ilhwan Choi , Bongki Moon , Hyoung-Joo Kim, A clustering method based on path similarities of XML data, Data & Knowledge Engineering, v.60 n.2, p.361-376, February, 2007
	Zhen He , Richard Lai , Alonso Marquez , Stephen Blackburn, Opportunistic prioritised clustering framework for improving OODBMS performance, Journal of Systems and Software, v.80 n.3, p.371-387, March, 2007
	Achim Kraiss , Gerhard Weikum, Integrated document caching and prefetching in storage hierarchies based on Markov-chain predictions, The VLDB Journal — The International Journal on Very Large Data Bases, v.7 n.3, p.141-162, August 1998
	Alfons Kemper , Donald Kossmann, Dual-Buffering Strategies in Object Bases, Proceedings of the 20th International Conference on Very Large Data Bases, p.427-438, September 12-15, 1994
	Achim Kraiss , Gerhard Weikum, Vertical Data Migration in Large Near-Line Document Archives Based on Markov-Chain Predictions, Proceedings of the 23rd International Conference on Very Large Data Bases, p.246-255, August 25-29, 1997
	A. A. Diwan , Sanjeeva Rane , S. Seshadri , S. Sudarshan, Clustering Techniques for Minimizing External Path Length, Proceedings of the 22th International Conference on Very Large Data Bases, p.342-353, September 03-06, 1996