Summarizing XML data by means of association rules

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3268, Issue , 2004, Pages 260-269

  Baralis, Elena ^a   Garza, Paolo ^a   Quintarelli, Elisa ^a   Tanca, Letizia ^b  

^a POLITECNICO DI TORINO   (Italy)

^b POLITECNICO DI MILANO   (Italy)

Author keywords

Association Rules; Data Mining; Intensional Answers; Semistructured Data

Indexed keywords

ASSOCIATION RULES; DIGITAL STORAGE; XML; DATA MINING;

INTENSIONAL ANSWER; SEMISTRUCTURED DATA; STORAGE SPACES; XML DATA; INTENSIONAL ANSWERS; SEMI STRUCTURED DATA;

DATA MINING; XML;

EID: 34547488646     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30192-9_25     Document Type: Article

References (21)

1. R. Agrawal and R. Srikant. Fast algorithm for mining association rules. In Proceeding of VLDB'94, 1994.
2. M. Arenas and L. Libkin. A normal form for xml documents. ACM TODS, 2002.
3. E. Augurusa, D. Braga, A. Campi, and S. Ceri. Design and implementation of a graphical interface to xquery. In SAC'03, 2003.
4. E. Baralis, P. Garza, E. Quintarelli, and L. Tanca. Answering Queries on XML Data by means of Association Rules. Technical Report 2004.3, Politecnico di Milano. http://www.elet.polimi.it/upload/quintare/Papers/BGQT-RR.ps.
5. P. Buneman, S. Davidson, W. Fan, C. Hara, and W. Tan. Reasoning about keys for XML. In DBLP'01, 2001.
6. P. Buneman, W. Fan, J. Siméon, and S. Weinstein. Constraints for semistructured data and XML. ACM SIGMOD Record, 30(1):47-54, 2001.
7. A. Cortesi, A. Dovier, E. Quintarelli, and L. Tanca. Operational and Abstract Semantics of a Query Language for Semi-Structured Information. Theoretical Computer Science, 275(1-2):521-560, 2002.
8. E. Damiani, B. Oliboni, E. Quintarelli, and L. Tanca. Modeling Semistructured Data by using graph-based constraints. Technical Report 27/03, Politecnico di Milano. Dipartimento di Elettronica e Informazione, July 2003.
9. A. Dovier, C. Piazza, and A. Policriti. An efficient algorithm for computing bisimulation equivalence. To appear in Theoretical Computer Science.
10. W. Fan and L. Libkin. On XML integrity constraints in the presence of DTDs. In Symposium on Principles of Database Systems, 2001.
11. G. Grahne and J. Zhu. Discovering approximate keys in XML data. In Proceedings of CIKM'02, pages 453-460. ACM Press, 2002.
12. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proceeding of SIGMOD'00, 2000.
13. Y. Huhtala, J. Kärkkäinen, P. Porkka, and H. Toivonen. TANE: An efficient algorithm for discovering functional and approximate dependencies. The Computer Journal, 42(2):100-111, 1999.
14. M.L. Lee, T.W. Ling, and W. L. Low. Designing functional dependencies for xml. In EDBT, 2002.
15. P. Merialdo. SIGMOD RECORD in XML, 2003. http://www.acm.org/sigmod/ record/xml.
16. R. Milner. A Calculus of Communicating System. In Lecture Notes in Computer Science, volume 92. Springer-Verlag, Berlin, 1980.
17. A. Motro. Using Integrity Constraints to Provide Intensional Answers to Relational Queries. In In Proceedings of VLDB'89, pages 237-245. Morgan Kaufmann, 1989.
18. M. F. Porter. An algorithm for suffix stripping. Program, 1980.
19. J. Staples and P. J. Robinson. Unification of quantified terms. In Robert M. Keller Joseph H. Fasel, editor, Proceedings of a Workshop on Graph Reduction, volume 279 of LNCS, pages 426-450, Sante Fé, NM, 1986. Springer.
20. World Wide Web Consortium. XML Information Set, 2001. http://www.w3C.org/xml-infoset/.
21. World Wide Web Consortium. Extensible Markup Language (XML) 1.0, 1998. http://www.w3C.org/TR/REC-xml/.