{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,31]],"date-time":"2026-10-31T13:14:17Z","timestamp":1793452457989,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540573012","type":"print"},{"value":"9783540480471","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57301-1_20","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:41:40Z","timestamp":1330260100000},"page":"301-316","source":"Crossref","is-referenced-by-count":21,"title":["Partition-based clustering in object bases: From theory to practice"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Gerlhof","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alfons","family":"Kemper","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christoph","family":"Kilger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guido","family":"Moerkotte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"V. Benzaken. An evaluation model for clustering strategies in the O2 object-oriented database system. In Proc. of the Int. Conf. on Database Theory (ICDT), pages 126\u2013140. Springer-Verlag, 1990.","DOI":"10.1007\/3-540-53507-1_74"},{"issue":"11","key":"20_CR2","doi-asserted-by":"crossref","first-page":"1684","DOI":"10.1109\/32.9055","volume":"14","author":"J. Banerjee","year":"1988","unstructured":"J. Banerjee, W. Kim, S. J. Kim, and J. F. Garza. Clustering a DAG for CAD databases. IEEE Trans. Software Eng., 14(11):1684\u20131699, Nov 1988.","journal-title":"IEEE Trans. Software Eng."},{"key":"20_CR3","unstructured":"M. A. Breuer. A class of min-cut placement algorithms. In Proc. of the Design Automation Conference, pages 284\u2013290, 1977."},{"key":"20_CR4","unstructured":"M. Carey, D. DeWitt, J. Richardson, and E. Shekita. Object and file management in the EXODUS extensible database system. In Proc. of the Conf. on Very Large Data Bases (VLDB), pages 91\u2013100, Kyoto, Japan, Aug 86."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"C. Fidducia and R. M. Mattheyses. A linear-time heuristic for improving network partitions. In Proc. of the Design Automation Conference, pages 175\u2013181, 1982.","DOI":"10.1109\/DAC.1982.1585498"},{"key":"20_CR6","volume-title":"Technical Report 6\/92","author":"C. Gerlhof","year":"1992","unstructured":"C. Gerlhof, A. Kemper, C. Kilger, and G. Moerkotte. Clustering in object bases. Technical Report 6\/92, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe, D-7500 Karlsruhe, Jun 1992."},{"key":"20_CR7","volume-title":"Technical Report 92-34","author":"C. Gerlhof","year":"1992","unstructured":"C. Gerlhof, A. Kemper, C. Kilger, and G. Moerkotte. Partition-based clustering in object bases: From theory to practice. Technical Report 92-34, RWTH Aachen, D-5100 Aachen, Dec 1992."},{"issue":"3","key":"20_CR8","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/68012.68013","volume":"14","author":"S. E. Hudson","year":"1989","unstructured":"S. E. Hudson and R. King. Cactis: A self-adaptive, concurrent implementation of an object-oriented database management system. ACM Trans. on Database Systems, 14(3):291\u2013321, Sep 1989.","journal-title":"ACM Trans. on Database Systems"},{"issue":"1","key":"20_CR9","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1145\/22890.22891","volume":"5","author":"M. Hornick","year":"1987","unstructured":"M. Hornick and S. Zdonik. A shared, segmented memory system for an object-oriented database. ACM Trans. Office Inf. Syst., 5(1):70\u201395, Jan 1987.","journal-title":"ACM Trans. Office Inf. Syst."},{"issue":"2","key":"20_CR10","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B. Kernighan","year":"1970","unstructured":"B. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49(2):291\u2013307, Feb 1970.","journal-title":"Bell System Technical Journal"},{"issue":"5","key":"20_CR11","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1109\/TC.1984.1676460","volume":"33","author":"B. Krishnamurthy","year":"1984","unstructured":"B. Krishnamurthy. An improved min-cut algorithm for partitioning VLSI networks. IEEE Trans. on Comp., 33(5):438\u2013446, 1984.","journal-title":"IEEE Trans. on Comp."},{"key":"20_CR12","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J. B. Kruskal","year":"1956","unstructured":"J. B. Kruskal. On the shortest spanning subgraph of a graph and the travelling salesman problem. Proc. of the Amer. Math. Soc., 7:48\u201350, 1956.","journal-title":"Proc. of the Amer. Math. Soc."},{"key":"20_CR13","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1147\/rd.183.0217","volume":"18","author":"J. Lukes","year":"1974","unstructured":"J. Lukes. Efficient algorithm for the partitioning of trees. IBM Journal of Research and Development, 18:217\u2013224, 1974.","journal-title":"IBM Journal of Research and Development"},{"issue":"2","key":"20_CR14","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/103724.103725","volume":"23","author":"K. Shahookar","year":"1991","unstructured":"K. Shahookar and P. Mazumber. VLSI cell placement techniques. ACM Computing Surveys, 23(2):143\u2013220, Jun 1991.","journal-title":"ACM Computing Surveys"},{"issue":"2","key":"20_CR15","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/190.194","volume":"2","author":"J. Stamos","year":"1984","unstructured":"J. Stamos. Static grouping of small objects to enhance performance of a paged virtual memory. ACM Trans. Comp. Syst., 2(2):155\u2013180, May 1984.","journal-title":"ACM Trans. Comp. Syst."},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"M. M. Tsangaris and J. F. Naughton. A stochastic approach for clustering in object bases. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 12\u201321, Denver, CO, May 1991.","DOI":"10.1145\/115790.115792"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"M. M. Tsangaris and J. F. Naughton. On the performance of object clustering techniques. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 144\u2013153, San Diego, CA, Jun 1992.","DOI":"10.1145\/130283.130308"}],"container-title":["Lecture Notes in Computer Science","Foundations of Data Organization and Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57301-1_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:11:02Z","timestamp":1605647462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57301-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573012","9783540480471"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-57301-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}