Carsten Gerlhof, Alfons Kemper, Christoph Kilger, Guido Moerkotte  Home/Search
Context Related
| db.fmi.unipassau.de/pub/...fodo93.ps.Z db.fmi.unipassau.de./pub...fodo93.ps.Z pi3.informatik.unimannheim...fodo93.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dodgers.fmi.unipassau.de/info... (more) From: pi3.informatik.uni...publications (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We classify clustering algorithms into sequence-based techniques ---which transform the object net into a linear sequence---and partition-based clustering algorithms. Tsangaris and Naughton [TN91, TN92] have shown that the partition-based techniques are superior. However, their work is based on a single partitioning algorithm, the Kernighan and Lin heuristics, which is not applicable to realistically large object bases because of its high running-time complexity. The contribution of this... (Update)
Context of citations to this paper: More
...to one cluster. This can be done by using clustering algorithms. For our system we have adapted the greedy graph partitioning algorithm [GKKM93] since it achieves good results in reasonable time. In the first phase the algorithm sorts the edges of the graph in decreasing order...
.... This allows full reorganization of a data segment by moving objects into a new segment and deletion of the old segment afterwards [GKKM93] A handle segment is an extensible array of handles stored in page slots. To directly map an OID to a handle, an OID has the following...
Cited by: More
On the Cost of Monitoring and Reorganization of Object.. - Gerlhof, Kemper.. (1996) (Correct)
Representing Web Graphs - Raghavan, Garcia-Molina (2003) (Correct)
A Performance Evaluation of OID Mapping Techniques - Eickler, Gerlhof, Kossmann (1995) (Correct)
Similar documents (at the sentence level):
67.4%: Partition-Based Clustering in Object Bases: From Theory to.. - Carsten Gerlhof (1993) (Correct)
Active bibliography (related documents): More All
0.3: Clustering in Object Bases - Gerlhof, Kemper, Kilger, Moerkotte (1992) (Correct)
0.3: Gras, A Graph-Oriented (software) Engineering Database .. - Norbert Kiesel, Andy.. (1995) (Correct)
0.2: Adaptable Pointer Swizzling Strategies in Object Bases.. - Kemper, Kossmann (1993) (Correct)
Similar documents based on text: More All
0.4: Flexible and Reliable Web Service Execution - Keidl, Seltzsam, Kemper (2002) (Correct)
0.3: A Multi-Threaded Architecture for Prefetching in Object Bases - Carsten Gerlhof And (1994) (Correct)
0.3: Building Dynamic Market Places Using Hyperqueries - Wiesner, Winklhofer, Kemper (2002) (Correct)
Related documents from co-citation: More All
11: A stochastic approach for clustering in object bases (context) - Tsangaris, Naughton
6: the performance of object clustering techniques - Tsangaris, Naughton
5: Exploiting Inheritance and Structure Semantics for Effective Clustering and Buff.. (context) - Chang, Katz - 1989
BibTeX entry: (Update)
C. Gerlhof, A. Kemper, C. Kilger, and G. Moerkotte. Partition-based clustering in object bases: From theory to practice. In Proc. of the Intl. Conf. on Foundations of Data Organization and Algorithms (FODO), volume 730 of Lecture Notes in Computer Science (LNCS), pages 301--316, Chicago, IL, October 1993. Springer-Verlag. http://citeseer.ist.psu.edu/gerlhof93partitionbased.html More
@inproceedings{ gerlhof93partitionbased,
author = "Carsten A. Gerlhof and Alfons Kemper and Christoph Kilger and Guido Moerkotte",
title = "Partition-Based Clustering in Object Bases: From Theory to Practice",
booktitle = "Intl. Conf. on Foundations of Data Organization and Algorithms",
volume = "730",
publisher = "Springer",
pages = "301--316",
year = "1993",
url = "citeseer.ist.psu.edu/gerlhof93partitionbased.html" }
Citations (may not include all citations):429 An efficient heuristic procedure for partitioning graphs (context) - Kernighan, Lin - 1970
421 A linear-time heuristic for improving network partitions (context) - Fidducia, Mattheyses - 1982
134 Object and file management in the EXODUS extensible database.. (context) - Carey, DeWitt et al.
78 An improved min-cut algorithm for partitioning VLSI networks (context) - Krishnamurthy - 1984
57 segmented memory system for an object-oriented database (context) - Hornick, Zdonik et al. - 1987
50 the performance of object clustering techniques - Tsangaris, Naughton - 1992
42 A stochastic approach for clustering in object bases (context) - Tsangaris, Naughton - 1991
39 VLSI cell placement techniques (context) - Shahookar, Mazumber - 1991
33 Static grouping of small objects to enhance performance of a.. (context) - Stamos - 1984
31 concurrent implementation of an object-oriented database man.. (context) - Hudson, King et al. - 1989
19 Partition-based clustering in object bases: From theory to p.. - Gerlhof, Kemper et al. - 1992
19 Clustering a DAG for CAD databases (context) - Banerjee, Kim et al. - 1988
16 A class of min-cut placement algorithms (context) - Breuer - 1977
8 Efficient algorithm for the partitioning of trees (context) - Lukes - 1974
7 An evaluation model for clustering strategies in the O2 obje.. (context) - Benzaken - 1990
5 the shortest spanning subgraph of a graph and the travelling.. (context) - Kruskal - 1956
4 Fakultat fur Informatik (context) - Gerlhof, Kemper et al. - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://dodgers.fmi.uni-passau.de/info/): More
Adaptable Pointer Swizzling Strategies in Object Bases - Kemper (1993) (Correct)
A Performance Evaluation of OID Mapping Techniques - Eickler, Gerlhof, Kossmann (1995) (Correct)
A Multi-Threaded Architecture for Prefetching in Object Bases - Carsten Gerlhof And (1994) (Correct)
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