Database Indexing

Wormhole Filters: Caching Your Hash on Persistent Memory

Click the Cite button above to demo the feature to enable visitors to import publication metadata into their reference management software. Click the Slides button above to demo Academic's Markdown slides feature. Supplementary notes can be added here, including [code and math](https://sourcethemes.com/academic/docs/writing-markdown-latex/). --

Large-scale Network Community Detection Algorithm Based on MapReduce

TBD

Filter Data Structures: A Survey

Filter data structures can approximately determine whether an element exists in a given set.Typical filter data structures,such as Bloom filters,cuckoo filters,and quotient filters,sacrifice query accuracy for lower memory space consumption and lower …

Variable-length Encoding Framework: A Generic Framework for Enhancing the Accuracy of Approximate Membership Queries

Click the Cite button above to demo the feature to enable visitors to import publication metadata into their reference management software. Click the Slides button above to demo Academic's Markdown slides feature. Supplementary notes can be added here, including [code and math](https://sourcethemes.com/academic/docs/writing-markdown-latex/). --

Adaptive Online Cache Capacity Optimization via Lightweight Working Set Size Estimation at Scale

Big data applications extensively use cache techniques to accelerate data access. A key challenge for improving cache utilization is provisioning a suitable cache size to fit the dynamic working set size (WSS) and understanding the related item …

Bamboo Filters: Make Resizing Smooth

The approximate membership query (AMQ) data structure is a kind of space-efficient probabilistic data structure. It can approximately indicate whether an element exists in a set. The AMQ data structure has been widely used in database indexing, …