Space-efficient data structures for flexible text retrieval systems

DOI10.1007/3-540-36136-7_2MaRDI QIDQ4425936zbMATH OpenFDO

Authors Kunihiko Sadakane

Publication date 14 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2518/25180014.htm

Mathematics Subject Classification ID

Searching and sorting (68P10) Information storage and retrieval of data (68P20)

Recommendations

• Succinct data structures for flexible text retrieval systems
• General document retrieval in compact space
• Top-\(k\) document retrieval in optimal time and linear space
• Complete inverted files for efficient text retrieval and analysis
• Space-Efficient Algorithms for Document Retrieval

Cited in

(10)

• Efficient data storage and retrieval organization using the frequency properties of the query stream
• Constructing suffix arrays in linear time
• Unique-order interpolative coding for fast querying and space-efficient indexing in information retrieval systems
• Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
• An efficient algorithm for retrieving example sentences
• A novel full-text indexing model for Chinese text retrieval
• A high-speed dynamic full-text search method by using memory management
• Complete inverted files for efficient text retrieval and analysis
• Multidimensional term indexing for efficient processing of complex queries
• Succinct data structures for flexible text retrieval systems

This page was built for publication: Space-efficient data structures for flexible text retrieval systems

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