Fast and flexible word searching on compressed text

No abstract is available for this paper.

• Publication year

  2000

• Venue

  ACM Trans. Inf. Syst.

• Publication date

  2000-04-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/348751.348754
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Human Behaviour and the Principle of Least Effort: an Introduction to Human Ecology

  2012influential reference
• A unifying framework for compressed pattern matching

  1999cited by this paper
• Shift-And Approach to Pattern Matching in LZW Compressed Text

  1999cited by this paper
• Faster Approximate String Matching

  1999cited by this paper
• A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text

  1999cited by this paper
• Fast searching on compressed text allowing errors

  1998cited by this paper
• Direct pattern matching on compressed text

  1998cited by this paper
• String Matching in Lempel—Ziv Compressed Strings

  1998cited by this paper
• Multiple pattern matching in LZW compressed text

  1998cited by this paper
• Block addressing indices for approximate text retrieval

  1997cited by this paper
• Large text searching allowing errors

  1997cited by this paper
• Fast file search using text compression

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

  1995cited by this paper
• Overview of the Third Text REtrieval Conference (TREC-3)

  1995cited by this paper
• String matching in Lempel-Ziv compressed strings

  1995cited by this paper
• In-Place Calculation of Minimum-Redundancy Codes

  1995cited by this paper
• Managing gigabytes

  1994cited by this paper
• A text compression scheme that allows fast searching directly in the compressed file

  1994influential reference
• Let sleeping files lie: pattern matching in Z-compressed files

  1994cited by this paper
• GLIMPSE: A Tool to Search Through Entire File Systems

  1994influential reference
• Data Compression in Full-Text Retrieval Systems

  1993cited by this paper
• Efficient two-dimensional compressed matching

  1992cited by this paper
• Constructing word-based text compression algorithms

  1992cited by this paper
• Fast text searching: allowing errors

  1992influential reference
• A new approach to text searching

  1992influential reference
• Handbook of algorithms and data structures: in Pascal and C (2nd ed.)

  1991cited by this paper
• A very fast substring search algorithm

  1990cited by this paper
• Efficient decoding of prefix codes

  1990cited by this paper
• Text Compression

  1990cited by this paper
• Word‐based text compression

  1989influential reference
• A new approach to text searching

  1989cited by this paper
• A Locally Adaptive Data

  1986influential reference
• Handbook Of Algorithms And Data Structures

  1984cited by this paper
• Compression of individual sequences via variable-rate coding

  1978cited by this paper
• Information retrieval, computational and theoretical aspects

  1978influential reference
• A universal algorithm for sequential data compression

  1977cited by this paper
• On the Complexity of Finite Sequences

  1976cited by this paper
• Efficient string matching

  1975cited by this paper
• Generating a canonical prefix encoding

  1964cited by this paper
• A method for the construction of minimum-redundancy codes

  1952influential reference
• Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology

  1950cited by this paper
• Human behavior and the principle of least effort

  1949influential reference
• Received

  1868cited by this paper

• Efficient Pattern Matching in Compressed Text via Bit-Parallel Word-Based Encoding

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

  2025influential citation
• BWBEV: A Bitwise Query Processing Algorithm for Approximate Prefix Search

  2024cites this paper
• Natural-Language Text Compression Using Reverse Multi-Delimiter Codes

  2024cites this paper
• Enhancing XML Data Parsing and Querying Performance on Multi-Core Architectures

  2024cites this paper
• An Efficient Direct Access Algorithm for Integer Compression

  2024cites this paper
• Prefix Coding Scheme Supporting Direct Access Without Auxiliary Space

  2023cites this paper
• Efficient regular expression matching over hybrid dictionary-based compressed data

  2023cites this paper
• Efficient Immediate-Access Dynamic Indexing

  2022cites this paper
• Improved characters distance sampling for online and offline text searching

  2022cites this paper
• A scalable approach for index compression using wavelet tree and LZW

  2022cites this paper
• A Method to Improve Exact Matching Results in Compressed Text using Parallel Wavelet Tree

  2021influential citation
• Lossless compression of industrial time series with direct access

  2021cites this paper
• Speeding up Natural Language Text Search using Compression

  2021cites this paper
• Sequential Representation of Suffix Trie: An Empirical Evaluation

  2020cites this paper
• Reverse Multi-Delimiter Compression Codes

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

  2020cites this paper
• Developing a Faster Pattern Matching Algorithms for Intrusion Detection System

  2019cites this paper
• Una mejora en tiempo del trie de sufijos

  2019cites this paper
• Efficient Online String Matching Based on Characters Distance Text Sampling

  2019cites this paper
• Saving Energy in Text Search Using Compression

  2019influential citation
• GREEN 2019

  2019influential citation
• Energy Consumption in Compact Integer Vectors: A Study Case

  2019cites this paper
• Text Compression for Myanmar Information Retrieval

  2019cites this paper
• A review on document image analysis techniques directly in the compressed domain

  2018cites this paper
• An approach for fast compressed text matching and to avoid false matching using WBTC and wavelet tree

  2018cites this paper
• About Chief Editors

  2018cites this paper
• Fast Pattern Matching in Compressed Text using Wavelet Tree

  2018influential citation
• Information and Data Management at PUC-Rio and UFMG

  2018cites this paper
• Accelerating compressed file pattern matching with parabix techniques

  2018cites this paper
• J an 2 01 6 Optimal Prefix Free Codes with Partial Sorting

  2018cites this paper
