Dissertations / Theses: 'Databases'

1

Chung, Sun S. "Anti-Tamper Databases: Querying Encrypted Databases." online version, 2006. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=case1136677144.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bielecki, Pavel. "Distributed relational database system of occasionally connected databases." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2000. http://handle.dtic.mil/100.2/ADA378092.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Rashid, Awais. "A database evolution approach for object oriented databases." Thesis, Lancaster University, 2001. http://eprints.lancs.ac.uk/11951/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Vargas, Herring Luis Carlos. "Integrating databases and publish/subscribe." Thesis, University of Cambridge, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.609151.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Unnava, Vasundhara. "Query processing in distributed database systems." Connect to resource, 1992. http://rave.ohiolink.edu/etdc/view.cgi?acc%5Fnum=osu1261314105.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Khayundi, Peter. "A comparison of open source object-oriented database products." Thesis, University of Fort Hare, 2009. http://hdl.handle.net/10353/254.

Full text

Abstract:

Object oriented databases have been gaining popularity over the years. Their ease of use and the advantages that they offer over relational databases have made them a popular choice amongst database administrators. Their use in previous years was restricted to business and administrative applications, but improvements in technology and the emergence of new, data-intensive applications has led to the increase in the use of object databases. This study investigates four Open Source object-oriented databases on their ability to carry out the standard database operations of storing, querying, updating and deleting database objects. Each of these databases will be timed in order to measure which is capable of performing a particular function faster than the other.

APA, Harvard, Vancouver, ISO, and other styles

7

Zhang, Hao. "Querying databases a tale of two C# approaches /." Click here for download, 2010. http://proquest.umi.com.ps2.villanova.edu/pqdweb?did=2019786971&sid=1&Fmt=2&clientId=3260&RQT=309&VName=PQD.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Hines, Gary L. "From entities to objects : reverse engineering a relational data model into an object-oriented design." Virtual Press, 2000. http://liblink.bsu.edu/uhtbin/catkey/1164846.

Full text

Abstract:

In many software applications, an object-oriented design (OOD) is generated first, then persistent storage is implemented by mapping the objects to a relational database. This thesis explores the "reverse engineering" of an OOD out of an existing relational data model. Findings from the current literature are presented, and a case study is undertaken using the model and research process published by GENTECH, a nonprofit organization promoting genealogical computing. The model is mapped into an OOD and captured in Unified Modeling Language (UML) class diagrams and object collaboration diagrams. The suitability of the example OOD is evaluated against the GENTECH research process using UML use cases and sequence diagrams. The mapping of relational database designs into OODs is found to be suitable in certain instances.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

9

Moatassem, Nawal N. "A Study of Migrating Biological Data from Relational Databases to NoSQL Databases." Youngstown State University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1442486094.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Aleksic, Mario. "Incremental computation methods in valid and transaction time databases." Thesis, Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/8126.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Henderson, Rebecca Sue. "Technology in action : the design and use of relational databases /." Thesis, Connect to this title online; UW restricted, 1999. http://hdl.handle.net/1773/8880.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Shou, Yutao Sindy, and 壽玉濤. "Efficient query processing for spatial and temporal databases." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B29853655.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Long, Shitian. "Database syncrhonization between devices : A new synchronization protocol for SQLite databases." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-46712.

Full text

Abstract:

Today people have multiple personal computers, personal digital assistants and smart phones. Today's advanced handheld devices have powerful processors, with a process frequency of up to 1 GHz, huge storage capacities, flash storage capacities up to 32 GB, a large (multi) touch screen, and a user-friendly user interface. Additionally, the device may have various input and output devices, thus leading to people utilizing different devices for different use cases. In order to provide the latest information to the users via any of their devices, data synchronization becomes a requirement for users. There are many data synchronization solutions for synchronizing database records and files. In the current database synchronization solutions, there is no clear source and target. For example, consider the case where a PDA synchronizes with a PC; the record could have been edited (changed) on both the PDA and PC. In this case it is not clear which should be synchronized with what should be the source for the value. In contrast, a files synchronization system has a clearly specified synchronizatiom sourse and destination structure. In this case the client Synchronizes their files with that of the server. In a version control system the client synchronize files with a repository acting as a version control server. There are many synchronizing protocols and each has been designed for different purpose. Protocols for synchronizing database records often provide continuous synchronization, leading to a lot of data being exchanging during the synchronization process, as a result the synchronization process takes a longer period of time, but maintains the semantics of the database updates (either a complete transaction completes or it must be rolled back). On the other hand, protocols for synchronizing files may require a short synchronization time, as the whole file transferred and replaces the previous version of the file at the destination. Note file synchronization may also transfer only the differences between the files, with a local transformation of an existing file copy of the by applying these differences as updates to the files. Sending only the updates to a file enables large files with a small number of changes to be quickly updated. However, file based updated does not efficiently support record level updates of a database. In this thesis we designed a new synchronization protocol for synchronizing two SQLite databases. This synchronization protocol borrows from (and hence offers the advantages of) a version control system in order to rapidly perform SQLite database synchronization. Moreover, this solution brings SQLite database additional functions, for example supporting multiple-user, transaction logs, and data roll-back.

