Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleNovember 2024
CHIME: A Cache-Efficient and High-Performance Hybrid Index on Disaggregated Memory
SOSP '24: Proceedings of the ACM SIGOPS 30th Symposium on Operating Systems PrinciplesPages 110–126https://doi.org/10.1145/3694715.3695959Disaggregated memory (DM) is a widely discussed datacenter architecture in academia and industry. It decouples computing and memory resources from monolithic servers into two network-connected resource pools. Range indexes are widely adopted by storage ...
- extended-abstractOctober 2024
LyricLure: Mining Catchy Hooks in Song Lyrics to Enhance Music Discovery and Recommendation
RecSys '24: Proceedings of the 18th ACM Conference on Recommender SystemsPages 800–802https://doi.org/10.1145/3640457.3688049Music Search encounters a significant challenge as users increasingly rely on catchy lines from lyrics to search for both new releases and other popular songs. Integrating lyrics into existing lexical search index or using lyrics vector index pose ...
- research-articleJune 2023
Exploiting Hybrid Index Scheme for RDMA-based Key-Value Stores
SYSTOR '23: Proceedings of the 16th ACM International Conference on Systems and StoragePages 49–59https://doi.org/10.1145/3579370.3594768RDMA (Remote Direct Memory Access) is widely studied in building key-value stores to achieve ultra-low latency. In RDMA-based key-value stores, the indexing time takes a large fraction of the overall operation latency as RDMA enables fast data access. ...
- research-articleJune 2022
Adaptive Hybrid Indexes
SIGMOD '22: Proceedings of the 2022 International Conference on Management of DataPages 1626–1639https://doi.org/10.1145/3514221.3526121While index structures are crucial components in high-performance query processing systems, they occupy a large fraction of the available memory. Recently-proposed compact indexes reduce this space overhead and thus speed up queries by allowing the ...
- research-articleSeptember 2021
Two Birds With One Stone: Boosting Both Search and Write Performance for Tree Indices on Persistent Memory
ACM Transactions on Embedded Computing Systems (TECS), Volume 20, Issue 5sArticle No.: 50, Pages 1–25https://doi.org/10.1145/3476981The advance of byte-addressable persistent memory (PM) makes it a hot topic to revisit traditional tree indices such as B+-tree and radix tree, and a few new persistent memory-friendly tree indices have been proposed. However, due to the special features ...
- research-articleMay 2019
A Hybrid BitFunnel and Partitioned Elias-Fano Inverted Index
Search engines encounter a time vs. space trade-off: search responsiveness (i.e., a short query response time) comes at the cost of increased index storage. We propose a hybrid method which uses both (a) the recently published mapping-matrix-style index ...
- research-articleOctober 2017
Hybrid Indexes for Spatial-Visual Search
Thematic Workshops '17: Proceedings of the on Thematic Workshops of ACM Multimedia 2017Pages 75–83https://doi.org/10.1145/3126686.3126763Due to the growth of geo-tagged images, recent web and mobile applications provide search capabilities for images that are similar to a given query image and simultaneously within a given geographical area. In this paper, we focus on designing index ...
- research-articleJune 2016
Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataPages 1567–1581https://doi.org/10.1145/2882903.2915222Using indexes for query execution is crucial for achieving high performance in modern on-line transaction processing databases. For a main-memory database, however, these indexes consume a large fraction of the total memory available and are thus a major ...