• Multi-Stream Word-Based Compression Algorithm for Compressed Text Search

  2018cites this paper
• A Compact Encoding for Efficient Character-level Deep Text Classification

  2018influential citation
• Dynamic sampling of text streams and its application in text analysis

  2017cites this paper
• Multi-stream word-based compression algorithm

  2017cites this paper
• Enhanced Algorithms for Compressed Pattern Matching using Wavelet Tree and Bit-parallelism

  2017cites this paper
• Multidimensional Fibonacci Coding

  2017cites this paper
• Compressed representation of dynamic binary relations with applications

  2017cites this paper
• Parallelization of Massive Textstream Compression Based on Compressed Sensing

  2017influential citation
• A new word-based compression model allowing compressed pattern matching

  2017influential citation
• Zeckendorf's Theorem and Fibonacci Coding for Modules

  2017cites this paper
• Variable-Length Prefix Codes With Multiple Delimiters

  2017cites this paper
• Exploring the reuse of past search results in information retrieval

  2016cites this paper
• A new dictionary-based preprocessor that uses radix-190 numbering

  2016cites this paper
• A new compression algorithm for fast text search

  2016cites this paper
• Compressed matching for feature vectors

  2016cites this paper
• An efficient approach towards compressed parameterized word matching using wavelet tree

  2016cites this paper
• Exploring the reuse of past search results in information retrieval. (Exploration de la réutilisation des résultats des recherches passées dans récupération de l'information)

  2016cites this paper
• Compressing Integer Sequences

  2016cites this paper
• Fast top-k preserving query processing using two-tier indexes

  2016cites this paper
• Content-aware compression for big textual data analysis

  2016cites this paper
• A Family of Data Compression Codes with Multiple Delimiters

  2016cites this paper
• A new dictionary-based preprocessor that uses radix-190 numbering

  2016cites this paper
• Optimal Prefix Free Codes With Partial Sorting

  2016cites this paper
• A workflow management system to feed digital libraries: proposal and case study

  2016cites this paper
• A neural words encoding model

  2016cites this paper
• The Use and Usefulness of Fibonacci Codes

  2016cites this paper
• A review on compressed pattern matching

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

  2016cites this paper
• A Study on Low-Cost Representations for Image Feature Extraction on Mobile Devices

  2015cites this paper
• On The Reuse of Past Searches in Information Retrieval: Study of Two Probabilistic Algorithms

  2015cites this paper
• Efficient compression of large repetitive strings

  2015influential citation
• Record-Aware Two-Level Compression for Big Textual Data Analysis Acceleration

  2015cites this paper
• Representações de características visuais de baixo custo para recuperação de imagens

  2015cites this paper
• Compression of a Set of Files with Natural Language Content

  2015cites this paper
• Variable-length Splittable Codes with Multiple Delimiters

  2015cites this paper
• Técnicas de compresión e estruturas de indexación compactas para texto en linguaxe natural e contidos dixitais: aplicacións prácticas

  2015cites this paper
• Statistical and repetition-based compressed data structures

  2015cites this paper
• Probabilistic Reuse of Past Search Results

  2014cites this paper
• A New Approach to Alphabet Extension for Improving Static Compression Schemes

  2014cites this paper
• Compressed SIFT Feature-based Matching

  2014cites this paper
• Randomized algorithm for Information Retrieval using past search results

  2014cites this paper
• Natural Language Compression using Byte Codes

  2014influential citation
• Efficient multi-word parameterized matching on compressed text

  2014cites this paper
• Enhancing Text Compression Method Using Information Source Indexing

  2014cites this paper
• Fast parameterized word matching on compressed text

  2014cites this paper
• Inverted Index Compression Using Multi-codes

  2014cites this paper
• M188: A New Preprocessor for Better Compression of Text and Transcription Files

  2014cites this paper
• Speeding up Compressed Matching with SBNDM2

  2014influential citation
• New data structures and algorithms for the efficient management of large spatial datasets

  2014cites this paper
• XXS

  2014cites this paper
• Efficient and Compact Representations of Prefix Codes

  2014cites this paper
• Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond

  2013influential citation
• ODC: Frame for definition of Dense codes

  2013cites this paper
• Compressing Huffman Models on Large Alphabets

  2013cites this paper
• A NEW PATTERN MATCHING METHOD FOR MEMORY REDUCTION APPLICATIONS

  2013cites this paper
• Pattern Matching in Compressed Texts and Images

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

  2013cites this paper
• String Mat hing with Stopper En odingand Code Splitting ?

  2013cites this paper
• Evaluating the Interest of Revamping Past Search Results

  2013cites this paper
• Fast Arabic Query Matching for Compressed Arabic Inverted Indices

  2012cites this paper
• Word-based self-indexes for natural language text

  2012cites this paper
• Indexing Sequences of IEEE 754 Double Precision Numbers

  2012cites this paper
• Boosting Text Compression with Word-Based Statistical Encoding

  2012influential citation
• Efficient query processing and index tuning using proximity scores

  2012cites this paper
• String matching with alphabet sampling

  2012cites this paper
• Implicit indexing of natural language text by reorganizing bytecodes

  2012influential citation
• Theoretical Foundations for Digital Libraries: The 5S (Societies, Scenarios, Spaces, Structures, Streams) Approach

  2012cites this paper
• Fast decoding algorithms for variable-lengths codes

  2012cites this paper
• Trajectory Pattern Matching Based on Bit-Parallelism for Large GPS Data

  2012cites this paper