Database systems employ physical structures such as indexes and materialized views to improve query performance, potentially by orders of magnitude. It is therefore important for a database administrator to choose the appropriate configuration of these physical structures (i.e., the appropriate physical design) for a given database. Deciding on the physical design of a database is not an easy task, and a considerable amount of research exists on automatic physical design tools for relational databases. Recently, XML database systems are increasingly being used for managing highly structured XML data, and support for XML data is being added to commercial relational database systems. This raises the important question of how to choose the appropriate physical design (i.e., the appropriate set of physical structures) for an XML database. Relational automatic physical design tools are not adequate, so new research is needed in this area. In this thesis, we address the problem of automatic physical design for XML databases, which is the process of automatically selecting the best set of physical structures for a given database and a given query workload representing the client application's usage patterns of this data. We focus on recommending two types of physical structures: XML indexes and relational materialized views of XML data. For each of these structures, we study the recommendation process and present a design advisor that automatically recommends a configuration of physical structures given an XML database and a workload of XML queries. The recommendation process is divided into four main phases: (1) enumerating candidate physical structures, (2) generalizing candidate structures in order to generate more candidates that are useful to queries that are not seen in the given workload but similar to the workload queries, (3) estimating the benefit of various candidate structures, and (4) selecting the best set of candidate structures for the given database and workload. We present a design advisor for recommending XML indexes, one for recommending materialized views, and an integrated design advisor that recommends both indexes and materialized views. A key characteristic of our advisors is that they are tightly coupled with the query optimizer of the database system, and rely on the optimizer for enumerating and evaluating physical designs whenever possible. This characteristic makes our techniques suitable for any database system that complies with a set of minimum requirements listed within the thesis. We have implemented the index, materialized view, and integrated advisors in a prototype version of IBM DB2 V9, which supports both relational and XML data, and we experimentally demonstrate the effectiveness of their recommendations using this implementation.

Tobulėjant informacinėms technologijoms vis didesnis programinės įrangos procentas kuriama mobiliųjų technologijų vartotojams. Populiarėjant mobiliųjų įrenginių programinei įrangai, darosi vis svarbiau sukurti patikimas, gerai vartotojui suprantamas programas ir tai padaryti kiek įmanoma greičiau. Gan svarbus yra vartotojo sąsajos kūrimas, jos funkcionalumas, paprastumas ir teisingas veikimas. Dinaminis vartotojo sąsajos kūrimas leidžia žymiai sumažinti programinei įrangai sukurti reikalingą laiką, suteikia mažai pastangų reikalaujantį vartotojo sąsajos atnaujinimą, greitą priėjimą prie daugumos mobilaus įrenginio teikiamų funkcijų. Taip pat palengvėja testavimo proceso automatizavimas, leidžia sumažinti bandymų trukmę Šiame darbe nagrinėjamas mobiliųjų įrenginių dinaminis grafinės vartotojo sąsajos kūrimas ir jos testavimas, nustatomi tikslai ir galimas jų įgyvendinimas. Darbe dinaminės vartotojo sąsajos aprašymui buvo pasirinkta XML kalba, įvardinti tokios architektūros privalumai ir problemos ir pateiktos išvados. / Evolving software development for mobile devices brings an increasing importance to develop reliable, user-friendly applications and do it in as short amount of time as possible. Very important is graphical user interface design, it‘s functionality, simplicity and fault free operation. Dynamic and fast low-level user interface development allows to significantly reduce the amount of time that development takes, provides fast content updates requiring less user endeavour, gives easy access to the most of the mobile device provided functionality. Furthermore, testing becomes easier and lasts shorter. Dynamic low-level graphical user interface development and testing are analyzed in the project, established goals and proposed solutions for their implementation. Dynamic user interface was defined using XML, advantages and disadvantages of such architecture were listed and conclusions provided.

Šiandienos įmonės susiduria su labai greitai besikeičiančia aplinka ir negali laikytis numatyto ilgalaikio veiklos modelio. Įmonės veikla ir jos veiklos modelis turi būti dinamiški. Viena didžiausių problemų verslo taisyklių panaudojimui yra jų kiekis ir sunkiai nuspėjama tarpusavio sąveika. Taisyklėms veikiant kartu atsiranda įvairūs konfliktai. Taisyklių konfliktų aptikimui ir logiškumui bei nuoseklumui patikrinti galima naudoti logika pagrįstus mechanizmus tokius kaip išvedimas. Darbe atlikta dalykinės srities literatūros apžvalga, suformuluotas metodas, leidžiantis XML atvaizduotas verslo taisykles transformuoti į predikatus bei komponuoti į verslo taisyklių rinkinius siekiant tuos rinkinius panaudoti duomenų analizei programų sistemoje. Verslo taisykli�� rinkinys turi būti išsamus ir neprieštaraujantis. Tam naudojama išvedimo mašina. / One of the greatest problems using business rules are their quantity and difficulty in foreseeing of their interplay. Conflicts become apparent when rules are used in conjunction. A logic based derivation mechanism can be used for detection of rule incongruence and to analyze their logical and chronological sequence. This paper presents a review of related works and method for transformation of the business rules represented in XML into predicate set for use in inference engine and business rules driven rule set consistency check and use of such a complete rule set in data analysis system.

