Symbolic Gray Code as a Perfect Multiattribute Hashing Scheme for Partial Match Queries

DOI10.1109/TSE.1982.235253zbMath0477.68117OpenAlexW1983094380MaRDI QIDQ3933809

M. W. Du, Chin-Chen Chang, Richard Chia-Tung Lee

Publication date: 1982

Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tse.1982.235253

zbMATH Keywords

partial match queryperfect hashingCartesian product filebucket-oriented symbolic Gray codemultiattribute file organization

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (3)

A note on allocating k-ary multiple key hashing files among multiple disks ⋮ The hierarchical ordering in multiattribute files ⋮ Optimal information retrieval when queries are not random

This page was built for publication: Symbolic Gray Code as a Perfect Multiattribute Hashing Scheme for Partial Match Queries