Document retrieval with one wildcard

DOI10.1016/J.TCS.2016.05.024zbMATH Open1339.68073OpenAlexW2400068012MaRDI QIDQ287451FDOQ287451

Authors: Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan 

Publication date: 26 May 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.05.024

Recommendations

• Document retrieval with one wildcard
• Less space: indexing for queries with wildcards
• String indexing for patterns with wildcards
• Less space: indexing for queries with wildcards
• Space-efficient string indexing for wildcard pattern matching

zbMATH Keywords

compressed data structuresdocument retrievalstring searchingwildcards

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05) Algorithms on strings (68W32)

Cites Work

• A data structure for dynamic trees
• Improved compressed indexes for full-text document retrieval
• Dictionary matching and indexing with errors and don't cares
• Title not available (Why is that?)
• Title not available (Why is that?)
• Space-efficient preprocessing schemes for range minimum queries on static arrays
• Text Indexing and Dictionary Matching with One Error
• String indexing for patterns with wildcards
• Indexing factors with gaps
• Orthogonal Range Searching for Text Indexing
• Indexes for Document Retrieval with Relevance
• Top-k Document Retrieval in External Memory
• Less Space: Indexing for Queries with Wildcards
• Forbidden patterns
• Document Listing for Queries with Excluded Pattern
• Document Retrieval with One Wildcard
• Space-Efficient String Indexing for Wildcard Pattern Matching.
• Substring Range Reporting
• A fast string searching algorithm
• Alphabet-independent compressed text indexing
• Suffix Arrays: A New Method for On-Line String Searches
• Ranked Document Selection
• Space-Efficient Frameworks for Top- k String Retrieval
• Fast Pattern Matching in Strings
• Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
• Optimal static range reporting in one dimension
• Spaces, Trees, and Colors
• Space Efficient Indexes for String Matching with Don’t Cares
• Orthogonal range searching on the RAM, revisited
• Fast set intersection and two-patterns matching
• Approximate string matching using compressed suffix arrays
• Succinct data structures for flexible text retrieval systems

This page was built for publication: Document retrieval with one wildcard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287451)