The Community for Technology Leaders
RSS Icon
Subscribe
Long Beach, CA, USA
Mar. 1, 2010 to Mar. 6, 2010
ISBN: 978-1-4244-5445-7
pp: 429-440
Shirish Tatikonda , Department of Computer Science and Engineering, The Ohio State University, 2015 Neil Ave, Columbus, 43202, USA
Srinivasan Parthasarathy , Department of Computer Science and Engineering, The Ohio State University, 2015 Neil Ave, Columbus, 43202, USA
ABSTRACT
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 tree-structured 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.
CITATION
Shirish Tatikonda, Srinivasan Parthasarathy, "Hashing tree-structured data: Methods and applications", ICDE, 2010, 2013 IEEE 29th International Conference on Data Engineering (ICDE), 2013 IEEE 29th International Conference on Data Engineering (ICDE) 2010, pp. 429-440, doi:10.1109/ICDE.2010.5447882
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool