Abstract
Per-set keyword’s 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 Pre-set 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 Pre-set query. We employ a keyword-element relationship summary that compactly represents relationships between pre-set 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 sub graphs that connect these elements. Experiments carried out using 150 publicly available sources on the web. That valid plan (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 Preset Keyword search, without compromising its result quality
Keywords
Pre-set keyword
Data element
Top-k algorithm
Searching linked data source
C4.5query
Rank aggregation.
Authors
How to Cite this Article
Aiswarya.S, Santhiya.T, Harini.R, Vinitha.S (2016).
"C4.5 QUERY BASED SEARCH OVER DATABASE".
International Journal of Contemporary Research in Computer Science and Technology,
2(3), pp. 567-569.
