Grant: Discovery Grants Program - Individual
Acadia University
$15,000.00
Updating and querying compressed XML documents
EF 2012-13
Résumé
XML is now the de facto data format standard for Web services, as well as for encoding semi-structured data. At the same time, mobile devices, which have limited memory and network bandwidth, are becoming ubiquitous in today's society. Unfortunately, XML's verbose nature adversely affects the efficiency of various XML services. In particular, querying and updating XML documents is one of the most commonly-used services, and therefore making these services more efficient has become a key research agenda.
To date, all work on developing update and query tools has focused on sequential methods, which suffer from limitations related to the trade-off between compression ratio and execution time. Recent widespread availability of multi-core processors could resolve XML processing issues, but as of today no research has been carried out on applying parallelization techniques to XML processing. The proposed research aims to fill this gap. I propose to develop an XML compression framework that leverages parallelization techniques for efficient query and update processing, while supporting partial, or lazy data decompression. For both types of operations (query and update), I will investigate simultaneous and consecutive approaches: with the simultaneous approach, two or more operations may be executed in parallel, while with a consecutive approach, one operation must be completed before another one begins (although its sub-parts may be parallelized). Although the former approach is more complex to implement, it may be more useful in practical applications. My research will explore both new theoretical questions, including parallel XML compression algorithms and query and update algorithms, as well as practical issues related to the implementation of these algorithms on multi-core machines. The key benefits of the proposed research are contributions to (1) theoretical parallel computing; (2) improvements of XML processing through novel techniques for parallelized XML update and query, as well as general XML-aware parallel compressors. The results of my research will be significant to both the research community and Canadian IT industry.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Nova Scotia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
21999-2010
Name nom
Muldner, Tomasz
Department département
Computer Science, Jodrey School of
Organization id
78
Institution établissement
Acadia University
Province en
Nova Scotia
Province fr
Nouvelle-Écosse
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2012
Competition year année de concours
2010
Award amount
15000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
Research subject code
2700
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Information technology
Research subject fr
Technologie de l'information
Partie
3
Nb partie
5
Application title
Updating and querying compressed XML documents
Keyword
NSERC
Application summary
XML is now the de facto data format standard for Web services, as well as for encoding semi-structured data. At the same time, mobile devices, which have limited memory and network bandwidth, are becoming ubiquitous in today's society. Unfortunately, XML's verbose nature adversely affects the efficiency of various XML services. In particular, querying and updating XML documents is one of the most commonly-used services, and therefore making these services more efficient has become a key research agenda.
To date, all work on developing update and query tools has focused on sequential methods, which suffer from limitations related to the trade-off between compression ratio and execution time. Recent widespread availability of multi-core processors could resolve XML processing issues, but as of today no research has been carried out on applying parallelization techniques to XML processing. The proposed research aims to fill this gap. I propose to develop an XML compression framework that leverages parallelization techniques for efficient query and update processing, while supporting partial, or lazy data decompression. For both types of operations (query and update), I will investigate simultaneous and consecutive approaches: with the simultaneous approach, two or more operations may be executed in parallel, while with a consecutive approach, one operation must be completed before another one begins (although its sub-parts may be parallelized). Although the former approach is more complex to implement, it may be more useful in practical applications. My research will explore both new theoretical questions, including parallel XML compression algorithms and query and update algorithms, as well as practical issues related to the implementation of these algorithms on multi-core machines. The key benefits of the proposed research are contributions to (1) theoretical parallel computing; (2) improvements of XML processing through novel techniques for parallelized XML update and query, as well as general XML-aware parallel compressors. The results of my research will be significant to both the research community and Canadian IT industry.