Relevant bibliographies by topics / Spatial database / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Spatial database.

Dissertations / Theses on the topic 'Spatial database'

Author: Grafiati
Published: 4 June 2021
Last updated: 11 March 2023

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

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Spatial database.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

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
2

Pfeifle, Martin. "Spatial Database Support for Virtual Engineering." Diss., lmu, 2004. http://nbn-resolving.de/urn:nbn:de:bvb:19-27018.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Yeung, Tony. "Storing Protein Structure in Spatial Database." Digital Archive @ GSU, 2005. http://digitalarchive.gsu.edu/cs_theses/8.

Full text
Abstract:
In recent years, the field of bioinformatics has exploded in a scale that is unprecedented. The amount of data generated from different genome projects demands a new and efficient way of information storage and retrieval. The analysis and management of the protein structure information has become one of the main focuses. It is well-known that a protein’s functions differ depending on its structure’s position in 3-dimensional space. Due to the fact that protein structures are exceedingly large, complex, and multi-dimensional, there is a need for a data model that can fulfill the requirements of storing protein structures in accordance to its spatial arrangement and topological relationships and, at the same time, provide tools to analyze the information stored. With the emergence of spatial database, first used in the field of Geographical Information Systems, the data model for protein structure could be based on the geographic model, as they share several similar uncanny traits. The geometry of proteins can be modeled using the spatial types provided in a spatial database. In a similar way, special geometry queries used for geographical analysis can also be used to provide information for analysis on the structure of the proteins. This thesis will explore the mechanics of extracting structural information for a protein from a flat file (PDB), storing that information into a spatial data model based on a spatial data model, and making analysis using geometric operators provided by the spatial database. The database used is Oracle 9i. Most features are provided by the Oracle Spatial package. Queries using the ideas aforementioned will be demonstrated.
APA, Harvard, Vancouver, ISO, and other styles
4

Eriksson, Ludvig. "Using IndexedDB with a spatial database." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-148355.

Full text
Abstract:
Web technologies are becoming increasingly useful with new features and the gap to native apps is narrowing. Recently, IndexedDB was added to the web standard to provide large scale storage solutions directly in the browser. Is it performant enough to be used with a spatial database? In this study, such a system is developed for Foran Sverige AB and we learn that IndexedDB indeed can be used for this purpose. Even storage demanding geospatial applications can be developed as a multi- platform system with a single codebase, all while broadening the possible audience reach by avoiding an app installation process.
APA, Harvard, Vancouver, ISO, and other styles
5

Prasher, Sham. "Query processing in multiresolution spatial databases /." [St. Lucia, Qld.], 2005. http://www.library.uq.edu.au/pdfserve.php?image=thesisabs/absthe18682.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ingemarsson, Gabriel. "Database Performance for GIS : A Comparison of Database Schemas for Measurements with Spatial Attributes." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-255022.

Full text
Abstract:
Spatial databases are becoming more and more important. One type of spatial database is a database of measurements, which combine positions with alphanumerical attributes. While these databases are important, little research has been done on them. There is therefore need for research on how to store this type of data most effectively.In this thesis a read performance benchmark and an execution plan analysis of three different database schemas using two different datasets of different size are presented. The three schemas investigated are the existing schema of the dataset, a schema where the spatial data have been split into a separate table, and a star schema. Additionally, these benchmarks were performed in two database management systems, Oracle Spatial and PostGIS.The results show that the choice of database schema has a real impact on performance, but none of the designs performs best in all cases. Star schema seems promising and may perform better than the existing schema in some cases, but more research is required to investigate further the specific cases where one schema outperforms the other. Finally, the results also show that PostGIS might perform better than Oracle Spatial for this type of data.
Spatiala databaser blir mer och mer populära. En typ av spatial databas är en databas med mätningar som kombinerar positioner med alfanumeriska attribut. Även om dessa databaser är viktiga, så har det skett ytterst lite forskning om dessa databaser. Därför finns det behov av mer forskning om hur man lagrar denna typ av data mest effektivt.I denna examensrapport presenteras en prestandamätning av läsprestanda och en exekveringsplansanalys för tre olika databasscheman på två olika datamängder av olika storlek. De tre scheman som undersöks är det existerande schemat för datamängden, ett schema där spatialdata har delats upp i en separat tabell, samt ett stjärnschema. Dessa prestandamätningar utfördes dessutom i två databashanteringssystem, Oracle Spatial och PostGIS.Resultaten visar att valet av schema påverkar prestandan, men inget schema presterar bäst i samtliga fall. Stjärnschema verkar lovande och kan i vissa fall prestera bättre än det befintliga schemat, men mer forskning krävs för att ytterligare undersöka de specifika fallen där så sker. Slutligen visar resultaten också att PostGIS kan fungera bättre än Oracle Spatial för denna typ av data.
APA, Harvard, Vancouver, ISO, and other styles
7

Tao, Yufei. "Indexing and query processing of spatio-temporal data /." View Abstract or Full-Text, 2002. http://library.ust.hk/cgi/db/thesis.pl?COMP%202002%20TAO.

Full text
Abstract:
Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2002.
Includes bibliographical references (leaves 208-215). Also available in electronic version. Access restricted to campus users.
APA, Harvard, Vancouver, ISO, and other styles
8

Liu, Qing Computer Science &amp Engineering Faculty of Engineering UNSW. "Summarization of very large spatial dataset." Awarded by:University of New South Wales. School of Computer Science and Engineering, 2006. http://handle.unsw.edu.au/1959.4/25489.

Full text
Abstract:
Nowadays there are a large number of applications, such as digital library information retrieval, business data analysis, CAD/CAM, multimedia applications with images and sound, real-time process control and scientific computation, with data sets about gigabytes, terabytes or even petabytes. Because data distributions are too large to be stored accurately, maintaining compact and accurate summarized information about underlying data is of crucial important. The summarizing problem for Level 1 (disjoint and non-disjoint) topological relationship has been well studied for the past few years. However the spatial database users are often interested in a much richer set of spatial relations such as contains. Little work has been done on summarization for Level 2 topological relationship which includes contains, contained, overlap, equal and disjoint relations. We study the problem of effective summatization to represent the underlying data distribution to answer window queries for Level 2 topological relationship. Cell-density based approach has been demonstrated as an effective way to this problem. But the challenges are the accuracy of the results and the storage space required which should be linearly proportional to the number of cells to be practical. In this thesis, we present several novel techniques to effectively construct cell density based spatial histograms. Based on the framework proposed, exact results could be obtained in constant time for aligned window queries. To minimize the storage space of the framework, an approximate algorithm with the approximate ratio 19/12 is presented, while the problem is shown NP-hard generally. Because the framework requires only a storage space linearly proportional to the number of cells, it is practical for many popular real datasets. To conform to a limited storage space, effective histogram construction and query algorithms are proposed which can provide approximate results but with high accuracy. The problem for non-aligned window queries is also investigated and techniques of un-even partitioned space are developed to support non-aligned window queries. Finally, we extend our techniques to 3D space. Our extensive experiments against both synthetic and real world datasets demonstrate the efficiency of the algorithms developed in this thesis.
APA, Harvard, Vancouver, ISO, and other styles
9

Brabec, František. "Optimizing client-server communication for remote spatial database access." College Park, Md. : University of Maryland, 2005. http://hdl.handle.net/1903/3087.

Full text
Abstract:
Thesis (Ph. D.) -- University of Maryland, College Park, 2005.
Thesis research directed by: Computer Science. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
APA, Harvard, Vancouver, ISO, and other styles
10

Valdivia, Martinez Angélica. "Implementing of G.I.S. spatial operations in a database system." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape10/PQDD_0007/MQ44308.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Valdivia, Martínez Angélica. "Implementing of G.I.S. spatial operations in a database system." Thesis, McGill University, 1998. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=20887.

Full text
Abstract:
This thesis presents a set of basic spatial operations implemented in a relational programming language. Our aim in undertaking this work was to demonstrate that a general purpose database system offers the needed flexibility for developing independent applications to manipulate spatial data. Thus, we exploited an existing Relix system by using both relational algebra functions and a relational database model.
Effectiveness, rather than high performance, is the central issue in this work. Of the two aspects (spatial and descriptive) of geographical data, we address only the spatial component. A spatial operation manipulates geometric data objects such as points, lines, and polygons. A relational data model for storing graphic data, and the spatial operations to manipulate them, are needed. For this purpose, some data models together with manipulation techniques are analyzed. We designed and implemented computational geometry vector-based algorithms such as measurements, calculations, buffers, and overlays for two-dimensional objects using relational algebra.
We also consider the important issue of interaction with commercial systems. We used other GIS such as ARC/INFO and MapInfo for data entry and display of results. Moreover, we developed C routines to communicate Relix with the GIS.
We document the usage of each operation and the relational algebra routines. We also provide examples which illustrate the operations. We conclude that the relational algebra can be effectively applied to produce spatial operations in a unified system.
APA, Harvard, Vancouver, ISO, and other styles
12

Wu, Xiaoying. "Managing Schema Evolution in a federated spatial database system." Thesis, Curtin University, 2014. http://hdl.handle.net/20.500.11937/100.

Full text
Abstract:
In a FSDBS environment, database schemas are subject to changes and the management of these changes is complex and inefficient. In this research, an Automatic Schema Evolution (ASE) Framework has been developed in order to overcome the limitation of manual modifications of applications. The main components of ASE include: Schema Element Dependency (SED), Schema Mapping, Metadata Repository and Query/View Rewriting. Combined together, they enable the management of schema evolution in a FSDBS in an automatic and transparent manner.
APA, Harvard, Vancouver, ISO, and other styles
13

Dai, Jing. "Efficient Concurrent Operations in Spatial Databases." Diss., Virginia Tech, 2009. http://hdl.handle.net/10919/28987.

Full text
Abstract:
As demanded by applications such as GIS, CAD, ecology analysis, and space research, efficient spatial data access methods have attracted much research. Especially, moving object management and continuous spatial queries are becoming highlighted in the spatial database area. However, most of the existing spatial query processing approaches were designed for single-user environments, which may not ensure correctness and data consistency in multiple-user environments. This research focuses on designing efficient concurrent operations on spatial datasets. Current multidimensional data access methods can be categorized into two types: 1) pure multidimensional indexing structures such as the R-tree family and grid file; 2) linear spatial access methods, represented by the Space-Filling Curve (SFC) combined with B-trees. Concurrency control protocols have been designed for some pure multidimensional indexing structures, but none of them is suitable for variants of R-trees with object clipping, which are efficient in searching. On the other hand, there is no concurrency control protocol designed for linear spatial indexing structures, where the one-dimensional concurrency control protocols cannot be directly applied. Furthermore, the recently designed query processing approaches for moving objects have not been protected by any efficient concurrency control protocols. In this research, solutions for efficient concurrent access frameworks on both types of spatial indexing structures are provided, as well as for continuous query processing on moving objects, for multiple-user environments. These concurrent access frameworks can satisfy the concurrency control requirements, while providing outstanding performance for concurrent queries. Major contributions of this research include: (1) a new efficient spatial indexing approach with object clipping technique, ZR+-tree, that outperforms R-tree and R+-tree on searching; (2) a concurrency control protocol, GLIP, to provide high throughput and phantom update protection on spatial indexing with object clipping; (3) efficient concurrent operations for indices based on linear spatial access methods, which form up the CLAM protocol; (4) efficient concurrent continuous query processing on moving objects for both R-tree-based and linear spatial indexing frameworks; (5) a generic access framework, Disposable Index, for optimal location update and parallel search.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
14

