A General and Efficient Approach for Solving Nearest Neighbor Problem in the Vague Query System

Josef Küng; Khanh Tran Dang; Roland Wagner

A General and Efficient Approach for Solving Nearest Neighbor Problem in the Vague Query System

Josef Küng, Khanh Tran Dang, Roland Wagner

Institute for Application-oriented Knowledge Processing

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

Abstract

This article presents a general and efficient approach for finding the best match for complex vague queries in the Vague Query System (VQS) [16]. The VQS is an extension to conventional database systems and can operate on top of them in order to facilitate vague retrieval capabilities. The VQSs key is Numeric-Coordinate-Representation-Tables (NCR-Tables), which store semantic background information of attributes. Concretely, attributes of arbitrary types in a query relation/view are mapped to the Euclidean space and kept by NCR-Tables. Answering a complex vague query requires parallel searching on some NCR-Tables, which usually contain multidimensional data. In [17] Kueng et al proposed an incremental hyper-cube approach for solving complex vague queries, however, this approach has weaknesses lead to degenerate the search performance of the VQS. Theoretical analyses and experimental results in this article will prove that our new approach defeats all these defects and makes the VQS a full-fledged flexible query answering system.

Original language	English
Title of host publication	Advances in Web-age information management. Third international conference, WAIM 2002, Beijing, China, August 11 - 13, 2002 ; proceedings
Editors	Xiaofeng Meng
Publisher	Springer Verlag
Pages	367-378
Number of pages	12
Volume	2419
ISBN (Print)	3-540-44045-3
Publication status	Published - Aug 2002

Publication series

Name	Lecture Notes in Computer Science (LNCS)
ISSN (Print)	0302-9743

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

Cite this

Küng, J., Dang, K. T., & Wagner, R. (2002). A General and Efficient Approach for Solving Nearest Neighbor Problem in the Vague Query System. In Xiaofeng Meng (Ed.), Advances in Web-age information management. Third international conference, WAIM 2002, Beijing, China, August 11 - 13, 2002 ; proceedings (Vol. 2419, pp. 367-378). (Lecture Notes in Computer Science (LNCS)). Springer Verlag.

Küng, Josef ; Dang, Khanh Tran ; Wagner, Roland. / A General and Efficient Approach for Solving Nearest Neighbor Problem in the Vague Query System. Advances in Web-age information management. Third international conference, WAIM 2002, Beijing, China, August 11 - 13, 2002 ; proceedings. editor / Xiaofeng Meng. Vol. 2419 Springer Verlag, 2002. pp. 367-378 (Lecture Notes in Computer Science (LNCS)).

@inproceedings{efc26d60b29846cfaebaf376211894d4,

title = "A General and Efficient Approach for Solving Nearest Neighbor Problem in the Vague Query System",

abstract = "This article presents a general and efficient approach for finding the best match for complex vague queries in the Vague Query System (VQS) [16]. The VQS is an extension to conventional database systems and can operate on top of them in order to facilitate vague retrieval capabilities. The VQSs key is Numeric-Coordinate-Representation-Tables (NCR-Tables), which store semantic background information of attributes. Concretely, attributes of arbitrary types in a query relation/view are mapped to the Euclidean space and kept by NCR-Tables. Answering a complex vague query requires parallel searching on some NCR-Tables, which usually contain multidimensional data. In [17] Kueng et al proposed an incremental hyper-cube approach for solving complex vague queries, however, this approach has weaknesses lead to degenerate the search performance of the VQS. Theoretical analyses and experimental results in this article will prove that our new approach defeats all these defects and makes the VQS a full-fledged flexible query answering system.",

author = "Josef K{\"u}ng and Dang, {Khanh Tran} and Roland Wagner",

year = "2002",

month = aug,

language = "English",

isbn = "3-540-44045-3",

volume = "2419",

series = "Lecture Notes in Computer Science (LNCS)",

publisher = "Springer Verlag",

pages = "367--378",

editor = "{Xiaofeng Meng}",

booktitle = "Advances in Web-age information management. Third international conference, WAIM 2002, Beijing, China, August 11 - 13, 2002 ; proceedings",

}

Küng, J, Dang, KT & Wagner, R 2002, A General and Efficient Approach for Solving Nearest Neighbor Problem in the Vague Query System. in Xiaofeng Meng (ed.), Advances in Web-age information management. Third international conference, WAIM 2002, Beijing, China, August 11 - 13, 2002 ; proceedings. vol. 2419, Lecture Notes in Computer Science (LNCS), Springer Verlag, pp. 367-378.

A General and Efficient Approach for Solving Nearest Neighbor Problem in the Vague Query System. / Küng, Josef; Dang, Khanh Tran; Wagner, Roland.
Advances in Web-age information management. Third international conference, WAIM 2002, Beijing, China, August 11 - 13, 2002 ; proceedings. ed. / Xiaofeng Meng. Vol. 2419 Springer Verlag, 2002. p. 367-378 (Lecture Notes in Computer Science (LNCS)).

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

TY - GEN

T1 - A General and Efficient Approach for Solving Nearest Neighbor Problem in the Vague Query System

AU - Küng, Josef

AU - Dang, Khanh Tran

AU - Wagner, Roland

PY - 2002/8

Y1 - 2002/8

N2 - This article presents a general and efficient approach for finding the best match for complex vague queries in the Vague Query System (VQS) [16]. The VQS is an extension to conventional database systems and can operate on top of them in order to facilitate vague retrieval capabilities. The VQSs key is Numeric-Coordinate-Representation-Tables (NCR-Tables), which store semantic background information of attributes. Concretely, attributes of arbitrary types in a query relation/view are mapped to the Euclidean space and kept by NCR-Tables. Answering a complex vague query requires parallel searching on some NCR-Tables, which usually contain multidimensional data. In [17] Kueng et al proposed an incremental hyper-cube approach for solving complex vague queries, however, this approach has weaknesses lead to degenerate the search performance of the VQS. Theoretical analyses and experimental results in this article will prove that our new approach defeats all these defects and makes the VQS a full-fledged flexible query answering system.

AB - This article presents a general and efficient approach for finding the best match for complex vague queries in the Vague Query System (VQS) [16]. The VQS is an extension to conventional database systems and can operate on top of them in order to facilitate vague retrieval capabilities. The VQSs key is Numeric-Coordinate-Representation-Tables (NCR-Tables), which store semantic background information of attributes. Concretely, attributes of arbitrary types in a query relation/view are mapped to the Euclidean space and kept by NCR-Tables. Answering a complex vague query requires parallel searching on some NCR-Tables, which usually contain multidimensional data. In [17] Kueng et al proposed an incremental hyper-cube approach for solving complex vague queries, however, this approach has weaknesses lead to degenerate the search performance of the VQS. Theoretical analyses and experimental results in this article will prove that our new approach defeats all these defects and makes the VQS a full-fledged flexible query answering system.

M3 - Conference proceedings

SN - 3-540-44045-3

VL - 2419

T3 - Lecture Notes in Computer Science (LNCS)

SP - 367

EP - 378

BT - Advances in Web-age information management. Third international conference, WAIM 2002, Beijing, China, August 11 - 13, 2002 ; proceedings

A2 - Xiaofeng Meng, null

PB - Springer Verlag

ER -

Küng J, Dang KT, Wagner R. A General and Efficient Approach for Solving Nearest Neighbor Problem in the Vague Query System. In Xiaofeng Meng, editor, Advances in Web-age information management. Third international conference, WAIM 2002, Beijing, China, August 11 - 13, 2002 ; proceedings. Vol. 2419. Springer Verlag. 2002. p. 367-378. (Lecture Notes in Computer Science (LNCS)).