Jia-bing. R. Cheng and A. R. Hurson. Effective clustering of complex objects in ObjectOriented databases. In Proceedings of ACM/SIGMOD Annual Conference on Management of Data, pages 22--31, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Dynamic Hierarchical Data Clustering And Efficient On-Line Database .. - Zou (1996) (1 citation) (Correct)
....in [41] 40] 3.4.2 Other Work In the research literature, several proposals for clustering object oriented data have been made and a survey is given in [6] They may address graphs [1] which are more general than hierarchies. They may or may not be dynamic clustering schemes. Cheng and Hurson [11] discussed a dynamic clustering method which requires keeping track of the read write ratio. Their method involves triggering a reorganization process to recluster the objects, which might not happen upon every insertion or deletion. They also assume knowledge of the traversal frequency in their ....
Jia-bing. R. Cheng and A. R. Hurson. Effective clustering of complex objects in ObjectOriented databases. In Proceedings of ACM/SIGMOD Annual Conference on Management of Data, pages 22--31, 1991.
Client Cache Management in a Distributed Object Database - Day (1995) (13 citations) (Correct)
....page buffer and object buffer on the same machine, but there seems to be nothing that would preclude putting the object buffer on the client and leaving the page buffer on the server, as in Thor. It is worth noting that Cheng and Hurson earlier advocated an elaborate static clustering technique [16] to address the performance deficiencies of simpler clustering techniques. In their proposed clustering technique, objects were first clustered into primary clusters, then reclustered into secondary clusters. Their report on prefetching [17] partially repudiates the arguments they made in favor ....
Jia-bing R. Cheng and A. R. Hurson. Effective clustering of complex objects in object-oriented databases. In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 22--31, 1991.
A Comparison of Group-based and Object-based Data.. - Bouguettaya, Le Viet.. (Correct)
....patterns can then used to predict a classification model for the data. The data warehouses become valuable in terms of understanding, managing, and using previously unknown relationships between sets of data. There has been a surge in the number of studies analyzing database clustering techniques [JbCH91] [MK94] TN91] Ben90] BKKG88] In particular, there has been recently a numbers of studies investigating adaptive (on line) clustering techniques which can cope with changing access patterns [Bou96] YSLS85] This paper is part of an on going comparative investigation of some well known ....
Jia-bing, R. Cheng, and A. R. Hurson. Effective clustering of complex objects in object-oriented databases. In SIGMOD, 1991.
Data Clustering Analysis in a Multidimensional Space - Bouguettaya, Le Viet (Correct)
....However, they are mostly static in nature [4] The case of OODBs is unique in that the underlying model provides a testbed for dynamic clustering. This is the reason why clustering takes on a whole new meaning with OODBs. There has been a surge in the number of studies of database clustering [13] [17] 24] 3] 2] In particular, there were recently a numbers of studies which investigate adaptive clustering techniques, i.e. the clustering techniques which can cope with changing access pattern and perform clustering on line [5] 5] 26] In database mining and knowledge discovery, the ....
Jia-bing, R. Cheng, and A. R. Hurson. Effective clustering of complex objects in object-oriented databases. In SIGMOD, 1991.
Dynamic Hierarchical Clustering - Chendong Zou (Correct)
....object oriented data have been made and a survey is given in [BSI94] They may assume knowledge of the queries and their frequencies [TN91] TN92] They may address graphs [BKKG88] which are more general than hierarchies. They may or may not be dynamic clustering schemes. Cheng and Hurson [CH91] discussed a dynamic clustering method which requires keeping track of the read write ratio. Their method actually involves triggering a reorganization process to recluster the objects, which might not happen upon every insertion or deletion. They also assume knowledge of the traversal frequency ....
Jia-bing. R. Cheng and A. R. Hurson. Effective clustering of complex objects in Object-Oriented databases. In Proceedings of ACM/SIGMOD Annual Conference on Management of Data, pages 22--31, 1991.
Compiling Object-Oriented Queries - Leung (1993) (Correct)
....requirement for a plan generation system. 2.7.3 Clustering The objective of clustering is place related objects close together physically, so that retrieving one object from disk causes all the related objects to be retrieved. There have been many proposals for single and multi page clusters [14, 11, 77], as well as performance studies of the impact of clustering[49] There has also been extensive work on methods for deciding which objects to place in a cluster[8, 85, 86] Support for clustering is essential for good performance in object oriented systems. 3 Approach Ultimately, the query must be ....
Jia bing R. Cheng and A. R. Hurson. Effective clustering of complex objects in object-oriented databases. In Clifford and King [18], pages 22--31.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC