A novel adaptive Cuckoo search for optimal query plan generation.
The emergence of multiple web pages day by day leads to the development of the semantic web technology. A World Wide Web Consortium (W3C) standard for storing semantic web data is the resource description framework (RDF). To enhance the efficiency in the execution time for querying large RDF graphs,...
| Publicado en: | Scientific World Journal pp. 727658 - 727659 |
|---|---|
| Autores principales: | , |
| Formato: | Journal Article |
| Publicado: |
Wiley-Blackwell
2014
|
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=ccm&AN=103845742&site=ehost-live header: @attributes: shortDbName: ccm uiTerm: 103845742 longDbName: CINAHL Complete uiTag: AN controlInfo: bkinfo: dissinfo: jinfo: jid: 1537744X 1BX5 jtl: Scientific World Journal issn: 1537744X maglogo: N pubinfo: dt: 2014 pid: 480 pub: Wiley-Blackwell place: Malden, Massachusetts artinfo: ui: 103845742 NLM25215330 2012727986 10.1155/2014/727658 NLM25215330 PMC4158119 103845742 ppf: 727658 ppct: 1 formats: tig: atl: A novel adaptive Cuckoo search for optimal query plan generation. aug: au: Gomathi, Ramalingam Sharmila, Dhandapani affil: Department of Computer Science and Engineering, Bannari Amman Institute of Technology, Sathyamangalam 638401, India. sug: subj: Models, Theoretical Algorithms ab: The emergence of multiple web pages day by day leads to the development of the semantic web technology. A World Wide Web Consortium (W3C) standard for storing semantic web data is the resource description framework (RDF). To enhance the efficiency in the execution time for querying large RDF graphs, the evolving metaheuristic algorithms become an alternate to the traditional query optimization methods. This paper focuses on the problem of query optimization of semantic web data. An efficient algorithm called adaptive Cuckoo search (ACS) for querying and generating optimal query plan for large RDF graphs is designed in this research. Experiments were conducted on different datasets with varying number of predicates. The experimental results have exposed that the proposed approach has provided significant results in terms of query execution time. The extent to which the algorithm is efficient is tested and the results are documented. pubtype: Academic Journal doctype: Journal Article ougenre: Article language: English refInfo: holdings: @attributes: islocal: N |
|---|