From Random to Hierarchical Data through an Irregular Pyramidal Structure

This paper proposes to transform data scanned randomly in a well-defined space (e.g, Euclidean) along a hierarchical irregular pyramidal structure in an attempt reduce search time consumed querying these random data. Such a structure is built as a series of graphs with different resolutions. Levels are constructed and surviving cells are chosen following irregular irregular pyramidal rules and according to a proximity criterion among the space points under consideration. Experimental results show that using such a structure to query data can save considerable search time.

• Type: Conference
• Year: 2009
• Where: GBRPR
• Authors: Rimon Elias, Mohab Al Ashraf, Omar Aly
• Keywords: GBRPR 2009, Irregular Pyramidal Rules, Irregular Pyramidal Structure, Search Time