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

Associative retrieval trie hash-coding

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

DOI10.1016/S0022-0000(77)80031-7zbMath0394.68065MaRDI QIDQ1252726

Walter A. Burkhard

Publication date: 1977

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)


zbMATH Keywords

DesignsInformation RetrievalPartial-Match FileSecondary KeysTrie Hash-Coding


Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)


Related Items (2)

Associative retrieval trie hash-coding ⋮ Automatic error correction in flexion languages




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Heuristics for partial-match retrieval data base design
  • Non-uniform partial-match file designs
  • Associative retrieval trie hash-coding
  • Quad trees: A data structure for retrieval by composite keys
  • Multidimensional binary search trees used for associative searching
  • Partial-Match Retrieval Algorithms
  • Partial match retrieval
  • A formal system for information retrieval from files




This page was built for publication: Associative retrieval trie hash-coding

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1252726&oldid=13344569"
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 09:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki