On the complexity of inferring functional dependencies
Discrete Applied Mathematics - Special issue on combinatorial problems in databases
Approximate inference of functional dependencies from relations
ICDT '92 Selected papers of the fourth international conference on Database theory
Discovering typical structures of documents: a road map approach
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Journal of the ACM (JACM)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Constraints for semistructured data and XML
ACM SIGMOD Record
On XML integrity constraints in the presence of DTDs
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A normal form for XML documents
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Efficient Discovery of Functional and Approximate Dependencies Using Partitions
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Semantics in Data and Knowledge Bases
Discovering XML keys and foreign keys in queries
Proceedings of the 2009 ACM symposium on Applied Computing
Using transversals for discovering XML functional dependencies
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Fast detection of functional dependencies in XML data
XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
Summarizing XML data by means of association rules
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Finding optimal probabilistic generators for XML collections
Proceedings of the 15th International Conference on Database Theory
Discovering conditional functional dependencies in XML data
ADC '11 Proceedings of the Twenty-Second Australasian Database Conference - Volume 115
Discovering XSD keys from XML data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Hi-index | 0.00 |
Keys are very important in many aspects of data management, such as guiding query formulation, query optimization, indexing, etc. We consider the situation where an XML document does not come with key definitions, and we are interested in using data mining techniques to obtain a representation of the keys holding in a document. In order to have a compact representation of the set of keys holding in a document, we define a partial order on the set of all key expressions. This order is based on an analysis of the properties of absolute and relative keys for XML. Given the existence of the partial order, only a reduced set of key expressions need to be discovered.Due to the semistructured nature of XML documents, it turns out to be useful to consider keys that hold in "almost" the whole document, that is, they are violated only in a small part of the document. To this end, the support and confidence of a key expression are also defined, and the concept of approximate key expression is introduced. We give an efficient algorithm to mine a reduced set of approximate keys from an XML document.