Before revision:  In an experimental study , we show that our ranked-enumeration approach is not only theoretically interesting, but also fast and memory-efficient in practice .
After revision:  In an experimental study , we show that our ranked-enumeration approach is not only theoretically interesting, but also fast and memory-efficient and fast in practice, beating the running time of state-of-the-art database systems by orders of magnitude .