PHORMA: Perfectly Hashed Order Restricted Multidimensional Array

Details PHORMA: Perfectly Hashed Order Restricted Multidimensional Array PHORMA: Perfectly Hashed Order Restricted Multidimensional Array

2003-01-24

arxiv.org/abs/cs/0301025v1

Computer Science

Discrete Mathematics

12 pages, 4 figures

Scientific paper

In this paper we propose a simple and efficient strategy to obtain a data structure generator to accomplish a perfect hash of quite general order restricted multidimensional arrays named {\em phormas}. The constructor of such objects gets two parameters as input: an n-vector a of non negative integers and a boolean function B on the types of order restrictions on the coordinates of the valid n-vectors bounded by a. At compiler time, the phorma constructor builds, from the pair a,B, a digraph G(a,B) with a single source s and a single sink t such that the st-paths are in 1-1 correspondence with the members of the B-restricted a-bounded array A(a,B). Besides perfectly hashing A(a,B), G(a,B) is an instance of an NW-family. This permits other useful computational tasks on it.

Affiliated with

Also associated with

No associations

Rating

PHORMA: Perfectly Hashed Order Restricted Multidimensional Array does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with PHORMA: Perfectly Hashed Order Restricted Multidimensional Array, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and PHORMA: Perfectly Hashed Order Restricted Multidimensional Array will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-709546