Learning unions of tree patterns using queries
Theoretical Computer Science - Special issue on algorithmic learning theory
Exact learning of tree patterns from queries and counterexamples
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On Exact Learning of Unordered Tree Patterns
Machine Learning
XRANK: ranked keyword search over XML documents
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Finding and approximating top-k answers in keyword proximity search
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML data exchange: Consistency and query answering
Journal of the ACM (JACM)
On the provenance of non-answers to queries over extracted data
Proceedings of the VLDB Endowment
TALE: A Tool for Approximate Large Graph Matching
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Information extraction from web documents based on local unranked tree automaton inference
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Artemis: a system for analyzing missing answers
Proceedings of the VLDB Endowment
Synthesizing view definitions from data
Proceedings of the 13th International Conference on Database Theory
Certain answers for XML queries
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
How to ConQueR why-not questions
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Query-based learning of XPath expressions
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Learning twig and path queries
Proceedings of the 15th International Conference on Database Theory
Learning queries for relational, semi-structured, and graph databases
Proceedings of the 2013 Sigmod/PODS Ph.D. symposium on PhD symposium
| Hi-index | 0.00 |
Formulating an XPath query over an XML document is a difficult chore for a non-expert user. This paper introduces a novel approach to ease the querying process. Instead of specifying a query, the user simply marks positive examples χ+ of nodes that fit her information need. She may also mark negative examples χ− of undesirable nodes. A deductive method, to suggest additional nodes that will interest the user, is developed in this paper. To be precise, a node y is a certain answer if every query returning all positive examples χ+, and not returning any negative example from χ−, must also return y. Similarly, y is a possible answer if there exists a query returning χ+ and y, while not returning any node in χ−. Thus, y is likely to be of interest to the user if y is a certain answer, and unlikely to be of interest if y is not even a possible answer. The complexity of finding certain and possible answers, with respect to various classes of XPath, is studied. It is shown that for a wide variety of XPath queries (including child and descendant axes, wildcards, branching and attribute constraints), certain and possible answers can be found efficiently, provided that χ+ and χ− are of bounded size. To prove this result a novel algorithm is developed.