DC FieldValueLanguage
dc.contributor.advisorPichler, Reinhard-
dc.contributor.authorDarmaputra, Yansen-
dc.date.accessioned2020-06-30T10:09:12Z-
dc.date.issued2008-
dc.date.submitted2008-06-
dc.identifier.urihttps://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-27335-
dc.identifier.urihttp://hdl.handle.net/20.500.12708/11906-
dc.description.abstractA meta-search engine is a search engine that forwards user query to several other search engines and aggregates the results. In flight search domain, meta-search engine has some inherent weaknesses. They can not find all routes from low-cost airlines and they don't support the concept of mixing flights between airlines in different alliances. This thesis proposes a mashup solution for the problem. A mashup application uses data from other resources (called content provider) to create a new application with new feature and functionality that is not offered by any of the content provider. In the flight search system that we build, the data are originated from airline websites. Extracting data from the Web has several obstacles such as password-protected sites, cookies, JavaScript, Session IDs, Web forms iterations, deep Web navigation, and dynamic changes on websites.<br />We use wrapper generation technology from Lixto to solve the obstacles and do the data extraction. Some data cleaning method is also performed to the wrapper output to clean unnecessary annotations.<br />In the algorithm, flight search problem is regarded as graph search problem with airports as the nodes and pair of airports where exist direct flights between them as the edges. We introduce hub identification heuristic concept to ensure system's scalability. Instead of analyzing and evaluating all possible routes to reach the destination, this heuristic only evaluates a fraction of all possible combinations that possibly contain the best routes.<br />de
dc.formatVIII, 79 Bl.-
dc.languageEnglish-
dc.language.isoen-
dc.subjectflugsuchede
dc.subjectroutensuchede
dc.subjectskalierbarkeitde
dc.subjectwrapper generationde
dc.subjectwrappingde
dc.subjectweb datenextraktionde
dc.subjectlixtode
dc.subjecthub identificationde
dc.subjectsemantic webde
dc.subjectflight searchen
dc.subjectroute searchen
dc.subjectscalabilityen
dc.subjectwrapper generationen
dc.subjectwrappingen
dc.subjectweb data extractionen
dc.subjectlixtoen
dc.subjecthub identificationen
dc.subjectsemantic weben
dc.titleAn application of heuristic route search techniques for a scalable flight search systemen
dc.typeThesisen
dc.typeHochschulschriftde
tuw.publication.orgunitE184 - Institut für Informationssysteme-
dc.type.qualificationlevelDiploma-
dc.identifier.libraryidAC05038038-
dc.description.numberOfPages79-
dc.identifier.urnurn:nbn:at:at-ubtuw:1-27335-
dc.thesistypeMasterarbeitde
dc.thesistypeMaster Thesisen
item.languageiso639-1en-
item.openairetypeThesis-
item.openairetypeHochschulschrift-
item.fulltextwith Fulltext-
item.cerifentitytypePublications-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextopen-
Appears in Collections:Thesis

Files in this item:

Show simple item record

Page view(s)

9
checked on Apr 9, 2021

Download(s)

60
checked on Apr 9, 2021

Google ScholarTM

Check


Items in reposiTUm are protected by copyright, with all rights reserved, unless otherwise indicated.