APA, Harvard, Vancouver, ISO, and other styles

14

Wang, Qing [Verfasser]. "Logical foundations of database transformations for complex-value databases / Qing Wang." Kiel : Universitätsbibliothek Kiel, 2010. http://d-nb.info/1020001461/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Ulibarri, Desirea Duarte. "Volunteer system project Regis University Networking Lab Practicum /." [Denver, Colo.] : Regis University, 2006. http://165.236.235.140/lib/DUlibarriPartI2006.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Ciolek, Thomas S. "Meeting the challenges of met data with MySQL X /." [Denver, Colo.] : Regis University, 2006. http://165.236.235.140/lib/TCiolek2006.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Sullivan, Larry. "Performance issues in mid-sized relational database machines /." Online version of thesis, 1989. http://hdl.handle.net/1850/10445.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Ge, Shen, and 葛屾. "Advanced analysis and join queries in multidimensional spaces." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2012. http://hub.hku.hk/bib/B49799332.

Full text

Abstract:

Multidimensional data are ubiquitous and their efficient management and analysis is a core database research problem. There are lots of previous works focusing on indexing, analyzing and querying multidimensional data. In this dissertation, three challenging advanced analysis and join problems in multidimensional spaces are proposed and studied, providing efficient solutions to their related applications. First, the problem of generalized budget constrained optimization query (Gen-BOQ) is studied. In real life, it is often difficult for manufacturers to create new products dominating their competitors, due to some constraints. These constraints can be modeled by constraint functions, and the problem is then to decide the best possible regions in multidimensional spaces where the features of new products could be placed. Using the number of dominating and dominated objects, the profitability of these regions can be evaluated and the best areas are then returned. Although GenBOQ computation is challenging due to its high complexity, an efficient divide-and-conquer based framework is offered for this problem. In addition, an approximation method is proposed, making tradeoffs between the result quality and the query cost. Next, the efficient evaluation of all top-k queries (ATOPk) in multidimensional spaces is investigated, which compute the top ranked objects for a group of preference functions simultaneously. As an application of such a query, consider an online store, which needs to provide recommendations for a large number of users simultaneously. This problem is somewhat overlooked by past research; in this thesis, batch algorithms are proposed instead of naïvely evaluating top-k queries individually. Similar preferences are grouped together, and two algorithms are proposed, using block indexed nested loops and a view-based thresholding strategy. The optimized view-based threshold algorithm is demonstrated to be consistently the best. Moreover, an all top-k query helps to evaluate other queries relying on the results of multiple top-k queries, such as reverse top-k queries and top-m influential queries proposed in previous works. It is shown that applying the view-based approach to these queries can improve the performance of the current state-of-the-art by orders of magnitude. Finally, the problem of spatio-textual similarity joins (ST-SJOIN) on multidimensional data is considered. Given both spatial and textual information, ST-SJOIN retrieves pairs of objects which are both spatially close and textually similar. One possible application of this query is friendship recommendation, by matching people who not only live nearby but also share common interests. By combining the state-of-the-art strategies of spatial distance joins and set similarity joins, efficient query processing algorithms are proposed, taking both spatial and textual constraints into account. A batch processing strategy is also introduced to boost the performance, which is also effective for the original textual-only joins. Using synthetic and real datasets, it is shown that the proposed techniques outperform the baseline solutions.
published_or_final_version
Computer Science
Doctoral
Doctor of Philosophy

