On the public citation graph
Techniques for Inverted Index Compression
0 signed · 162 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1948.tb01338.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1002/spe.2203openalex-snapshot
Decoding billions of integers per second through vectorization
inferredcites →https://doi.org/10.1002/spe.2325openalex-snapshot
Better bitmap performance with Roaring bitmaps
inferredcites →https://doi.org/10.1002/spe.2402openalex-snapshot
Consistently faster and smaller compressed bitmaps with Roaring
inferredcites →https://doi.org/10.1002/spe.2556openalex-snapshot
Compact inverted index storage using general‐purpose compression libraries
inferredcites →https://doi.org/10.1002/spe.2560openalex-snapshot
Roaring bitmaps: Implementation of an optimized software library
inferredcites →https://doi.org/10.1007/11575832_1openalex-snapshot
Enhanced Byte Codes with Restricted Prefix Properties
inferredcites →https://doi.org/10.1007/978-1-4615-0935-6openalex-snapshot
Compression and Coding Algorithms
inferredcites →https://doi.org/10.1007/978-1-84628-959-0openalex-snapshot
Variable-length Codes for Data Compression
inferredcites →https://doi.org/10.1007/978-3-030-15712-8_23openalex-snapshot
An Experimental Study of Index Compression and DAAT Query Processing Methods
inferredcites →https://doi.org/10.1007/978-3-031-02298-2openalex-snapshot
Scalability Challenges in Web Search Engines
inferredcites →https://doi.org/10.1007/978-3-319-63962-8_52-1openalex-snapshot
Inverted Index Compression
inferredcites →https://doi.org/10.1007/978-3-540-39984-1_10openalex-snapshot
(S,C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases
inferredcites →https://doi.org/10.1007/978-3-540-71496-5_12openalex-snapshot
Sorting Out the Document Identifier Assignment Problem
inferredcites →https://doi.org/10.1007/978-3-642-27848-8_84-2openalex-snapshot
Compressing Integer Sequences
inferredcites →https://doi.org/10.1016/0020-0190(77)90031-xopenalex-snapshot
Preserving order in a forest in less than logarithmic time and linear space
inferredcites →https://doi.org/10.1016/0020-0190(78)90023-6openalex-snapshot
Huffman coding in bit-vector compression
inferredcites →https://doi.org/10.1016/0020-0190(78)90024-8openalex-snapshot
A compression method for clustered bit-vectors
inferredcites →https://doi.org/10.1016/0020-0271(72)90024-1openalex-snapshot
Program design for retrospective searches on large data bases
inferredcites →https://doi.org/10.1016/b978-012722442-8/50080-xopenalex-snapshot
Efficient IR-Style Keyword Search over Relational Databases
inferredcites →https://doi.org/10.1016/j.ipl.2006.04.014openalex-snapshot
Binary codes for locally homogeneous sequences
inferredcites →https://doi.org/10.1016/j.ipl.2017.09.011openalex-snapshot
Stream VByte : Faster byte-oriented integer compression
inferredcites →https://doi.org/10.1016/j.ipm.2012.08.003openalex-snapshot
DACs: Bringing direct access to variable-length codes
inferredcites →https://doi.org/10.1016/j.is.2016.04.002openalex-snapshot
Universal indexes for highly repetitive document collections
inferredcites →https://doi.org/10.1016/j.tcs.2007.07.013openalex-snapshot
Rank and select revisited and extended
inferredcites →https://doi.org/10.1016/j.websem.2011.04.004openalex-snapshot
Searching web data: An entity retrieval and high-performance indexing model
inferredcites →https://doi.org/10.1016/s0306-4573(02)00020-1openalex-snapshot
Inverted file compression through document identifier reassignment
inferredcites →https://doi.org/10.1023/a:1013002601898openalex-snapshot
Binary Interpolative Coding for Effective Index Compression
inferredcites →https://doi.org/10.1023/b:inrt.0000048490.99518.5copenalex-snapshot
Inverted Index Compression Using Word-Aligned Binary Codes
inferredcites →https://doi.org/10.1080/15427951.2005.10129113openalex-snapshot
Codes for the World Wide Web
inferredcites →https://doi.org/10.1093/comjnl/42.3.193openalex-snapshot
Compressing Integers for Fast File Access
inferredcites →https://doi.org/10.1093/comjnl/bxn030openalex-snapshot
Tournament Coding of Integer Sequences
inferredcites →https://doi.org/10.1109/26.634683openalex-snapshot
On the implementation of minimum redundancy prefix codes
inferredcites →https://doi.org/10.1109/dcc.1996.488313openalex-snapshot
Exploiting clustering in inverted file compression
inferredcites →https://doi.org/10.1109/dcc.1999.755679openalex-snapshot
Offline dictionary-based compression
inferredcites →https://doi.org/10.1109/dcc.2002.999972openalex-snapshot
Index compression through document reordering
inferredcites →https://doi.org/10.1109/dcc.2004.1281504openalex-snapshot
The webgraph framework II codes for the world-wide web
inferredcites →https://doi.org/10.1109/dcc.2005.22openalex-snapshot
Binary Codes for Non-Uniform Sources
inferredcites →https://doi.org/10.1109/icde.1998.655800openalex-snapshot
Compressing relations and indexes
inferredcites →https://doi.org/10.1109/icde.2006.150openalex-snapshot
Super-Scalar RAM-CPU Cache Compression
inferredcites →https://doi.org/10.1109/jrproc.1952.273898openalex-snapshot
A Method for the Construction of Minimum-Redundancy Codes
inferredcites →https://doi.org/10.1109/pcs.2015.7170048openalex-snapshot
The use of asymmetric numeral systems as an accurate replacement for Huffman coding
inferredcites →https://doi.org/10.1109/sfcs.1975.26openalex-snapshot
Preserving order in a forest in less than logarithmic time
inferredcites →https://doi.org/10.1109/tcom.1971.1090789openalex-snapshot
Adaptive Variable-Length Coding for Efficient Compression of Spacecraft Television Data
inferredcites →https://doi.org/10.1109/tit.1956.1056818openalex-snapshot
Two inequalities implied by unique decipherability
inferredcites →https://doi.org/10.1109/tit.1966.1053907openalex-snapshot
Run-length encodings (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1975.1055349openalex-snapshot
Universal codeword sets and representations of the integers
inferredcites →https://doi.org/10.1109/tit.1975.1055357openalex-snapshot
Optimal source codes for geometrically distributed integer alphabets (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1987.1057284openalex-snapshot
Robust transmission of unbounded strings using Fibonacci representations
inferredcites →https://doi.org/10.1109/tkde.2019.2911288openalex-snapshot
On Optimally Partitioning Variable-Byte Codes
inferredcites →https://doi.org/10.1137/s0097539700369909openalex-snapshot
Low Redundancy in Static Dictionaries with Constant Query Time
inferredcites →https://doi.org/10.1145/1132956.1132959openalex-snapshot
Inverted files for text search engines
inferredcites →https://doi.org/10.1145/1247480.1247566openalex-snapshot
Lazy, adaptive rid-list intersection, and its application to index anding
inferredcites →https://doi.org/10.1145/133160.133210openalex-snapshot
Parameterised compression for sparse bitmaps
inferredcites →https://doi.org/10.1145/1367497.1367550openalex-snapshot
Performance of compressed inverted list caching in search engines
inferredcites →https://doi.org/10.1145/1498759.1498761openalex-snapshot
Challenges in building large-scale information retrieval systems
inferredcites →https://doi.org/10.1145/1526709.1526764openalex-snapshot
Inverted index compression and query processing with optimized document ordering
inferredcites →https://doi.org/10.1145/1869389.1869394openalex-snapshot
Fast integer compression using SIMD instructions
inferredcites →https://doi.org/10.1145/2063576.2063627openalex-snapshot
SIMD-based decoding of posting lists
inferredcites →https://doi.org/10.1145/214762.214771openalex-snapshot
Arithmetic coding for data compression
inferredcites →https://doi.org/10.1145/237496.237497openalex-snapshot
Self-indexing inverted files for fast text retrieval
inferredcites →https://doi.org/10.1145/253168.253190openalex-snapshot
Improved hierarchical bit-vector compression in document retrieval systems
inferredcites →https://doi.org/10.1145/2600428.2609615openalex-snapshot
Partitioned Elias-Fano indexes
inferredcites →https://doi.org/10.1145/2682862.2682870openalex-snapshot
Compression, SIMD, and Postings Lists
inferredcites →https://doi.org/10.1145/2684822.2685297openalex-snapshot
Optimal Space-time Tradeoffs for Inverted Indexes
inferredcites →https://doi.org/10.1145/290941.291011openalex-snapshot
Compressed inverted files with reduced decoding overheads
inferredcites →https://doi.org/10.1145/2939672.2939862openalex-snapshot
Compressing Graphs and Indexes with Recursive Graph Bisection
inferredcites →https://doi.org/10.1145/3077136.3080780openalex-snapshot
Faster BlockMax WAND with Variable-sized Blocks
inferredcites →https://doi.org/10.1145/3159652.3159663openalex-snapshot
Index Compression Using Byte-Aligned ANS Coding and Two-Dimensional Contexts
inferredcites →https://doi.org/10.1145/321812.321820openalex-snapshot
Efficient Storage and Retrieval by Content and Address of Static Files
inferredcites →https://doi.org/10.1145/322344.322346openalex-snapshot
Data compression via textual substitution
inferredcites →https://doi.org/10.1145/3289600.3290962openalex-snapshot
Fast Dictionary-Based Compression for Inverted Indexes
inferredcites →https://doi.org/10.1145/564376.564416openalex-snapshot
Compression of inverted indexes For fast query evaluation
inferredcites →https://doi.org/10.1145/62437.62500openalex-snapshot
Compression of concordances in full-text retrieval systems
inferredcites →https://doi.org/10.1145/956863.956944openalex-snapshot
Efficient query evaluation using a two-level retrieval process
inferredcites →https://doi.org/10.1145/96749.98236openalex-snapshot
Construction of optimal graphs for bit-vector compression
inferredcites →https://doi.org/10.1147/rd.203.0198openalex-snapshot
Generalized Kraft Inequality and Arithmetic Coding
inferredcites →https://doi.org/10.14778/2002974.2002975openalex-snapshot
Efficient parallel lists intersection and index compression algorithms using graphics processing units
inferredcites →https://doi.org/10.2307/2288754openalex-snapshot
Probability, Random Variables, and Stochastic Processes.
inferredcites →https://doi.org/10.4230/lipics.cpm.2017.30openalex-snapshot
Dynamic Elias-Fano Representation
inferredcites →https://doi.org/10.48550/arxiv.0911.3318openalex-snapshot
Re-Pair Compression of Inverted Lists
inferredcites →https://doi.org/10.48550/arxiv.1311.2540openalex-snapshot
Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding
inferredcites →https://doi.org/10.48550/arxiv.1907.01032openalex-snapshot
On Slicing Sorted Integer Sequences
inferredcites →https://doi.org/10.5860/choice.46-2715openalex-snapshot
Introduction to information retrieval
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-0716-3989-4_9openalex-snapshot
Meta-colored Compacted de Bruijn Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-29119-7_2openalex-snapshot
Spectrum Preserving Tilings Enable Sparse and Modular Reference Indexing
inferred← citeshttps://doi.org/10.1007/978-3-031-56063-7_12openalex-snapshot
Improved Learned Sparse Retrieval with Corpus-Specific Vocabularies
inferred← citeshttps://doi.org/10.1007/978-3-032-21300-6_35openalex-snapshot
Forward Index Compression for Learned Sparse Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-032-21324-2_1openalex-snapshot
Fast, Compact, Immediate-Access Indexing for Learned Sparse Retrieval Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_52-2openalex-snapshot
Inverted Index Compression
inferred← citeshttps://doi.org/10.1007/978-981-95-5294-8_35openalex-snapshot
Source Code Vulnerability Detection Method Based on Hybrid Retrieval-Augmented Generation Technology
inferred← citeshttps://doi.org/10.1007/978-981-99-7161-9_13openalex-snapshot
A Blockchain-Based Encrypted Data Retrieval Scheme for Smart Grid
inferred← citeshttps://doi.org/10.1007/s00530-023-01229-0openalex-snapshot
A novel hashing-inverted index for secure content-based retrieval with massive encrypted speeches
inferred← citeshttps://doi.org/10.1007/s00778-020-00636-3openalex-snapshot
TADOC: Text analytics directly on compression
inferred← citeshttps://doi.org/10.1007/s11390-024-3040-9openalex-snapshot
Caching Document Identifiers to Speedup Query Processing in Search Servers
inferred← citeshttps://doi.org/10.1016/j.csl.2026.102058openalex-snapshot
A secure and efficient audio retrieval algorithm based on Bernoulli biohashing templates
inferred← citeshttps://doi.org/10.1016/j.ipm.2022.103248openalex-snapshot
Efficient immediate-access dynamic indexing
inferred← citeshttps://doi.org/10.1016/j.ipm.2023.103359openalex-snapshot
Many are Better than One: Algorithm Selection for Faster Top-K Retrieval
inferred← citeshttps://doi.org/10.1016/j.is.2021.101756openalex-snapshot
Rank/select queries over mutable bitmaps
inferred← citeshttps://doi.org/10.1016/j.is.2024.102490openalex-snapshot
Two-level massive string dictionaries
inferred← citeshttps://doi.org/10.1016/j.simpat.2024.102960openalex-snapshot
Trie and LOUDS hybrid model for efficient e-commerce processing in cloud environment
inferred← citeshttps://doi.org/10.1089/cmb.2024.0714openalex-snapshot
Where the Patterns Are: Repetition-Aware Compression for Colored de Bruijn Graphs *
inferred← citeshttps://doi.org/10.1093/bioadv/vbag120openalex-snapshot
Kaminari: a frugal colored index for approximate k -mer queries
inferred← citeshttps://doi.org/10.1093/bioinformatics/btac245openalex-snapshot
Sparse and skew hashing of K-mers
inferred← citeshttps://doi.org/10.1093/bioinformatics/btad219openalex-snapshot
Locality-preserving minimal perfect hashing of k-mers
inferred← citeshttps://doi.org/10.1101/2022.05.23.493024openalex-snapshot
On Weighted K-Mer Dictionaries
inferred← citeshttps://doi.org/10.1101/2024.02.08.579510openalex-snapshot
PLA-complexity of k -mer multisets
inferred← citeshttps://doi.org/10.1101/2025.05.16.654317openalex-snapshot
Kaminari: a resource-frugal index for approximate colored k -mer queries
inferred← citeshttps://doi.org/10.1109/access.2022.3142449openalex-snapshot
3iCubing: An Interval Inverted Index Approach to Data Cubes
inferred← citeshttps://doi.org/10.1109/access.2023.3234434openalex-snapshot
SDOT: Secure Hash, Semantic Keyword Extraction, and Dynamic Operator Pattern-Based Three-Tier Forensic Classification Framework
inferred← citeshttps://doi.org/10.1109/bibm55620.2022.9994867openalex-snapshot
BioMDSE: A Multimodal Deep Learning-Based Search Engine Framework for Biofilm Documents Classifications
inferred← citeshttps://doi.org/10.1109/dcc50243.2021.00037openalex-snapshot
Fast and Compact Set Intersection through Recursive Universe Partitioning
inferred← citeshttps://doi.org/10.1109/icde51399.2021.00148openalex-snapshot
G-TADOC: Enabling Efficient GPU-Based Text Analytics without Decompression
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00281openalex-snapshot
Compression and In-Situ Query Processing for Fine-Grained Array Lineage
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00138openalex-snapshot
Columnar Formatted Inverted Index for Highly-Paralleled, Vectorized Query Processing
inferred← citeshttps://doi.org/10.1109/icecet61485.2024.10698440openalex-snapshot
A Comparative Analysis of the Lossless Data Compression Methods for Unsparsed Tabular Data
inferred← citeshttps://doi.org/10.1109/nnice61279.2024.10499155openalex-snapshot
Partitioned Inverted Index Compression Using Hierarchical Dirichlet Process
inferred← citeshttps://doi.org/10.1109/tkde.2020.2966609openalex-snapshot
Compressed Indexes for Fast Search of Semantic Data
inferred← citeshttps://doi.org/10.1109/tkde.2022.3208902openalex-snapshot
Tradeoff Options for Bipartite Graph Partitioning
inferred← citeshttps://doi.org/10.1109/tpds.2021.3093234openalex-snapshot
POCLib: A High-Performance Framework for Enabling Near Orthogonal Processing on Compression
inferred← citeshttps://doi.org/10.1109/tpds.2021.3119402openalex-snapshot
Exploring Data Analytics Without Decompression on Embedded GPU Systems
inferred← citeshttps://doi.org/10.1109/tpds.2024.3426275openalex-snapshot
Toward Materials Genome Big-Data: A Blockchain-Based Secure Storage and Efficient Retrieval Method
inferred← citeshttps://doi.org/10.1145/3340531.3412000openalex-snapshot
Examining the Additivity of Top-k Query Processing Innovations
inferred← citeshttps://doi.org/10.1145/3404835.3462991openalex-snapshot
Faster Index Reordering with Bipartite Graph Partitioning
inferred← citeshttps://doi.org/10.1145/3503516.3503528openalex-snapshot
Cost-Effective Updating of Distributed Reordered Indexes
inferred← citeshttps://doi.org/10.1145/3576922openalex-snapshot
Efficient Document-at-a-Time and Score-at-a-Time Query Evaluation for Learned Sparse Representations
inferred← citeshttps://doi.org/10.1145/3591195.3595272openalex-snapshot
Analyzing and Improving the Scalability of In-Memory Indices for Managed Search Engines
inferred← citeshttps://doi.org/10.1145/3609797openalex-snapshot
An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors
inferred← citeshttps://doi.org/10.1145/3624918.3625316openalex-snapshot
Lossy Compression Options for Dense Index Retention
inferred← citeshttps://doi.org/10.1145/3626521openalex-snapshot
Dataset Discovery and Exploration: A Survey
inferred← citeshttps://doi.org/10.1145/3626772.3657769openalex-snapshot
Efficient Inverted Indexes for Approximate Retrieval over Learned Sparse Representations
inferred← citeshttps://doi.org/10.1145/3643641openalex-snapshot
Exploiting Data-pattern-aware Vertical Partitioning to Achieve Fast and Low-cost Cloud Log Storage
inferred← citeshttps://doi.org/10.1145/3665324openalex-snapshot
Bridging Dense and Sparse Maximum Inner Product Search
inferred← citeshttps://doi.org/10.1145/3701100.3701115openalex-snapshot
A novel InfluxDB-based inverted index method
inferred← citeshttps://doi.org/10.1145/3726302.3730248openalex-snapshot
Score-Fitted Indexes and Constant Length Indexes for Information Retrieval
inferred← citeshttps://doi.org/10.1145/3749164openalex-snapshot
Fast Indexing for Temporal Information Retrieval
inferred← citeshttps://doi.org/10.1145/3802125openalex-snapshot
VecBench: A Controllable Benchmark for Filtered Vector Search: [Experiments & Analysis]
inferred← citeshttps://doi.org/10.1186/s13015-023-00226-2openalex-snapshot
On weighted k-mer dictionaries
inferred← citeshttps://doi.org/10.1186/s13015-024-00251-9openalex-snapshot
Fulgor: a fast and compact k-mer index for large-scale matching and color queries
inferred← citeshttps://doi.org/10.14483/23448350.19640openalex-snapshot
Modelo para definir índices de corrupción en convocatorias de contratación en Colombia basado en Big Data y procesamiento del lenguaje natural
inferred← citeshttps://doi.org/10.18653/v1/2022.findings-emnlp.205openalex-snapshot
Accelerating Learned Sparse Indexes Via Term Impact Decomposition
inferred← citeshttps://doi.org/10.23919/cje.2023.00.387openalex-snapshot
Towards Reliable Configuration Management in Clouds: A Lightweight Consistency Validation Mechanism for Virtual Private Clouds
inferred← citeshttps://doi.org/10.3390/e23030296openalex-snapshot
Efficient Inverted Index Compression Algorithm Characterized by Faster Decompression Compared with the Golomb-Rice Algorithm
inferred← citeshttps://doi.org/10.3390/e27090961openalex-snapshot
SE-MSLC: Semantic Entropy-Driven Keyword Analysis and Multi-Stage Logical Combination Recall for Search Engine
inferred← citeshttps://doi.org/10.3390/s22249894openalex-snapshot
iRun: Horizontal and Vertical Shape of a Region-Based Graph Compression
inferred← citeshttps://doi.org/10.48550/arxiv.2107.14577openalex-snapshot
Fast direct access to variable length codes
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.