Login / Signup

Divide-and-Conquer Algorithm for Computing Set Containment Joins.

Sergey MelnikHector Garcia-Molina
Published in: EDBT (2002)
Keyphrases
  • np hard
  • optimal solution
  • data model
  • dynamic programming