Adaptive range filters for cold data: Avoiding trips to siberia

Proceedings of the VLDB Endowment

Volumn 6, Issue 14, 2013, Pages 1714-1725

  Alexiou, Karolina ^a   Kossmann, Donald ^a   Larson, Per Åke ^b  

^a ETH ZURICH   (Switzerland)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE FILTERING; ADAPTIVE FILTERS; BLOOMS (METAL); DATA STRUCTURES;

BLOOM FILTERS; COLD REGIONS; COMMERCIAL DATABASE SYSTEM; EFFICIENT IMPLEMENTATION; RANGE QUERY; SIBERIA;

QUERY LANGUAGES;

EID: 84891051718     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2556549.2556556     Document Type: Article

References (18)

1. A. V. Aho, P. J. Denning, and J. D. Ullman. Principles of optimal page replacement. J. ACM, 18(1):80-93, 1971.
2. A.-K. Alexiou. Adaptive range filters for query optimization. Master Thesis 84, Systems Group, ETH Zurich, 2013.
3. B. Baig, H. Chan, S. McCauley, and A. Wong. Range queries using Bloom filters. http://www.scribd.com/doc/92463819/Ranged-Queries-Using-Bloom-Filters-Final.
4. D. Barbaŕa, W. DuMouchel, C. Faloutsos, P. J. Haas, J. M. Hellerstein, Y. E. Ioannidis, H. V. Jagadish, T. Johnson, R. T. Ng, V. Poosala, K. A. Ross, and K. C. Sevcik. The new jersey data reduction report. IEEE Data Eng. Bull., 20(4):3-45, 1997.
5. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7):422-426, 1970.
6. F. Bonomi, M. Mitzenmacher, R. Panigrahy, S. Singh, and G. Varghese. An improved construction for counting Bloom filters. In Y. Azar and T. Erlebach, editors, ESA, volume 4168 of Lecture Notes in Computer Science, pages 684-695. Springer, 2006.
7. J. Bruck, J. Gao, and A. Jiang. Weighted Bloom filters. 2006.
8. C.-M. Chen and N. Roussopoulos. Adaptive selectivity estimation using query feedback. In R. T. Snodgrass and M. Winslett, editors, SIGMOD Conference, pages 161-172. ACM Press, 1994.
9. S. Dar, M. J. Franklin, B. T. J́onsson, D. Srivastava, and M. Tan. Semantic data caching and replacement. In T. M. Vijayaraman, A. P. Buchmann, C. Mohan, and N. L. Sarda, editors, VLDB, pages 330-341. Morgan Kaufmann, 1996.
10. C. Diaconu, C. Freedman, E. Ismert, P.-A. Larson, P. Mittal, R. Stonecipher, N. Verma, and M. Zwilling. Hekaton: SQL Server's memory-optimized OLTP engine. In SIGMOD Conference, 2013.
11. J.-P. Dittrich, P. M. Fischer, and D. Kossmann. Agile: Adaptive indexing for context-aware information filters. In F. Ö zcan, editor, SIGMOD Conference, pages 215-226. ACM, 2005.
12. F. Fabret, H.-A. Jacobsen, F. Llirbat, J. Pereira, K. A. Ross, and D. Shasha. Filtering algorithms and implementation for very fast publish/subscribe. In S. Mehrotra and T. K. Sellis, editors, SIGMOD Conference, pages 115-126. ACM, 2001.
13. L. Fan, P. Cao, J. M. Almeida, and A. Z. Broder. Summary cache: A scalable wide-area web cache sharing protocol. In SIGCOMM, pages 254-265, 1998.
14. Y. E. Ioannidis. The history of histograms (abridged). In VLDB, pages 19-30, 2003.
15. A. M. Keller and J. Basu. A predicate-based caching scheme for client-server database architectures. In PDIS, pages 229-238. IEEE Computer Society, 1994.
16. D. E. Knuth. The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley, 1973.
17. J. Levandoski, P.-A. Larson, and R. Stoica. Identifying hot and cold data in main-memory databases. In IEEE Conf. on Data Engineering, 2013.
18. M. Zhong, P. Lu, K. Shen, and J. I. Seiferas. Optimizing data popularity conscious Bloom filters. In R. A. Bazzi and B. Patt-Shamir, editors, PODC, pages 355-364. ACM, 2008.