V.I.S. Wietrzyk, M. Takizawa, and M.A. Orgun (Australia)
internet computing, on-line reorganization, dynamic clustering, performance analysis
We consider the problem of on-line workflow database reorganization. We present an algorithm for maintaining the biconnected components of a graph during a sequence of edge insertions and deletions. We complement our algorithms with encouraging experimental results.
Important Links:
Go Back
