Algorithms for Parallel Searching in XML Datasets
| Název práce v češtině: | Paralelní vyhledávání nad XML daty |
|---|---|
| Název v anglickém jazyce: | Algorithms for Parallel Searching in XML Datasets |
| Akademický rok vypsání: | 2008/2009 |
| Typ práce: | diplomová práce |
| Jazyk práce: | angličtina |
| Ústav: | Katedra softwarového inženýrství (32-KSI) |
| Vedoucí / školitel: | RNDr. Jakub Yaghob, Ph.D. |
| Řešitel: | skrytý - zadáno a potvrzeno stud. odd. |
| Datum přihlášení: | 14.11.2008 |
| Datum zadání: | 14.11.2008 |
| Datum a čas obhajoby: | 07.09.2009 00:00 |
| Datum odevzdání elektronické podoby: | 05.08.2009 |
| Datum odevzdání tištěné podoby: | 05.08.2009 |
| Datum proběhlé obhajoby: | 07.09.2009 |
| Oponenti: | Mgr. Martin Mareš, Ph.D. |
| Zásady pro vypracování |
| 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. |
| Seznam odborné literatury |
| 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/) |
| Předběžná náplň práce |
| 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. |
| Předběžná náplň práce v anglickém jazyce |
| 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. |