Efficient processing of exact top-k queries over disk-resident sorted lists
- 8 December 2009
- journal article
- Published by Springer Science and Business Media LLC in The VLDB Journal
- Vol. 19 (3), 437-456
- https://doi.org/10.1007/s00778-009-0174-x
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Robust and efficient algorithms for rank join evaluationPublished by Association for Computing Machinery (ACM) ,2009
- Anytime measures for top-k algorithms on exact and fuzzy data setsThe VLDB Journal, 2009
- Top-k typicality queries and efficient query answering methods on large databasesThe VLDB Journal, 2009
- Efficient online top-K retrieval with arbitrary similarity measuresPublished by Association for Computing Machinery (ACM) ,2008
- Optimizing top-k queries for middleware accessACM Transactions on Database Systems, 2007
- Minimal probingPublished by Association for Computing Machinery (ACM) ,2002
- Joining Ranked Inputs in PracticePublished by Elsevier BV ,2002
- Optimal aggregation algorithms for middlewarePublished by Association for Computing Machinery (ACM) ,2001
- The anatomy of a large-scale hypertextual Web search engineComputer Networks and ISDN Systems, 1998
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970