Minimal probing: supporting expensive predicates for top-k queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Evaluating Top-k Queries over Web-Accessible Databases
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Supporting top-K join queries in relational databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
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
An entity class model based correlated query path selection method in multiple domains
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
Hi-index | 0.00 |
As integration systems of data sources in the same domain become more and more, another application comes up with the tide of them. Because of correlation of pairs of domains, when we do some queries involving multiple domains, such as "find a post named software development engineer on job web and look for apartments for rental around the company having been chosen", we note that general-purpose search engines and general integration frameworks fail to answer cross-domain queries. This paper presents SCDQ, an approach providing fully automated support for cross-domain queries. More specifically, for SCDQ, (i) find which domains are correlated based on data sources having been clustered according to domain. (ii) Recommend different cross-domain paths to meet user's all possible intentions when query arrives.