Efficient Temporal Queries in an XML-Based Content Management System
Ladda ner
Typ
Examensarbete för masterexamen
Master Thesis
Master Thesis
Program
Computer science – algorithms, languages and logic (MPALG), MSc
Publicerad
2014
Författare
Svallfors, Hugo
Modellbyggare
Tidskriftstitel
ISSN
Volymtitel
Utgivare
Sammanfattning
The thesis concerns solving the following problem: How to efficiently search through multiple versions of the same XML file. A promising approach was found in the research field of temporal databases, and the works of F.Wang and C. Zaniolo in particular. They developed a pseudocode algorithm called the XChronicler Algorithm that given multiple revisions of an XML file, produces an XML v-file, an efficiently compressed, searchable history of an XML file that is itself an XML file. The algorithm is implemented and relevant parts of the implementation are discussed.or, Intersection, Field assessment, Wireless, Cooperative, Application, Human-Machine Interface, Historic profiles, Distance to intersection, Time to intersection
Beskrivning
Ämne/nyckelord
Data- och informationsvetenskap , Computer and Information Science