Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Heuristics for partial-match retrieval data base design

From MaRDI portal
Publication:1223153
Jump to:navigation, search

DOI10.1016/0020-0190(76)90027-2zbMath0321.68026OpenAlexW2079416701MaRDI QIDQ1223153

Jon Louis Bentley, Walter A. Burkhard

Publication date: 1976

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://www.osti.gov/biblio/1443590



Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) General topics in the theory of software (68N01) Algorithms in computer science (68W99)


Related Items (3)

Non-uniform partial-match file designs ⋮ Associative retrieval trie hash-coding ⋮ Expected worst-case partial match in random quadtries




Cites Work

  • Partial-Match Retrieval Algorithms
  • Partial match retrieval
  • A formal system for information retrieval from files




This page was built for publication: Heuristics for partial-match retrieval data base design

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1223153&oldid=13298563"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 07:15.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki