Live briefing
Everything about Search data structure
In computer science, a search data structure is any data structure that allows the efficient retrieval of specific items from a set of items, such as a specific record from a database. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Search data structureA 5-minute orientation
- Skim a recent paper: GPCRdb in 2025: adding odorant receptors, data mapper, structure similarity search and models of physiological ligand complexesInfluential work since 2022
- Pick up a classic book: Knowledge discovery and measures of interestThe most-reprinted book on the subject
- Read the landmark paper: Ephemeral data derived potentials for random structure searchCited 76 times
- Go sideways: Priority queueA closely related topic
- Go sideways: Comparison of data structuresA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Ephemeral data derived potentials for random structure search
An implicit data structure supporting insertion, deletion, and search in Olog2n) time
Protein structure determination by exhaustive search of Protein Data Bank derived databases
Computational Search for Strong Topological Insulators: An Exercise in Data Mining and Electronic Structure
Augmented Interval List: a novel data structure for efficient genomic interval search
Accelerated cluster structure search using electron diffraction data in a genetic algorithm
Visualizing the structure of web communities based on data acquired from a search engine
The empty bin: A data structure for spatial search of time‐varying data
🆕 Influential since 2022
GPCRdb in 2025: adding odorant receptors, data mapper, structure similarity search and models of physiological ligand complexes
TM-search: An Efficient and Effective Tool for Protein Structure Database Search
A search for the fine-structure constant evolution from fast radio bursts and type Ia supernovae data
Search for a possible quasi-periodic structure based on data of the SDSS DR12 LOWZ
Discovering structure and influencing factors of Chinese city directed network (CCDN) from web search engine data
📚 Books worth reading
Knowledge discovery and measures of interestRobert J. Hilderman, Howard J. Hamilton · 2001
Keyword search in databasesJeffrey Xu Yu · 2009
Ontology-based query processing for global information systemsEduardo Mena, Arantza Illarramendi · 2001
R-treesYannis Manolopoulos, Alexandros Nanopoulos · 2005
Dynamic Taxonomies and Faceted SearchGiovanni Maria Sacco · 2009
Semantic models for multimedia database searching and browsingShu-Ching Chen, Shu-Ching Chen · 2000
Knowledge discovery and data miningOded Z. Maimon, Oded Maimon · 2000
Soft Computing for Knowledge DiscoveryJames G. Shanahan · 2000
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Priority queue In computer science, a priority queue is an abstract data type similar to a regular queue where each element has an associated priority determining its…
- Comparison of data structures This is a comparison of the performance of notable data structures, as measured by the complexity of their logical operations. For a more comprehensive…
- Binary heap A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues. The binary…
- Van Emde Boas tree A van Emde Boas tree (Dutch pronunciation: [vɑn ˈɛmdə ˈboːɑs]), also known as a vEB tree or van Emde Boas priority queue, is a tree data structure which…
- Binary search tree In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each…
- Heap (data structure) In computer science, a heap is a tree-based data structure that satisfies the heap property: In a max heap, for any given node C, if P is the parent node…
- Hash table In computer science, a hash table is a data structure that implements an associative array, also called a dictionary or simply map; an associative array…
- Insertion sort Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time by comparisons. It is much less efficient…