On ordered weighted averaging aggregation operators in multicriteria decisionmaking
IEEE Transactions on Systems, Man and Cybernetics
Using fuzzy sets in flexible querying: why and how?
Flexible query answering systems
Fuzzy queries and relational databases
SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Data summarization in relational databases through fuzzy dependencies
Information Sciences: an International Journal
Computing with words in intelligent database querying: standalone and internet-based application
Information Sciences—Informatics and Computer Science: An International Journal - Special issue computing with words
SAINTETIQ: a fuzzy set-based approach to database summarization
Fuzzy Sets and Systems - Data bases and approximate reasoning
A Server for Fuzzy SQL Queries
FQAS '98 Proceedings of the Third International Conference on Flexible Query Answering Systems
An Approach to Flexible Information Access Systems Using Soft Computing
HICSS '99 Proceedings of the Thirty-second Annual Hawaii International Conference on System Sciences-Volume 6 - Volume 6
Database summarization using fuzzy ISA hierarchies
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Database querying with personalized vocabulary using data summaries
Fuzzy Sets and Systems
Data mining by attribute generalization with fuzzy hierarchies in fuzzy databases
Fuzzy Sets and Systems
Data aggregation in VANETs: the VESPA approach
Proceedings of the 5th Annual International Conference on Mobile and Ubiquitous Systems: Computing, Networking, and Services
| Hi-index | 0.00 |
For some years, data summarization techniques have been developed to handle the growth of databases. However these techniques are usually not provided with tools for end-users to efficiently use the produced summaries. This paper presents a first attempt to develop a querying tool for the SAINTETIQ summarization model. The proposed search algorithm takes advantage of the hierarchical structure of the SAINTETIQ summaries to efficiently answer questions such as "how are, on some attributes, the tuples which have specific characteristics?" Moreover, this algorithm can be seen both as a boolean querying mechanism over a hierarchy of summaries, and as a flexible querying mechanism over the underlying relational tuples.