PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays
Lauro Lins, Sostenes Lins, Silvio Melo
TL;DR
This paper introduces 'phorma', a novel data structure that enables perfect hashing of complex, order-restricted multidimensional arrays, improving efficiency in data retrieval and storage.
Contribution
The paper presents a new data structure called phorma that achieves perfect hashing for general arrays with order restrictions, a significant advancement over existing methods.
Findings
Efficient perfect hashing for complex arrays.
Applicable to a wide range of order-restricted multidimensional arrays.
Improves data retrieval and storage efficiency.
Abstract
In this paper we propose a simple and efficient data structure yielding a perfect hashing of quite general arrays. The data structure is named phorma, which is an acronym for perfectly hashable order restricted multidimensional array. Keywords: Perfect hash function, Digraph, Implicit enumeration, Nijenhuis-Wilf combinatorial family.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Packing Problems · graph theory and CDMA systems · Computational Geometry and Mesh Generation