On the complexity of designing optimal partial-match retrieval systems (Q3340208)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3874669
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of designing optimal partial-match retrieval systems |
scientific article; zbMATH DE number 3874669 |
Statements
On the complexity of designing optimal partial-match retrieval systems (English)
0 references
1983
0 references
partial match retrieval
0 references
searching
0 references
file organization
0 references
approximation algorithms
0 references
information retrieval system
0 references
partial match queries
0 references
hashing
0 references
NP-hard
0 references
heuristic algorithms
0 references
0.8452632427215576
0 references
0.8451915383338928
0 references
0.8276286125183105
0 references
0.7865947484970093
0 references
0.7808991074562073
0 references
