A graphical query language supporting recursion
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Flexible queries over semistructured data
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximating Terminological Queries
FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
Foundations of semantic web databases
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Imprecise RDQL: towards generic retrieval in ontologies using similarity joins
Proceedings of the 2006 ACM symposium on Applied computing
Computing Relaxed Answers on RDF Databases
WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
A Framework for the Partial Evaluation of SPARQL Queries
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
Approximating OWL-DL ontologies
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Relaxing RDF queries based on user and domain preferences
Journal of Intelligent Information Systems
Flexible SPARQL Querying of Web Data Tables Driven by an Ontology
FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
SPARK: adapting keyword query to semantic search
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
Supporting semantic search on heterogeneous semi-structured documents
CAiSE'10 Proceedings of the 22nd international conference on Advanced information systems engineering
Query relaxation for star queries on RDF
WISE'10 Proceedings of the 11th international conference on Web information systems engineering
Approximating query answering on RDF databases
World Wide Web
Hi-index | 0.00 |
We explore flexible querying of RDF data, with the aim of making it possible to return data satisfying query conditions with varying degrees of exactness, and also to rank the results of a query depending on how “closely” they satisfy the query conditions. We make queries more flexible by logical relaxation of their conditions based on RDFS entailment and RDFS ontologies. We develop a notion of ranking of query answers, and present a query processing algorithm for incrementally computing the relaxed answer of a query. Our approach has application in scenarios where there is a lack of understanding of the ontology underlying the data, or where the data objects have heterogeneous sets of properties or irregular structures.