Schema-Driven Evaluation of Approximate Tree-Pattern Queries
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
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
XIRQL: An XML query language based on information retrieval concepts
ACM Transactions on Information Systems (TOIS)
On the integration of structure indexes and inverted lists
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Adaptive Processing of Top-k Queries in XML
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
XSKETCH synopses for XML data graphs
ACM Transactions on Database Systems (TODS)
Retrieving XML data from heterogeneous sources through vague querying
ACM Transactions on Internet Technology (TOIT)
A fuzzy extension for the XPath query language
FQAS'06 Proceedings of the 7th international conference on Flexible Query Answering Systems
Vague queries on peer-to-peer XML databases
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
On the expressiveness of generalization rules for XPath query relaxation
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
A flexible XPath-based query language implemented with fuzzy logic programming
RuleML'2011 Proceedings of the 5th international conference on Rule-based reasoning, programming, and applications
Fuzzy Logic Programming for Implementing a Flexible XPath-based Query Language
Electronic Notes in Theoretical Computer Science (ENTCS)
Dynamically querying possibilistic XML data
Information Sciences: an International Journal
| Hi-index | 0.00 |
Data heterogeneity in XML repositories can be tackled by giving users the possibility to obtain approximate answers to their queries. In this setting, several approaches for XPath queries have been defined in the literature. In particular, fuzzy XPath queries have been recently introduced as a formalism to provide users with a clear understanding of the approximations that the query evaluation process introduces in the answers. However, in many cases, users are not a-priori aware of the maximum approximation degree they would allow in the answers; rather, they are interested in obtaining the first k answers ranked according to their approximation degrees. In this paper we investigate the problem of top-k fuzzy XPath querying, propose a query language and its associated semantics, and discuss query evaluation.