Top-k selection queries over relational databases: Mapping strategies and performance evaluation
ACM Transactions on Database Systems (TODS)
Cooperative Answering through Controlled Query Relaxation
IEEE Expert: Intelligent Systems and Their Applications
An Efficient Aproach to Similarity-Based Retrieval on Top of Relational Databases
EWCBR '00 Proceedings of the 5th European Workshop on Advances in Case-Based Reasoning
Index Selection for Databases: A Hardness Study and a Principled Heuristic Solution
IEEE Transactions on Knowledge and Data Engineering
Computing Relaxed Answers on RDF Databases
WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
Integration of Semantically Annotated Data by the KnoFuss Architecture
EKAW '08 Proceedings of the 16th international conference on Knowledge Engineering: Practice and Patterns
Combining a Logical and a Numerical Method for Data Reconciliation
Journal on Data Semantics XII
Computing semantic relatedness using Wikipedia-based explicit semantic analysis
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
DBpedia - A crystallization point for the Web of Data
Web Semantics: Science, Services and Agents on the World Wide Web
Relaxing RDF queries based on user and domain preferences
Journal of Intelligent Information Systems
A Semantic Similarity Measure for Ontology-Based Information
FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
The fundamentals of iSPARQL: a virtual triple approach for similarity-based semantic web tasks
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Journal on data semantics X
AnQL: SPARQLing up annotated RDFS
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Combining approximation and relaxation in semantic web path queries
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
A self-training approach for resolving object coreference on the semantic web
Proceedings of the 20th international conference on World wide web
Query relaxation for entity-relationship search
ESWC'11 Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II
Web Semantics: Science, Services and Agents on the World Wide Web
Efficient semantic-aware detection of near duplicate resources
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part II
Leveraging terminological structure for object reconciliation
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part II
ReVeaLD: A user-driven domain-specific interactive search platform for biomedical research
Journal of Biomedical Informatics
| Hi-index | 0.00 |
In this paper, we argue that query relaxation over RDF data is an important but largely overlooked research topic: the Semantic Web standards allow for answering crisp queries over crisp RDF data, but what of use-cases that require approximate answers for fuzzy queries over crisp data? We introduce a use-case from an EADS project that aims to aggregate intelligence information for police post-incident analysis. Query relaxation is needed to match incomplete descriptions of entities involved in crimes to structured descriptions thereof. We first discuss the use-case, formalise the problem, and survey current literature for possible approaches. We then present a proof-of-concept framework for enabling relaxation of structured entity-lookup queries, evaluating different distance measures for performing relaxation. We argue that beyond our specific scenario, query relaxation is important to many potential use-cases for Semantic Web technologies, and worthy of more attention.