Darbe analizuojamas SQL 2005 sistemoje duomenų saugojimo XML formatu efektyvumas, bei bandoma numatyti, kur būtų galima pritaikyti konkrečius variantus sukurtų duomenų struktūrų, kad būtų galima pritaikyti tai realiam uždavinių sprendimui. Tyrime buvo naudojama VISUAL BASIC 2005 (VB 2005) programavimo kalba, bei įvairūs XML apdorojimo metodai. Tyrimas buvo atliekamas sukūrus kelis skirtingus hierarchinės duomenų basės modelius, dažnai naudojamus sudarant sąmatas. / The purpose of this paperwork is to analyse the storing hierarchical structure data, in the SQL 2005 database. The main concern is to implement data retrieval from server using as fast methods as possible of retrieving hierarchical structure data. To achieve that purposes here comes XML data structures and it native support in SQL 2005. In conjunction with this technology we are also adapting other new server side technologies, and client side technologies VB 2005. The investigation has been made using data hierarchical database samples and different numbers of recordings.

Šiame darbe yra sukurtas ir pasiūlyta architektūra duomenų mainams tarp atviro kodo DBVS ir XML dokumento. Ši sistema leidžia vartotojui XML dokumente aprašyti SQL užklausas.Po to kai bus vykdomas kreipimasis į šį XML dokumentą iš naršyklės, sistema sugeneruos naują XML dokumentą, kuriame bus atvaizduotas XML struktūros dokumentas su duomenim išgautais iš DBVS pagal anksčiau pateiktame XML dokuemnte SQL užklausą (-oms). Ši sistema buvo sukurta, pasinaudojus Microsoft SQLXML programinės įrangos pagrindu, tačiau mūsų sistema turi privalūmą tame, kad saveikauja nesvarbu su kokiom DBVS, t.y. MySQL, Oracle ir t.t. / In this study, has been created software, that support XML documents interfacing with open source data base management systems. This system enables in XML document write SQL query or queries. When this XML document (file) will be requested from internet browser, this system generate a new XML document in which instead placed SQL query or queries, would be inserted generated query answer from data base written in XML format. This system has been created similar as Microsoft product SQLXML. Only our system has a feature, that it interfacing with open source data base management systems, such as MySQL.

Magistrinis darbas turi išspręsti problemas iškylančias norint sujungti WSDL servisus veikiančius SOAP protokolu. Problemai išspręsti sukurta programinė įranga, kuri naudojant XSLT tranformacijas suvienodina servisų struktūras, pateikia vartotojui servisų projektavimo įrankį ir rezultate gražina programinį kodą. / This work is trying to solve the WSDL services mapping problem. To solve the problem was chosen develop the new system, because there is no such a decision that has been made or is currently under construction. The system will have a graphical user interface that will be generated by the WSDL description. The main requirement is that a developed system can generate the programing code by combining several existing e-service SOAP protocols.

Ces dernières années ont été marquées par l'adoption en masse de XML comme format d'échange et de représentation des données stockées sur le web. Cette évolution s'est accompagnée du développement de langages pour l'interrogation et la manipulation des données XML et de la mise en œuvre de plusieurs systèmes pour le stockage et le traitement des ces dernières. Parmi ces systèmes, les moteurs mémoire centrale ont été développés pour faire face à des besoins spécifiques d'applications qui ne nécessitant pas les fonctionnalités avancées des SGBD traditionnels. Ces moteurs offrent les mêmes fonctionnalités que les systèmes traditionnels sauf que contrairement à ces derniers, ils nécessitent de charger entièrement les documents en mémoire centrale pour pouvoir les traiter. Par conséquent, ces systèmes sont limités quant à la taille des documents pouvant être traités. Dans cette thèse nous nous intéressons aux aspects liés à l'évolution des données XML et à la gestion de la dimension temporelle de celles-ci. Cette thèse comprend deux parties ayant comme objectif commun le développement de méthodes efficaces pour le traitement des documents XML volumineux en utilisant les moteurs mémoire centrale.Dans la première partie nous nous focalisons sur la mise à jour des documents XML statiques. Nous proposons une technique d'optimisation basée sur la projection XML et sur l'utilisation des schémas. La projection est une méthode qui a été proposée dans le cadre des requêtes afin de résoudre les limitations des moteurs mémoire centrale. Son utilisation pour le cas des mises à jour soulève de nouveaux problèmes liés notamment à la propagation des effets des mises à jours. La deuxième partie est consacrée à la construction et à la maintenance des documents temporels, toujours sous la contrainte d'espace. A cette contrainte s'ajoute la nécessité de générer des documents efficaces du point de vue du stockage. Notre contribution consiste en deux méthodes. La première méthode s'applique dans le cas général pour lequel aucune information n'est utilisée pour la construction des documents temporels. Cette méthode est conçue pour être réalisée en streaming et permet ainsi le traitement de document quasiment sans limite de taille. La deuxième méthode s'applique dans le cas où les changements sont spécifiés par des mises à jour. Elle utilise le paradigme de projection ce qui lui permet en outre de manipuler des documents volumineux de générer des documents temporels satisfaisant du point de vue du stockage.

