Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Answering Imprecise Queries over Autonomous Web Databases
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
NGS: a framework for multi-domain query answering
ICDEW '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering Workshop
Navigating in complex mashed-up applications
Proceedings of the VLDB Endowment
A cross-service travel engine for trip planning
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Search computing: multi-domain search on ranked data
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A self-adaptive cross-domain query approach on the deep web
WAIM'11 Proceedings of the 12th international conference on Web-age information management
Hi-index | 0.00 |
One interesting problem in data integration is, when users submit a query in one domain, he may also want to know more information in other domains which haven't come up to his or her mind yet. It's a great idea to recommend correlated domains to users so that they could get more information. However, the existing researches in solving this problem are quite rare and limited. In this paper, we propose a method of selecting query paths, and the query paths consist of correlated domains. We propose an entity class model which is based to construct a domain correlation graph, and query paths are picked based on the graph. At last we evaluate our method by experiments and demonstrate the effectiveness of our method.