Skip to main content
Springer Nature Link
Log in

An Incremental Hypercube Approach for Finding Best Matches for Vague Queries

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1677))

Included in the following conference series:

Abstract

In this article we present an extension of the Vague Query System (VQS) which allows the user to efficiently find the best matching record for adhoc queries. The VQS operates on top of existing database systems. It maps arbitrary types of attributes to the Euclidean space in order to represent semantic background information. Due to the multi tier concept of the VQS we can not apply conventional multidimensional search methods directly and so we have chosen to use an iterative approach. The concept works on the basis of an incremental extension of the search intervals around the query values which is repeated until the best match is proven to be found. As an indexing method for effectively accessing the semantic background information a slightly modified version of the pyramid technique (Berchtold et. al.) is applied.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. J. Küng, J. Palkoska: “VQS-A Vague Query System Prototype”, Proceedings of the Eight International Workshop on Database and Expert Systems Applications, DEXA 97, Toulouse, France, Sep. 1-2, 1997, IEEE Computer Society Press

    Google Scholar 

  2. P. Bosc, M. Galibourg, G. Hamon, “Fuzzy Querying with SQL: Extension and Implementation Aspects”, Fuzzy Sets and Systems, Vol. 28, No.3, 1988, pp. 333–349

    Article  MATH  MathSciNet  Google Scholar 

  3. M.H. Wong, K.S. Leung, “A Fuzzy Database-Query Language”, Information Systems, Vol. 15, No. 5, 1990, pp. 583–590

    Article  Google Scholar 

  4. D. Gazotti, L. Piancastelli, C. Sartori, D. Beneventano, “Fuzzy Base: A Fuzzy Logic Aid for Relational Database Queries”, Database and Expert Systems Applications, 6th International Conference DEXA 1995, Ed. Norman Revell, A Min Tjoa, Springer-Verlag Berlin Heidelberg New York Barcelona Budapest Hong Kong London Milan Paris Tokyo, London 1995, pp. 385–394

    Google Scholar 

  5. T. Ichikawa, M. Hirakawa, “ARES: A Relational Database with the Capability of Performing Flexible Interpretation of Queries”, IEEE Transactions on Software Engineering, Vol. 12, No. 5, 1986, pp. 624–634.

    Google Scholar 

  6. A. Motro, “VAGUE: A User Interface to Relational Databases that Permits Vague Queries”, ACM Transactions on Office Information Systems, Vol. 6, No. 3, 1988, pp. 187–214

    Article  Google Scholar 

  7. V. Gaede, O. Günther, “Multidimensional Access Methods”, ACM Computing Surveys, Vol. 30, Number 2, June 1998

    Google Scholar 

  8. J. L. Bentley, “Multidimensional Binary Search Trees Used for Associative Searching”, Communications of the ACM, Vol. 18, Number 9, 1975

    Google Scholar 

  9. J. H. Friedman, J. L. Bentley, R. A. Finkel, “An Algorithm for Finding Best Matches in Logarithmic Expected Time”, ACM Transactions on Mathematical Software, Vol. 3, Number 3, 1977

    Google Scholar 

  10. K. V. R. Kanth, D. Agrawal, A. Singh, “Dimensionality Reduction for Similarity Searching in Dynamic Databases”, Proceedings of ACM SIGMOD International Conference on Management of Data, Seattle, Washington, USA, June 2-4, 1998

    Google Scholar 

  11. S. Berchtold, C. Böhm, H. P. Kriegel, “The Pyramid Technique: Towards Breaking the Curse of Dimensionality”, Proceedings of ACM SIGMOD International Conference on Management of Data, Seattle, Washington, USA, June 2-4, 1998

    Google Scholar 

  12. R. Bayer, V. Markl, “The Universal B-Tree for multidimensional Indexing”, Technical Report TUM-I9637, Institut für Informatik, Technische Universität München, Nov. 1996

    Google Scholar 

  13. J. Küng, J. Palkoska: “Vague Joins-An Extension of the Vague Query System VQS”, Proceedings of the Ninth International Workshop on Database and Expert Systems Applications, DEXA 98, Vienna, Austria, Aug. 26-28, 1998, IEEE Computer Society Press

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institue for Applied Knowledge Processing(FAW), University Of Linz, Austria

    Josef Küng & Jürgen Palkoska

Authors
  1. Josef Küng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jürgen Palkoska
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Liverpool, P.O. Box 147, Liverpool, L49 3BX, UK

    Trevor J.M. Bench-Capon

  2. Department of Systems and Computers, University of Florence, Via S. Marta, 3, I-50139, Florence, Italy

    Giovanni Soda

  3. IFS, Technical University of Vienna, Resselgasse 3, A-1040, Vienna, Austria

    A Min Tjoa

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Küng, J., Palkoska, J. (1999). An Incremental Hypercube Approach for Finding Best Matches for Vague Queries. In: Bench-Capon, T.J., Soda, G., Tjoa, A.M. (eds) Database and Expert Systems Applications. DEXA 1999. Lecture Notes in Computer Science, vol 1677. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48309-8_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-48309-8_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66448-2

  • Online ISBN: 978-3-540-48309-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics