SEAVE: a mechanism for verifying user presuppositions in query systems
ACM Transactions on Information Systems (TOIS)
On saying “Enough already!” in SQL
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
PREFER: a system for the efficient execution of multi-parametric ranked queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
RQL: a declarative query language for RDF
Proceedings of the 11th international conference on World Wide Web
Top-k selection queries over relational databases: Mapping strategies and performance evaluation
ACM Transactions on Database Systems (TODS)
FLEX: A Tolerant and Cooperative User Interface to Databases
IEEE Transactions on Knowledge and Data Engineering
Cooperative Answering through Controlled Query Relaxation
IEEE Expert: Intelligent Systems and Their Applications
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Supporting Incremental Join Queries on Ranked Inputs
Proceedings of the 27th International Conference on Very Large Data Bases
A Sampling-Based Estimator for Top-k Query
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
RAL: An Algebra for Querying RDF
World Wide Web
FleXPath: flexible structure and full-text querying for XML
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Machine learning for online query relaxation
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Supporting ad-hoc ranking aggregates
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Supporting top-K join queries in relational databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
SPARQL basic graph pattern optimization using selectivity estimation
Proceedings of the 17th international conference on World Wide Web
On Capturing Semantics in Ontology Mapping
World Wide Web
Computing Relaxed Answers on RDF Databases
WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
RDF-3X: a RISC-style engine for RDF
Proceedings of the VLDB Endowment
Using information content to evaluate semantic similarity in a taxonomy
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
DBpedia - A crystallization point for the Web of Data
Web Semantics: Science, Services and Agents on the World Wide Web
Adaptive relaxation for querying heterogeneous XML data sources
Information Systems
A relaxed approach to RDF querying
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Adaptive support framework for wisdom web of things
World Wide Web
Hi-index | 0.00 |
Database users may be frustrated by no answers returned when they pose a query on the database. In this paper, we study the problem of relaxing queries on RDF databases in order to acquire approximate answers. We address two problems in efficient query relaxation. First, to ensure the quality of answers, we compute the similarities between relaxed queries with regard to the user query and use them to score the potential relevant answers. Second, for obtaining top-k answers, we develop two algorithms. One is based on the best-first strategy and relaxed queries are executed in the ranking order. The batch based algorithm executes the relaxed queries as a batch and avoids unnecessary execution cost. At last, we implement and experimentally evaluate our approaches.