Algorithms for Parallel Searching in XML Datasets
| Thesis title in Czech: | Paralelní vyhledávání nad XML daty |
|---|---|
| Thesis title in English: | Algorithms for Parallel Searching in XML Datasets |
| Academic year of topic announcement: | 2008/2009 |
| Thesis type: | diploma thesis |
| Thesis language: | angličtina |
| Department: | Department of Software Engineering (32-KSI) |
| Supervisor: | RNDr. Jakub Yaghob, Ph.D. |
| Author: | hidden - assigned and confirmed by the Study Dept. |
| Date of registration: | 14.11.2008 |
| Date of assignment: | 14.11.2008 |
| Date and time of defence: | 07.09.2009 00:00 |
| Date of electronic submission: | 05.08.2009 |
| Date of submission of printed version: | 05.08.2009 |
| Date of proceeded defence: | 07.09.2009 |
| Opponents: | Mgr. Martin Mareš, Ph.D. |
| Guidelines |
| The thesis will address the problems of indexing XML datasets and finding effective searching methods for indexed data. Defining data structures and algorithms that take highly parallel approach to the searching problem is considered to be main objective, therefore the implementation may benefit from the power of multi-core CPUs. Prototype of such implementation will be embedded in the thesis.
Internal query language will be presented as common layer for other query languages that will be able to operate above this layer as front-ends. Most likely the internal query language will not have text-like representation. Subset of XPath query language will be implemented as a sample front-end. |
| References |
| Reinders J.: Intel Threading Building Blocks, O'Reilly Media, 2007, ISBN 0-596-51480-8
Mattson T.G., Sanders B.A., Massingill B.L.: Patterns for Parallel Programming, Pearson Education, 2005, ISBN 0-321-22811-1 XML specifikace (http://www.w3.org/TR/2006/REC-xml-20060816/) XPath 1.0 specifikace (http://www.w3.org/TR/xpath) XPath 2.0 specifikace (http://www.w3.org/TR/xpath20/) |
| Preliminary scope of work |
| The thesis will address the problems of indexing XML datasets and finding effective searching methods for indexed data. Defining data structures and algorithms that take highly parallel approach to the searching problem is considered to be main objective, therefore the implementation may benefit from the power of multi-core CPUs. Prototype of such implementation will be embedded in the thesis.
Internal query language will be presented as common layer for other query languages that will be able to operate above this layer as front-ends. Most likely the internal query language will not have text-like representation. Subset of XPath query language will be implemented as a sample front-end. |
| Preliminary scope of work in English |
| The thesis will address the problems of indexing XML datasets and finding effective searching methods for indexed data. Defining data structures and algorithms that take highly parallel approach to the searching problem is considered to be main objective, therefore the implementation may benefit from the power of multi-core CPUs. Prototype of such implementation will be embedded in the thesis.
Internal query language will be presented as common layer for other query languages that will be able to operate above this layer as front-ends. Most likely the internal query language will not have text-like representation. Subset of XPath query language will be implemented as a sample front-end. |