In English

Efficient Temporal Queries in an XML-Based Content Management System

Hugo Svallfors
Göteborg : Chalmers tekniska högskola, 2014. 33 s.
[Examensarbete på avancerad nivå]

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

Publikationen registrerades 2014-02-13. Den ändrades senast 2014-02-13

CPL ID: 193724

Detta är en tjänst från Chalmers bibliotek