Įmonė UAB „Duomenų Centras“ nuomoja serverius jau 13 metų. Atlikus tyrimus paaiškėjo, kad įmonė eksportuoja apie 75% savo paslaugų į daugiau nei 130 pasaulio šalių. Prie šio rezultato labai prisidėjo Duomenų Centro partneriai iš Lietuvos ir kitų šalių. Partneris – tai svarbiausias klientas, kuris pritraukia kitus naujus klientus. Per įmonės gyvavimo metus visas perpardavinėjimo ir partnerių klientų paslaugų valdymo procesas buvo per elektorinį paštą - tai užtrunka, tokios paslaugos nėra itin patrauklios šiuolaikinėje interneto rinkoje. Todėl dokumente atskleidžiama „partnerių programa“, bei API posistemė, kuri leidžia įmonės partneriams vykdyti su paslaugomis susijusias funkcijas. / The modern data center of Balticservers have been selling their services now for 13 years. The research revealed that the company exports 75% of its services to more than 130 countries worldwide. Moreover, the company has partners from Lithuania and many other countries. The product has been designed for partners that optimizes the process of reselling Balticservers services. It offers a WHMCS module which allows an easy creation and customization of services that are desired to be resold from Balticservers. Also, this includes an API communication between two separated systems that are WHMCS and Korys which Balticservers are currently developing and using in their daily work. API has been developed by using PHP scripting language, cURL and JSON technologies. The document exposes a few similar API systems’ comparison, product requirement specification, architecture’s specification, testing protocol and partners API documentation.

The need for aggregating privacy policies is present in a variety of application areas today. In traditional client/server models, websites host services along with their policies in different private domains. However, in a cloud-computing platform where aggregators can merge multiple services, users often face complex decisions in terms of choosing the right services from service providers. In this computing paradigm, the ability to aggregate policies as well as services will be useful and more effective for users that are privacy conscious regarding their sensitive or personal information. This thesis studies the problems associated with the Platform for Privacy Preference (P3P) language, and the present issues with communicating and understanding the P3P language. Furthermore, it discusses some efficient strategies and algorithms for the matching and the merging processes, and then elaborates on some privacy policy conflicts that may occur after merging policies. Lastly, the thesis presents a tool for matching and merging P3P policies. If successful, the merge produces an aggregate policy that is consistent with the policies of all participating service providers.

Recent years have seen a surge in the popularity of XML, a markup language for representing semi-structured data. Some of this popularity can be attributed to the success that the semi-structured data model has had in environments where the relational data model has been insufficiently expressive. Concomitant with XMLs growing popularity, the world of database research has seen the rebirth of interest in tree-structured, hierarchical database systems. This thesis analyzes several problems that arise when constructing XML data management systems, particularly in the case where such systems must handle dynamic content. In the first chapter, we consider the problem of incremental schema validation, which arises in almost any XML database system. We build upon previous work by finding several classes of schemas for which very efficient algorithms exist. We also develop an algorithm that works for any schema, and prove that it is optimal. In the second chapter, we turn to the problem of improving query evaluation times on extremely large database systems. In particular, we boost the performance of the structural and twig joins, fundamental XML query evaluation techniques, through the use of an adaptive index. This index tunes itself to the query workload, providing a 20-80% boost in speed for these join operators. The adaptive nature of the index also allows updates to the database to be easily tracked. While accurate selectivity estimation is a critical problem in any database system due to its importance in choosing optimal query plans, there has been very little work on selectivity estimation in the presence of updates. We ask whether it is possible to design a structure for selectivity in XML databases that is updateable, and can return results with theoretically sound error guarantees. Through a combination of lower and upper bounds, we give strong evidence suggesting that this is unlikely in practice. Motivated by these results, we then develop a heuristic selectivity estimation structure for XML databases. This structure is the first such synopsis that can handle all aspects of core XPath, and is also updateable. Our experimental results demonstrate the efficacy of the approach.