Evaluating top-k queries over web-accessible databases
ACM Transactions on Database Systems (TODS)
General purpose database summarization
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Processing relaxed skylines in PDMS using distributed data summaries
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Distributed top-N query processing with possibly uncooperative local systems
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Top-k query evaluation with probabilistic guarantees
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Summary management in P2P systems
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
BITPEER: continuous subspace skyline computation with distributed bitmap indexes
DaMaP '08 Proceedings of the 2008 international workshop on Data management in peer-to-peer systems
AGiDS: A Grid-Based Strategy for Distributed Skyline Query Processing
Globe '09 Proceedings of the 2nd International Conference on Data Management in Grid and Peer-to-Peer Systems
Top-k query processing in the APPA P2P system
VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
SQLf: a relational database language for fuzzy querying
IEEE Transactions on Fuzzy Systems
| Hi-index | 0.00 |
In this paper, we consider the situation where a fuzzy query is submitted to distributed data sources. In order to save bandwith and processing cost, we propose an approach whose aim is to forward the query to the most relevant sources only. An efficient fuzzy-cardinality-based technique for summarizing each data source is described. The approach we propose consists in estimating the relevance of a source with respect to a user query, based on its associated summary. Some experiments illustrate the efficiency of the approach.