Binary Interpolative Coding for Effective Index Compression

No abstract is available for this paper.

• Publication year

  2000

• Venue

  Information retrieval (Boston)

• Publication date

  2000-07-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1023/A:1013002601898
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Housekeeping for prefix coding

  2000cited by this paper
• Managing gigabytes (2nd ed.): compressing and indexing documents and images

  1999influential reference
• Managing Gigabytes: Compressing and Indexing Documents and Images

  1999influential reference
• Arithmetic coding revisited

  1998influential reference
• Compressed inverted files with reduced decoding overheads

  1998cited by this paper
• Modeling word occurrences for the compression of concordances

  1997cited by this paper
• Filtered Document Retrieval with Frequency-Sorted Indexes

  1996cited by this paper
• The Burrows-Wheeler Transform for Block Sorting Text Compression: Principles and Improvements

  1996cited by this paper
• Self-indexing inverted files for fast text retrieval

  1996cited by this paper
• Adding compression to a full‐text retrieval system

  1995cited by this paper
• Improved Inverted File Processing for Large Text Databases

  1995cited by this paper
• Managing gigabytes

  1994cited by this paper
• Overview of the Second Text REtrieval Conference (TREC-2)

  1994cited by this paper
• A Block-sorting Lossless Data Compression Algorithm

  1994cited by this paper
• Markov models for clusters in concordance compression

  1994cited by this paper
• Data Compression in Full-Text Retrieval Systems

  1993influential reference
• Fast and efficient lossless image compression

  1993cited by this paper
• Parameterised compression for sparse bitmaps

  1992cited by this paper
• A Systematic Approach to Compressing a Full-Text Retrieval System

  1992cited by this paper
• Compression of correlated bit-vectors

  1991cited by this paper
• Indexing and compressing full-text databases for CD-ROM

  1991cited by this paper
• Storing text retrieval systems on CD-ROM: compression and encryption considerations

  1989cited by this paper
• Compression of concordances in full-text retrieval systems

  1988cited by this paper
• Reversible intraframe compression of medical images.

  1988cited by this paper
• Improved hierarchical bit-vector compression in document retrieval systems

  1986cited by this paper
• Novel Compression of Sparse Bit-Strings — Preliminary Report

  1985cited by this paper
• Development of a Spelling List

  1982cited by this paper
• Huffman Coding in Bit-Vector Compression

  1978cited by this paper
• A Compression Method for Clustered Bit-Vectors

  1978cited by this paper
• Compression of large inverted files with hyperbolic term distribution

  1976cited by this paper
• Universal codeword sets and representations of the integers

  1975influential reference
• Optimal source codes for geometrically distributed integer alphabets (Corresp.)

  1975cited by this paper
• Run-length encodings.

  1966cited by this paper

• Challenges in Algorithmic Implementation: The FLoCIC Algorithm as a Case Study in Technology-Enhanced Computer Science Education

  2025cites this paper
• Onto how compression yields energy-efficient text search

  2025cites this paper
• Faster Run-Length Compressed Suffix Arrays

  2024cites this paper
• COPR -- Efficient, large-scale log storage and retrieval

  2024influential citation
• State-of-the-Art Trends in Data Compression: COMPROMISE Case Study

  2024cites this paper
• A New Directly Accessible Compression Scheme

  2024cites this paper
• Progressive Tree-Based Compression of Large-Scale Particle Data

  2023cites this paper
• The Many Qualities of a New Directly Accessible Compression Scheme

  2023cites this paper
• GraphScale: Scalable Processing on FPGAs for HBM and Large Graphs

  2023cites this paper
• Trie-Compressed Adaptive Set Intersection

  2023cites this paper
• Tradeoff Options for Bipartite Graph Partitioning

  2023cites this paper
• Spectrum preserving tilings enable sparse and modular reference indexing

  2023cites this paper
• FLoCIC: A Few Lines of Code for Raster Image Compression

  2023influential citation
• Efficient Immediate-Access Dynamic Indexing

  2022cites this paper
• Trie-Compressed Intersectable Sets

  2022cites this paper
• Pareto Optimal Compression of Genomic Dictionaries, with or without Random Access in Main Memory

  2022cites this paper
• Compressing Integer Lists with Contextual Arithmetic Trits

  2022influential citation
• New variable-length data compression scheme for solution representation of meta-heuristics

  2021cites this paper
• Anytime Ranking on Document-Ordered Indexes

  2021cites this paper
• Efficient Inverted Index Compression Algorithm Characterized by Faster Decompression Compared with the Golomb-Rice Algorithm

  2021cites this paper
• Fast and Compact Set Intersection through Recursive Universe Partitioning

  2021influential citation
• Faster Index Reordering with Bipartite Graph Partitioning

  2021cites this paper
• Increase the Speed of Search Index in the Duplicate Text Detection Systems

  2020cites this paper
• Examining the Additivity of Top-k Query Processing Innovations

  2020cites this paper
• Efficient Representation of Geometric Tree Models with Level-of-Detail Using Compressed 3D Chain Code

  2020cites this paper
• Large-Alphabet Semi-Static Entropy Coding Via Asymmetric Numeral Systems

  2020cites this paper
• Pipelined Query Processing Using Non-volatile Memory SSDs

  2020cites this paper
• Can burrows-Wheeler transform be replaced in chain code compression?

  2020cites this paper
• Parallelization of Variable Rate Decompression through Metadata

  2020cites this paper
• To index or not to index: Time-space trade-offs for positional ranking functions in search engines

  2020cites this paper
• Efficient and Effective Query Auto-Completion

  2020cites this paper
