Skip to main content

Similarity Queries in Data Bases Using Metric Distances – from Modeling Semantics to Its Maintenance

  • Conference paper
Computer Aided Systems Theory – EUROCAST 2005 (EUROCAST 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3643))

Included in the following conference series:

  • 1227 Accesses

Abstract

Similarity queries in traditional databases work directly on attribute values. But, often similar attribute values do not indicate similar meanings. Semantic background information is needed to enhance similarity query performance. In this paper a method will be addressed which follows the idea to map attribute values to multidimensional points and then interpret the distances between that points as similarity. The second part brings the questions “How to arrange these points that they correspond to real world?” and “Can that be done automatically?” into focus and comes to the following result: For the case that all similarities are known in advance a good solution is given otherwise it turns to a complex optimization problem.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Küng, J., Palkoska, J.: VQS-A Vague Query System Prototype. In: DEXA 1997. IEEE Computer Society Press, Los Alamitos (1997)

    Google Scholar 

  2. Küng, J., Palkoska, J.: Vague Joins-An Extension of the Vaque Query System VQS. In: DEXA 1998. IEEE Computer Society Press, Los Alamitos (1998)

    Google Scholar 

  3. Haykin, S.: Neural Networks. A Comprehensive Foundation, 2nd edn. Prentice Hall, Englewood Cliffs (1999)

    MATH  Google Scholar 

  4. Blumenthal, L.M.: Theory and Application of Distance Geometry, Chelsea, Bronx, New York (1970)

    Google Scholar 

  5. Yoon, J., Gad, Y., Wu, Z.: Mathematical Modeling of Protein Structure Using Distance Geometry. Technical Report TR00-24 for the Computational and Applied Mathematics Department of Rice University (2000)

    Google Scholar 

  6. Borcea, C., Streinu, I.: On the Number of Embeddings in Minimally Rigid Graphs. In: SoCG 2002, Barcelona, Spain (2002)

    Google Scholar 

  7. Saxe, J.B.: Embeddability ofWeighted Graph in k-space is Strongly NP-hard. In: Proc. 17th Allerton Conf. in Communications, Control and Computing, pp. 480–489 (1979)

    Google Scholar 

  8. Csáji, B.C., Küng, J., Palkoska, J., Wagner, R.: On the Automation of Similarity Information Maintenance in Flexible Query Answering Systems. In: Galindo, F., Takizawa, M., Traunmüller, R. (eds.) DEXA 2004. LNCS, vol. 3180, pp. 130–140. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Küng, J., Wagner, R. (2005). Similarity Queries in Data Bases Using Metric Distances – from Modeling Semantics to Its Maintenance. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2005. EUROCAST 2005. Lecture Notes in Computer Science, vol 3643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11556985_27

Download citation

  • DOI: https://doi.org/10.1007/11556985_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29002-5

  • Online ISBN: 978-3-540-31829-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics