A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Combining Approximation and Relaxation in Semantic Web Path Queries
[chapter]
2010
Lecture Notes in Computer Science
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
doi:10.1007/978-3-642-17746-0_40
fatcat:5uasd74kxfdmnmuelueqvofibi