Live briefing
Everything about Substring index
Data structure
In computer science, a substring index is a data structure which gives substring search in a text or text collection in sublinear time. Once constructed from a document or set of documents, a substring index can be used to locate all occurrences of a pattern in time linear or near-linear in the pattern size, with no dependence or only logarithmic dependence on the document size. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Substring indexA 5-minute orientation
- Skim a recent paper: A novel method for designing indexes to support efficient substring queries on encrypted databasesInfluential work since 2022
- Pick up a classic book: Computational Thinking for the Modern Problem SolverThe most-reprinted book on the subject
- Read the landmark paper: Two-dimensional substring indexingCited 15 times
- Go sideways: Suffix treeA closely related topic
- Go sideways: Suffix automatonA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Two-dimensional substring indexing
Document retrieval using a substring index
Using Frequent Substring Mining Techniques for Indexing Genome Sequences: A Comparison of Frequent Substring and Frequent Max Substring Algorithms
SSCard: Substring Cardinality Estimation using Suffix Tree-Guided Learned FM-Index
🆕 Influential since 2022
📚 Books worth reading
Computational Thinking for the Modern Problem SolverKenny A. Hunt, David D. Riley · 2014
Fundamentals of data structures in CEllis Horowitz · 1993- 📕Full-Text (Substring) Indexes in External MemoryMarina Barsky, Alex Thomo · 2011
Introduction to C ProgrammingReema Thareja · 2013
Apache Solr 3 Enterprise Search ServerDavid Smiley · 2011
Programming in C#E. Balagurusamy · 2002
Learn to Program with PythonIrv Kalb · 2016
Fundamentals of data structures in CEllis Horowitz · 2008
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Suffix tree In computer science, a suffix tree (also called PAT tree or, in an earlier form, position tree) is a compressed trie containing all the suffixes of the…
- Suffix automaton In computer science, a suffix automaton is an efficient data structure for representing the substring index of a given string which allows the storage…
- Suffix array In computer science, a suffix array is a sorted array of all suffixes of a string. It is a data structure used in, among others, full-text indices, data-compres…
- FM-index In computer science, an FM-index is a compressed full-text substring index based on the Burrows–Wheeler transform, with some similarities to the suffix…
- Compressed suffix array In computer science, a compressed suffix array is a compressed data structure for pattern matching. Compressed suffix arrays are a general class of data…
- String-searching algorithm A string-searching algorithm, sometimes called string-matching algorithm, is an algorithm that searches a body of text for portions that match by pattern…
- Trie In computer science, a trie (/ˈtraɪ/, /ˈtriː/ ), also known as a digital tree or prefix tree, is a specialized search tree data structure used to store…
- Deterministic acyclic finite state automaton In computer science, a deterministic acyclic finite state automaton (DAFSA), is a data structure that represents a set of strings, and allows for a query…