The purpose of this paperwork is to analyze the programming methods of various modern data bases and apply them for the solution of real problems. ADO and ADO.NET component programming methods have been used to attain this purpose. The investigation has been made using different systems of data bases and different numbers of recordings. The results of investigation were applied for the practical implementation of problem solution; and that is estimate data.

Pragmatically motivated communicative action loop (CAL) is proposed for modeling business transactions and designing database transactions. Using parameters of the communicative action loops, activity model can be adapted to particular objective area. Selected parameters are utilizable in formation of database transactions that are oriented in modification of states of objects of activity. Performed database transactions are registered to query register in order to make a database rollback when business transactions are canceled. Database transactions are synchronized between two replicated databases.

The subject of this master work is the <a href="http://www.ntsearch.com/search.php?q=internet&v=56">internet</a> information resource database. This work also handles the problems of old information systems which do not meet the new contemporary requirements. The aim is to create <a href="http://www.ntsearch.com/search.php?q=internet&v=56">internet</a> information system, based on object-oriented technologies and tailored to <a href="http://www.ntsearch.com/search.php?q=computer&v=56">computer</a> users’ needs. The <a href="http://www.ntsearch.com/search.php?q=internet&v=56">internet</a> information database system helps <a href="http://www.ntsearch.com/search.php?q=computers&v=56">computers</a> administrators to get the all needed information about <a href="http://www.ntsearch.com/search.php?q=computers&v=56">computers</a> <a href="http://www.ntsearch.com/search.php?q=network&v=56">network</a> elements and easy to register all changes into information database.

Currently there are many software systems for creating data bases widely used in the world. There were made an analysis of existing software and customer needs in this work. There were made an analysis of Object-oriented programing, CASE – computer aided system engeenering, Component modeling, MS Access. To understand business environment I created Business Interaction Model, Workflow models, Use Case Model. For this purpose I used ProVision Workbench package. I created data base project. I used MS Access XP because of its stability, multipurpose, potential, good working with Windows 9*, Windows 2000, Windows XP operational systems. There were made an User Interface, including forms , reports, queries.

Jankevičius, Vytautas (2006). “Analysis of open source database servers using service management system”. MA Graduation Paper. Kaunas: Faculty of informatics, University of Kaunas Technology . 49 p. The graduation work object is to analyse the popular open source databases servers and determine which is the optimal for service management system. To complete the goal there were made such tasks: • Perform theoretical analysis of open source database servers • To determine similarities and differences of open source database servers. • To analyze and compare functional features of service management systems. • To design the special class and methods necessary for research. • To determine the optimal database server for service management system using the special class and methods. There are 49 pages in the work. First part of the work consists of 13 pages, second part – 13 pages and the third part is 14 pages. There are 3 tables and 32 pictures in the work. The first part of the work proposed the review and the comparison of service management systems and open source database servers. Second part of the work is proposed the project model of service management system Third part of the work proposed the results of open source database servers’ research.

We present methodology, which allows automatically test database schemes. Such methodology allows you to create new one or expand existing CASE tool. You can integrate database tests in generating physical database model process. In this way you can make scheme validation much easier, as a result it lowers the possibility of errors in early steps of modelling. Acording to our analysis, there are very few tools that covers such methodotlogy. So during our work we have designed and created a new tool – „DbTestAddin“, tool that tests database schemes. It works as Microsoft Office Visio 2003 Add-in. With this tool you can easily test any database scheme you want, compare it with a real database etc. In future, there are several updates and functional enhacements which can make this tool more attractive to use.

Laikui einant informacijos srautai vis didėja, todėl reikia surasti patogų būdą ją saugoti ir apdoroti. Dėka tobulėjančių informacinių technologijų, informacijos saugojimo ir apdorojimo metodai taip pat turi galimybę tobulėti. Šiais laikais įvairūs informacijos kiekiai gali būti saugomi ne tik fizinėje formoje, bet ir elektroniniame pavidale. Tokiame pavidale informacija gali būti sėkmingai administruojama, naudojant administravimo programinę įrangą. Šiame darbe apžvelgsime C# ir C++ programavimo kalbų sukurtas (realizuotas) duomenų administravimo programas bei programavimo kalbų potencialą kuriant analogišką produkciją. Detaliau bus apžvelgiama C# programavimo kalba. Šis darbas yra skiriamas asmenims, kurie domisi duomenų administravimo programų kūrimu ir taikymo galimybėmis. Šio baigiamojo magistrinio darbo tikslas - išanalizuoti duomenų bazių programavimo C# kalba charakteristikas, sukuriant taikomųjų programų pavyzdžius ir atliekant jų efektyvumo tyrimus, bei jas palyginti su C++ kalba. Darbo uždaviniai: Susipažinti su duomenų bazių (DB) teorine dalimi. Parengti C# duomenų bazių administravimo programas, taikant skirtingas programavimo metodikas. Išanalizuoti programų veikimo charakteristikas. Pasirinkus tinkamiausias C# programavimo metodikas, parengti demonstracines programas. Palyginti parengtų C# ir C++ programų rezultatyvumą.  . / As time passed the flow of information is growing so had to find a convenient way to store and handle, thanks to the constant development of information technology, information storage and processing methods have the opportunity to excel. Nowadays, different amounts of information can be stored not only in shape but also in electronic form. Such form may be successfully managed using the administration software. In this work, review the C# and C++ programming language created (realized), data administration programs and the programming language’s potential for the analog output. Retailers will be an overview of the C# programming language. This work is given to individuals who are interested in database administration and application programming development opportunities. This master thesis is to analyze the database programming in C# language features, creating a sample application and the effectiveness of their research, and to compare them with the C++ language. Tasks: Get familiar with the database (DB) of the theoretical part. Develop a programming language, C# database management applications using different programming techniques. To analyze the performance characteristics of applications. Selecting the best C# programming techniques to develop demonstration programs. Comparison between the performance of programs developed in C# and C++ languages.

Magistro darbe nagrinėjama pilno teksto paieškos veikimo sparta. Paieškos sistema sukurta naudojantis PHP ir MySQL priemonėmis, taip pat panaudojant Memcached laikinosios atminties valdymo sistemą. Tyrimui atlikti reikalingi duomenys paimti iš RSS srautų agregatoriaus, periodiškai nuskaitančio informaciją iš lietuviškų tinklaraščių. Darbe didžiausias dėmesys skiriamas paieškos variklio indeksavimo ir rezultatų atrinkimo procesų vykdymo trukmei. Tiriant indeksavimo procesą, veikimo sparta išmatuota dirbant su skirtingais duomenų kiekiais. Turint daug duomenų, šis veiksmas reikalauja daug kompiuterio resursų ir gali trukti ilgai. Indeksuojant duomenis proceso trukmė buvo išmatuota naudojant ir nenaudojant Memcached ir ignoruojamų žodžių sąrašų. Paieškos tyrimo metu tirtas paieškos užklausos elementų kiekio įtaka rezultatų atrinkimui. Abiejų procesų veiklų matavimai atlikti naudojant InnoDB ir MyISAM lenteles duomenų saugojimui. Tyrimo metu rasti sprendimai, kuriuos rekomenduojama rinktis realizuojant arba naudojant panašiais principais paremtą paieškos sistemą. / In this Master thesis the performance of full-text search is analyzed. Search engine is implemented by using PHP and MySQL also Memcached cache engine. Data for the research is gathered from RSS aggregator that periodically collects information from lithuanian blogs. The main attention is drawn on speed of both data indexing and search results gathering. While analyzing indexing process the speed of its performance was measured on different data sets. Indexing requires a lot of computer resources and can last long when having a lot of data. The duration of this process was measured with enabled and disabled Memcached service and list of ignored words. A test on how strongly query's number of elements influence the collection of results was performed. Performances were tested by using both InnoDB and MyISAM tables. Paper suggests solutions that are recommended for implementing and using similar search engines.

Darbe apžvelgiami duomenų vientisumo apribojimų tipai ir jų realizavimo būdai, analizuojami jų privalumai ir trūkumai. Kiekvienam apribojimo tipui, pagal veikimo trukmės ir įgyvendinimo sudėtingumo charakteristikas, parinktas labiausiai efektyvus realizavimo būdas bei eksperimentiškai patvirtintos analizės metu iškeltos hipotezės. Remiantis eksperimentinio tyrimo rezultatais, sudaryta ir aprašyta duomenų vientisumo apribojimų realizacijos strategijos parinkimo metodika, kuri galėtų padėti didelėms įmonėms efektyviai įgyvendinti duomenų vientisumo apribojimus, sunaudojant kuo mažiau laiko, darbo ir sistemos resursų, bet tuo pačiu užtikrinant duomenų vientisumą ir korektiškumą. / This thesis describes types of data integrity constraints, the ways for implementation these constraints, and their analyzed advantages and disadvantages. It is chosen most effective way for implementation every type of data integrity constraint, according to their run duration and complexity of implementation characteristics, and experimentally approved hypotheses, which were raised during analysis. With reference to the results of the experiment, is made and described the methodology of implementation strategy for data integrity constraints, which could help effectively implement data integrity constraints for large application systems, using as less as it is possible time, workforce and system resources, and at the same time ensuring data integrity and correctness.

Valstybėms tiesioginių mokesčių srityje išlaikant suverenitetą ir laisvai nusistatant tiesioginių mokesčių rūšį, bazę, tarifą, apmokestinamus subjektus, atsiranda esminiai skirtumų, sukuriančių rinkos fragmentaciją ir didelių kliūčių efektyviam Bendrijos vidaus rinkos funkcionavimui. Visa tai ir atsilikimas nuo kitų sričių harmonizavimo lemia integracijos poreikį ir spaudimą valstybėms narėms harmonizuoti. Tačiau tiesioginių mokesčių pozityviosios integracijos bazė reikalauja, kad Taryboje priimant direktyvas būtų sprendžiama vieningai (nuo 2004 m. – 27-ių valstybių konsensusu). Tai de facto blokuoja privalomų teisės aktų leidybą ir sukuria politinių sprendimų stagnaciją. Priešingai nei pozityvioji integracija, negatyvioji integracija (daugiausia besiremianti laisvo judėjimo pažeidimų draudimais), vyksta itin sparčiai, nepaliaujamai didėjant ETT sprendžiamų bylų ir jų ratio decidendi sklaidą užtikrinančių Komisijos pažeidimo procedūrų skaičiui. ETT, spręsdamas bylas, taiko „visaapimantį” požiūrį: vertinant vienos valstybės įstatymų atitiktį EB teisei, analizuojami ne tik jos įstatymai, bet ir kitos, susijusios valstybės, įstatymai bei jų tarpusavio dvigubo apmokestinimo išvengimo sutartys, t.y. aplinkybių visuma, todėl netgi tas pats įstatymas santykyje su valstybės A įstatymais gali prieštarauti EB teisei, o su valstybės B – jau nebe. Tokia doktrina remiasi Cassis de Dijon abipusio pripažinimo principu: valstybė turi atsižvelgti į kitos valstybės įstatymų nuostatas; tačiau... [toliau žr. visą tekstą] / While Member States retain direct tax sovereignity and determine the tax, its base, rate, taxable subjects discretionary, fundamental differencies occur, resulting in market fragmentation and big obstacles for effective functioning of Community internal market. These differencies and the gap between harmonization in direct taxes and other spheres stipulate the need of harmonization and pressure for the Member States. However, the sole harmonization base requires the Council to act unanimously (starting from year 2004 – by consent of 27 states). This de facto blocks the law-making of compulsory acts and leads to stagnation of political decisions. Contrary to positive integration, negative integration (mostly founded on prohibitions to restrict free movement) proceeds rapidly, while in the meantime the number of cases solved by European Court of Justice (ECJ) and infringement procedures initiated by Commision which ensure the spread of ECJ cases’ ratio decidendi is constantly growing. ECJ when providing the decisions applies overall approach: evaluation of one Member State’s laws means taking into account the whole situation, including the laws of other related Member State and their inter-tax treaties. Therefore the same law is liable to be restrictive in relation to the laws of Member State A, but not restrictive in relation with the laws of Member State B. This doctrine is based under the Cassis de Dijon principle of mutual recognition: Member State is obliged to consider... [to full text]