• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1582
  • 457
  • 422
  • 170
  • 114
  • 100
  • 60
  • 49
  • 40
  • 36
  • 29
  • 23
  • 21
  • 17
  • 16
  • Tagged with
  • 3611
  • 846
  • 793
  • 741
  • 599
  • 535
  • 420
  • 397
  • 392
  • 360
  • 310
  • 302
  • 283
  • 271
  • 260
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
51

Knowledge management in Naval Sea Systems Command : a structure for performance driven knowledge management initiative /

Chan, Francis. January 2002 (has links) (PDF)
Thesis (M.S. in Product Development)--Naval Postgraduate School, September 2002. / Thesis advisor(s): Mark E. Nissen, Donald H. Steinbrecher. Includes bibliographical references (p. 113-117). Also available online.
52

Geometric filter a space and time efficient lookup table with bounded error /

Zhao, Yang. January 2009 (has links)
Thesis (M. Sc.)--University of Alberta, 2009. / Title from PDF file main screen (viewed on Sept. 8, 2009). "A thesis submitted to the Faculty of Graduate Studies and Research in partial fulfillment of the requirements for the degree of Master of Science, Department of Computing Science, University of Alberta." Includes bibliographical references.
53

Querying databases a tale of two C# approaches /

Zhang, Hao. January 2010 (has links)
Thesis (M.S.)--Villanova University, 2010. / Computer Science Dept. Includes bibliographical references.
54

A database management system to support the instance-based data model : design, implementation, and evaluation /

Su, Jianmin, January 2003 (has links)
Thesis (M.Sc.)--Memorial University of Newfoundland, 2003. / Bibliography: leaves 121-123. Also available online.
55

An audit perspective of data quality

Ramabulana, Territon 20 November 2014 (has links)
M.Com. (Computer Auditing) / Please refer to full text to view abstract
56

Information security with special reference to database interconnectivity.

Coetzee, Marijke 29 May 2008 (has links)
Information can be considered a company’s most valued asset and should be protected as such. In the past, companies allowed very limited access to corporate information. Today, the rapid growth of the Internet increases the importance of connecting to existing databases. Access to such web-enabled databases, containing sensitive information such as credit card numbers must be made available only to those who need it. The security of web-enabled databases is challenged, as huge user populations access corporate information, past traditional perimeters. Providing a secure web-enabled database environment is not as simple as creating a few dynamic pages linked to a secured database. As a web-enabled database is very sophisticated, consisting of various applications in front of the database, it is vulnerable to attack. Furthermore, since most malicious intrusions occur from inside, defences such as firewalls, intrusion detection and virus scanning provide limited protection. The principle aim of this study was to consider security services and mechanisms that would provide protection to web-enabled databases. As database security has been a well-researched topic ever since the first databases were used, it was decided to investigate whether traditional database security could possibly provide a basic framework to be used when approaching the security of web-enabled databases. An investigation was made into nine current state database security services and their associated mechanisms. Additional services and mechanisms were identified, that could provide protection in the new environment. The integrated service provided by web-enabled databases was contrasted to the service provided by current state database security. A model was developed that illustrated how these services and mechanisms could be applied to create a secure web-enabled database. The study was brought to an end with a conclusion on the security that can be attained by web-enabled databases. Further problem areas, which could be researched in the future, were touched upon briefly. / Prof. J.H.P. Eloff
57

Anti-Tamper Databases: Querying Encrypted Databases

Chung, Sun S. 09 January 2006 (has links)
No description available.
58

Dynamic data dictionary

Phillips, Robert William January 2010 (has links)
Typescript (photocopy). / Digitized by Kansas Correctional Industries
59

Definition of cross-domain indexes and ordering functions in relational algebra and its usage in relational database management systems

Pinto, Paulo Jorge Gonçalves January 2010 (has links)
In this thesis, a mathematical model that describes a “Unique Constraint Domain” is defined. Following, the “Ordered Unique Constraint Domain” is also mathematically defined. With those definitions, a cross-domain ordering is also defined. Then it is shown that relationships between tables in a Relational Database Management System can be defined in other forms than the usual ways, using cross-domain indexes, based in cross-domain ordering. It is shown that all foreign keys in a database can be transformed in indexes with the benefit of speeding data access. It is also shown that this technique is consistent with actual modeling techniques. It is shown how the index structure, with indexes defined as functions, can provide support for relationship roles. In addition, it is also shown how this can provide support for more than two tables in one relationship and for supporting special sorting order. The addition of a mathematical function to a relation that could sort that relation, demonstrating that the closure property of relations are still kept, shows that this mathematical model can be used as extension of the base relational model. Next, it is shown that with this new technique, commercial database engines should not degrade performance because all supporting structures are already present and, in some cases, a better performance might be achieved. Code for a prototype based in a Commercial Database Engine has been added, as an annex, to show how this new technique can be used.
60

Evaluating recursive relational queries modelled by networks of coroutines

Glauert, J. R. W. January 1983 (has links)
No description available.

Page generated in 0.0438 seconds