Yiu, Man-lung. "Advanced query processing on spatial networks." Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B36279365.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Yiu, Man-lung, and 姚文龍. "Advanced query processing on spatial networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2006. http://hub.hku.hk/bib/B36279365.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Nebiker, Stephan. "Spatial raster data management for geo-information systems : a database perspective /." Zürich, 1997. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=12374.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Xu, Kai. "Database support for multi-resolution terrain models /." St. Lucia, Qld, 2004. http://www.library.uq.edu.au/pdfserve.php?image=thesisabs/absthe17869.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Ellul, Claire Denise. "Querying topology in a 3D spatial database - functional requirements and performance optimisation." Thesis, University College London (University of London), 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.500047.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Davis, Raymond. "The spatial assessment of environmental engineering systems using database generated design algorithms." Thesis, Queen's University Belfast, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.356878.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Lim, Heechul. "Evaluation of Shortest Path Query Algorithm in Spatial Databases." Thesis, University of Waterloo, 2003. http://hdl.handle.net/10012/1085.

Full text
Abstract:
Many variations of algorithms for finding the shortest path in a large graph have been introduced recently due to the needs of applications like the Geographic Information System (GIS) or Intelligent Transportation System (ITS). The primary subjects of those algorithms are materialization and hierarchical path views. Some studies focus on the materialization and sacrifice the pre-computational costs and storage costs for faster computation of a query. Other studies focus on the shortest-path algorithm, which has less pre-computation and storage but takes more time to compute the shortest path. The main objective of this thesis is to accelerate the computation time for the shortest-path queries while keeping the degree of materialization as low as possible. This thesis explores two different categories: 1) the reduction of the I/O-costs for multiple queries, and 2) the reduction of search spaces in a graph. The thesis proposes two simple algorithms to reduce the I/O-costs, especially for multiple queries. To tackle the problem of reducing search spaces, we give two different levels of materializations, namely, the boundary set distance matrix and x-Hop sketch graph, both of which materialize the shortest-path view of the boundary nodes in a partitioned graph. Our experiments show that a combination of the suggested solutions for 1) and 2) performs better than the original Disk-based SP algorithm [7], on which our work is based, and requires much less storage than HEPV [3].
APA, Harvard, Vancouver, ISO, and other styles
21

Polách, Ondřej. "Prostorové rozšíření objektové databáze." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2012. http://www.nusl.cz/ntk/nusl-236607.

Full text
Abstract:
Still increasing requirements are made on database systems, because users need to work with still more complex data. Because of the historical development of database systems, post-relational database systems are mainly used today. As follows from their name, post-relational database systems are built on relational database systems and expand them so that they are able to work with complex data. The vast majority of today's spatial database systems is based on post-relational databases. However, this work is trying to find a connection between object and spatial databases. The obtained knowledge is reflected in the implementation of the object database spatial extension.
APA, Harvard, Vancouver, ISO, and other styles
22

Faisal, Behadili Suhad. "Adaptative modeling of urban dynamics with mobile phone database." Thesis, Le Havre, 2016. http://www.theses.fr/2016LEHA0017/document.

Full text
Abstract:
Dans cette étude, on s’intéresse à l’étude de la mobilité urbaine à partir de traces de données de téléphonie mobile qui ont été fournies par l’opérateur Orange. Les données fournies concernent la région de la ville de Rouen, durant un événement éphémère qui est l’Armada de 2008. Dans une première étude, on gère une masse importante de données pour extraire des caractéristiques permettant de qualifier des usages de la ville lors d’évènements éphémères, en fonctions des jours d’activités ou de repos des individus. Des visualisations sont données et permettent de comprendre les mobilités engendrées de manière spécifique ou non par l’événement. Dans une seconde partie, on s’intéresse à la reconstitution de trajectoires avec des approches agrégées inspirées des techniques de physique statistique afin de dégager des comportements en fonction des périodes d’activités et d’un découpage spatial en grandes zones urbaines. On tente ainsi de dégager des lois en observant des distributions en loi de puissance caractéristiques de la complexité des systèmes étudiés
In this study, we are interested in the study of urban mobility from traces of mobile data that were provided by the operator Orange. The data provided relate to the region of the city of Rouen, during an ephemeral event that is the Armada of 2008. In a first study, a large amount of data is managed to extract characteristics allowing to qualify the uses of the city during ephemeral events, depending on the days of activity of the individuals. Visualizations are given and make it possible to understand the mobilities generated in a specific way during the event. In the second part, we study the reconstruction of trajectories with aggregated approaches inspired by statistical physics techniques in order to reveal behaviors according to periods of activity and a spatial division in large urban areas. In order to obtain the general mobility law by observing distributions in power law characteristic for the studied complex system
APA, Harvard, Vancouver, ISO, and other styles
23

Gunadasa, Ankumbure Dewayalage. "Spatial database integration, a GIS approach, a case study from Colombo, Sri Lanka." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape9/PQDD_0022/NQ39534.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Terry, Ina M. "The Ohio Pleistocene Mammal Database (OPMDB): Creation and Preliminary Taphonomic and Spatial Analyses." Bowling Green State University / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1377456136.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Zhang, Chengyang. "Toward a Data-Type-Based Real Time Geospatial Data Stream Management System." Thesis, University of North Texas, 2011. https://digital.library.unt.edu/ark:/67531/metadc68070/.

Full text
Abstract:
The advent of sensory and communication technologies enables the generation and consumption of large volumes of streaming data. Many of these data streams are geo-referenced. Existing spatio-temporal databases and data stream management systems are not capable of handling real time queries on spatial extents. In this thesis, we investigated several fundamental research issues toward building a data-type-based real time geospatial data stream management system. The thesis makes contributions in the following areas: geo-stream data models, aggregation, window-based nearest neighbor operators, and query optimization strategies. The proposed geo-stream data model is based on second-order logic and multi-typed algebra. Both abstract and discrete data models are proposed and exemplified. I further propose two useful geo-stream operators, namely Region By and WNN, which abstract common aggregation and nearest neighbor queries as generalized data model constructs. Finally, I propose three query optimization algorithms based on spatial, temporal, and spatio-temporal constraints of geo-streams. I show the effectiveness of the data model through many query examples. The effectiveness and the efficiency of the algorithms are validated through extensive experiments on both synthetic and real data sets. This work established the fundamental building blocks toward a full-fledged geo-stream database management system and has potential impact in many applications such as hazard weather alerting and monitoring, traffic analysis, and environmental modeling.
APA, Harvard, Vancouver, ISO, and other styles
26

Szkandera, Jan. "TSQL2 interpret nad post-relačními databázemi v Oracle Database." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2011. http://www.nusl.cz/ntk/nusl-236923.

Full text
Abstract:
This thesis focuses on temporal databases and their multimedia and spatial extensions. The introduction of this work summarizes results in the area of research of temporal databases - key concepts of a TSQL2 language and post-relational extension of Oracle database are introduced. Main part of the thesis is design of an interpreter as a layer between user application and relational database.  In the next part of the thesis control of integrity constraints in temporal databases are discussed. Result of this work is functional interpreter of TSQL2 language able to store post-relational data.
APA, Harvard, Vancouver, ISO, and other styles
27

Kanani, Saleh. "A method to evaluate database management systems for Big Data : focus on spatial data." Thesis, Luleå tekniska universitet, Datavetenskap, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-74172.

Full text
Abstract:
Big data of type spatial is growing exponentially with the highest rate due to extensive growth in usage of sensors, IoT and mobile devices’ spatial data generation, therefore maintaining, processing and using such data efficiently, effectively with high performance has become one of the top priorities for Database management system providers, hence spatial database features and datatypes have become serious criteria in evaluating database management systems that are supposed to work as the back-end for spatial applications and services. With exponential growth of data and introducing of new types of data, “Big Data” has become strongly focused area that has gained the attention of different sectors e.g. academia, industries and governments to other organizations and studies. The rising trend in high resolution and large-scale geographical information systems have resulted in more companies providing location-based applications and services, therefore finding a proper database management system solution that can support spatial big data features, with multi-model big data support that is reliable and affordable has become a business need for many companies. Concerning the fact that choosing proper solution for any software project can be crucial due to the total cost and desired functionalities that any product could possibly bring into the solution. Migration is also a very complicated and costly procedure that many companies should avoid, which justifies the criticality of choosing the right solution based on the specific needs of any organization. Companies providing spatial applications and services are growing with the common concern of providing successful solutions and robust services. One of the most significant elements that ensures services’ and hence the providers’ reputation and positive depiction is services’ high availability. The possible future work for the thesis could be to develop the framework into a decision support solution for IT businesses with emphasize on spatial features. Another possibility for the future works would be to evaluate the framework by testing the evaluation framework on many other different DBMSs.
APA, Harvard, Vancouver, ISO, and other styles
28

Bogorny, Vania. "Enhancing spatial association rule mining in geographic databases." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2006. http://hdl.handle.net/10183/7841.

Full text
Abstract:
A técnica de mineração de regras de associação surgiu com o objetivo de encontrar conhecimento novo, útil e previamente desconhecido em bancos de dados transacionais, e uma grande quantidade de algoritmos de mineração de regras de associação tem sido proposta na última década. O maior e mais bem conhecido problema destes algoritmos é a geração de grandes quantidades de conjuntos freqüentes e regras de associação. Em bancos de dados geográficos o problema de mineração de regras de associação espacial aumenta significativamente. Além da grande quantidade de regras e padrões gerados a maioria são associações do domínio geográfico, e são bem conhecidas, normalmente explicitamente representadas no esquema do banco de dados. A maioria dos algoritmos de mineração de regras de associação não garantem a eliminação de dependências geográficas conhecidas a priori. O resultado é que as mesmas associações representadas nos esquemas do banco de dados são extraídas pelos algoritmos de mineração de regras de associação e apresentadas ao usuário. O problema de mineração de regras de associação espacial pode ser dividido em três etapas principais: extração dos relacionamentos espaciais, geração dos conjuntos freqüentes e geração das regras de associação. A primeira etapa é a mais custosa tanto em tempo de processamento quanto pelo esforço requerido do usuário. A segunda e terceira etapas têm sido consideradas o maior problema na mineração de regras de associação em bancos de dados transacionais e tem sido abordadas como dois problemas diferentes: “frequent pattern mining” e “association rule mining”. Dependências geográficas bem conhecidas aparecem nas três etapas do processo. Tendo como objetivo a eliminação dessas dependências na mineração de regras de associação espacial essa tese apresenta um framework com três novos métodos para mineração de regras de associação utilizando restrições semânticas como conhecimento a priori. O primeiro método reduz os dados de entrada do algoritmo, e dependências geográficas são eliminadas parcialmente sem que haja perda de informação. O segundo método elimina combinações de pares de objetos geográficos com dependências durante a geração dos conjuntos freqüentes. O terceiro método é uma nova abordagem para gerar conjuntos freqüentes não redundantes e sem dependências, gerando conjuntos freqüentes máximos. Esse método reduz consideravelmente o número final de conjuntos freqüentes, e como conseqüência, reduz o número de regras de associação espacial.
The association rule mining technique emerged with the objective to find novel, useful, and previously unknown associations from transactional databases, and a large amount of association rule mining algorithms have been proposed in the last decade. Their main drawback, which is a well known problem, is the generation of large amounts of frequent patterns and association rules. In geographic databases the problem of mining spatial association rules increases significantly. Besides the large amount of generated patterns and rules, many patterns are well known geographic domain associations, normally explicitly represented in geographic database schemas. The majority of existing algorithms do not warrant the elimination of all well known geographic dependences. The result is that the same associations represented in geographic database schemas are extracted by spatial association rule mining algorithms and presented to the user. The problem of mining spatial association rules from geographic databases requires at least three main steps: compute spatial relationships, generate frequent patterns, and extract association rules. The first step is the most effort demanding and time consuming task in the rule mining process, but has received little attention in the literature. The second and third steps have been considered the main problem in transactional association rule mining and have been addressed as two different problems: frequent pattern mining and association rule mining. Well known geographic dependences which generate well known patterns may appear in the three main steps of the spatial association rule mining process. Aiming to eliminate well known dependences and generate more interesting patterns, this thesis presents a framework with three main methods for mining frequent geographic patterns using knowledge constraints. Semantic knowledge is used to avoid the generation of patterns that are previously known as non-interesting. The first method reduces the input problem, and all well known dependences that can be eliminated without loosing information are removed in data preprocessing. The second method eliminates combinations of pairs of geographic objects with dependences, during the frequent set generation. A third method presents a new approach to generate non-redundant frequent sets, the maximal generalized frequent sets without dependences. This method reduces the number of frequent patterns very significantly, and by consequence, the number of association rules.
APA, Harvard, Vancouver, ISO, and other styles
29

Tonner, Tobias W. W. "A spatial database for the Later Stone Age site 'Dunefield Midden', (Western Cape, South Africa)." Master's thesis, University of Cape Town, 2003. http://hdl.handle.net/11427/4183.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Zhang, Jingxiong. "A surface-based approach to the handling of uncertainties in an urban-orientated spatial database." Thesis, University of Edinburgh, 1997. http://hdl.handle.net/1842/21629.

Full text
Abstract:
The work presented in this thesis is built on three assertions: (1) uncertainties should be perceived as integral components of GIS spatial databases; (2) as such and given the importance of uncertainties at all stages of processing spatial data by digital methods, an integrating strategy is needed to provide more direct access to the uncertainties of spatial data during data collection, update, spatial analysis and during the creation of output products; (3) surface-based models and methods are capable of such an integral strategy, by which many kinds of uncertainties of spatial data can be well represented and handled. A cumulative description is given of various uncertainties occurring in geographical abstraction and spatial data acquisitions with special reference to one common area of geographical studies, that is, land cover mapping. Two alternative forms of geographical abstraction or spatial data modelling are introduced: discrete objects and continuous fields. The uncertainties are then discussed with respect to their description, estimation and representation under object and field perspectives. For categorical data, in particular, uncertainties are represented as fuzzy surfaces, whose derivation and analysis are described in detail. To provide an evaluation of the integrated approach and to show how such an integrated strategy can be used to advantage, a case study is developed in the context of suburban land cover mapping, based on a local Edinburgh area. The case study begins with the construction of a co-registered hierarchy of test data with a corresponding hierarchy of accuracies, and continues to the generation and analysis of fuzzy surfaces using the suite of methods introduced previously. The various graphical maps and quantitative data produced show that surface based approaches are well suited to the representation and handling of uncertainties of spatial data, because they are effective and flexible.
APA, Harvard, Vancouver, ISO, and other styles
31

Dickinson, Matthew G. Musser Dale Roy. "Architecting the spatial enablement of a film location database for enhanced geographic analysis and query." Diss., Columbia, Mo. : University of Missouri-Columbia, 2009. http://hdl.handle.net/10355/6729.

Full text
Abstract:
The entire thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file; a non-technical public abstract appears in the public.pdf file. Title from PDF of title page (University of Missouri--Columbia, viewed on March 19, 2010). Thesis advisor: Dr. Dale R. Musser. Includes bibliographical references.
APA, Harvard, Vancouver, ISO, and other styles
32

Hedefalk, Finn. "Robustness of Spatial Databases: Using Network Analysis on GIS Data Models." Thesis, University of Gävle, Department of Technology and Built Environment, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:hig:diva-6625.

Full text
Abstract:

Demands on the quality and reliability of Volunteered Geographic Information have increased because of its rising popularity. Due to the less controlled data entry, there is a risk that people provide false or inaccurate information to the database. One factor that affects the effect of such updates is the network structure of the database schema, which might reveal the database’s robustness against different kinds of false updates. Therefore, network analyses are needed. The aim is to analyse GIS data models, stored in UML class diagrams, for scale-free and small-world properties. Moreover, a robustness analysis is to be carried out on selected data models in order to find out their error and attack tolerance against, for example, false updates. Three graphs were specified from the UML class diagrams: (1) class graphs: classes as nodes and their interactive relationships as connections; (2) attribute graphs: classes and attributes as nodes, with connections between the classes and their attributes; and (3) schema graphs: attributes as nodes and their interactive relationships inside and outside the tables as links. The analysed class diagrams were stored in XMI, and therefore transformed with XSLT to the Pajek network format. Thereafter, small-world and scale-free analyses as well as a robustness analysis were performed on the graphs. 

The results from the scale-free analyses showed no strict power-laws. Nevertheless, the classes’ relationships and attributes, and the betweenness in the schema graphs were long-tailed distributed. Furthermore, the schema graphs had small-world properties, and the analysed class and schema graphs were robust against errors but fragile against attacks. In a network structure perspective, these results indicate that false updates on random tables of a database should usually do little harm, but falsely updating the most central cells or tables may cause big damage. Consequently, it may be necessary to monitor and constrain sensitive cells and tables in order to protect them from attacks

APA, Harvard, Vancouver, ISO, and other styles
33

Toups, Matthew A. "A study of three paradigms for storing geospatial data: distributed-cloud model, relational database, and indexed flat file." ScholarWorks@UNO, 2016. http://scholarworks.uno.edu/td/2196.

Full text
Abstract:
Geographic Information Systems (GIS) and related applications of geospatial data were once a small software niche; today nearly all Internet and mobile users utilize some sort of mapping or location-aware software. This widespread use reaches beyond mere consumption of geodata; projects like OpenStreetMap (OSM) represent a new source of geodata production, sometimes dubbed “Volunteered Geographic Information.” The volume of geodata produced and the user demand for geodata will surely continue to grow, so the storage and query techniques for geospatial data must evolve accordingly. This thesis compares three paradigms for systems that manage vector data. Over the past few decades these methodologies have fallen in and out of favor. Today, some are considered new and experimental (distributed), others nearly forgotten (flat file), and others are the workhorse of present-day GIS (relational database). Each is well-suited to some use cases, and poorly-suited to others. This thesis investigates exemplars of each paradigm.
APA, Harvard, Vancouver, ISO, and other styles
34

