An Incremental Hypercube Approach for Finding Best Matches for Vague Queries

Josef Küng; Jürgen Palkoska

doi:10.1007/3-540-48309-8_22

An Incremental Hypercube Approach for Finding Best Matches for Vague Queries

Josef Küng
, Jürgen Palkoska

Institute for Application-oriented Knowledge Processing

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

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 ad-hoc 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.

Original language	English
Title of host publication	Database and Expert Systems Applications. 10th International Conference, DEXA'99, Florence, Italy, August 30 - September 3, 1999, Proceedings
Editors	Trevor J. M. Bench-Capon, Giovanni Soda, A. Min Tjoa
Publisher	Springer Verlag
Pages	238-249
Number of pages	12
ISBN (Print)	3540664483, 9783540664482
DOIs	https://doi.org/10.1007/3-540-48309-8_22
Publication status	Published - Aug 1999

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1677
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Fields of science

102001 Artificial intelligence
102006 Computer supported cooperative work (CSCW)
102010 Database systems
102014 Information design
102015 Information systems
102016 IT security
102028 Knowledge engineering
102019 Machine learning
102022 Software development
102025 Distributed systems
502007 E-commerce
505002 Data protection
506002 E-government
509018 Knowledge management
202007 Computer integrated manufacturing (CIM)
102033 Data mining
102035 Data science

Access to Document

10.1007/3-540-48309-8_22

Cite this

Küng, J., & Palkoska, J. (1999). An Incremental Hypercube Approach for Finding Best Matches for Vague Queries. In T. J. M. Bench-Capon, G. Soda, & A. M. Tjoa (Eds.), Database and Expert Systems Applications. 10th International Conference, DEXA'99, Florence, Italy, August 30 - September 3, 1999, Proceedings (pp. 238-249). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1677). Springer Verlag. https://doi.org/10.1007/3-540-48309-8_22

Küng, Josef ; Palkoska, Jürgen. / An Incremental Hypercube Approach for Finding Best Matches for Vague Queries. Database and Expert Systems Applications. 10th International Conference, DEXA'99, Florence, Italy, August 30 - September 3, 1999, Proceedings. editor / Trevor J. M. Bench-Capon ; Giovanni Soda ; A. Min Tjoa. Springer Verlag, 1999. pp. 238-249 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{fc76fd5a0e0644ad933f77c43c14ba8b,

title = "An Incremental Hypercube Approach for Finding Best Matches for Vague Queries",

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 ad-hoc 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.",

author = "Josef K{\"u}ng and J{\"u}rgen Palkoska",

year = "1999",

month = aug,

doi = "10.1007/3-540-48309-8\_22",

language = "English",

isbn = "3540664483",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "238--249",

editor = "Bench-Capon, \{Trevor J. M.\} and Giovanni Soda and Tjoa, \{A. Min\}",

booktitle = "Database and Expert Systems Applications. 10th International Conference, DEXA'99, Florence, Italy, August 30 - September 3, 1999, Proceedings",

}

Küng, J & Palkoska, J 1999, An Incremental Hypercube Approach for Finding Best Matches for Vague Queries. in TJM Bench-Capon, G Soda & AM Tjoa (eds), Database and Expert Systems Applications. 10th International Conference, DEXA'99, Florence, Italy, August 30 - September 3, 1999, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1677, Springer Verlag, pp. 238-249. https://doi.org/10.1007/3-540-48309-8_22

An Incremental Hypercube Approach for Finding Best Matches for Vague Queries. / Küng, Josef; Palkoska, Jürgen.
Database and Expert Systems Applications. 10th International Conference, DEXA'99, Florence, Italy, August 30 - September 3, 1999, Proceedings. ed. / Trevor J. M. Bench-Capon; Giovanni Soda; A. Min Tjoa. Springer Verlag, 1999. p. 238-249 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1677).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

TY - GEN

T1 - An Incremental Hypercube Approach for Finding Best Matches for Vague Queries

AU - Küng, Josef

AU - Palkoska, Jürgen

PY - 1999/8

Y1 - 1999/8

N2 - 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 ad-hoc 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.

AB - 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 ad-hoc 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.

UR - https://www.scopus.com/pages/publications/84892068952

U2 - 10.1007/3-540-48309-8_22

DO - 10.1007/3-540-48309-8_22

M3 - Conference proceedings

SN - 3540664483

SN - 9783540664482

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 238

EP - 249

BT - Database and Expert Systems Applications. 10th International Conference, DEXA'99, Florence, Italy, August 30 - September 3, 1999, Proceedings

A2 - Bench-Capon, Trevor J. M.

A2 - Soda, Giovanni

A2 - Tjoa, A. Min

PB - Springer Verlag

ER -

Küng J, Palkoska J. An Incremental Hypercube Approach for Finding Best Matches for Vague Queries. In Bench-Capon TJM, Soda G, Tjoa AM, editors, Database and Expert Systems Applications. 10th International Conference, DEXA'99, Florence, Italy, August 30 - September 3, 1999, Proceedings. Springer Verlag. 1999. p. 238-249. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-48309-8_22

An Incremental Hypercube Approach for Finding Best Matches for Vague Queries

Abstract

Publication series

Fields of science

Access to Document

Other files and links

Cite this