Seeded search for joins in BCPOs
Richard Elling Moe · 2005
First we devise an algorithm for finding joins in BCPO’s given a set of upper bounds as seeds for the search. Sec-ondly, simple tests are performed to assess the possibil-ity of an increase in efficiency as a result of having the seeds as a starting point. Finally, we briefly consider join-computation by first finding some arbitrary upper bounds and subsequently use them as seed to the algorithm de-scribed above.