Dvořáček, Ondřej. "Dotazování nad časoprostorovými daty pohybujících se objektů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2009. http://www.nusl.cz/ntk/nusl-236692.

Full text
Abstract:
This master's thesis is devoted to the studies of possibilities, which can be used for representation of moving objects data and for querying such spatio-temporal data. It also shows results of the master's thesis created by Ing. Jaroslav Vališ, that should be used for the solution of this master's thesis. But based on the theoretical grounds defined at the beginning of this work was designed and implemented new database extension for saving and querying spatio-temporal data. Special usage of this extension is demonstrated in an example application. This application uses the database extension for the implementation of its own database functions that are domain specific. At the conclusion, there are presented ways of the farther development of this database extension and the results of this master's thesis are there set into the context of the following project, doctoral thesis "Moving objects database".
APA, Harvard, Vancouver, ISO, and other styles
35

Gunay, Serkan. "Spatial Information System For Conservation Ofhistoric Buildings Case Study: Doganlar Church Izmir." Master's thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/12608388/index.pdf.

Full text
Abstract:
Conservation of historic buildings requires comprehensive and correct information of buildings to be analyzed in conservation decision making process in a systematic and rational approach. Geographical Information Systems (GIS) are advantageous in such cases which can be defined as computer based systems for handling geographical and spatial data. GIS have the potential to support the conservation decision making process with their storing, analyzing and monitoring capabilities. Therefore, information systems like GIS can be seen as a potential significant instrument for dealing with the conservation projects. This thesis aims to analyze the transformation process of the data collected in conservation process into practical information in order to adapt this process to a spatial information system. In this context, use of Geographical Information Systems is tested in the process of historic building conservation on spatial information system designed for Doganlar Church izmir chosen as the case study. Hence the advantages and disadvantages of local information systems in conservation decision making process of historic buildings can be criticized.
APA, Harvard, Vancouver, ISO, and other styles
36

Bidoshi, Kosta. "A database system as a tool for comparing, updating, and conflating spatial data from DLG and GPSVan." The Ohio State University, 1995. http://rave.ohiolink.edu/etdc/view?acc_num=osu1399557538.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Stock, Kristin Mary. "A new method for representing and translating the semantics of hetrogenous spatial databases." Thesis, Queensland University of Technology, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
38

Mastros, James Lee. "Measuring Community Consensus in Facial Characterization Using Spatial Databases and Fuzzy Logic." VCU Scholars Compass, 2005. http://scholarscompass.vcu.edu/etd/683.

Full text
Abstract:
Spatial databases store geometric objects and capture spatial relationships that can be used to represent key features of the human face. One can search spatial databases for these objects, and seek the relationships between them, using fuzzy logic to provide a natural way to describe the human face for the purposes of facial characterization. This study focuses on community perception of short, average, or long nose length. Three algorithms were used to update community opinion of nose length. All three methods showed similar trends in nose length classification which could indicate that the effort to extract spatial data from images to classify nose length is not as crucial as previously thought since community consensus will ultimately give similar results. However, additional testing with larger groups is needed to further validate any conclusion that spatial data can be eliminated.
APA, Harvard, Vancouver, ISO, and other styles
39

ívarsson, Óli. "Improved Combat Tactics of AI Agents in Real-Time Strategy Games Using Qualitative Spatial Reasoning." Thesis, University of Skövde, School of Humanities and Informatics, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-956.

Full text
Abstract:

Real-time strategy (RTS) games constitute one of the largest game genres today and have done so for the past decade. A central feature of real-time strategy games is opponent AI which is suggestively the “last frontier” of game development because the focus of research has primarily been on other components, graphics in particular. This has led to AI research being largely ignored within the commercial game industry but several methods have recently been suggested for improving the strategic ability of AI agents in real-time strategy games.

The aim of this project is to evaluate how a method called qualitative spatial reasoning can improve AI on a tactical level in a selected RTS game. An implementation of an AI agent that uses qualitative spatial reasoning has been obtained and an evaluation of its performance in an RTS game example monitored and analysed.

The study has shown that qualitative spatial reasoning affects AI agent’s behaviour significantly and indicates that it can be used to deduce a rule-base that increases the unpredictability and performance of the agent.

APA, Harvard, Vancouver, ISO, and other styles
40

Wiseman, Alec. "GRT: Global R-Trees." The Ohio State University, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=osu1372420134.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Pesti, Peter. "Novel spatial query processing techniques for scaling location based services." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/45844.

Full text
Abstract:
Location based services (LBS) are gaining widespread user acceptance and increased daily usage. GPS based mobile navigation systems (Garmin), location-related social network updates and "check-ins" (Facebook), location-based games (Nokia), friend queries (Foursquare) and ads (Google) are some of the popular LBSs available to mobile users today. Despite these successes, current user services fall short of a vision where mobile users could ask for continuous location-based services with always-up-to-date information around them, such as the list of friends or favorite restaurants within 15 minutes of driving. Providing such a location based service in real time faces a number of technical challenges. In this dissertation research, we propose a suite of novel techniques and system architectures to address some known technical challenges of continuous location queries and updates. Our solution approaches enable the creation of new, practical and scalable location based services with better energy efficiency on mobile clients and higher throughput at the location servers. Our first contribution is the development of RoadTrack, a road network aware and query-aware location update framework and a suite of algorithms. A unique characteristic of RoadTrack is the innovative design of encounter points and system-defined precincts to manage the desired spatial resolution of location updates for different mobile clients while reducing the complexity and energy consumption of location update strategies. The second novelty of this dissertation research is the technical development of Dandelion data structures and algorithms that can deliver superior performance for the periodic re-evaluation of continuous road-network distance based location queries, when compared with the alternative of repeatedly performing a network expansion along a mobile user's trajectory. The third contribution of this dissertation research is the FastExpand algorithm that can speed up the computation of single-issue shortest-distance road network queries. Finally, we have developed the open source GT MobiSim mobility simulator, a discrete event simulation platform to generate realistic driving trajectories for real road maps. It has been downloaded and utilized by many to evaluate the efficiency and effectiveness of the location query and location update algorithms, including the research efforts in this dissertation.
APA, Harvard, Vancouver, ISO, and other styles
42

