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

DOI10.1016/J.IPL.2011.03.003zbMath1260.68495OpenAlexW2106410028MaRDI QIDQ1944943

Donghua Yang, Jian-Zhong Li, Xixian Han

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

databasesmassive datatop-\(k\)early pruningTKEP

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Scalable Bloom filters
• On the false-positive rate of Bloom filters
• Optimal aggregation algorithms for middleware.
• A new analysis of the false positive rate of a Bloom filter
• Space/time trade-offs in hash coding with allowable errors

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