The String-to-String Correction Problem
Journal of the ACM (JACM)
Flexible queries over semistructured data
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A survey in indexing and searching XML documents
Journal of the American Society for Information Science and Technology - XML
Accelerating XPath location steps
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
The Index-Based XXL Search Engine for Querying XML Data with Relevance Ranking
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Adding Structure to Unstructured Data
ICDT '97 Proceedings of the 6th International Conference on Database Theory
ATreeGrep: Approximate Searching in Unordered Trees
SSDBM '02 Proceedings of the 14th International Conference on Scientific and Statistical Database Management
DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
Adaptive Processing of Top-k Queries in XML
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Structure and content scoring for XML
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Approximate subtree identification in heterogeneous XML documents collections
XSym'05 Proceedings of the Third international conference on Database and XML Technologies
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II
Hi-index | 0.00 |
Highly heterogeneous XML collections are thematic collections exploiting different structures: the parent-child or ancestor-descendant relationships are not preserved and vocabulary discrepancies in the element names can occur. In this setting current approaches return answers with low precision. By means of similarity measures and semantic inverted indices we present an approach for improving the precision of query answers without compromising performance.