Keyword Query Routing
Downloads
Keyword search is an intuitive paradigm for searching linked data sources on the web. We propose to route keywords only to relevant sources to reduce the high cost of processing keyword search queries over all sources. We propose a novel method for computing top-k routing plans based on their potentials to contain results for a given keyword query. We employ a keyword-element relationship summary that compactly represents relationships between keywords and the data elements mentioning them. A multilevel scoring mechanism is proposed for computing the relevance of routing plans based on scores at the level of keywords, data elements, element sets, and subgraphs that connect these elements. Experiments carried out using 150 publicly available sources on the web showed that valid plans (precision@1 of 0.92) that are highly relevant (mean reciprocal rank of 0.89) can be computed in 1 second on average on a single PC. Further, we show routing greatly helps to improve the performance of keyword search, without compromising its result quality
V. Hristidis, L. Gravano, and Y. Papakonstantinou, “Efficient IR-Style Keyword Search over Relational Databases, ”Proc. 29th Int’l Conf. Very Large Data Bases (VLDB), pp. 850-861, 2003.
F. Liu, C.T. Yu, W. Meng, and A. Chowdhury, “Effective Keyword Search in Relational Databases,” Proc. ACM SIGMOD Conf., pp. 563-574, 2006.
Y. Luo, X. Lin, W. Wang, and X. Zhou, “Spark:Top-K Keyword Query in Relational Databases,” Proc. ACM SIGMOD Conf., pp. 115-126, 2007.
Pawar Prajakta Bhagwat et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 6 (1), 2015, 434-437
Oya Y. Rieger, " Search engine use behavior of students and faculty: User perceptions and implications for future research"
B. Yu, G. Li, K.R. Sollins, and A.K.H. Tung, “Effective Keyword-Based Selection of Relational Databases,” Proc. ACM SIGMOD Conf., pp. 139-150, 2007.
Q.H. Vu, B.C. Ooi, D. Papadias, and A.K.H. Tung, “A Graph Method for Keyword-Based Selection of the Top-K Databases,” Proc. ACM SIGMOD Conf., pp. 915-926, 2008.
http://firstmonday.org/article/view/2716/2385
Thanh Tran And Lei Zhang, “Keyword Query Routing Ieee Transactions On Knowledge And Data Engineering, Vol. 26, No. 2, February 2014. 46
K.Collins-Thompson, Reducing the risk of query expansion via robust constrained optimization. In CIKM. ACM, 2009.
