Finding Regular Simple Paths in Graph Databases
SIAM Journal on Computing
Flexible queries over semistructured data
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Foundations of semantic web databases
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Regular path queries under approximate semantics
Annals of Mathematics and Artificial Intelligence
Computing Relaxed Answers on RDF Databases
WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
Answering approximate queries over autonomous web databases
Proceedings of the 18th international conference on World wide web
Robust and efficient algorithms for rank join evaluation
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Ranking Approximate Answers to Semantic Web Queries
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
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
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
Adaptive relaxation for querying heterogeneous XML data sources
Information Systems
Journal on data semantics X
Query languages for graph databases
ACM SIGMOD Record
Towards fuzzy query-relaxation for RDF
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
A similarity measure for approximate querying over RDF data
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Database research challenges and opportunities of big graph data
BNCOD'13 Proceedings of the 29th British National conference on Big Data
Hi-index | 0.00 |
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks knowledge of its full structure or where the structure is irregular. In such circumstances, it is helpful if the querying system can perform both approximate matching and relaxation of the user's query and can rank the answers according to how closely they match the original query. Our framework incorporates both standard notions of approximation based on edit distance and RDFS-based inference rules. The query language we adopt comprises conjunctions of regular path queries, thus including extensions proposed for SPARQL to allow for querying paths using regular expressions. We provide an incremental query evaluation algorithm which runs in polynomial time and returns answers to the user in ranked order.