Abstract
In this paper we present different algorithms to reduce the number of DBMs in federations by merging them. Federations are unions of DBMs and are used to represent non-convex zones. Inclusion checking between DBMs is a limited technique to reduce the size of federations and how to choose some DBMs to merge them into a larger one is a combi-natorial problem. We present a number of simple but efficient techniques to avoid searching the combinations while still being able to merge any number of DBMs
| Originalsprog | Engelsk |
|---|---|
| Titel | 17th Nordic Workshop on Programming Theory, NWPT'05 |
| Antal sider | 3 |
| Forlag | DIKU, University of Copenhagen |
| Publikationsdato | 2005 |
| Sider | 54-56 |
| Status | Udgivet - 2005 |
| Begivenhed | 17th Nordic Workshop on Programming Theory - Copenhagen, Danmark Varighed: 19 okt. 2005 → 21 okt. 2005 Konferencens nummer: 17 |
Konference
| Konference | 17th Nordic Workshop on Programming Theory |
|---|---|
| Nummer | 17 |
| Land/Område | Danmark |
| By | Copenhagen |
| Periode | 19/10/2005 → 21/10/2005 |