Baybas, Gizem. "Spatial Decision Support System For Archaeological Application: A Case Study For Kaunos Archaeological Site." Master's thesis, METU, 2013. http://etd.lib.metu.edu.tr/upload/12615648/index.pdf.

Full text
Abstract:
Geographically located materials are used by the archaeology to analyze and explain the socio-cultural aspects of ancient life. Thus, Geographical Information Systems (GIS) have started to be used in archaeology for many applications. Although, cooperation of GIS and archaeology is considered as beneficial, it has become insufficient to meet the requirements of archaeologists about excavation study. Therefore, the aim of this thesis is to develop Spatial Decision Support System (SDSS) which includes both the GIS tools and analyses and
analytical modeling capabilities in order to satisfy the needs of archaeologists. Moreover, to develop a specialized system for specific archaeological excavation site is aimed. In this study, Kaunos is selected as a case study area and in order to furnish this aim, firstly, needs of archaeologists working in the excavation study of Kaunos are analyzed. Secondly, GIS tools and analyses are determined which meet the requirements of archaeologists. Finally, SDSS for Kaunos Archaeological Excavation Site is developed. It is composed of four components namely
Database Management, Model Management, Dialog Management and Stakeholder Components. Analyses are conducted under the Model Management Component and results are visualized in Dialog Management Component. Result maps help and assist archaeologists in terms of interpreting and examining the socio-cultural, economical and demographical characteristics of Kaunos.
APA, Harvard, Vancouver, ISO, and other styles
43

Pandey, Varun [Verfasser], Alfons [Akademischer Betreuer] Kemper, Alfons [Gutachter] Kemper, Florian [Gutachter] Matthes, and Mohamed Sarwat Abdelghany Aly [Gutachter] Elsayed. "Advancing Spatial Analytical Database Systems / Varun Pandey ; Gutachter: Alfons Kemper, Florian Matthes, Mohamed Sarwat Abdelghany Aly Elsayed ; Betreuer: Alfons Kemper." München : Universitätsbibliothek der TU München, 2021. http://d-nb.info/1239812469/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Sebake, Malete Daniel. "Assessing the motivators and barriers of interorganizational GIS data sharing for address data in South Africa." Diss., University of Pretoria, 2012. http://hdl.handle.net/2263/24514.

Full text
Abstract:
Address data within geographic information systems (GIS) is used as reference data to link personal and administrative information, thus making it possible to locate and deliver goods and services to eligible persons. Preferably, every country must develop and maintain a single national address database (NAD) to eliminate data redundancy and provide a common point of reference across the board. In South Africa, the challenge is that there are separate address databases, which are developed and maintained by various public and private organizations – with little or no cooperation on data sharing. Currently, the establishment of a Committee for Spatial Information (CSI) which is tasked with the implementation of the South African Spatial Data Infrastructure (SASDI) and the publication of the South African Address Standard (SANS 1883) offer organizations an opportunity to collaborate towards the creation of a single address dataset. This research posits that the implementation of a successful data sharing initiative depends on the understanding of motivators and barriers of organizations participating in it. The research applied the case study method – with a semi-structured questionnaire – to assess the issues that motivate or obstruct GIS data sharing among three address organizations in South Africa. The results identified significant motivators that underlie the data sharing activities, e.g. reduced cost of data collection, improved data quality; and equally identified significant barriers that make organizations reluctant to enter into a data sharing initiative, e.g. data copyright and ownership, high staff-turnover, and lack of financial and technical resources. Although the case studies focused on address data in South Africa, the research findings can equally apply to other spatial datasets and are relevant for the successful implementation of the South African Spatial Data Infrastructure (SASDI).
Dissertation (MIT)--University of Pretoria, 2012.
Computer Science
Unrestricted
APA, Harvard, Vancouver, ISO, and other styles
45

Mangiameli, Michele. "Navigation systems for autonomous robots based on open source gis technologies." Doctoral thesis, Università di Catania, 2013. http://hdl.handle.net/10761/1302.

Full text
Abstract:
Man has always dreamed of building artificial beings, which take over tedious or dangerous tasks, with abilities of entertainment and subject to human commands. In everyday language, these artificial beings are called robots . Robots are characterized for the capability to act in the environment using a mechanical locomotion system and to interact with the objects present in the environment using a handling system , or a perceptive capacity to measure parameters relating to their internal state using proprioceptive sensors, and to measure external parameters, using exteroceptive sensors, and the capability to establish an intelligent link between perceptions and actions, using a control system that works taking into account the mechanical constraints of the robot with respect to those inside the environment.There are two fundamental aspects for mobile robotics: the estimation of the robot position in the operating environment and the robotic mapping to acquire spatial models of the physical environment.This aspect is very serious when the operating environment of the robot is unknown. The mapping problem is generally considered as one of the most important challenges in the pursuit of building truly autonomous mobile robots, because it requires the integration of information gathered by the robots sensors into a given representation. So the two central aspects in mapping are the representation of the environment and the interpretation of sensor data. To acquire a map and to estimate its position, a robot should be equipped with sensors that enable it to perceive the outside world. Common sensors usable for this task include cameras, range finders using sonar, laser, and infrared technologies, radar, tactile sensors, compasses, laser scanner and GPS for outdoor applications.The navigation of a robot in an environment for reaching a goal requires the solution of three tasks: mapping, localization, and path planning. In this PhD thesis is the management of the navigation for autonomous mobile robots in outdoor environments using geographic information systems. This technology can be seen as an extension of classical topography but uses advanced functionality for the management of any type of information as a reference spatial and temporal in software environment.The GIS environment has a layered architecture where the raster layer represents the cartographic base georeferenced with topographic algorithms. On the raster base, different vector layers are overlapped as sets of geometric primitives (points, lines, areas, surfaces and volumes) for the representation of real-world phenomena. For this reason, the core of this PhD thesis is the development of a navigation system for autonomous robots based on the GIS technology using cartography and maps geo-referenced with the rigorous approach of geomatics to analyze the satellite positioning data detected by the robot and to manage its navigation accurately. In particular the thesis exploited desktop GIS platforms and developed webGis platforms using free and open source software for optimizing and customizing these platforms. For managing the navigation of the robot and the spatial data, an external spatial DBMS (DataBase Management System) was also developed with free and open source technologies.This PhD thesis aims at developing a navigation system for autonomous robots based on the GIS technology using cartography and maps geo-referenced with the rigorous approach of geomatics to analyze the satellite positioning data detected by the robot and to manage its navigation accurately. In particular, the thesis exploits desktop GIS platforms and develops webGis platforms using free and open source software for optimizing and customizing these platforms. For managing the navigation of the robot and the spatial data, an external spatial DBMS (DataBase Management System) has been also developed with free and open source technologies.
APA, Harvard, Vancouver, ISO, and other styles
46

Ganpaa, Gayatri. "An R*-Tree Based Semi-Dynamic Clustering Method for the Efficient Processing of Spatial Join in a Shared-Nothing Parallel Database System." ScholarWorks@UNO, 2006. http://scholarworks.uno.edu/td/298.

Full text
Abstract:
The growing importance of geospatial databases has made it essential to perform complex spatial queries efficiently. To achieve acceptable performance levels, database systems have been increasingly required to make use of parallelism. The spatial join is a computationally expensive operator. Efficient implementation of the join operator is, thus, desirable. The work presented in this document attempts to improve the performance of spatial join queries by distributing the data set across several nodes of a cluster and executing queries across these nodes in parallel. This document discusses a new parallel algorithm that implements the spatial join in an efficient manner. This algorithm is compared to an existing parallel spatial-join algorithm, the clone join. Both algorithms have been implemented on a Beowulf cluster and compared using real datasets. An extensive experimental analysis reveals that the proposed algorithm exhibits superior performance both in declustering time as well as in the execution time of the join query.
APA, Harvard, Vancouver, ISO, and other styles
47

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
48

Večerek, Petr. "Vliv finanční krize na hodnoty finančních ukazatelů evropských společností." Master's thesis, Vysoká škola ekonomická v Praze, 2011. http://www.nusl.cz/ntk/nusl-114169.

Full text
Abstract:
Content of this thesis is displaying impact of financial crisis on values of ratios of total assets turnover, fixed assets turnover, current assets turnover, trade deficit, current liquidity, quick liquidity, immediate liquidity, return on assets, return on equity, return on sales, debt ratio and labor productivity ratio. Thesis is related to companies from industry sectors from selected countries of European Union. Data are from years 2006 to 2009. In all ratios start of financial crisis was registered. In case of turnover ratios, return ratios, debt ratio and labor productivity ratios decreased was caused by decrease of sales which was caused by financial crisis. In case of liquidity ratios of examined industry companies there was increase in values of these ratios during crisis mostly caused by increase of receivables. Generally the best values of ration from examined periods regarding industry companies had Germany, Ireland and Great Britain. The worst values were in France, Portugal and Italy. From the point of view of sectors the best values were in sector CA "Mining and quarrying of energy producing materials", E "Electricity, gas and water supply" and CB "Mining and quarrying, except of energy producing materials". The worst sectors were DC "Manufacture of leather and leather products", DD "Manufacture of wood and wood products" and DM "Manufacture of transport equipment".
APA, Harvard, Vancouver, ISO, and other styles
49

Zhang, Jun. "Nearest neighbor queries in spatial and spatio-temporal databases /." View abstract or full-text, 2003. http://library.ust.hk/cgi/db/thesis.pl?COMP%202003%20ZHANG.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Gomes, Antonio Henrique Alves. "Desenvolvimento de ferramenta de geração de mapas para uso no controle de dengue no estado de São Paulo." [s.n.], 2011. http://repositorio.unicamp.br/jspui/handle/REPOSIP/311813.

Full text
Abstract:
Orientador: Roberto Wagner Lourenço
Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Ciências Médicas
Made available in DSpace on 2018-08-17T18:34:31Z (GMT). No. of bitstreams: 1 Gomes_AntonioHenriqueAlves_M.pdf: 1070688 bytes, checksum: 85bfcee6035d625920e86eff253e48b2 (MD5) Previous issue date: 2011
Resumo: A situação epidemiológica da dengue vem se agravando no país como um todo e em particular no Estado de São Paulo. Grande quantidade de recursos são gastos na execução das ações de controle, sem considerar as diferentes vulnerabilidades do espaço urbano. O objetivo desse trabalho foi construir uma ferramenta de geração de mapas para análise das informações geradas pelas atividades desenvolvidas nas ações de controle em formato gráfico, facilitando a visualização dessas diferenças e propiciando uma melhor programação das ações. Por utilizar as informações já registradas na base de dados oficial do programa estadual e ter acesso pela internet, não necessitando de instalação de nenhum software, nem de conhecimento prévio em geotecnologias por parte dos usuários, o programa possibilita a utilização por parte de qualquer tipo de usuário. A utilização de tecnologias de código aberto possibilita ainda que interessados em aprofundar as funcionalidades do sistema participem do projeto, melhorando-o ou adequando-o a necessidades específicas
Abstract: The epidemiological situation of dengue has been worsening in the country as a whole and particularly in the state of Sao Paulo. Large amount of resources are spent on implementation of control measures, without considering the different vulnerabilities of urban space. The aim of this study was to build a tool to generate maps to analyze the information generated by activities in the control actions in a graphical format for easier viewing of these differences and providing better planning of actions. By using the information already recorded in the official database of the state program and having access the Internet, not needing to install any software, nor prior knowledge on spatial analysis by users, the software allows the use by any user. The use of open source technology also enables interested in deepening the functionality of the system participate in the project, improving it and adapting it to specific needs
Mestrado
Epidemiologia
Mestre em Saude Coletiva
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Spatial database' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography