Supporting early pruning in top-k query processing on massive data

DOI10.1016/J.IPL.2011.03.003MaRDI QIDQ1944943zbMATH OpenOpenAlexFDO

Authors Xixian Han, Jianzhong Li, Donghua Yang

Publication date 28 March 2013

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2011.03.003

zbMATH Keywords

databasesearly pruningmassive dataTKEPtop-\(k\)

Mathematics Subject Classification ID

Database theory (68P15) Analysis of algorithms (68W40)

Recommendations

• TJJE: an efficient algorithm for top-\(k\) join on massive data
• Efficient top-k query calculation in distributed networks
• Evaluating top-\(N\) queries in \(n\)-dimensional normed spaces
• Foundations of Information and Knowledge Systems
• Time- and space-efficient sliding window top-k query processing

Cites work

• A new analysis of the false positive rate of a Bloom filter
• scientific article; zbMATH DE number 1947676 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• On the false-positive rate of Bloom filters
• Optimal aggregation algorithms for middleware.
• Scalable Bloom filters
• Space/time trade-offs in hash coding with allowable errors

Cited in

(1)

• Exploiting early sorting and early partitioning for decision support query processing

This page was built for publication: Supporting early pruning in top-\(k\) query processing on massive data

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