Concurrency and trie hashing

DOI10.1007/BF00288973zbMath0659.68031MaRDI QIDQ1112592

W. Litwin, K. Vidyasankar, Yehoshua Sagiv

Publication date: 1989

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

binary treerange queriesdata structureconcurrent executiondynamic filesordered filestrie hashing

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Related Items (1)

Concurrency and trie hashing

Cites Work

• Unnamed Item
• Unnamed Item
• Concurrent operations on \(B^ *\)-trees with overtaking
• Concurrency and trie hashing
• Consistency in Hierarchical Database Systems
• Concurrent manipulation of binary search trees
• Efficient locking for concurrent operations on B-trees

This page was built for publication: Concurrency and trie hashing