Efficient query processing in columnar databases using bloom filters
作者： Anurag Windlass Gupta
DOI:
关键词:
摘要: A bloom filter is generated for efficient query processing unsorted data in a column of columnar database. Bloom filters represented as bitmaps are blocks storing database table. An indication directed toward the received and each block examined to determine which ones do not need be read order service select data. Data then from excepting read.
lens.org 参考文章(23)
Katsufumi Inoue, Koichi Kise, Compiling method, compiling apparatus, and compiling program of image database used for object recognition ,(2010)
Ivan Schreter, Dirk Thomsen, Blaine French, Colin Florendo, Unified architecture for hybrid database storage using fragments ,(2013)
Patrick Dantressangle, Martin Oberhofer, Eberhard Hechler, Michael Wurst, Determination of rules by providing data records in columnar data structures ,(2012)
Umesh Panchaksharaiah, Hakan Jakobsson, Dmitry Potapov, Poojan Kumar, Yiu Woon Lau, Hash join using collaborative parallel filtering in intelligent storage with offloaded bloom filters ,(2009)
Roger MacNicol, Vikram Kapoor, Jesse Kamp, Kam Shergill, Vineet Marwah, Amit Ganesh, Sachin Kulkami, Query and exadata support for hybrid columnar compressed data ,(2010)
Iraklis A Klampanos, Joemon M Jose, Searching in peer to peer networks ,(2010)
Sang Yong Hwang, Lars Fricke, Unique Value Calculation in Partitioned Table ,(2014)
Jeffrey W. Tenner, Richard J. Stevens, Richard D. Dettinger, Method and system for providing aggregate data access ,(2004)
Ross Neil Williams, Method for partitioning a block of data into subblocks and for storing and communicating such subblocks ,(1996)
Jianchang Mao, Yun Fu, Zhichen Xu, Dynamic bloom filter for caching query results ,(2006)