Compressed Self-indices Supporting Conjunctive Queries on Document Collections

No abstract is available for this paper.

• Publication year

  2010

• Venue

  SPIRE

• Publication date

  2010-10-11

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-642-16321-0_5
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fully-functional succinct trees

  2010cited by this paper
• Extended Compact Web Graph Representations

  2010cited by this paper
• Extracting Powers and Periods in a String from Its Runs Structure

  2010cited by this paper
• Alphabet Partitioning for Compressed Rank/Select with Applications

  2009influential reference
• Alphabet Partitioning for Compressed Rank/Select and Applications

  2009influential reference
• Rank/select on dynamic compressed sequences and applications

  2009cited by this paper
• Space-Efficient Framework for Top-k String Retrieval Problems

  2009cited by this paper
• Compressed Representations of Permutations, and Applications

  2009cited by this paper
• Range Quantile Queries: Another Virtue of Wavelet Trees

  2009cited by this paper
• Compressing and indexing labeled trees, with applications

  2009cited by this paper
• Inverted index compression and query processing with optimized document ordering

  2009cited by this paper
• Practical Rank/Select Queries over Arbitrary Sequences

  2008influential reference
• Reorganizing compressed text

  2008cited by this paper
• Succinct Encoding of Permutations: Applications to Text Indexing

  2008cited by this paper
• Succinct Representations of Arbitrary Graphs

  2008cited by this paper
• Compressed text indexes: From theory to practice

  2007cited by this paper
• Succinct indexes for strings, binary relations and multilabeled trees

  2007cited by this paper
• Compact Set Representation for Information Retrieval

  2007cited by this paper
• Compressed representations of sequences and full-text indexes

  2007cited by this paper
• Succinct data structures for flexible text retrieval systems

  2007cited by this paper
• Compressed full-text indexes

  2007cited by this paper
• Space-Efficient Algorithms for Document Retrieval

  2007cited by this paper
• Intersection in Integer Inverted Indices

  2007influential reference
• Practical Entropy-Compressed Rank/Select Dictionary

  2006cited by this paper
• Inverted files for text search engines

  2006cited by this paper
• Representing Trees of Higher Degree

  2005cited by this paper
• A Fast Set Intersection Algorithm for Sorted Sequences

  2004influential reference
• High-order entropy-compressed text indexes

  2003cited by this paper
• Adaptive intersection and t-threshold problems

  2002influential reference
• Efficient algorithms for document retrieval problems

  2002cited by this paper
• Experiments on Adaptive Set Intersections for Text Retrieval Systems

  2001influential reference
• An analysis of the Burrows-Wheeler transform

  2001cited by this paper
• Adaptive set intersections, unions, and differences

  2000cited by this paper
• Authoritative sources in a hyperlinked environment

  1999cited by this paper
• The Anatomy of a Large-Scale Hypertextual Web Search Engine

  1998cited by this paper
• Efficient suffix trees on secondary storage

  1996cited by this paper
• Succinct static data structures

  1988cited by this paper

• Engineering Rank/Select Data Structures for Big-Alphabet Strings

  2023influential citation
• Engineering rank/select data structures for large-alphabet strings

  2023influential citation
• To index or not to index: Time-space trade-offs for positional ranking functions in search engines

  2020cites this paper
• Energy Consumption in Compact Integer Vectors: A Study Case

  2019cites this paper
• A Practical Alphabet-Partitioning Rank/Select Data Structure

  2019cites this paper
• Indexing infrastructure for semantics full-text search

  2019cites this paper
• Succinct Representations in Collaborative Filtering: A Case Study using Wavelet Tree on 1,000 Cores

  2019cites this paper
• Efficient indexing for semantic search

  2017cites this paper
• The wavelet matrix: An efficient wavelet tree for large alphabets

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

  2015cites this paper
• TO INDEX OR NOT TO INDEX: TIME-SPACE TRADE-OFFS IN SEARCH ENGINES WITH POSITIONAL RANKING FUNCTIONS

  2014cites this paper
• Grammar compressed sequences with rank/select support

  2014cites this paper
• Efficient Compressed Wavelet Trees over Large Alphabets

  2014cites this paper
• Ranked Document Retrieval in (Almost) No Space

  2012cites this paper
• Wavelet trees for all

  2012cites this paper
• Dual-Sorted Inverted Lists in Practice

  2012cites this paper
• The Wavelet Matrix

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

  2012cites this paper
• Wavelet trees: A survey

  2012influential citation
• Implicit indexing of natural language text by reorganizing bytecodes

  2012cites this paper
• To index or not to index: time-space trade-offs in search engines with positional ranking functions

  2012cites this paper
• Distributed search based on self-indexed compressed text

  2012cites this paper
• A Word-based Self-Indexes for Natural Language Text

  2011cites this paper
• Algorithms and Compressed Data Structures for Information Retrieval

  2011cites this paper
• Optimal Lower and Upper Bounds for Representing Sequences

  2011cites this paper
• Efficient Fully-Compressed Sequence Representations

  2009cites this paper