A clustering algorithm for hierarchical structures

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A clustering algorithm for hierarchical structures
Full text	Pdf (531 KB)
Source	ACM Transactions on Database Systems (TODS) archive Volume 2 , Issue 1 (March 1977) table of contents Pages: 27 - 44 Year of Publication: 1977 ISSN:0362-5915
Publisher	ACM New York, NY, USA
Bibliometrics	Downloads (6 Weeks): 5, Downloads (12 Months): 36, Citation Count: 31

Additional Information:

references cited by index terms

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/320521.320531 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.

	1	C. J. Date, An introduction to database systems: vol. I (4th ed.), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	2	HOFFER, J.A., AND SEVERANCE, D.G. The use of cluster analysis in physical data base design. Proc. Internat. Conf. on Very Large Data Bases, Framinghm, Mass., Sept. 1975, pp. 69-86. (Available from ACM, New York.)
	3	JENSEN, P.A. Optimum network partitioning. Oper. Res. 19 (1971), 916932.
	4	Brian W. Kernighan, Optimal Sequential Partitions of Graphs, Journal of the ACM (JACM), v.18 n.1, p.34-40, Jan. 1971 [doi>10.1145/321623.321627]
	5	Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
	6	LUKES, J.A. Efficient algorithm for the partitioning of trees. IBM J . Res. and Develop. 18 (1974), 217-224.

CITED BY 31

	A. El Habbash , J. Grimson , C. Horn, Towards an efficient management of objects in a distributed environment, Proceedings of the second international symposium on Databases in parallel and distributed systems, p.181-190, July 02-04, 1990, Dublin, Ireland
	J. L. Bentley , H. T. Kung , M. Schkolnick , C. D. Thompson, On the Average Number of Maxima in a Set of Vectors and Applications, Journal of the ACM (JACM), v.25 n.4, p.536-543, Oct. 1978
	Antony L. Hosking , Jiawan Chen, Mostly-copying reachability-based orthogonal persistence, ACM SIGPLAN Notices, v.34 n.10, p.382-398, Oct. 1999
	Stavros Christodoulakis, Analysis of retrieval performance for records and objects using optical disk technology, ACM Transactions on Database Systems (TODS), v.12 n.2, p.137-169, June 1987
	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
	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
	C. M. Eastman, Current practice in the evaluation of multikey search algorithms, ACM SIGIR Forum, v.17 n.4, Summer 1983
	S. Bing Yao, Optimization of query evaluation algorithms, ACM Transactions on Database Systems (TODS), v.4 n.2, p.133-155, June 1979
	Salvatore T. March , Dennis G. Severance, A mathematical modeling approach to the automatic selection of database designs, Proceedings of the 1978 ACM SIGMOD international conference on management of data, May 31-June 02, 1978, Austin, Texas
	Toby J. Teorey , James P. Fry, The Logical Record Access Approach to Database Design, ACM Computing Surveys (CSUR), v.12 n.2, p.179-211, June 1980
	Salvatore T. March, Techniques for Structuring Database Records, ACM Computing Surveys (CSUR), v.15 n.1, p.45-79, March 1983
	C. T. Yu , C. H. Chen, Adaptive information system design: one query at a time, ACM SIGMOD Record, v.14 n.4, p.280-290, May 1985
	B. J. Oommen , D. Ma, Fast object partitioning using Stochastic learning automata, Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval, p.111-122, June 03-05, 1987, New Orleans, Louisiana, United States
	S. Ceri , M. Negri , G. Pelagatti, Horizontal data partitioning in database design, Proceedings of the 1982 ACM SIGMOD international conference on Management of data, June 02-04, 1982, Orlando, Florida
	Michael Hammer , Bahram Niamir, A heuristic approach to attribute partitioning, Proceedings of the 1979 ACM SIGMOD international conference on Management of data, May 30-June 01, 1979, Boston, Massachusetts
	Edward Omiecinski , Peter Scheuermann, A global approach to record clustering and file reorganization, Proceedings of the 7th annual international ACM SIGIR conference on Research and development in information retrieval, p.201-219, July 02-06, 1984, Cambridge, England
	J. T. Park , T. J. Teorey, A knowledge-based approach to multiple query processing in distributed database system, Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow, p.461-468, December 1987, Dallas, Texas, United States
	Shamkant Navathe , Stefano Ceri , Gio Wiederhold , Jinglie Dou, Vertical partitioning algorithms for database design, ACM Transactions on Database Systems (TODS), v.9 n.4, p.680-710, Dec. 1984
	J. Banerjee , W. Kim , S.-J. Kim , J. F. Garza, Clustering a DAG for CAD Databases, IEEE Transactions on Software Engineering, v.14 n.11, p.1684-1699, November 1988
	Chen-Yong Cher , Antony L. Hosking , T. N. Vijaykumar, Software prefetching for mark-sweep garbage collection: hardware analysis and software redesign, ACM SIGOPS Operating Systems Review, v.38 n.5, December 2004
	B. J. Oommen , D. C. Y. Ma, Deterministic Learning Automata Solutions to the Equipartitioning Problem, IEEE Transactions on Computers, v.37 n.1, p.2-13, January 1988
	Stanley Y. W. Su , Shamkant B. Navathe , Don S. Batory, Logical and physical modeling of statistical scientific databases, Proceedings of the 2nd international workshop on Proceedings of the Second International Workshop on Statistical Database Management, p.251-263, September 27-29, 1983, Los Altos, California
	C. C. Kanne , G. Moerkotte, The importance of sibling clustering for efficient bulkload of XML document trees, IBM Systems Journal, v.45 n.2, p.321-334, January 2006
	Carl-Christian Kanne , Guido Moerkotte, A linear time algorithm for optimal tree sibling partitioning and approximation algorithms in Natix, Proceedings of the 32nd international conference on Very large data bases, September 12-15, 2006, Seoul, Korea
	Kenneth C. Sevcik, Data base system performance prediction using an analytical model (invited paper), Proceedings of the seventh international conference on Very Large Data Bases, p.182-198, September 09-11, 1981, Cannes, France
	Mario Schkolnick, A survey of physical database design methodology and techniques, Proceedings of the fourth international conference on Very Large Data Bases, p.474-487, September 13-15, 1978, West Berlin, Germany
	Keki B. Irani , Subir Purkayastha , Toby J. Teorey, A designer for DBMS-processable logical database structures, Proceedings of the fifth international conference on Very Large Data Bases, p.219-231, October 03-05, 1979, Rio de Janeiro, Brazil
	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
	Antony L. Hosking , Jiawan Chen, PM3: An Orthogonal Persistent Systems Programming Language - Design, Implementation, Performance, Proceedings of the 25th International Conference on Very Large Data Bases, p.587-598, September 07-10, 1999
	Lila Shnaiderman , Oded Shmueli , Rajesh Bordawekar, PIXSAR: incremental reclustering of augmented XML trees, Proceeding of the 10th ACM workshop on Web information and data management, October 30-30, 2008, Napa Valley, California, USA
	Isabella Lari , Maurizio Maravalle , Bruno Simeone, Computing sharp bounds for hard clustering problems on trees, Discrete Applied Mathematics, v.157 n.5, p.991-1008, March, 2009