Optimal algorithms for selecting top-k combinations of attributes: theory and applications

Traditional top- algorithms, e.g., TA and NRA, have been successfully applied in many areas such as information retrieval, data mining and databases. They are designed to discover objects, e.g., top- restaurants, with highest overall scores aggregated from different attributes, e.g., price and location. However, new emerging applications like query recommendation require providing the best combinations of , instead of objects. The straightforward extension based on the existing top- algorithms is prohibitively expensive to answer top- combinations because they need to enumerate all the possible combinations, which is exponential to the number of attributes. In this article, we formalize a novel type of top- query, called top-, , which aims to find top- combinations of attributes based on the overall scores of the top- objects within each combination, where is the number of objects forming a combination. We propose a family of efficient top-,  algorithms with different data access methods, i.e., sorted accesses and random accesses and different query certainties, i.e., exact query processing and approximate query processing. Theoretically, we prove that our algorithms are instance optimal and analyze the bound of the depth of accesses. We further develop optimizations for efficient query evaluation to reduce the computational and the memory costs and the number of accesses. We provide a case study on the real applications of top-,  queries for an online biomedical search engine. Finally, we perform comprehensive experiments to demonstrate the scalability and efficiency of top-,  algorithms on multiple real-life datasets.