Enhancing Algebraic Query Relaxation with Semantic Similarity release_pkgoonfow5cbvprzjqfyelfkwa

by Lena Wiese

Released as a article .

2012  

Abstract

Cooperative database systems support a database user by searching for answers that are closely related to his query and hence are informative answers. Common operators to relax the user query are Dropping Condition, Anti-Instantiation and Goal Replacement. In this article, we provide an algebraic version of these operators. Moreover we propose some heuristics to assign a degree of similarity to each tuple of an answer table; this degree can help the user to determine whether this answer is relevant for him or not.
In text/plain format

Archived Files and Locations

application/pdf  167.6 kB
file_fhqb62kdyjg5db6mqk22kv4r34
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2012-10-23
Version   v1
Language   en ?
arXiv  1210.6242v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: e3f95b6f-6d47-49a3-b354-acb6f7fd983b
API URL: JSON