ARES: a relational database with the capability of performing flexible interpretation of queries
IEEE Transactions on Software Engineering
VAGUE: a user interface to relational databases that permits vague queries
ACM Transactions on Information Systems (TOIS)
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Efficient processing of vague queries using a data stream approach
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Optimizing queries over multimedia repositories
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Combining fuzzy information from multiple systems (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A cost model for nearest neighbor search in high-dimensional data space
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Supporting similarity queries in MARS
MULTIMEDIA '97 Proceedings of the fifth ACM international conference on Multimedia
Modern Information Retrieval
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Evaluating Top-k Selection Queries
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Optimizing Multi-Feature Queries for Image Databases
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Fast Evaluation Techniques for Complex Similarity Queries
Proceedings of the 27th International Conference on Very Large Data Bases
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
The SH-tree: A Super Hybrid Index Structure for Multidimensional Data
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
VQS - A Vague Query System Prototype
DEXA '97 Proceedings of the 8th International Workshop on Database and Expert Systems Applications
Using Fagin's Algorithm for Merging Ranked Results in Multimedia Middleware
COOPIS '99 Proceedings of the Fourth IECIS International Conference on Cooperative Information Systems
Query Processing Issues in Image(Multimedia) Databases
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
| Hi-index | 0.00 |
This paper presents an enhanced extension of the Vague Query System (VQS) [14, 15] to solve complex vague queries more efficiently and generally. The VQS is an extension to conventional database systems and can work on top of them to return records semantically close to user's query. It represents semantic information of arbitrary attributes by mapping them to the Euclidean space and this information is invisible to the users. Answering a complex vague query requires searching on multiple feature spaces of attributes and these spaces are usually multidimensional. The proposed approach in [15] is not general and has weaknesses lead to degenerate performance of the system. The new approach introduced in this paper overcomes all those defects and significantly improves the search performance in both concepts of CPU-and IO-cost. Our experiments on uniformly distributed data sets, which are managed by the SH-trees [6], have proven the advantages of this new approach.