A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the Top-k Retrieval Problem for Ontology-Based Access to Databases
[chapter]
2013
Studies in Computational Intelligence
The chapter is a succinct summary on the problem of evaluating ranked top-k queries in the context of ontology-based access over relational databases. An ontology layer is used to define the relevant abstract concepts and relations of the application domain, while facts with associated score are stored into a relational database. Queries are conjunctive queries with ranking aggregates and scoring functions. The results of a query may be ranked according to the score and the problem is to find
doi:10.1007/978-3-319-00954-4_5
fatcat:wq725kq5svcedjietrtez3rsaq