APA, Harvard, Vancouver, ISO, and other styles

19

Alkahtani, Mufleh M. "Modeling relational database management systems." Virtual Press, 1993. http://liblink.bsu.edu/uhtbin/catkey/865955.

Full text

Abstract:

Almost all of the database products developed over the past few years are based on what is called the relational approach.The purpose of this thesis is to characterize a relational data base management system, we do this by studying the relational model in some depth.The relational model is not static, rather it has been evolving over time. We trace the evolution of the relational model. We will also consider the ramifications of the relational model for modern database systems.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

20

Xie, Dongqing. "A Web database builder system WEBDB /." [Gainesville, Fla.] : University of Florida, 2001. http://purl.fcla.edu/fcla/etd/UFE0000365.

Full text

Abstract:

Thesis (M.S.)--University of Florida, 2001.
Title from title page of source document. Document formatted into pages; contains xi, 62 p.; also contains graphics. Includes vita. Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

21

Chen, Lijun. "A Web-based database application builder." [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE1000113.

Full text

Abstract:

Thesis (M.S.)--University of Florida, 2002.
Title from title page of source document. Document formatted into pages; contains ix, 64 p.; also contains graphics. Includes vita. Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

22

Garcia, Hong-Mei Chen. "A semantics-based methodology for integrated distributed database design: Toward combined logical and fragmentation design and design automation." Diss., The University of Arizona, 1992. http://hdl.handle.net/10150/185936.

Full text

Abstract:

The many advantages of Distributed Database (DDB) systems can only be achieved through proper DDB designs. Since designing a DDB is very difficult and expert designers are relatively few in number, "good" DDB design methodologies and associated computer-aided design tools are needed to help designers cope with design complexity and improve their productivity. Unfortunately, previous DDB design research focused on solving subproblems of data distribution design in isolation. As a result, past research on a general DDB design methodology offered only methodological frameworks that, at best, aggregate a set of non-integrated design techniques. The conventional separation of logical design from fragmentation design is problematic, but has not been fully analyzed. This dissertation presents the SEER-DTS methodology developed for the purposes of overcoming the methodological inadequacies of conventional design methodologies, resolving the DDB design problem in an integrated manner and facilitating design automation. It is based on a static semantic data model, SEER (Synthesized Extended Entity-Relationship Model) and a dynamic data model, DTS (Distributed Transaction Scheme), which together provide complete and consistent modeling mechanisms for acquiring/representing DDB design inputs and facilitating DDB schema design. In this methodology, requirement/distribution analysis and conceptual design are integrated and logical and fragmentation designs are combined. "Semantics-based" design techniques have been developed to allow for end-user design specifications and seamless design schema transformations, thereby simplifying design tasks. Towards our ultimate goal of design automation, an architectural framework for a computer-aided DDB design system, Auto-DDB, was formulated and the system was prototyped. As part of the developmental effort, a real-world DDB design case study was conducted to verify the applicability of the SEER-DTS methodology in a manual design mode. The results of a laboratory experiment showed that the SEER-DTS methodology produced better design outcomes (in terms of design effectiveness and efficiency) than a Conventional Best methodology performed by non-expert designers in an automated design mode. However, no statistically significant difference was found in user-perceived ease of use.

APA, Harvard, Vancouver, ISO, and other styles

23

Li, Xue. "Schema evolution in object-oriented databases." Thesis, Queensland University of Technology, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

24

Sun, Jimeng. "Analysis of predictive spatio-temporal queries /." View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?COMP%202003%20SUN.

Full text

Abstract:

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2003.
Includes bibliographical references (leaves 62-65). Also available in electronic version. Access restricted to campus users.

APA, Harvard, Vancouver, ISO, and other styles

25

Jermaine, Christopher. "Approximate answering of aggregate queries in relational databases." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/9221.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Pawluk, Przemyslaw. "Stream databases." Thesis, Blekinge Tekniska Högskola, Avdelningen för programvarusystem, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3644.

Full text

Abstract:

One of the most important issues in contemporary database application became processing of the large amount of data. Second problem is different characteristic of the data that are processed by the system. Those data are perceived as large continuous streams of elements rather than finite sets of elements. This thesis presents new class of database systems that handles data stream processing, issues and benefits form using these systems in the context of telecommunication systems.
This thesis presents stream databases which are able to process data streams. Moreover advantages and disadvantages of those systems are presented.
przemyslaw.pawluk@pwr.wroc.pl (+48)697-958-666

APA, Harvard, Vancouver, ISO, and other styles

27

Le, Pendu Paea Jean-Francois 1974. "Ontology databases." Thesis, University of Oregon, 2010. http://hdl.handle.net/1794/10575.

Full text

Abstract:

xi, 89 p. : ill. A print copy of this thesis is available through the UO Libraries. Search the library catalog for the location and call number.
On the one hand, ontologies provide a means of formally specifying complex descriptions and relationships about information in a way that is expressive yet amenable to automated processing and reasoning. When data are annotated using terms from an ontology, the instances inhere in formal semantics. Compared to an ontology, which may have as few as a dozen or as many as tens of thousands of terms, the annotated instances for the ontology are often several orders of magnitude larger, from millions to possibly trillions of instances. Unfortunately, existing reasoning techniques cannot scale to these sizes. On the other hand, relational database management systems provide mechanisms for storing, retrieving, and maintaining the integrity of large amounts of data. Relational database management systems are well known for scaling to extremely large sizes of data, some claiming to manage over a quadrillion data. This dissertation defines ontology databases as a mapping from ontologies to relational databases in order to combine the expressiveness of ontologies with the scalability of relational databases. This mapping is sound and, under certain conditions, complete. That is, the database behaves like a knowledge base which is faithful to the semantics of a given ontology. What distinguishes this work is the treatment of the relational database management system as an active reasoning component rather than as a passive storage and retrieval system. The main contributions this dissertation will highlight include: (i) the theory and implementation particulars for mapping ontologies to databases, (ii) subsumption based reasoning, (iii) inconsistency detection, (iv) scalability studies, and (v) information integration (specifically, information exchange). This work is novel because it is the first attempt to embed a logical reasoning system, specified by a Semantic Web ontology, into a plain relational database management system using active database technologies. This work also introduces the not-gadget , which relaxes the closed-world assumption and increases the expressive power of the logical system without significant cost. This work also demonstrates how to deploy the same framework as an information integration system for data exchange scenarios, which is an important step toward semantic information integration over distributed data repositories.
Committee in charge: Dejing Dou, Chairperson, Computer & Information Science; Zena Ariola, Member, Computer & Information Science; Christopher Wilson, Member, Computer & Information Science; Monte Westerfield, Outside Member, Biology

APA, Harvard, Vancouver, ISO, and other styles

28

Maatuk, Abdelsalam. "Migrating relational databases into object-based and XML databases." Thesis, Northumbria University, 2009. http://nrl.northumbria.ac.uk/3374/.

Full text

Abstract:

Rapid changes in information technology, the emergence of object-based and WWW applications, and the interest of organisations in securing benefits from new technologies have made information systems re-engineering in general and database migration in particular an active research area. In order to improve the functionality and performance of existing systems, the re-engineering process requires identifying and understanding all of the components of such systems. An underlying database is one of the most important component of information systems. A considerable body of data is stored in relational databases (RDBs), yet they have limitations to support complex structures and user-defined data types provided by relatively recent databases such as object-based and XML databases. Instead of throwing away the large amount of data stored in RDBs, it is more appropriate to enrich and convert such data to be used by new systems. Most researchers into the migration of RDBs into object-based/XML databases have concentrated on schema translation, accessing and publishing RDB data using newer technology, while few have paid attention to the conversion of data, and the preservation of data semantics, e.g., inheritance and integrity constraints. In addition, existing work does not appear to provide a solution for more than one target database. Thus, research on the migration of RDBs is not fully developed. We propose a solution that offers automatic migration of an RDB as a source into the recent database technologies as targets based on available standards such as ODMG 3.0, SQL4 and XML Schema. A canonical data model (CDM) is proposed to bridge the semantic gap between an RDB and the target databases. The CDM preserves and enhances the metadata of existing RDBs to fit in with the essential characteristics of the target databases. The adoption of standards is essential for increased portability, flexibility and constraints preservation. This thesis contributes a solution for migrating RDBs into object-based and XML databases. The solution takes an existing RDB as input, enriches its metadata representation with the required explicit semantics, and constructs an enhanced relational schema representation (RSR). Based on the RSR, a CDM is generated which is enriched with the RDB's constraints and data semantics that may not have been explicitly expressed in the RDB metadata. The CDM so obtained facilitates both schema translation and data conversion. We design sets of rules for translating the CDM into each of the three target schemas, and provide algorithms for converting RDB data into the target formats based on the CDM. A prototype of the solution has been implemented, which generates the three target databases. Experimental study has been conducted to evaluate the prototype. The experimental results show that the target schemas resulting from the prototype and those generated by existing manual mapping techniques were comparable. We have also shown that the source and target databases were equivalent, and demonstrated that the solution, conceptually and practically, is feasible, efficient and correct.

APA, Harvard, Vancouver, ISO, and other styles

29

Karlapalem, Kamalakar. "Redesign of distributed relational databases." Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/9173.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Zawis, John A., and David K. Hsiao. "Accessing hierarchical databases via SQL transactions in a multi-model database system." Thesis, Monterey, California. Naval Postgraduate School, 1987. http://hdl.handle.net/10945/22186.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Walpole, Dennis A., and Alphonso L. Woods. "Accessing network databases via SQL transactions in a multi-model database system." Thesis, Monterey, California. Naval Postgraduate School, 1989. http://hdl.handle.net/10945/25647.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Lloyd, Peter James. "Database use in the primary school : format-free databases and knowledge construction." Thesis, Queensland University of Technology, 1996. https://eprints.qut.edu.au/36518/1/36518_Lloyd_1996.pdf.

Full text

Abstract:

The use of computer based learning and specifically the use of databases has many positive benefits for the learning process in primary schools. The construction _of meaning, the focus on the learner and the development of self-regulatory, problem solving skills can all be enhanced through the use of databases. This study sought to evaluate the use of format-free data structures to consider their usefulness and appropriateness for knowledge construction in the primary school. The study demonstrated that the development of format-free databases was a motivational learning activity which encouraged students to develop positive educational outcomes such as reflective practices, higher order thinking skills as well as the development of students' personal knowledge bases.

APA, Harvard, Vancouver, ISO, and other styles

33

Kong, Yibing. "Security and privacy model for association databases." Access electronically, 2003. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20031126.142250/index.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Morsi, Magdi M. A. "Extensible object-oriented databases with dynamic schemas." Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/9121.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Lee, J. J. "The object-oriented database and processing of electronic warfare data." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1996. http://handle.dtic.mil/100.2/ADA303112.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Clemens, David W. "Relational database design of a shipboard ammunition inventory, requisitioning, and reporting system." Thesis, Monterey, California : Naval Postgraduate School, 1990. http://handle.dtic.mil/100.2/ADA231559.

Full text

Abstract:

Thesis (M.S. in Information Systems)--Naval Postgraduate School, June 1990.
Thesis Advisor(s): Kamel, Magdi N. Second Reader: Bhargava, Hemant K. "June 1990." Description based on signature page as viewed on October 19, 2009. Author(s) subject terms: Ammunition, database design, relational database. Includes bibliographical references (p. 163-166). Also available online.

APA, Harvard, Vancouver, ISO, and other styles

37

Stanier, C. F. "A model integrity based object-relational data model and complex data model definition framework." Thesis, Staffordshire University, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.522119.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Nulty, William Glenn. "Geometric searching with spacefilling curves." Diss., Georgia Institute of Technology, 1993. http://hdl.handle.net/1853/24520.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Willshire, Mary Jane. "The effects of inheritance on the properties of physical storage models in object oriented databases." Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/9236.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Robinson, H. M. "The capture of meaning in database administration." Thesis, University of Hertfordshire, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.234361.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Jakobovits, Rex M. "The Web interfacing repository manager : a framework for developing web-based experiment management systems /." Thesis, Connect to this title online; UW restricted, 1999. http://hdl.handle.net/1773/7007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Kern, Deborah R. "Design and implementation of the acoustic database and acoustic trainer modules for "ARGOS"." Thesis, Monterey, California : Naval Postgraduate School, 1990. http://handle.dtic.mil/100.2/ADA232052.

Full text

Abstract:

Thesis (M.S. in Computer Science)--Naval Postgraduate School, June 1990.
Thesis Advisor(s): Wu, C. Thomas. Second Reader: Lum, Vincent Y. "June 1990." Description based on signature page. DTIC Identifier(s): Software engineering, event driven multimedia database, acoustic database. Author(s) subject terms: Software engineering, event driven multimedia database, acoustic database. Includes bibliographical references (p. 96). Also available online.

APA, Harvard, Vancouver, ISO, and other styles

43

Ekberg, Albin, and Jacob Holm. "Effektiv och underhållssäker lagring av medicinsk data." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-107331.

Full text

Abstract:

Creating a database to manage medical data is not the easiest. We create a database to be used for a presentation tool that presents medical data about patients that is stored in the database. We examine which of the three databases, MySQL with relational design, MySQL with EAV design and MongoDB that are best suited for storing medical data. The analysis i performed in two steps. The first step handles the database that is most effective to retriev data. The second step examines how easy it is to change the structure of the various databases. The results show that depending on whether efficiency or maintenance is most important, different databases are the best choise. MySQL with relational design proves to be most effective while MongoDB is the easiest to maintain.

APA, Harvard, Vancouver, ISO, and other styles

44

Rogers, Brandon Lamar. "A Statistical Performance Model of Homogeneous Raidb Clusters." Diss., CLICK HERE for online access, 2005. http://contentdm.lib.byu.edu/ETD/image/etd709.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Kitinya, Sylivano Chiluli Nonga. "Relational multimedia databases." Thesis, Durham University, 1987. http://etheses.dur.ac.uk/1242/.

Full text

Abstract:

This thesis is concerned with the design and im plementation of a Relational Multimedia Database System, in short RMDBS. RMDBS is designed to efficiently use storage space and manipulate various kinds of data; attribute data, bit-m apped pictures, and program s in binary code. RMDBS is an integrated system which enables the user to manage and control operations on the different forms of data in a user friendly manner. This means that even nonexperienced users can work with the system. The work described in this thesis is novel in that a true multimedia database has been implemented within the framework of a traditional relational DBMS. Previous work in this area has concentrated either in building data base management systems for storing picture-based data or multimedia databases which are not true data base management systems. RMDBS is implemented using the Revelation data base management system.

APA, Harvard, Vancouver, ISO, and other styles

46

Abrahamsson, Emil. "Digitalt arkiv." Thesis, University of Gävle, Department of Mathematics, Natural and Computer Sciences, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:hig:diva-608.

Full text

Abstract:

Grunden för detta arbete har varit att förenkla hantering och sökning bland ritningar och förteckningar i ett ritningsarkiv. Lösningen har blivit ett webbaserat datasystem som bygger på en databas där all information lagras och är sökbar. Resultatet har blivit ett system som man oavsett var man befinner sig inom företagets nätverk ha tillgång till alla ritningar och förteckningar på ett snabbt och effektivt sätt.

APA, Harvard, Vancouver, ISO, and other styles

47

Forsberg, Mikael, and Mikael Morell. "Optimering av SQL-frågor för analys i QlikView." Thesis, Karlstad University, Division for Information Technology, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-55.

Full text

Abstract:

Huvudsyftet med detta examensarbete är att för vår uppdragsgivare ÅF:s räkning, analysera huruvida det är möjligt att, rent tidsmässigt, hämta lagrad information från en av företagets kunders databaser online samt presentera detta grafiskt, som statistisk information. Hänsyn måste tas till server- och nätverksbelastning. Vid analysen optimerade vi SQL-frågor, vilket resulterade i en minskning av den totala exekveringstiden på serversidan med 24 sekunder.

Den databasoberoende applikationen QlikView med sina inbyggda funktioner visade sig vara ett mycket användbart rapporteringsverktyg. Genom att utveckla ett grafiskt gränssnitt, tydliggjorde vi olika fråge- och svarsalternativ, vilka fungerar som underlag för sammanställning av produktionsdata.

The main purpose of this thesis is, on the behalf of ÅF, to examine how stored information can be gathered online in a timely fashion. Consideration must be taken to the server and network load. During our investigation we were able to optimize SQL queries that resulted in a reduction of the total execution time by 24 seconds at the server side. One analysis tool that was very useful during our assignment was QlikView, which turned out to be a database independent analysis and reporting tool. We have clarified some alternatives of the questions and answers by developing a graphical interface, which is the basis for putting together the information.

APA, Harvard, Vancouver, ISO, and other styles

48

Ottesen, Erik Bagge. "Similarity Search in Large Databases using Metric Indexing and Standard Database Access Methods." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2009. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9038.

Full text

Abstract:

Several methods exists for performing similarity searches quickly using metric indexing. However, most of these methods are based on main memory indexing or require specialized disk access methods. We have described and implemented a method combining standard database access methods with the LAESA Linear Approximating Eliminating Search Algorithm to perform both range and K nearest neighbour (KNN) queries using standard database access methods and relational operators. We have studied and tested various existing implementations of R-trees, and implemented the R*-tree. We also found that some of the optimizations in R*-trees was damaging to the response time at very high dimensionality. This is mostly due to the increased CPU time removing any benefit from reducing the number of disk accesses. Further we have performed comprehensive experiments using different access methods, join operators, pivot counts and range limits for both range and nearest neighbour queries. We will also implement and experiment using a multi-threaded execution environment running on several processors.

APA, Harvard, Vancouver, ISO, and other styles

49

Nagy, Victor. "Performance Analysis of Relational Databases, Object-Oriented Databases and ORM Frameworks." Thesis, Högskolan i Skövde, Institutionen för informationsteknologi, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-9528.

Full text

Abstract:

In the planning stage of web and software development, it is important to select the right tool for the job. When selecting the database to use, relational databases like MySQL is a popular choice. However, relational databases suffer by object-relational impedance mismatch. In this work we will explore the response time of relational and object-oriented databases and the overhead of ORM frameworks. This will be done by creating a web application that receives data about flights and airports from a client, which measures the response time of the databases and the entire request. It was found that MySQL has the lowest response time, while the ORM framework Hibernate adds an overhead on some of the tests while performing similar to MySQL. Db4o had the highest response time in a majority of the tests. In future works, this study could be extended by other tests or by other type of databases.

APA, Harvard, Vancouver, ISO, and other styles

50

Axhamn, Johan. "Databasskydd." Doctoral thesis, Stockholms universitet, Juridiska institutionen, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-136352.

Full text

Abstract:

The capacity to assemble, store, and make available information in databases is ever growing. This development has accelerated in recent decades, driven by the advent and increased use of digital networks. Already at an early stage, it led to demands for legal protection of databases. In most countries databases have been protected in national legislation based on copyright principles. However, this kind of protection has been regarded as insufficient. The reason for this is that copyright protection only covers the selection or arrangement of the contents of the database. By rearranging the contents, it is possible to avoid liability for copyright infringement. To address the specific needs of producers of databases, the then European community adopted a directive in 1996 on the legal protection of databases. The Directive aims to harmonise copyright protection for databases and to introduce a new, sui generis, right for the legal protection of databases. The sui generis right protects the investments in obtaining, verifying, and presenting the contents in a database. The sui generis right has been described in the literature as one of the most complex intellectual property rights ever established. Its complexity resides in the unclear relationship between the requirements for protection and the content and scope of protection. This dissertation describes, analyses, compares and systematises the legal protection for databases as provided for in the EU Database Directive – both in relation to copyright and sui generis protection, but also in relation to the intellectual property system in general and principles and rules on unfair competition. The study also describes and analyses the Directive as implemented into Swedish law. To do this, it makes use of relevant legal sources, with particular account taken of relevant sources of EU law such as the Directive itself, adjacent directives in the field of copyright and related rights, as well as unfair competition law and the case law and legal method developed by the Court of Justice of the European Union. The study also draws on underlying theories of intellectual property protection and unfair competition law, as well as arguments based on unjust enrichment and pure economic loss. The study establishes how the sui generis right serves as a legal hybrid between traditional intellectual property rights and protection against unfair competition. The structure of the right resembles traditional intellectual property rights, with requirements for protection, provisions on exclusive rights, exceptions and limitations and a term of protection. At the same time, the content and scope of protection provide measures similar to those countering unfair competition with aspects of protection against pure economic loss. The right protects against certain activities carried out in the market rather than providing protection for a traditional object of intellectual property law. When implementing the Directive, the Swedish legislator overlooked these aspects of the sui generis right, creating legal uncertainties when interpreting and applying the national legislation. The study concludes with a look forward and suggestions for future research.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Databases'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles