Pour voir les autres types de publications sur ce sujet consultez le lien suivant : LN. Data base management systems.
Thèses sur le sujet « LN. Data base management systems »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les 20 meilleures thèses pour votre recherche sur le sujet « LN. Data base management systems ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Parcourez les thèses sur diverses disciplines et organisez correctement votre bibliographie.
1
Saravanan, Mahesh. « Expressions as Data in Relational Data Base Management Systems ». ScholarWorks@UNO, 2006. http://scholarworks.uno.edu/td/500.
Texte intégralRésumé :
Numerous applications, such as publish/subscribe, website personalization, applications involving continuous queries, etc., require that user.s interest be persistently maintained and matched with the expected data. Conditional Expressions can be used to maintain user interests. This thesis focuses on the support for expression data type in relational database system, allowing storing of conditional expressions as .data. in columns of database tables and evaluating those expressions using an EVALUATE operator. With this context, expressions can be interpreted as descriptions, queries, and filters, and this significantly broadens the use of a relational database system to support new types of applications. The thesis presents an overview of the expression data type, storing the expressions, evaluating the stored expressions and shows how these applications can be easily supported with improved functionality. A sample application is also explained in order to show the importance of expressions in application context, with a comparison of the application with and without expressions.
2
Laribi, Atika. « A protection model for distributed data base management systems ». Diss., Virginia Polytechnic Institute and State University, 1985. http://hdl.handle.net/10919/53883.
Texte intégralRésumé :
Security is important for Centralized Data Base Management Systems (CDBMS) and becomes crucial for Distributed Data Base Management Systems (DDBMS) when different organizations share information. Secure cooperation can be achieved only if each participating organization is assured that the data it makes available will not be abused by other users. In this work differences between CDBMS and DDBMS that characterize the nature of the protection problem in DDBMS are identified. These differences are translated into basic protection requirements. Policies that a distributed data base management protection system should allow are described. The system proposed in this work is powerful enough to satisfy the stated requirements and allow for variations on the policies. This system is a hybrid one where both authorizations and constraints can be defined. The system is termed hybrid because it combines features of both open and closed protection systems. In addition the hybrid system, although designed to offer the flexibility of discretionary systems, incorporates the flow control of information between users, a feature found only in some nondiscretionary systems. Furthermore, the proposed system is said to be integrated because authorizations and constraints can be defined on any of the data bases supported by the system including the data bases containing the authorizations, and the constraints themselves. The hybrid system is incorporated in a general model of DDBMS protection. A modular approach is taken for the design of the model. This approach allows us to represent the different options for the model depending on the set of policy choices taken. Three levels of abstraction describing different aspects of DDBMS protection problems are defined. The conceptual level describes the protection control of the DDBMS transactions and information flows. The logical level is concerned with the interaction between the different organizations participating in the DDBMS. The physical level is involved with the architectural implementation of the logical level.Ph. D.
3
Whelan, Peter Timothy. « CAD/CAM data base management systems requirements for mechanical parts ». Diss., Georgia Institute of Technology, 1989. http://hdl.handle.net/1853/17692.
Texte intégral
4
Busack, Nancy Long. « The intelligent data object and its data base interface ». Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/9825.
Texte intégral
5
Safigan, Steve J. « A transportable natural language front-end to data base management systems ». Thesis, Virginia Tech, 1987. http://hdl.handle.net/10919/44066.
Texte intégralRésumé :
Although some success has been achieved in the design of front-end natural language processors to data base management systems, transporting the processor to various data base management systems has proven to be elusive. A transportable system must be modular; it must be able to adapt to radically different data domains; and it must be able to communicate with many different data managers. The system developed accomplishes this by maintaining its own knowledge base distinct from the target data base management system, so that no communication is needed between the natural language processor and the data manager during the parse. The knowledge base is developed by interviewing the system administrator about the structure and meaning of the elements in the target data base. The natural language processor then converts the natural language query into an unambiguous intermediate-language query, which is easily converted to P
the target query language using simple syntactic methods.Master of Science
6
Chaudhuri, Jayasri. « Rules for mapping a conceptual model onto various data base management systems ». Thesis, Aston University, 1988. http://publications.aston.ac.uk/10655/.
Texte intégralRésumé :
The design and implementation of data bases involve, firstly, the formulation of a conceptual data model by systematic analysis of the structure and information requirements of the organisation for which the system is being designed; secondly, the logical mapping of this conceptual model onto the data structure of the target data base management system (DBMS); and thirdly, the physical mapping of this structured model into storage structures of the target DBMS. The accuracy of both the logical and physical mapping determine the performance of the resulting systems. This thesis describes research which develops software tools to facilitate the implementation of data bases. A conceptual model describing the information structure of a hospital is derived using the Entity-Relationship (E-R) approach and this model forms the basis for mapping onto the logical model. Rules are derived for automatically mapping the conceptual model onto relational and CODASYL types of data structures. Further algorithms are developed for partly automating the implementation of these models onto INGRES, MIMER and VAX-11 DBMS.
7
Queiroz, Vieira Turnell M. de F. « A decision making aid system based on a small microprocessor ». Thesis, University of Bradford, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.379855.
Texte intégral
8
Yu, Ye. « ULTRA-FAST AND MEMORY-EFFICIENT LOOKUPS FOR CLOUD, NETWORKED SYSTEMS, AND MASSIVE DATA MANAGEMENT ». UKnowledge, 2018. https://uknowledge.uky.edu/cs_etds/68.
Texte intégralRésumé :
Systems that process big data (e.g., high-traffic networks and large-scale storage) prefer data structures and algorithms with small memory and fast processing speed. Efficient and fast algorithms play an essential role in system design, despite the improvement of hardware. This dissertation is organized around a novel algorithm called Othello Hashing. Othello Hashing supports ultra-fast and memory-efficient key-value lookup, and it fits the requirements of the core algorithms of many large-scale systems and big data applications. Using Othello hashing, combined with domain expertise in cloud, computer networks, big data, and bioinformatics, I developed the following applications that resolve several major challenges in the area.
Concise: Forwarding Information Base. A Forwarding Information Base is a data structure used by the data plane of a forwarding device to determine the proper forwarding actions for packets. The polymorphic property of Othello Hashing the separation of its query and control functionalities, which is a perfect match to the programmable networks such as Software Defined Networks. Using Othello Hashing, we built a fast and scalable FIB named \textit{Concise}. Extensive evaluation results on three different platforms show that Concise outperforms other FIB designs.
SDLB: Cloud Load Balancer. In a cloud network, the layer-4 load balancer servers is a device that acts as a reverse proxy and distributes network or application traffic across a number of servers. We built a software load balancer with Othello Hashing techniques named SDLB. SDLB is able to accomplish two functionalities of the SDLB using one Othello query: to find the designated server for packets of ongoing sessions and to distribute new or session-free packets.
MetaOthello: Taxonomic Classification of Metagenomic Sequences. Metagenomic read classification is a critical step in the identification and quantification of microbial species sampled by high-throughput sequencing. Due to the growing popularity of metagenomic data in both basic science and clinical applications, as well as the increasing volume of data being generated, efficient and accurate algorithms are in high demand. We built a system to support efficient classification of taxonomic sequences using its k-mer signatures.
SeqOthello: RNA-seq Sequence Search Engine. Advances in the study of functional genomics produced a vast supply of RNA-seq datasets. However, how to quickly query and extract information from sequencing resources remains a challenging problem and has been the bottleneck for the broader dissemination of sequencing efforts. The challenge resides in both the sheer volume of the data and its nature of unstructured representation. Using the Othello Hashing techniques, we built the SeqOthello sequence search engine. SeqOthello is a reference-free, alignment-free, and parameter-free sequence search system that supports arbitrary sequence query against large collections of RNA-seq experiments, which enables large-scale integrative studies using sequence-level data.
9
Khan, Abdullah. « An investigation into improving the functioning of manufacturing executions system at the Impala base metals refinery ». Thesis, Stellenbosch : University of Stellenbosch, 2009. http://hdl.handle.net/10019.1/6408.
Texte intégral
10
Wang, Yufei 1981. « An analysis of different data base structures and management systems on Clickstream data collected for advocacy based marketing strategies experiments for Intel and GM ». Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/33387.
Texte intégralRésumé :
Thesis (M. Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.Includes bibliographical references (leaves 82-83).
Marketing on the Internet is the next big field in marketing research. Clickstream data is a great contribution to analyze the effects of advocacy based marketing strategies. Handling Clickstream data becomes a big issue. This paper will look at the problems caused by Clickstream data from a database perspective and consider several theories to alleviate the difficulties. Applications of modern database optimization techniques will be discussed and this paper will detail the implementation of these techniques for the Intel and GM project.
by Yufei Wang.
M.Eng.and S.B.
11
Zhao, Ning. « Analysis of priority service systems ». Thesis, University of Macau, 2011. http://umaclib3.umac.mo/record=b1027673.
Texte intégral
12
MACEDO, VAGNER dos S. « Desenvolvimento de uma base de dados computacional para aplicação em Análise Probabilística de Segurança de reatores nucleares de pesquisa ». reponame:Repositório Institucional do IPEN, 2016. http://repositorio.ipen.br:8080/xmlui/handle/123456789/27500.
Texte intégralRésumé :
Submitted by Marco Antonio Oliveira da Silva (maosilva@ipen.br) on 2017-05-25T12:51:29Z
No. of bitstreams: 0Made available in DSpace on 2017-05-25T12:51:29Z (GMT). No. of bitstreams: 0
O objetivo deste trabalho é apresentar a base de dados que foi desenvolvida para armazenar dados técnicos e processar dados sobre operação, falha e manutenção de equipamentos dos reatores nucleares de pesquisa localizados no Instituto de Pesquisas Energéticas e Nucleares (IPEN), em São Paulo - SP. Os dados extraídos desta base poderão ser aplicados na Análise Probabilística de Segurança dos reatores de pesquisa ou em avaliações quantitativas menos complexas relacionadas à segurança, confiabilidade, disponibilidade e manutenibilidade destas instalações. Esta base de dados foi desenvolvida de modo a permitir que as informações nela contidas estejam disponíveis aos usuários da rede corporativa, que é a intranet do IPEN. Os profissionais interessados deverão ser devidamente cadastrados pelo administrador do sistema, para que possam efetuar a consulta e/ou o manuseio dos dados. O modelo lógico e físico da base de dados foi representado por um diagrama de entidades e relacionamento e está de acordo com os módulos de segurança instalados na intranet do IPEN. O sistema de gerenciamento da base de dados foi desenvolvido com o MySQL, o qual utiliza a linguagem SQL como interface. A linguagem de programação PHP foi usada para permitir o manuseio da base de dados pelo usuário. Ao final deste trabalho, foi gerado um sistema de gerenciamento de base de dados capaz de fornecer as informações de modo otimizado e com bom desempenho.
Dissertação (Mestrado em Tecnologia Nuclear)
IPEN/D
Instituto de Pesquisas Energéticas e Nucleares - IPEN-CNEN/SP
13
Malaney, Gary Douglas. « The coordination of information in a highly differentiated organization : use of a computerized relational data base system as an integrating device for monitoring graduate education / ». The Ohio State University, 1985. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487261919113367.
Texte intégral
14
Mierzwiak, Sara M. « The Development of the Contaminant Exceedance Rating System (CERS) for Comparing Groundwater Contaminant Data ». University of Toledo / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1345227410.
Texte intégral
15
SILVA, MARIA C. C. da. « O comprometimento como estratégia para a adoção de um sistema de gestão ambiental : O caso de uma instituição pública de pesquisa ». reponame:Repositório Institucional do IPEN, 2017. http://repositorio.ipen.br:8080/xmlui/handle/123456789/27970.
Texte intégralRésumé :
Submitted by Marco Antonio Oliveira da Silva (maosilva@ipen.br) on 2017-11-08T16:58:17Z
No. of bitstreams: 0Made available in DSpace on 2017-11-08T16:58:17Z (GMT). No. of bitstreams: 0
Esta tese, utilizando-se do mapa cognitivo Strategic Options Development and Analysis - SODA, se propôs a atender o objetivo nela especificado, ou seja, avaliar a importância do comprometimento organizacional para a implementação de um Sistema de Gestão Ambiental SGA por parte dos quinze Gerentes de uma Instituição Pública Federal, localizada no estado de São Paulo. Os dados que compuserem o mapa cognitivo, foram obtidos por meio de entrevista face a face, no período de maio a novembro de 2015, e de reuniões grupais com os referidos Gerentes, no período de dezembro de 2015 a março de 2016. A utilização do método de estruturação de problemas - Problem Structuring Methods (PSMs) - mapa cognitivo - SODA possibilitou investigar, as possíveis incertezas, complexidades e conflitos, voltados para o elemento comprometimento, provenientes da adoção de uma gestão ambiental, por intermédio da implementação de um Sistema de Gestão Ambiental SGA. O resultado da análise do mapa cognitivo demonstrou a importância do comprometimento organizacional quando da intenção de se adotar um Sistema de Gestão Ambiental. Diferentemente do entendimento de Barbieri (2007), o presente estudo coloca a importância desse comportamento não somente por parte da alta direção, mas também por parte de toda a equipe a ser envolvida nas atividades concernentes a tal sistema. Permitiu também a construção de um modelo de mensuração do comprometimento em relação ao Sistema de Gestão Ambiental SGA. O comprometimento mensurado por meio de referido instrumento, está dividido em dois componentes: afetivo que tem o comprometimento como um apego, como um envolvimento, onde ocorre a identificação com a empresa, funcionários com forte comprometimento afetivo permanecem na empresa porque querem, e normativo o comprometimento como uma obrigação em permanecer na organização, funcionários identificados com esse comportamento permanecem na empresa porque sentem que tem essa obrigação. O modelo de mensuração do comprometimento neste estudo sugerido, a ser validado em estudos longitudinais, permitirá mapear elementos de forma que possam observar tendências. Referido instrumento não foi validado neste estudo, no entanto sugere-se que estudos futuros, por meio de estudos longitudinais procedam sua validação.
Tese (Doutorado em Tecnologia Nuclear)
IPEN/T
Instituto de Pesquisas Energéticas e Nucleares - IPEN-CNEN/SP
16
REIS, JUNIOR JOSE S. B. « Métodos e softwares para análise da produção científica e detecção de frentes emergentes de pesquisa ». reponame:Repositório Institucional do IPEN, 2015. http://repositorio.ipen.br:8080/xmlui/handle/123456789/26929.
Texte intégralRésumé :
Submitted by Marco Antonio Oliveira da Silva (maosilva@ipen.br) on 2016-12-21T15:07:24Z
No. of bitstreams: 0Made available in DSpace on 2016-12-21T15:07:24Z (GMT). No. of bitstreams: 0
O progresso de projetos anteriores salientou a necessidade de tratar o problema dos softwares para detecção, a partir de bases de dados de publicações científicas, de tendências emergentes de pesquisa e desenvolvimento. Evidenciou-se a carência de aplicações computacionais eficientes dedicadas a este propósito, que são artigos de grande utilidade para um melhor planejamento de programas de pesquisa e desenvolvimento em instituições. Foi realizada, então, uma revisão dos softwares atualmente disponíveis, para poder-se delinear claramente a oportunidade de desenvolver novas ferramentas. Como resultado, implementou-se um aplicativo chamado Citesnake, projetado especialmente para auxiliar a detecção e o estudo de tendências emergentes a partir da análise de redes de vários tipos, extraídas das bases de dados científicas. Através desta ferramenta computacional robusta e eficaz, foram conduzidas análises de frentes emergentes de pesquisa e desenvolvimento na área de Sistemas Geradores de Energia Nuclear de Geração IV, de forma que se pudesse evidenciar, dentre os tipos de reatores selecionados como os mais promissores pelo GIF - Generation IV International Forum, aqueles que mais se desenvolveram nos últimos dez anos e que se apresentam, atualmente, como os mais capazes de cumprir as promessas realizadas sobre os seus conceitos inovadores.
Dissertação (Mestrado em Tecnologia Nuclear)
IPEN/D
Instituto de Pesquisas Energéticas e Nucleares - IPEN-CNEN/SP
17
Afyouni, Imad. « Représentation et Gestion des Connaissances dans les Environnements Intérieurs Mobiles ». Phd thesis, Université de Bretagne occidentale - Brest, 2013. http://tel.archives-ouvertes.fr/tel-00956812.
Texte intégralRésumé :
Les systèmes d'information mobiles et ambiants liés à la localisation et à la navigation évoluent progressivement vers des environnements à petite échelle. La nouvelle frontière scientifique et technologique concernent les applications qui assistent les utilisateurs dans leurs déplacements et activités au sein d'espaces bâtis dits "indoor" (e.g., aéroports, musées, bâtiments). La recherche présentée par cette thèse développe une représentation de données spatiales d'un environnement "indoor" qui tient compte des dimensions contextuelles centrées sur l'utilisateur et aborde les enjeux de gestion de données mobiles. Un modèle de données "indoor" hiérarchique et sensible au contexte est proposé. Ce modèle intègre différentes dimensions du contexte en plus de la localisation des entités concernées, telles que le temps et les profils des utilisateurs. Ce modèle est basé sur une structure arborescente dans laquelle l'information spatiale est représentée à différents niveaux d'abstraction. Cette conception hiérarchique favorise un traitement adaptatif et efficace des Requêtes Dépendantes de la Localisation (RDL) qui sont considérées comme des éléments clés pour le développement des différentes catégories de services de géolocalisation sensibles au contexte. Un langage de requêtes continues est développé et illustré par des exemples de requêtes RDL. Ce langage exploite le concept des granules spatiaux, et permet de représenter les requêtes continues et dépendantes de la localisation en prenant compte des préférences de l'utilisateur au moment de l'exécution. Cette approche de modélisation est complétée par le développement d'une architecture générique pour le traitement continu des requêtes RDL et par la conception et la mise en œuvre de plusieurs algorithmes qui permettent un traitement efficace des requêtes dépendantes de la localisation sur des objets mobiles en "indoor". Plusieurs algorithmes de traitement continu des requêtes de recherche de chemin hiérarchique et des requêtes de zone appliquées à des objets statiques et/ou en mouvement sont présentés. Ces algorithmes utilisent une approche hiérarchique et incrémentale afin d'exécuter efficacement les requêtes RDL continues. Un prototype encapsulant le modèle de données hiérarchique, les opérateurs et les contraintes introduits dans le langage de requête ainsi que les différents algorithmes et méthodes pour la manipulation de requêtes RDL a été développé comme une extension du SGBD Open Source PostgreSQL. Une étude expérimentale des solutions développées a été menée pour étudier la performance et le passage à l'échelle à l'égard des propriétés intrinsèques des solutions proposées.
18
蔡昭燕. « Mobile agents for dynamic schema replication in distributed data base management systems ». Thesis, 2004. http://ndltd.ncl.edu.tw/handle/37858469766902682575.
Texte intégral
19
Figg, P. G. « Data base optimisation for an I.C. design layout package on the VAX ». Thesis, 1987. http://hdl.handle.net/10413/6199.
Texte intégralRésumé :
The performance of an interactive graphics/computer aided design system, such as the IC layout and rule checking package implemented as part of the
schematic drawing application on the Gerber Systems Technology IDS-80, is
very closely related to the performance of the system's data base. This is due to the fact that most editing functions on an interactive graphics/CAD system are data base intensive functions and the data base and its management routines form one of the major building blocks of a CAD system. It can therefore be said that the performance of a CAD system is directly dependent on the data base access time and the efficiency of the managing routines.
The primary objective of this project was to enhance the performance of the IC
layout and rule checking package. This was done by improving the performance of the data base of the system. This was achieved by following two mutually supportive paths. The first was the transportation of the software to a new host machine which had a 32-bit processor and virtual memory capabilities. The second was to try and improve the performance of the transported data base by utilising sophisticated data base structures and memory management·techniques facilitated by the larger available memory of the new host to optimise the data base operations. The effectiveness of the two paths in achieving their respective goals was evaluated using evaluation programs which simulated characteristic data base activities.This thesis documents the above process, as well as expounds on some of the
background related theory which was instrumental in the progress of the project and the drawing of the final conclusions.Thesis (M.Sc.)-University of Natal, Durban, 1987.
20
Zare, Afifi Saharnaz. « Securing sensor network ». Thesis, 2014. http://hdl.handle.net/1805/6186.
Texte intégralRésumé :
Indiana University-Purdue University Indianapolis (IUPUI)A wireless sensor network consists of lightweight nodes with a limited power source. They can be used in a variety of environments, especially in environments for which it is impossible to utilize a wired network. They are easy/fast to deploy. Nodes collect data and send it to a processing center (base station) to be analyzed, in order to detect an event and/or determine information/characteristics of the environment. The challenges for securing a sensor network are numerous. Nodes in this network have a limited amount of power, therefore they could be faulty because of a lack of battery power and broadcast faulty information to the network. Moreover, nodes in this network could be prone to different attacks from an adversary who tries to eavesdrop, modify or repeat the data which is collected by other nodes. Nodes may be mobile. There is no possibility of having a fixed infrastructure. Because of the importance of extracting information from the data collected by the sensors in the network there needs to be some level of security to provide trustworthy information. The goal of this thesis is to organize part of the network in an energy efficient manner in order to produce a suitable amount of integrity/security. By making nodes monitor each other in small organized clusters we increase security with a minimal energy cost. To increase the security of the network we use cryptographic techniques such as: public/ private key, manufacturer signature, cluster signature, etc. In addition, nodes monitor each other's activity in the network, we call it a "neighborhood watch" In this case, if a node does not forward data, or modifies it, and other nodes which are in their transmission range can send a claim against that node.