How hard is this query? Measuring the Semantic Complexity of Schema-agnostic Queries (bibtex)
by Andre Freitas, Juliano Efson Sales, Siegfried Handschuh, Edward Curry
Abstract:
The growing size, heterogeneity and complexity of databases demand the creation of strategies to facilitate users and systems to consume data. Ideally, query mechanisms should be schema-agnostic, i.e. they should be able to match user queries in their own vocabulary and syntax to the data, ab- stracting data consumers from the representation of the data. This work provides an information- theoretical framework to evaluate the semantic complexity involved in the query-database commu- nication, under a schema-agnostic query scenario. Different entropy measures are introduced to quantify the semantic phenomena involved in the user-database communication, including structural complexity, ambiguity, synonymy and vagueness. The entropy measures are validated using natural language queries over Semantic Web databases. The analysis of the semantic complexity is used to improve the understanding of the core semantic dimensions present at the query-data matching process, allowing the improvement of the design of schema-agnostic query mechanisms and defining measures which can be used to assess the semantic uncertainty or difficulty behind a schema-agnostic querying task.
Reference:
Andre Freitas, Juliano Efson Sales, Siegfried Handschuh, Edward Curry, "How hard is this query? Measuring the Semantic Complexity of Schema-agnostic Queries", In 11th International Conference on Computational Semantics (IWCS 2015), London, UK, 2015.
Bibtex Entry:
@inproceedings{Freitas2015,
abstract = {The growing size, heterogeneity and complexity of databases demand the creation of strategies to facilitate users and systems to consume data. Ideally, query mechanisms should be schema-agnostic, i.e. they should be able to match user queries in their own vocabulary and syntax to the data, ab- stracting data consumers from the representation of the data. This work provides an information- theoretical framework to evaluate the semantic complexity involved in the query-database commu- nication, under a schema-agnostic query scenario. Different entropy measures are introduced to quantify the semantic phenomena involved in the user-database communication, including structural complexity, ambiguity, synonymy and vagueness. The entropy measures are validated using natural language queries over Semantic Web databases. The analysis of the semantic complexity is used to improve the understanding of the core semantic dimensions present at the query-data matching process, allowing the improvement of the design of schema-agnostic query mechanisms and defining measures which can be used to assess the semantic uncertainty or difficulty behind a schema-agnostic querying task.},
address = {London, UK},
author = {Freitas, Andre and Sales, Juliano Efson and Handschuh, Siegfried and Curry, Edward},
booktitle = {11th International Conference on Computational Semantics (IWCS 2015)},
file = {:Users/ed/Library/Application Support/Mendeley Desktop/Downloaded/Freitas et al. - 2015 - How hard is this query Measuring the Semantic Complexity of Schema-agnostic Queries.pdf:pdf},
keywords = {Database Queries,Databases,Entropy,Schema-agnostic Queries,Semantic Complexity},
mendeley-tags = {Database Queries,Databases,Entropy,Schema-agnostic Queries,Semantic Complexity},
title = {{How hard is this query? Measuring the Semantic Complexity of Schema-agnostic Queries}},
url = {http://www.edwardcurry.org/publications/preprint_iwcs_2015.pdf},
year = {2015}
}
Powered by bibtexbrowser