PSATop-: Approximate range top- computation on big data
Authors:
- Hongjie GuoHGHongjie Guo
- Jianzhong LiJLJianzhong Li
- Hong GaoHGHong Gao
- Kaiqi ZhangKZKaiqi Zhang
- 1 January 2022
- journal article
- research article
- Published by Elsevier in Knowledge-Based Systems
- Vol. 235
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61732003, 61832003)
- National Key Research and Development Program of China (2019YFB2101902)
This publication has 21 references indexed in Scilit:
- Efficient Top-k Retrieval on Massive DataIEEE Transactions on Knowledge and Data Engineering, 2015
- Why are Normal Distributions Normal?The British Journal for the Philosophy of Science, 2014
- Top-k diversity queries over bounded regionsACM Transactions on Database Systems, 2013
- Efficient processing of exact top-k queries over disk-resident sorted listsThe VLDB Journal, 2009
- A survey of top- k query processing techniques in relational database systemsACM Computing Surveys, 2008
- Efficient top- k aggregation of ranked inputsACM Transactions on Database Systems, 2007
- Approximating extent measures of pointsJournal of the ACM, 2004
- Optimal aggregation algorithms for middlewareJournal of Computer and System Sciences, 2003
- Ripple joins for online aggregationACM SIGMOD Record, 1999
- Random sampling with a reservoirACM Transactions on Mathematical Software, 1985