Josef Küng, Khanh Tran Dang, Roland Wagner,
"Efficient Vague Joins Processing in the VQS"
: Proceedings of the 7th World Multiconference on Systemics, Cybernetics and Informatics - SCI 2003, 7-2003, DANG Tran Khanh, Josef Küng, Roland Wagner: Efficient Vague Joins Processing in the VQS, Proceedings of the 7th World Multiconference on Systemics, Cybernetics and Informatics - SCI 2003, Orlando, USA, July 27-30, 2003
Original Titel:
Efficient Vague Joins Processing in the VQS
Sprache des Titels:
Englisch
Original Buchtitel:
Proceedings of the 7th World Multiconference on Systemics, Cybernetics and Informatics - SCI 2003
Original Kurzfassung:
Join operation is one of the most expensive ones in database management systems (DBMSs). In the context of the VQS (Vague Query System), which is a flexible query answering system built on top of DBMSs to provide them with similarity search/retrieval capabilities, vague joins are prohibitively expensive in terms of both IO-cost and CPU-cost because they must undergo intermediate processing steps with the sheer volume of multidimensional data in multiple feature spaces. This article presents problems arisen when processing complex vague joins in the VQS and introduces a new approach to efficiently solve these problems. This new approach not only reduces the costs significantly, but also returns to users the best matches or approximate nearest neighbors with a certain tolerant error e with respect to given vague join predicates. It is based on a novel, flexible, and efficient algorithm introduced recently for solving (approximate) complex vague queries in the VQS. Experimental results will show performance of the proposed approach
Sprache der Kurzfassung:
Englisch
Erscheinungsmonat:
7
Erscheinungsjahr:
2003
Notiz zum Zitat:
DANG Tran Khanh, Josef Küng, Roland Wagner: Efficient Vague Joins Processing in the VQS, Proceedings of the 7th World Multiconference on Systemics, Cybernetics and Informatics - SCI 2003, Orlando, USA, July 27-30, 2003
Forschungs-