Applications of ordinal ranks to flexible query answering

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Exact querying and retrieving relevant data from a database is a difficult task. We present an approach for flexibly answering algebraic queries using an extension of Codd's relational model with ordinal ranks based on residuated lattices and similarities on attribute domains. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Urbanova, L., Vychodil, V., & Wiese, L. (2012). Applications of ordinal ranks to flexible query answering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7520 LNAI, pp. 16–29). https://doi.org/10.1007/978-3-642-33362-0_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free