Document - On the Top-k Retrieval Problem for Ontology-Based Access to Databases

2014

Contribution to book Restricted

On the Top-k Retrieval Problem for Ontology-Based Access to Databases

Straccia U.

Ontology based access Top-k retrieval F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES

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 efficiently the top-k ranked query answers.

Source: Flexible Approaches in Data, Information and Knowledge Management, edited by O. Pivert, S. Zadrozny, pp. 95–114. Berlin: Springer-Verlag, 2014

Publisher: Springer-Verlag, Berlin, DEU

Metrics

Back to previous page

Cite as

BibTeX entry

@inbook{oai:it.cnr:prodotti:261205,
	title = {On the Top-k Retrieval Problem for Ontology-Based Access to Databases},
	author = {Straccia U.},
	publisher = {Springer-Verlag, Berlin, DEU},
	doi = {10.1007/978-3-319-00954-4_5},
	booktitle = {Flexible Approaches in Data, Information and Knowledge Management, edited by O. Pivert, S. Zadrozny, pp. 95–114. Berlin: Springer-Verlag, 2014},
	year = {2014}
}