A normal form for precisely characterizing redundancy in nested relations
ACM Transactions on Database Systems (TODS)
A normal form for XML documents
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Discovering approximate keys in XML data
Proceedings of the eleventh international conference on Information and knowledge management
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
Data Mining and Knowledge Discovery
Designing Functional Dependencies for XML
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
On the Computation of Multidimensional Aggregates
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
An information-theoretic approach to normal forms for relational and XML data
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Strong functional dependencies and their application to normal forms in XML
ACM Transactions on Database Systems (TODS)
Efficient discovery of XML data redundancies
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
GORDIAN: efficient and scalable discovery of composite keys
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
A Survey Study on XML Functional Dependencies
ISDPE '07 Proceedings of the The First International Symposium on Data, Privacy, and E-Commerce
XML schema refinement through redundancy detection and normalization
The VLDB Journal — The International Journal on Very Large Data Bases
XML Functional Dependency and Schema Normalization
HIS '09 Proceedings of the 2009 Ninth International Conference on Hybrid Intelligent Systems - Volume 03
On Defining Functional Dependency for XML
ICSC '09 Proceedings of the 2009 IEEE International Conference on Semantic Computing
ICDT'07 Proceedings of the 11th international conference on Database Theory
Efficient filtering and ranking schemes for finding inclusion dependencies on the web
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |
In this paper we discuss a scheme for efficiently detecting functional dependency in XML data (XFD). The ability to detect XFD in XML data is useful in many real-life applications, such as XML schema design, relational schema design based on XML data, and redundancy detection in XML data. However, detection of XFD is an expensive task, and an efficient algorithm is essential in order to deal with large XML data collection. For this reason, we propose an efficient way to detect XFD in XML data. We assume that XML data being processed are represented as hierarchically organized relational tables. Given such data, we attempt to detect XFDs existing within and among the tables. Our basic idea is to adopt the PipeSort algorithm, which has been successfully used in OLAP, to detect XFDs within a table. We modify the basic PipeSort algorithm by incorporating a pruning mechanism by taking the features of XFDs into account, thereby making the whole process even faster. Having obtained a set of XFDs existing in tables, we attempt to detect XFDs existing among tables. In this process, we also make use of the features of XFDs for pruning. We show the feasibility of our scheme by some experiments.