Hashing tree-structured data: Methods and applications

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2010, Pages 429-440

  Tatikonda, Shirish ^a   Parthasarathy, Srinivasan ^a  

^a The Ohio State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EFFECTIVE MECHANISMS; MULTI-SETS; MULTISET; PERFECT HASHING; REAL-WORLD DATASETS; TREE EDIT DISTANCE; TREE-STRUCTURED DATA; UNORDERED TREES; WEDGE-SHAPED STRUCTURE;

TREES (MATHEMATICS);

EID: 77952779390     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2010.5447882     Document Type: Conference Paper

References (41)

1. M. Daconta, L. Obrst, and K. Smith, The Semantic Web: a guide to the future of XML, Web services, and knowledge management. Wiley, 2003.
2. S. Decker, S. Melnik, F. Van Harmelen, D. Fensel, M. Klein, J. Broekstra, M. Erdmann, and I. Horrocks, "The semantic web: The roles of XML and RDF," IEEE Internet computing, vol. 4, no. 5, pp. 63-73, 2000.
3. P. DeRose, W. Shen, F. Chen, Y. Lee, D. Burdick, A. Doan, and R. Ramakrishnan, "DBLife: A community information management platform for the database research community," demo). In CIDR-07, 2007.
4. A. Brazma, H. Parkinson, U. Sarkans, M. Shojatalab, J. Vilo, N. Abeygunawardena, E. Holloway, M. Kapushesky, P. Kemmeren, G. Lara, et al., "ArrayExpress - a public repository for microarray gene expression data at the EBI," Nucleic Acids Research, vol. 31, no. 1, p. 68, 2003.
5. U. Westermann and W. Klas, "An analysis of XML database solutions for the management of MPEG-7 media descriptions," ACM Computing Surveys, vol. 35, no. 4, pp. 331-373, 2003.
6. E. Charniak, "Tree-bank grammars," in Proceedings of the National Conference on Artificial Intelligence, 1996, pp. 1031-1036.
7. M. Tsvetovat, J. Reminga, and K. Carley, DyNetML: Interchange format for rich social network data. Carnegie Mellon University, School of Computer Science,[Institute for Software Research International], 2004.
8. C. Stockham, L. Wang, and T. Warnow, "Statistically based postprocessing of phylogenetic analysis by clustering," Bioinformatics, vol. 18, no. 3, pp. 465-469, 2002.
9. S. Agrawal, S. Chaudhuri, and G. Das, "DBXplorer: a system for keyword-based search over relationaldatabases," in Proceedings 18th International Conference on Data Engineering, 2002, pp. 5-16.
10. A. Elmagarmid, P. Ipeirotis, and V. Verykios, "Duplicate record detection: A survey," IEEE Transaction on Knowledge and Data Engineering, vol. 19, no. 1, pp. 1-16, 2007.
11. Y. Ke, R. Sukthankar, and L. Huston, "An efficient parts-based near-duplicate and sub-image retrieval system," in Proceedings of the 12th annual ACM international conference on Multimedia, 2004, pp. 869-876.
12. G. Buehrer and K. Chellapilla, "A scalable pattern mining approach to web graph compression with communities," in Proceedings of the international conference on Web search and web data mining. ACM New York, NY, USA, 2008, pp. 95-106.
13. A. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher, "Min-wise independent permutations (extended abstract)," in Proceedings of the thirtieth annual ACM Symposium on Theory of Computing, 1998, pp. 327-336.
14. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. Ullman, and C. Yang, "Finding interesting associations without support pruning," IEEE Transactions on Knowledge and Data Engineering, vol. 13, no. 1, pp. 64-78, 2001.
15. A. Broder, S. Glassman, M. Manasse, and G. Zweig, "Syntactic clustering of the web," Computer Networks and ISDN Systems, vol. 29, no. 8-13, pp. 1157-1166, 1997.
16. A. Aho, R. Sethi, and J. Ullman, Compilers: principles, techniques, and tools. Addison-Wesley Longman Publishing Co., Inc. Boston, MA, USA, 1986.
17. H. Wolfson and I. Rigoutsos, "Geometric hashing: An overview," IEEE Computational Science & Engineering, vol. 4, no. 4, pp. 10-21, 1997.
18. N. Augsten, M. Böhlen, and J. Gamper, "Approximate matching of hierarchical data using pq-grams," in Proceedings of the 31st international conference on Very large data bases, 2005, pp. 301-312.
19. N. Augsten, M. Bohlen, C. Dyreson, and J. Gamper, "Approximate joins for data-centric XML," in IEEE 24th International Conference on Data Engineering, 2008. ICDE 2008, 2008, pp. 814-823.
20. S. Gollapudi and R. Panigrahy, "The power of two min-hashes for similarity search among hierarchical data objects," in Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 2008, pp. 211-220.
21. R. Yang, P. Kalnis, and A. Tung, "Similarity evaluation on tree-structured data," in Proceedings of the 2005 ACM SIGMOD international conference on Management of data. ACM New York, NY, USA, 2005, pp. 754-765.
22. M. Garofalakis and A. Kumar, "XML stream processing using tree-edit distance embeddings," ACM Transactions on Database Systems (TODS), vol. 30, no. 1, pp. 279-332, 2005.
23. A. Andoni and P. Indyk, "Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions," Communications of ACM, vol. 51, no. 1, pp. 117-122, 2008.
24. A. Gionis, P. Indyk, and R. Motwani, "Similarity search in high dimensions via hashing," in Proceedings of 25th International Confererence on Very Large Data Bases, 1999, pp. 518-529.
25. P. Indyk and R. Motwani, "Approximate nearest neighbors: towards removing the curse of dimensionality," in Proceedings of the thirtieth annual ACM symposium on Theory of computing, 1998, pp. 604-613.
26. A. Kirsch and M. Mitzenmacher, "Distance-sensitive bloom filters," in Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments. Society for Industrial Mathematics, 1987, p. 41.
27. R. Karp and M. Rabin, "Efficient randomized pattern-matching algorithms," IBM Journal of Research and Development, vol. 31, no. 2, pp. 249-260, 1987.
28. H. Samet, Applications of spatial data structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading, MA, 1990.
29. S. Tatikonda and S. Parthasarathy, "Hashing Tree-Structured Data: Methods and Applications," OSU Technical Report - OSU-CISRC-6/09-TR34, 2009.
30. P. Bille, "A survey on tree edit distance and related problems," Theoretical computer science, vol. 337, no. 1-3, pp. 217-239, 2005.
31. K. Zhang and D. Shasha, "Simple fast algorithms for the editing distance between trees and related problems," SIAM journal on computing, vol. 18, p. 1245, 1989.
32. D. Shapiro and J. Storer, "Distance with Move operations," in Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching, 2002, pp. 85-98.
33. S. Guha, H. Jagadish, N. Koudas, D. Srivastava, and T. Yu, "Approximate XML joins," in Proceedings of the 2002 ACM SIGMOD international conference on Management of data. ACM New York, NY, USA, 2002, pp. 287-298.
34. M. Weis and F. Naumann, "DogmatiX tracks down duplicates in XML," in Proceedings of the 2005 ACM SIGMOD international conference on Management of data. ACM New York, NY, USA, 2005, pp. 431-442.
35. T. Shintani and M. Kitsuregawa, "Parallel mining algorithms for generalized association rules with classification hierarchy," in Proceedings of the 1998 ACM SIGMOD international conference on Management of data. ACM New York, NY, USA, 1998, pp. 25-36.
36. S. Parthasarathy, "Efficient progressive sampling for association rules," in Proceedings of the 2002 IEEE International Conference on Data Mining, 2002, pp. 354-361.
37. T. Akutsu and M. Halldorsson, "On the approximation of largest common subtrees and largest common point sets," Theoretical Computer Science, vol. 233, no. 1-2, pp. 33-50, 2000.
38. F. Rossello and G. Valiente, "An algebraic view of the relation between largest common subtrees and smallest common supertrees," Theoretical Computer Science, vol. 362, no. 1-3, pp. 33-53, 2006.
39. T. Jiang, L. Wang, and K. Zhang, "Alignment of treesan alternative to tree edit," Theoretical Computer Science, vol. 143, no. 1, pp. 137-148, 1995.
40. K. Zhang, R. Statman, and D. Shasha, "On the editing distance between unordered labeled trees," Information Processing Letters, vol. 42, no. 3, pp. 133-139, 1992.
41. A. Andoni and R. Krauthgamer, "The computational hardness of estimating edit distance," in IEEE Symposium on the Foundations of Computer Science (FOCS). Citeseer, 2007, pp. 724-734.