|
| |
|
| |
|
|
XML Data Editor with the Support of XML Schema Inference
Němec, Michal ; Holubová, Irena (advisor) ; Svoboda, Martin (referee)
The goal of this thesis is creation of an XML data editor. The editor contains functionality to simplify creation of syntactically and semantically correct XML documents. The main feature of the editor is automatic inference of XML schema for a set of input XML documents. User may edit XML data by either a text view or a tree view. It is possible to check well-formedness and validity of edited XML data. There is a code completion - overview of feasible elements on given level - feature in the text view available. Implemented solution facilitates an easy extension of its main feature - schema inference. The program is written in C# programming language and is designed for use on Microsoft Windows operating systems. Powered by TCPDF (www.tcpdf.org)
|
|
|
Optimization of Processing of Data Files in System DIRAC
Adam, Martin ; Holubová, Irena (advisor) ; Svoboda, Martin (referee)
DIRAC is a software framework for distributed computing providing a complete solution to one (or more) user community requiring access to distributed resources. In this thesis the DIRAC File Catalog (DFC) is extended by adding a DatasetManager module, thus adding support for datasets based on metadata queries. To improve the metaquery handling in the code, a new class MetaQuery was implemented that bundles the handling methods and adds normalization and optimization of the user input. The metaquery language was extended enabling logical operators and parenthesis. In the second part of the thesis the hypothesis that connecting the metadata part of the DIRAC File Catalog to a NoSQL database could improve metaquery performance is evaluated. Several databases are tested and the best performing one is then connected via an interface module to the DFC. Powered by TCPDF (www.tcpdf.org)
|
|
|
Automatic Generation of Synthetic XML Documents
Betík, Roman ; Holubová, Irena (advisor) ; Svoboda, Martin (referee)
The aim of this thesis is to research the current possibilities and limitations of automatic generation of synthetic XML and JSON documents used in the area of Big Data. The first part of the work discusses the properties of the most used XML data generators, Big Data and JSON generators and compares them. The next part of the thesis proposes an algorithm for data generation of semistructured data. The main focus of the algorithm is on the parallel execution of the generation process while preserving the ability to control the contents of the generated documents. The data generator can also use samples of real data in the generation of the synthetic data and is also capable of automatic creation of simple references between JSON documents. The last part of the thesis provides the results of experiments with the data generator exploited for the purpose of testing database MongoDB, describes its added value and compares it to other solutions. Powered by TCPDF (www.tcpdf.org)
|
|
|
Analysis of Real-World XML Queries
Hlísta, Peter ; Holubová, Irena (advisor) ; Svoboda, Martin (referee)
The aim of this thesis was to gather and analyze the real-world XQuery programs. The data gathering process is usually performed using the crawler. Part of the thesis was to analyze different crawlers and to choose the most suitable one. The crawler was then modified, so it would not overload servers, gather the right data and be able to pause. Before main gathering two problems had to be solved - where to start the gathering and how long it will take. After the data were gathered, they were cleaned, corrected and validated. The subject of the analysis was usage of the XQuery language and its grammar symbols. We also analyzed the XML documents used by XQuery programs and outputs from the XQuery programs. The main contribution of this thesis is the amount of the gathered data (in comparison with other sources), as well as gathering XML documents which are being queried, using Analyzer for analyzing the real-world XQuery programs and running this real-world XQuery programs over gathered XML documents.
|
|
|
Development of journalist as a film character in Amarican cinema
Svoboda, Martin ; Novotný, David Jan (advisor) ; Štoll, Martin (referee)
This bachelor work follows the occupation of journalism as it is shown in mainstream American cinema throught the sound era of motion pictures. It describes ways mainstream cinema deals with the complexity of journalism as it needs to maintain its rentability of commercial art. The work points out the possibility of essential simplification of the journalism routine caused just by the same need - making profit. Because to make a gainful movie remains to be the main motivation for producers of films. And the profitable movie must be at the first place underestandable for a viewer. In the result of this the work offers some basic archetypes of movie journalist. The next important issue of the work is a professional ethics which can collide with intentions of movie makers which prefer other moral vallues than real news media. The simplification ad profitability can again be a factor. The last part of the work uses all presented informations to trace the way of the influental theatre play The Front Page and its four adaptations throught the decades of movie making. The main goal of the work is to understand the way journalists are portrayted in the mainstream American cinema which offered so many films about them.
|
|
|
Correction of Invalid Trees with Respect to Regular Tree Grammars
Svoboda, Martin ; Holubová, Irena (advisor) ; Bača, Radim (referee) ; Pardede, Eric (referee)
XML documents and related technologies represent one of the most widespread ways how data on the Web are maintained and interchanged. Unfortunately, many of the real-world documents contain various types of consistency issues that prevent their successful automated processing. In this thesis we focus on the problem of the structural invalidity and its correction. In particular, having one potentially invalid XML document modeled as a tree, and a schema in DTD or XML Schema languages modeled as a regular tree grammar, our goal is to find all the minimal corrections of this tree. The model we proposed builds on top of the recursively nested structures of correction multigraphs, where the shortest paths are being found. For this purpose we formally introduce three correction strategies with different pruning optimizations applied. According to the experiments we performed, the refinement correction strategy not only significantly outperforms all the other existing approaches, but also guarantees important characteristics the others cannot. Powered by TCPDF (www.tcpdf.org)
|
|
|
Web Database for Chess Games
Postupa, Martin ; Svoboda, Martin (advisor) ; Zavoral, Filip (referee)
1 Title: Web Database for Chess Games Author: Martin Postupa Department: The Department of Software Engineering Supervisor: RNDr. Martin Svoboda, The Department of Software Engineering. Abstract: This work is about creating database for chess games. Purpose this work is lead user how to create, edit, erase and copy chess games. How to replay and find chess games and create scoresheet. Purpose this work is also saving this data into database and interpreting games. We are focus on write list of games and registration new users. For solving big part of problems we use wall through chessboard array where is placed chessmen because it is amount to big part of tasks involved in creating games like creating scoresheet and addding correct chess moves. Therefore we accomplish bachelor work tasks. Work contains function system for addding chess games. System encompasses basic function for work with chess games and showing games list.There is function for verification remaining moves of games. This function check correct chess move in linked with chess laws. Benefit of this work is enrichment for web databases for chess games system, where addding games only users and it have potentiality to come one of the biggest database of chess games, because there can be more than thousands users who addding chess games....
|
|
|
Ontological Reasoning with Taxonomies in RDF Database
Hoferek, Ondřej ; Nečaský, Martin (advisor) ; Svoboda, Martin (referee)
13548805670613-46162052c208770f99e83a586780d16c.txt As the technologies for the realisation of the idea of the Semantic Web have evolved rapidly during past few years, it is possible to use them in variety of applications. As they are designed with the ability to process and analyze semantic information found in the data in mind, they are particularly suitable for the task of enhancing relevance of the document retrieval. In this work, we discuss the possibilities of identifying a suitable subset of the expressing capabilities of the SPARQL querying language and create a component that encapsulates the technical details of its usage. Page 1
|
guest ::
RSS feed.