Hashing Tree-Structured Data: Methods and Applications

12 years 1 months ago
Hashing Tree-Structured Data: Methods and Applications
In this article we propose a new hashing framework for tree-structured data. Our method maps an unordered tree into a multiset of simple wedge-shaped structures refered to as pivots. By coupling our pivot multisets with the idea of minwise hashing, we realize a fixed sized signature-sketch of the treestructured datum yielding an effective mechanism for hashing such data. We discuss several potential pivot structures and study some of the theoretical properties of such structures, and discuss their implications to tree edit distance and properties related to perfect hashing. We then empirically demonstrate the efficacy and efficiency of the overall approach on a range of real-world datasets and applications.
Shirish Tatikonda, Srinivasan Parthasarathy
Added 20 Dec 2009
Updated 03 Jan 2010
Type Conference
Year 2010
Where ICDE
Authors Shirish Tatikonda, Srinivasan Parthasarathy
Comments (0)