We present a framework for logic-based matchmaking on ALN ABoxes stored in a relational database. The proposed approach allows both non-standard reasoning and subsumption check be performed only via standard SQL queries. Main contribution is in the SQL implementation of the following features: (i) compliance with four match classes (i.e., exact, full, partial and potential); (ii) rank computation for each matching outcome and (iii) preferences management in the user query. Performance evaluation carried out on a PostgreSQL 8.4 engine reports reasonable results in terms of scalability and turnaround times for large scale data sets.
|Titolo:||Reasoning in resource-constrained environments: a matchmaking engine over relational Knowledge Bases|
|Data di pubblicazione:||2011|
|Nome del convegno:||24th International Workshop on Description Logics, DL 2011|
|Appare nelle tipologie:||4.1 Contributo in Atti di convegno|