Summarizing XML Data by Means of Association Rules

XML is a rather verbose representation of semistructured data, which may require huge amounts of storage space We propose several summarized representations of XML data, which can both provide succinct information and be directly queried These representations are based on the extraction of association rules from XML datasets.

[1]  Letizia Tanca,et al.  Modeling Semistructured Data by Using Graph-Based Constraints , 2003, OTM Workshops.

[2]  Wenfei Fan,et al.  On XML integrity constraints in the presence of DTDs , 2001, JACM.

[3]  Wenfei Fan,et al.  Constraints for semistructured data and XML , 2001, SGMD.

[4]  Matthias Jarke,et al.  Advances in Database Technology — EDBT 2002 , 2002, Lecture Notes in Computer Science.

[5]  Hannu Toivonen,et al.  TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies , 1999, Comput. J..

[6]  John Staples,et al.  Unification of quantified terms , 1986, Graph Reduction.

[7]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[8]  Agostino Dovier,et al.  An efficient algorithm for computing bisimulation equivalence , 2004, Theor. Comput. Sci..

[9]  Wenfei Fan,et al.  Keys for XML , 2001, WWW '01.

[10]  C. M. Sperberg-McQueen,et al.  Extensible Markup Language (XML) , 1997, World Wide Web J..

[11]  Letizia Tanca,et al.  Operational and abstract semantics of the query language G-Log , 2002, Theor. Comput. Sci..

[12]  Tok Wang Ling,et al.  Designing Functional Dependencies for XML , 2002, EDBT.

[13]  Alessandro Campi,et al.  Design and implementation of a graphical interface to XQuery , 2003, SAC '03.

[14]  Wenfei Fan,et al.  Reasoning about Keys for XML , 2001, DBPL.

[15]  Marcelo Arenas,et al.  A normal form for XML documents , 2004, TODS.

[16]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD 2000.

[17]  M. F. Porter,et al.  An algorithm for suffix stripping , 1997 .

[18]  Gösta Grahne,et al.  Discovering approximate keys in XML data , 2002, CIKM '02.

[19]  Letizia Tanca,et al.  Operational and Abstract Semantics of a Query Language for Semi-Structured Information , 1998, APPIA-GULP-PRODE.

[20]  Elena Baralis,et al.  Answering Queries on XML Data by means of Association Rules , 2004, SEBD.

[21]  Amihai Motro.  Using Integrity Constraints to Provide Intensional Answers to Relational Queries , 1989, VLDB.

[22]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.