Top - K Query Retrieval of Combinations with Sum-of-Subsets Ranking

DOI10.1007/978-3-319-12691-3_36MaRDI QIDQ2942423zbMATH OpenOpenAlexFDO

Authors Subhashis Majumder, Biswajit Sanyal, Prosenjit Gupta, Soumik Sinha, Shiladitya Pande, Wing-Kai Hon

Publication date 11 September 2015

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-12691-3_36

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20) Combinatorics in computer science (68R05)

Recommendations

• A top-k retrieval algorithm based on a decomposition of ranking functions
• Top-\(k\) ranked document search in general text databases
• Top-k document retrieval in compact space and near-optimal time
• Time-optimal top-k document retrieval
• Top-k querying of unknown values under order constraints

Cited in

(4)

• A top-k retrieval algorithm based on a decomposition of ranking functions
• Efficient meta-data structure in top-\(k\) queries of combinations and multi-item procurement auctions
• Efficient generation of top-\(k\) procurements in a multi-item auction
• Foundations of Information and Knowledge Systems

This page was built for publication: $$Top$$ - $$K$$ Query Retrieval of Combinations with Sum-of-Subsets Ranking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942423)