Efficient Temporal Queries in an XML-Based Content Management System

Visa enkel post
dc.contributor.authorSvallfors, Hugo
dc.contributor.departmentChalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)sv
dc.contributor.departmentChalmers University of Technology / Department of Computer Science and Engineering (Chalmers)en
dc.date.accessioned2019-07-03T13:21:06Z
dc.date.available2019-07-03T13:21:06Z
dc.date.issued2014
dc.description.abstractThe 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
dc.identifier.urihttps://hdl.handle.net/20.500.12380/193724
dc.language.isoeng
dc.setspec.uppsokTechnology
dc.subjectData- och informationsvetenskap
dc.subjectComputer and Information Science
dc.titleEfficient Temporal Queries in an XML-Based Content Management System
dc.type.degreeExamensarbete för masterexamensv
dc.type.degreeMaster Thesisen
dc.type.uppsokH
local.programmeComputer science – algorithms, languages and logic (MPALG), MSc
Ladda ner
Original bundle
Visar 1 - 1 av 1
Bild (thumbnail)
Namn:
193724.pdf
Storlek:
877.68 KB
Format:
Adobe Portable Document Format
Beskrivning:
Fulltext
Ladda ner
Samling
Examensarbeten för masterexamen