Skip to main content
SpringerLink
Log in

Applications of Ordinal Ranks to Flexible Query Answering

  • Conference paper
Scalable Uncertainty Management (SUM 2012)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7520))

Included in the following conference series:

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.

Supported by grant no. P103/11/1456 of the Czech Science Foundation and internal grant of Palacky University no. PrF_2012_029. DAMOL is supported by project reg. no. CZ.1.07/2.3.00/20.0059 of the European Social Fund in the Czech Republic.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bělohlávek, R.: Fuzzy Relational Systems: Foundations and Principles. Kluwer Academic Publishers, Norwell (2002)

    Book  MATH  Google Scholar 

  2. Bělohlávek, R., Vychodil, V.: Data Tables with Similarity Relations: Functional Dependencies, Complete Rules and Non-redundant Bases. In: Li Lee, M., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol. 3882, pp. 644–658. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Bělohlávek, R., Vychodil, V.: Query systems in similarity-based databases: logical foundations, expressive power, and completeness. In: ACM Symposium on Applied Computing (SAC), pp. 1648–1655. ACM (2010)

    Google Scholar 

  4. Bosc, P., HadjAli, A., Pivert, O.: Incremental controlled relaxation of failing flexible queries. Journal of Intelligent Information Systems (JIIS) 33(3), 261–283 (2009)

    Article  Google Scholar 

  5. Bosc, P., Pivert, O.: Fuzzy queries and relational databases. In: 9th ACM Symposium on Applied Computing (SAC), pp. 170–174 (1994)

    Google Scholar 

  6. Chomicki, J.: Preference formulas in relational queries. ACM Transactions on Database Systems 28(4), 427–466 (2003)

    Article  Google Scholar 

  7. Chomicki, J.: Logical foundations of preference queries. IEEE Data Engineering Bulletin 34(2), 3–10 (2011)

    Google Scholar 

  8. Cignoli, R., Esteva, F., Godo, L., Torrens, A.: Basic fuzzy logic is the logic of continuous t-norms and their residua. Soft Computing - A Fusion of Foundations, Methodologies and Applications 4, 106–112 (2000)

    Google Scholar 

  9. Cintula, P., Hájek, P.: Triangular norm based predicate fuzzy logics. Fuzzy Sets and Systems 161, 311–346 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  10. Codd, E.F.: A relational model of data for large shared data banks. Communications of the ACM 26, 64–69 (1983)

    Article  Google Scholar 

  11. Esteva, F., Godo, L.: Monoidal t-norm based logic: towards a logic for left-continuous t-norms. Fuzzy Sets and Systems 124(3), 271–288 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  12. Galindo, J. (ed.): Handbook of Research on Fuzzy Information Processing in Databases. IGI Global (2008)

    Google Scholar 

  13. Goguen, J.A.: The logic of inexact concepts. Synthese 19, 325–373 (1979)

    Article  Google Scholar 

  14. HadjAli, A., Pivert, O.: Towards Fuzzy Query Answering Using Fuzzy Views – A Graded-Subsumption-Based Approach. In: An, A., Matwin, S., Raś, Z.W., Ślęzak, D. (eds.) ISMIS 2008. LNCS (LNAI), vol. 4994, pp. 268–277. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  15. HadjAli, A., Pivert, O.: A Fuzzy-Rule-Based Approach to the Handling of Inferred Fuzzy Predicates in Database Queries. In: Christiansen, H., De Tré, G., Yazici, A., Zadrozny, S., Andreasen, T., Larsen, H.L. (eds.) FQAS 2011. LNCS, vol. 7022, pp. 448–459. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  16. Hájek, P.: Metamathematics of Fuzzy Logic. Kluwer Academic Publishers, Dordrecht (1998)

    Book  MATH  Google Scholar 

  17. Inoue, K., Wiese, L.: Generalizing Conjunctive Queries for Informative Answers. In: Christiansen, H., De Tré, G., Yazici, A., Zadrozny, S., Andreasen, T., Larsen, H.L. (eds.) FQAS 2011. LNCS, vol. 7022, pp. 1–12. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  18. Li, C., Chang, K.C.C., Ilyas, I.F., Song, S.: RankSQL: query algebra and optimization for relational top-k queries. In: Proc. 2005 ACM SIGMOD, pp. 131–142 (2005)

    Google Scholar 

  19. Maier, D.: The Theory of Relational Databases. Computer Science Press (1983)

    Google Scholar 

  20. Mindolin, D., Chomicki, J.: Contracting preference relations for database applications. Artificial Intelligence 175(7-8), 1092–1121 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  21. Pivert, O., Bosc, P.: Fuzzy Preference Queries to Relational Databases. Imperial College Press (2012)

    Google Scholar 

  22. Pivert, O., Smits, G., HadjAli, A., Jaudoin, H.: Efficient Detection of Minimal Failing Subqueries in a Fuzzy Querying Context. In: Eder, J., Bielikova, M., Tjoa, A.M. (eds.) ADBIS 2011. LNCS, vol. 6909, pp. 243–256. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  23. Vaneková, V., Vojtáš, P.: Fuzziness as a model of user preference in semantic web search. In: European Society of Fuzzy Logic and Technology Conference (EUSFLAT), pp. 998–1003 (2009)

    Google Scholar 

  24. Zhang, X., Chomicki, J.: Preference queries over sets. In: 27th International Conference on Data Engineering (ICDE), pp. 1019–1030. IEEE Computer Society (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DAMOL (Data Analysis and Modeling Laboratory) Dept. Computer Science, Palacky University, Olomouc 17. listopadu 12, CZ77146, Olomouc, Czech Republic

    Lucie Urbanova & Vilem Vychodil

  2. Institute of Computer Science, University of Hildesheim, Samelsonplatz 1, 31141, Hildesheim, Germany

    Lena Wiese

Authors
  1. Lucie Urbanova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vilem Vychodil
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lena Wiese
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, Marburg University, Hans-Meerwein-Strasse 6, 35032, Marburg, Germany

    Eyke Hüllermeier , Thomas Fober  & Bernhard Seeger ,  & 

  2. Department of Computer Science, Auckland University, 38 Princes St., 1010, Auckland, New Zealand

    Sebastian Link

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Urbanova, L., Vychodil, V., Wiese, L. (2012). Applications of Ordinal Ranks to Flexible Query Answering. In: Hüllermeier, E., Link, S., Fober, T., Seeger, B. (eds) Scalable Uncertainty Management. SUM 2012. Lecture Notes in Computer Science(), vol 7520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33362-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33362-0_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33361-3

  • Online ISBN: 978-3-642-33362-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation