An alternate approach to calculating SKG/relatedness over high-cardinality domains and fields (e.g., for sorting by “relatedness”) yields as much as 60x latency reduction for common high-cardinality queries. Incorporation of a facet count cache yields as much as 450x latency reduction. These modifications should facilitate production deployment of sort-by-relatedness faceting in high-cardinality contexts.

Continue reading

Author's picture

Michael Gibney

Core Java developer, musician, person

Senior Application Developer

University of Pennsylvania Libraries