Ranked Enumeration of Conjunctive Query Results with Logarithmic Delay

This paper presents a novel algorithm for efficiently enumerating the results of conjunctive queries in ranked order, achieving logarithmic delay and small preprocessing time by exploiting the structure of ranking functions and utilizing query decomposition techniques.