Discovering approximate keys in XML data

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2002, Pages 453-460

  Grahne, Gösta ^a   Zhu, Jianfei ^a  

^a Gina Cody School of Engineering and Computer Science   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING; DATA STRUCTURES; DATABASE SYSTEMS; SEMANTICS; THEOREM PROVING;

APPROXIMATE KEYS;

XML;

EID: 0037818557     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/584792.584867     Document Type: Conference Paper

References (18)

1. ACM SIGMOD Record: XML Version. http://www.acm.org/sigmod/record/xml/.
2. S. Abiteboul, R. Hull and V. Vianu. Foundations of databases, Addison-Wesley, 1995.
3. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Very Large Data Bases, pages 487-499, Santiago, 1994.
4. M. Arenas and L. Libkin. A normal form for XML documents, Proceedings of the 21th Symposium on Principles of Database Systems (PODS'02), pages 85-96, 2002.
5. T. Bray, J. Paoli, and C. M. Sperberg-McQueen. Extensive Markup Language (XML) 1.0. World Wide Web Consortium (W3C), Feb. 1998. http://www.w3.org/TR/REC-xml.
6. P. Buneman, S. Davidson, W. Fan, C. Hara, W. Tan. Reasoning about Keys for XML. In 8th International Workshop on Databases and Programming Languages (DBPL '01).
7. P. Buneman, W. Fan,J. Siméon, S. Weinstein. Constraints for semistructured data and XML. SIGMOD Record, 30(1): 47-55, 2001.
8. S. Davidson, Y. Chen and Y. Zheng. Technical report, Indexing Keys in Hierarchical Data, 2001.
9. W. Fan, L. Libkin. On XML Integrity Constraints in the Presence of DTDs. In Proceedings of ACM Symposium on Principles of Database Systems (PODS), pages 114-125, Santa Barbara, California, May 2001.
10. W. Fan, J. Siméon. Integrity Constraints for XML. In Proceedings of ACM Symposium on Principles of Database Systems (PODS), pages 23-34, Dallas, Texas, May 2000.
11. C. M. Hoffmann and M. J. O'Donnell. Pattern matching in trees, Journal of the ACM, 29(1):68-95, 1982.
12. Y. Huhtala, J. Kivinen, P. Porkka and H. Toivonen. Efficient Discovery of Functional and Approximate Dependencies Using Partitions, ICDE, pages 392-401, 1998.
13. A. Layman et al. XML-Data. W3C Note, Jan. 1998. http://www.w3.org/TR/1998/NOTE-XML-data.
14. K. Wang, H. Liu. Discovering Typical Structures of Documents: A Road Map Approach. In 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 146-154, 1998.
15. P. Buneman, S. Khanna, K. Tajima, W. Tan. Archiving Scientific Data. Proceedings of ACM SIGMOD International Conference on Management of Data, pages 1-12, 2002.
16. J. Kivinen and H. Mannila Approximate dependency inference from relations. Theoretical Computer Science, 149:129-149, 1995.
17. H. Mannila and K.-J. Räihä On the complexity of inferring functional dependencies. Discrete Applied Mathematics, 40:237-243, 1992.
18. Calders T., Paredaens J. Axiomatization of frequent sets. In Proceedings of the International Conference on Database Theory, pages 204-218, London, 2001.