• Comparison between text compression algorithms in biological sequences

  2020cites this paper
• Burrows‐Wheeler post‐transformation with effective clustering and interpolative coding

  2020cites this paper
• Efficiency Implications of Term Weighting for Passage Retrieval

  2020cites this paper
• Online two-way trading: Randomization and advice

  2020cites this paper
• Accelerated partial decoding in wavelet trees

  2020cites this paper
• A Lossy Compression Method on Positional Index for Efficient and Effective Retrieval

  2019cites this paper
• An Experimental Study of Index Compression and DAAT Query Processing Methods

  2019cites this paper
• CPOI: A Compact Method to Archive Versioned RDF Triple-Sets

  2019cites this paper
• Compressing Inverted Indexes with Recursive Graph Bisection: A Reproducibility Study

  2019cites this paper
• A flexible space-time tradeoff on hybrid index with bicriteria optimization

  2019cites this paper
• Document Reordering for Faster Intersection

  2019cites this paper
• Fast Dictionary-Based Compression for Inverted Indexes

  2019cites this paper
• On the Reproducibility of Experiments of Indexing Repetitive Document Collections

  2019influential citation
• Inverted Index Compression

  2019cites this paper
• Chain code compression with modified interpolative coding

  2019cites this paper
• MWAND: A New Early Termination Algorithm for Fast and Efficient Query Evaluation

  2019cites this paper
• On Slicing Sorted Integer Sequences

  2019cites this paper
• On Implementing the Binary Interpolative Coding Algorithm

  2019influential citation
• PISA: Performant Indexes and Search for Academia

  2019cites this paper
• Beyond the Inverted Index

  2019cites this paper
• Techniques for Inverted Index Compression

  2019cites this paper
• Parallelization of Variable Rate Decompression for GPU Acceleration

  2019cites this paper
• A Hybrid BitFunnel and Partitioned Elias-Fano Inverted Index

  2019cites this paper
• New FastPFOR for Inverted File Compression

  2018cites this paper
• Big Data to Enable Global Disruption of the Grapevine-powered Industries

  2018influential citation
• On the Reproducibility of Experiments of Indexing Repetitive Document

  2018influential citation
• Efficient chain code compression with interpolative coding

  2018cites this paper
• Variable-Byte Encoding is Now Space-Efficient Too

  2018influential citation
• Index Compression Using Byte-Aligned ANS Coding and Two-Dimensional Contexts

  2018cites this paper
• Space and Time-Efficient Data Structures for Massive Datasets

  2018influential citation
• Compact inverted index storage using general‐purpose compression libraries

  2018cites this paper
• Handling Massive N-Gram Datasets Efficiently

  2018influential citation
• Efficient Grammar Generation for Inverted Indexes

  2018cites this paper
• A data model and algorithms for a spatial data marketplace

  2018cites this paper
• Hybrid compression of inverted lists for reordered document collections

  2018cites this paper
• On Optimally Partitioning Variable-Byte Codes

  2018influential citation
• Clustered Elias-Fano Indexes

  2017influential citation
• Building a Structured Query Engine

  2017cites this paper
• Efficient Data Structures for Massive N-Gram Datasets

  2017cites this paper
• Optimized partitioned binary interpolative coding

  2017cites this paper
• Well-Balanced Successive Simple-9 for Inverted Lists Compression

  2017cites this paper
• ANS-Based Index Compression

  2017cites this paper
• Compressing Graphs and Indexes with Recursive Graph Bisection

  2016cites this paper
• Proceedings of the Prague Stringology Conference 2016, Prague, Czech Republic, August 29-31, 2016

  2016cites this paper
• Upscaledb: Efficient integer-key compression in a key-value store using SIMD instructions

  2016cites this paper
• Compressing Inverted Files using Modified LZW

  2016influential citation
• A Space Efficient Direct Access Data Structure

  2016cites this paper
• Processamento eficiente de consultas em sistemas de busca

  2016cites this paper
• Leveraging Context-Free Grammar for Efficient Inverted Index Compression

  2016cites this paper
• Universal indexes for highly repetitive document collections

  2016cites this paper
• Partially Decompressing Binary Interpolative Coding for Fast Query Processing

  2016cites this paper
• Compressing Integer Sequences

  2016cites this paper
• Compressed Indexes for String Searching in Labeled Graphs

  2015cites this paper
• Optimal Space-time Tradeoffs for Inverted Indexes

  2015influential citation
• Scalability Challenges in Web Search Engines

  2015cites this paper
• Compressing Inverted Index Using Optimal FastPFOR

  2015cites this paper
• Efficient data structures for masks on 2D grids

  2015cites this paper
• Applications in High-throughput Sequencing Technologies: From Compression Algorithms and Data Warehousing to Understanding Gene Regulation and Diseases at Scale

  2015cites this paper
• Highly Compressed Lists of Integers with Dense Padding Modes

  2015cites this paper
• Indexing and Compressing Text

  2015cites this paper
• Compression, SIMD, and Postings Lists

  2014influential citation
• Web Search Engines: Practice and Experience

  2014cites this paper
• Partitioned Elias-Fano indexes

  2014influential citation
• Enhanced FastPFOR for Inverted Index Compression

  2014cites this paper
• Integrating Skips and Bitvectors for List Intersection

  2014cites this paper
• On the compression of search trees

  2014cites this paper
• Integer Set Compression and Statistical Modeling

  2014cites this paper
• DACs: Bringing direct access to variable-length codes

  2013cites this paper
• The Key as Dictionary Compression Method of Inverted Index Table under the Hbase Database

  2013cites this paper