Show simple item record

dc.contributor.authorGeorgiou, Michael A.en
dc.coverage.spatialΚύπροςel_GR
dc.coverage.spatialCyprusen
dc.date2010
dc.date.accessioned2013-09-10T05:59:35Z
dc.date.available2013-09-10T05:59:35Z
dc.date.issued2010-12
dc.date.submitted2010-12
dc.identifier.urihttps://gnosis.library.ucy.ac.cy/handle/7/13099en
dc.descriptionThesis (Master) -- University of Cyprus, Faculty of Pure and Applied Sciences, Department of Computer Science, 2010.el_GR
dc.description.abstractMashQL is a query-by-diagram mashup language, which collects web data that are expressed in a Resource Description Framework (RDF) and stores them into a backend database, allowing people to query it very easily. MashQL assumes that web data sources are represented in RDF and it can be inquired using a SPARQL query language. Resource Description Framework (RDF) is a language for representing information (metadata) about resources in the World Wide Web[10]. In this paper we present the design and implementation of two important modules of the MashQL, the RDF Loader, which downloads and loads RDF data from the web into an Oracle’s RDF model database and the Query Optimizer, which is designed for the purpose of executing all MashQL’s queries successfully, efficiently and in a timely fashion. With the RDF Loader, we achieved to design and implement a concrete system that includes a combination of the market’s lasted technologies that exist in the Extract-Transform-Load (ETL) process for RDF data, such as Oracle, Java and Jena. On the basis of these technologies, we created a powerful, stable and intelligent RDF loader that loads any RDF data in any format and of any size in a very short time. The Query Optimizer, implements our optimization solution in order to provide MashQL's queries with the highest speed performance execution. Our optimization solution includes the creation of data summaries on top of the RDF data have are already been loaded onto the database and the BR-Algorithm that catches queries’ results regarding the most important MashQL's queries. Using the database summaries we have the advantage of, instead of scanning and sorting all the data during the query’s execution course, the data have already been sorted and pre-computed. This focuses on MashQL's queries requirements matter. By using the BR-algorithm the most important MashQL's queries acquired high response time, since their results are had already been caught in the database. For the highest algorithm's performance execution course, we achieved to reduce 3 times in average the original graph’s size by dividing it in three parts using our graph's partitioning novel idea. This partition concept helps the BRalgorithm to run faster ,producing less and more carefully caught data. Finally, our optimization solution against MashQL’s queries has been compared with Oracle’s corresponding technology and it presents very good results. More concretely, our solution is performing 10 times faster in MashQL queries and 45 times faster concerning the MashQL's most important queries.el_GR
dc.format.extent122 p. : ill. ; 30 cm.en
dc.language.isoengen
dc.publisherΠανεπιστήμιο Κύπρου, Σχολή Θετικών και Εφαρμοσμένων Επιστημών / University of Cyprus, Faculty of Pure and Applied Sciences
dc.rightsinfo:eu-repo/semantics/openAccessen
dc.source.urihttps://ktree.cs.ucy.ac.cy/action.php?kt_path_info=ktcore.actions.document.view&fDocumentId=12928en
dc.titleChallenges in building an efficient relational architecture for MASHQLen
dc.typeinfo:eu-repo/semantics/masterThesisen
dc.contributor.departmentΠανεπιστήμιο Κύπρου, Σχολή Θετικών και Εφαρμοσμένων Επιστημών, Τμήμα Πληροφορικήςel_GR
dc.contributor.departmentUniversity of Cyprus, Faculty of Pure and Applied Sciences, Department of Computer Scienceen
dc.author.facultyΣχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences
dc.author.departmentΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeMaster Thesisen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record