E L

P T
Geographic Information Systems

N
Dr. Bharath Haridas Aithal
Ranbir and Chitra Gupta School of Infrastructure Design and Management,
IIT KHARAGPUR

Module 8: Database System

Lecture 36: Creating and Maintaining a database
 E L
T
 Relational Database management in MS. Access


P
What is MS. Access
 Planning and Designing a database
 Creating Maintaining a database

N
 Database operations
 Compacting
 Repairing
 Encrypting
 Securing
A computerised Data Base Management System (DBMS) is a computer application

L
that helps you store, retrieve, analyse, sort, and print information in a database.

E
In a DBMS, data is stored in a table that looks very similar to a spreadsheet.

T
The column headings are field names, and the columns are called fields.

P
The rows of data are called records.
Name Address Age Field name

N
John Tayport 25

Jane Dundee 28 Record

Field
 L
• Relational database management systems enable users to
manipulate data in most sophisticated ways without data

E
redundancy.

T
• This is achieved by defining relationships between sets of data.

P
• The relationship is a common field, such as a student
matriculation number or a course name.

N
• The data stored in each set can be retrieved and updated based on
data in the other set.


E L
P T
N Relationship between Students and Courses
 L
Excel files

T E
P
• Excel worksheets with suitable layout can be opened as tables in

N
QGIS or any other GIS software
• Most functions that do not involve changing the file will work
(sort, query)
• Tables cannot be changed or edited
 L
Excel file requirements

E
• First row must contain field headings with legal field names as defined

T
earlier
• No blank rows or formulas should be used

P
• Each column should contain only text or only numbers.

N
• It is helpful for each column to be formatted as text, numeric, etc.
 L
Decimal degrees = degrees + minutes/60 + seconds/3600
Acceptable Worksheet

E
Columns formatted as text Legal field names
or numeric

P T
N
No formulas or
blank lines

Table Source:Google
Workbooks and worksheets

L
• An Excel workbook file (.xls/Xlsx) may

E
contain more than one worksheet.
• By default there are three named

T
Sheet1, Sheet2, Sheet3
• There may be one or more named

P
worksheets.
• GIS software can only open one

N
worksheet at a time.
• You will open the workbook like a folder
and select a single worksheet
 L
What is Microsoft (MS.) Access

E
• Microsoft Access is the relational database application in Microsoft

T
Office Professional.

P
• Before we explore Access, let's recall ourselves of what a database is
and also review some basic database concepts.

N
• A database is an organised collection of information

• A telephone directory is a good example of a database.

 L
Your computer has many applications which you use each
day to accomplish your work

E
Knowing when to use Access instead of Excel (for example )

T
is important

P
Recall the purpose of a database is to store a collection of
information

N
 L
• Student attendance systems
• Student marks

E
• Library systems

T
• Customer records
• Invoicing systems

P
• Product inventory

N
“Notice that the emphasis is on data collection rather than calculation”

Although databases can be used to perform statistical calculations they

do not perform them as quickly as spreadsheet applications.
When to use Access

E L
Access can be used to perform the following tasks

T
 Organise data into manageable related units
 Enter, modify and locate data

P
 Extract subsets of data based on specific criteria
 Create custom forms and reports

N
 Automate common database tasks
 Create graphs
 Create you own database application, complete with
custom menus, dialog boxes and command buttons
 L
Components of an Access Database

E
In Access, the term database refers to a single file that
contains a collection of information

T
Each Access database consists of the following objects:

P
tables, queries, forms, reports, pages, groups, macros and
modules

N
Pages and groups will not be looked at in this lecture course
 E L
T
Tables: Stores data similar to a spreadsheet

NP
 E L
P T
N
Macros: Used to Automate
common database actions based
on user specified command and
events
 E L
T
Query: Extracts data from a
table based on user supplied

P
criteria. Queries enable you to
view fields from more than one

N
table in the same record
 E L
T
Forms: Displays data from a table or query based
on a user defined custom format.

P
Forms enable you to view, edit and print data.

N
A from can display information from more than one
table or query
 E L
T
Reports: Displays and prints data from a table or
query based on a user defined custom format.

P
We cannot edit data in a report.

N
Reports can contain information from more than one
table or query
 E L
T
Reports: Used to Automate complex operations that
macros cannot perform.

P
Modules are procedures written in Visual Basic for

N
Applications programming language
 L
Planning and Designing a Database

E
Before you create your database you should take time to plan it.

T
The time you take to design the database will be time well spent when you

P
create and maintain the database.

N
The focus should be on the data, the people who will use the database and
the tasks.
The key steps are

L
• Analyse the existing database (manual or computerised)

E
• Meet with the people who will use the database information and

T
discuss their needs

P
• Review the database tasks to be performed such as weekly reports,
data exports, sorting, data entry and analysis

N
• After you identify your data storage and retrieval needs, separate the
data into groups of common information

• These groups will become tables

Determine the types of information to be stored in each table

L
(A student table, might store matriculation number, name, address, date of
birth and telephone.) These categories of information in a table are fields

E
Look for common elements among the tables

T
(A student matriculation number would be the common element between the
student table and the enrolled table.) This common element is called a key
field.

P
Design forms and reports.
Determine criteria for queries.

N
Consider automating common database tasks, such as executing a query and
printing a report.
Review data-security issues, such as backup policies, data sharing, and
network access.
How to Create a Database

L
To create a new blank database follow these
steps:

E
i. Choose File, New Database, or choose the
Blank Database button in the Microsoft

T
Access dialog box, or choose the File
New database button in the toolbar. The

P
New Dialog box appears.
ii. In the Save In List box, select the desired

N
drive and folder.
iii. Enter a File Name for the new database
file. Access automatically assigns the
MDB/(.accdb) extension to the new
database's file name.
iv. Choose OK.
 E L
P T
N
Now access will allow you to add objects
 L
How to Maintain a Database

E
As you use your database, you will need to perform various tasks to help

T
protect it and keep it up to date.

P
Backing up your Database

N
• Like all computer data, database backups are important
because they protect you against losing critical data.

• Backing up an Access database is easy because all database

objects are kept in one file.
 L
As you add and delete objects in a database file, the file can become
fragmented and inefficient.

E
Compacting the database eliminates the fragmentation and improves

T
performance.

Compacting the file also saves storage space.

P
How often you need to compact depends on the database.

N
A database used frequently to enter new data will need regular
compacting.

A database used primarily for to look up data does not need compacting.
 L
Compacting a Database

E
To compact a database, follow these steps:

T
Close the database

P
Choose Tools, Database Utilities, Compact and Repair Database. The Database
to Compact From dialog box appears

N
Select the database file to compact and click Compact. The Compact Into dialog
box appears.
Specify the name, drive and folder for the compacted database.
Choose Save
 L
Repairing a Damaged Database

E
When you open a database, Access checks for data corruption and informs you

T
whether the database needs repaired.

P
Simply choose OK, and Access repairs the damaged file.

Data corruption means that your data has been damaged in some way.

N
Not shutting down properly and other unexpected shutdowns can lead to data
corruption.
Encrypting a Database

E L
• If you are concerned about the confidentiality of your data,
consider using the data encryption feature of Access.
• Encryption renders a file unreadable by a text editor or utility

T
program.

P
• Only Access can read your data.
• Encrypted databases run slightly slower. You can decrypt a

N
database later if you want increased speed.
 L
To encrypt or decrypt a database follow these steps:

E
• Close the database.
• Choose Tools, Security, Encrypt/Decrypt Database

T
• The Encrypt/Decrypt Database dialog box appears
•

P
Select the name of the database to be encrypted and click OK
• The Encrypt/Decrypt Database As dialog box appears.

N
• Select or type a database file name to store the encrypted database.
• Choose Ok
• Confirm the overwrite of the existing file, if applicable
 L
Securing a Database

E
Data encryption alone does not provide complete security.
• Anyone with a copy of Access could decrypt an encrypted database.

T
• Encryption combined with password protection offers better security.
• There are two ways for you to secure a database, passwords and user level

P
security. User level security allows you to create users with passwords.
• The users are organised into groups who share certain rights and privileges.

N
• These permissions are used to control access to database objects.
• This can quite elaborate and is not needed for most databases.
• The easiest way to secure a database is specify a password for each database.
 L
• To set-up a password follow these steps:

E
1)Open the database.

T
2)Choose Tools, Security, Set Database Password.

P
3)In the Password text box, type your password. Passwords are case
sensitive.

N
4)In the Verify text box, confirm your password by typing it again,
then click OK.
5)Do not forget your password.
6)You will not be access the database if you do.
 L
Summary

T
MS. Access can help you to build database

E
P
Objects and Fields
Creation of a database

N
Storage and maintaining a database
Encryption of Database
 E L
P T
N
 E L
P T
Geographic Information Systems

N
Dr. Bharath Haridas Aithal
Ranbir and Chitra Gupta School of Infrastructure Design and Management,
IIT KHARAGPUR

Module 8: Spatial analysis and SQL

Lecture 37: Spatial Query using SQL - Introduction
 E L
P T
 Structured query language (SQL)
 SQL statements

N
 Positioning and indexing
 Hashing
SQL

L
 Structured (Standard) Query Language – (pronounced SEQUEL)

E
 Developed by IBM in 1970s

T
 Now de facto and de jure standard for accessing relational databases
 Three types of usage

P
 Stand alone queries

N
 High level programming
 Embedded in other applications
Types of SQL Statements

L
 Data Definition Language (DDL)

E
• Create, alter and delete data

T
• CREATE TABLE, CREATE INDEX
 Data Manipulation Language (DML)

P
• Retrieve and manipulate data

N
• SELECT, UPDATE, DELETE, INSERT
 Data Control Languages (DCL)
• Control security of data
• GRANT, CREATE USER, DROP USER
Distributed databases

E L
 Distributed databases are special cases of decentralized database solutions.

T
 Systems with distributed databases comprises of several databases closely
integrated with assistance of network and treated as one unit.

P
 Sub databases may have different types of databases , copies of the same data

N
can be found in several of the sub databases.
 E L
 Distributed databases have special requirements with respect to common data

T
models , routines for maintaining and checking data quality.

P
 This results in system to be expensive to run.

N
 Advantages are increased reliability and access to data ,increased efficiency
,capacity and advantage of sharing resources.
Types of distributed databases

Distributed Databases

E L
P T
Homogeneous Heterogeneous

N
Non-Autonomous Federated Multi database
Autonomous
Distributed databases

L
Advantages Disadvantages

E
 Increased reliability and  Complexity of implementation

T
availability  Difficult to maintain integrity

P
 Easier expansion  Inexperience personnel
 Local autonomy  Complex design

N
 Protection of valuable data  Dependency with other software's
 Cost effective  Concurrency control challenging
 Reliable transactions  Lack of standards
 Positioning and Indexing

L
 A rational data structure will reduce storage volumes

E
 Special techniques have been developed for dividing and structuring data

T
 Generally map data are stored in single sequential files increases response time

P
 This has resulted in Indexing
 Indexing specifies the locations, so map sheets are divided into sections which

N
are distributed in such a matter as to accelerate the search
Spatial indexing

L
 Many maps tiled

E
 B-tree (Balanced)

T
 Grid indexing

P
 Quad tree: Points/regions

N
 R-tree (Based on MBR)
 L
• k-d tree - early structure used for indexing in multiple dimensions
• Each level of a k-d tree partitions the space into two

E
• choose one dimension for partitioning at the root level of the tree.
• choose another dimensions for partitioning in nodes at the next level and so

T
on, cycling through the dimensions
• In each node, approximately half of the points stored in the sub-

P
tree fall on one side and half on the other.
• Partitioning stops when a node has less than a given maximum

N
number of points
• The k-d-B tree extends the k-d tree to allow multiple child nodes for
each internal node; well-suited for secondary storage

Adapted from ©Silberschatz, Korth and Sudarshan

 L
Quadtrees

E
• Each node of a quadtree is associated with a rectangular region of

T
space; the top node is associated with the entire target space.

P
• Each non-leaf nodes divides its region into four equal sized quadrants
• Correspondingly each such node has four child nodes corresponding to the

N
four quadrants and so on

• Leaf nodes have between zero and some fixed maximum number
of points
 E L
P T
N Adapted from ©Silberschatz, Korth and Sudarshan
R-Trees

L
• R-trees are a N-dimensional extension of B+-trees, useful for

E
indexing sets of rectangles and other polygons.

T
• Supported in many modern database systems, along with
variants like R+ -trees and R*-trees.

P
• Basic idea: generalize the notion of a one-dimensional interval
associated with each B-tree node to an

N
N-dimensional interval, that is, an N-dimensional rectangle.
• Will consider only the two-dimensional case (N = 2)
• generalization for N > 2 is straightforward, although R-trees work well
only for relatively small N
 L
• A rectangular bounding box is associated with each tree node.
• Bounding box of a leaf node is a minimum sized rectangle that contains all

E
the rectangles/polygons associated with the leaf node.
• The bounding box associated with a non-leaf node contains the bounding box

T
associated with all its children.
• Bounding box of a node serves as its key in its parent node (if any)

P
• Bounding boxes of children of a node are allowed to overlap

N
• A polygon is stored only in one node, and the bounding box of the
node must contain the polygon.
• The storage efficiency or R-trees is better than that of k-d trees or quadtrees
since a polygon is stored only once.

Adapted from ©Silberschatz, Korth and Sudarshan

 E L
P T
N
 E L
P T
N Adapted from IBM
Hashing

E L
 Concept : key is used to locate data physically on the disk

T
 Each map sections is assigned a number which are listed in

P
table of pointers to storage locations

N
 The map section numbers and hence the entries in Index table
are calculated from Cartesian coordinates
Hashing function

L
 The example uses a single function called hash function

E
 Which divides the map into equal rectangles

T
 The entry into the table is done using the following formulae

P
𝐻𝑥(𝑥)=((𝑋−𝑋𝑚𝑖𝑛)/(𝑋𝑚𝑎𝑥−𝑋𝑚𝑖𝑛))∗𝑁
𝐻𝑦(𝑦)=((𝑌−𝑌𝑚𝑖𝑛)/(𝑌𝑚𝑎𝑥−𝑌𝑚𝑖𝑛))∗𝑀

N
M,N are no of grids in y and x orientations
 L
X 100 , 100
0 1 2 3

E
1 75 , 35
R1
0 30 , 70 R2

T
0,0 Y
30−0

P
𝑅1𝑥 = (100−0)(2) = 0.6=0. Index Table
CALL ADDRESS
GEOMETRIC DATA
R0

N
R1
R2
R3

Index table – enables access of data quickly once the

square has been found
 L
Multiple Criteria Queries

E
• Multiple criteria queries using AND or OR

T
“STATE” = ‘WEST BENGAL’ OR “STATE” = ‘KERALA’

P
[Value] > 5000 AND [Value] < 10000

N
• Note that the field name must be repeated for each condition
 L
Searching for partial matches

E
• We may need to find one string within another rather than an exact
match

T
• Find all customer names beginning with “Mac” or “Mc”
• Find all zip codes beginning with 6

P
• Typically uses a “wildcard” character “ ”*

N
• *Mac* or *Mc*
• 0*
 L
The Like Operator

E
• “NAME” LIKE ‘%(A)%’
• Finds all of the (A) Academicians

T
• % is the “IGNORE” wildcard

P
• Ignores Amith or Arpitha

N
• “NAME” LIKE ‘%Nagar %’
• Would find Kalyan nagar and Karunya Nagar, but not rajajinagar or
shivajinagar
 L
Query results

E
• The result of a query is result of query that meets the standard design in the query. It
may select only records that match in the table

P T
• We may use operations such as
• Export the queried shortlisted objects
• Mathematically calculate any required value

N
• Statistically determine results
• Develop outputs such as reports (cannot be modified)
Database storage rules

• Fields have specific types available

E L
T
• Must be defined before use

P
• Once defined, cannot be changed
• Naming rules

N
• No more than 13 characters
• Use only letters and numbers
• Must start with a letter
Binary data

E L
T
• Fundamental mode of computer storage
• Data are stored as a series of 0’s and 1’s representing numbers

P
in base 2 (bits)
• Bits are grouped by eight to form 1 byte.

N
 L
Storing data

E
• Text data always stored in ASCII format

T
• Numeric data may be stored in ASCII or binary format
• Binary is generally more efficient

N P
 L
Integer vs float storage

E
Scientific notation 3.2957239 x 104

T
• Binary stores whole numbers (integers)

P
• To store decimal values, the computer stores a form of
scientific notation with a mantissa and an exponent

N
• 3.2957239e04 = 32957.239
• -3.2957239e04 = -32957.239
• 3.2957239e-04 = 0.00032957239
Database storage
• Database fields typically are defined by
• ASCII vs binary type storage

E L
T
• Bytes of storage allocated
• Integer vs floating point

P
• Definition limits the values that can be stored

N
• Important to match type to storage requirements
• Try to minimize storage space while making sure all potential values
will fit in the field
Before you create a field .. Know this

L
• What kind of storage would be used to store the following kinds of data? How

E
many bytes are needed for each field?

T
• Last name

P
• Number of children in household
• Student grade point average

N
• Year of birth
• County population
• Aerial image of county
 L
Summary

T
 Structured query language (SQL)
 SQL statements

E
P
 Positioning and indexing

N
 Hashing
 Query operations
 Database Storage
 E L
P T
N
 E L
P
Geographic Information Systems
T
N
Dr. Bharath Haridas Aithal
Ranbir and Chitra Gupta School of Infrastructure Design and Management,
IIT KHARAGPUR

Module 8: Spatial analysis and SQL

Lecture 38 : Spatial analysis
 E L
P T
 Database design
 Spatial analysis

N
 Operations
 Logical
 Arithmetic
 Statistical, geometric
 Database design

L
Database design consists of three elements

E
1. Conceptual design

T
Is hardware and software independent and specifies the end user needs. Includes

P
same elements as in data structures/modeling.
2. Logical design

N
Is software dependent and sets out logical structure of the database elements.
3. Physical design
Is hardware dependent includes file structure, memory and disk space,
access and speed, among other attributes
 GIS data

L
 GIS data can be categorized into geometrical and attribute data.

E
 These data are stored in one of the four forms:
 Two separate database system, one for geometrical data and another one for

T
attribute data

P
 A single database system that stores both geometrical data and attribute data

N
 One database for geometrical data connected to several different databases for
attribute data

 Several database for geometrical data and attribute joined into one
system – distributed data solution
 GIS data

L
 System that stores the geometrical data and attribute data in two separate

E
database are known as hybrid systems.

T
 Storage of attribute and geometrical data in the same database is known as an
integrated system.

P
Geometric data

N
GIS data Hybrid systems

Attribute data
Spatial analysis

L
 Data analysis comprises of two principal phases:

E
 Choice of data

T
 Analyses of the data chosen

P
 Data may be analyzed at various levels:

N
 Data in attribute table are sorted for presentation in the reports or
for use in other computer systems
Spatial analysis

E L
 Operations are performed on geometric data, either in search mode or for
computational purposes.

T
 Arithmetic, Boolean, and statistical operations are performed in attribute tables.

P
 Geometry and attribute tables are used jointly to:
 Compile new set of data, based on original and derived attributes

N
 Compile new set of data based on the geographical relationships.
Spatial analysis

E L
 Within each of these, the operations used may be

T
 logical
 arithmetic

P
 geometric

N
 statistical
 combination of two or more of these four types
Logical operations

E L
 Set of Algebra or Boolean algebra are employed in logical searches.

T
 Set Algebra operators are : <, >, = , >=, <=, <>.
 Boolean algebra : AND, OR, NOR, and NOT.

P
 These operations are included in SQL(Structured Query Language).

N
 The use of these Boolean operation are suitable for analyzing
geographical data.
General arithmetic operations

E L
 Arithmetic operations are performed on both attribute and geometric data.
 Arithmetic operations:

T
 +

P
 -
 X

N
 
 sin, cos, tan…
Example of arithmetic operations in GIS

E L
 Reclassification of soil types, in which areas are to be converted
from acres to hectares by dividing all areas figures by 2.47.

T
 Conversion of distances along roads to diving times, by dividing all

P
distances by a specified average vehicle speed.
 The result is a new set of attributes that are useful in transportation

N
planning.
Statistical operations

E L
 Statistical operations are performed primarily on attribute data
 Statistical operations

T
 Maxima

P
 Minima
 Average

N
 Weighted average
 Frequency distribution
 Bidirectional comparison, standard deviation, multivariate, and others
Geometric operations

E L
 Operations on geometric data involve the customary arithmetic operations in
computations of distances, areas, volumes, and directions

P T
 In a raster GIS, the unit may be cell width or diagonal

N
 In transportation analysis, results may be stated in travel time or travel costs
rather than in meters or other units of lengths
Summary

E L
T
 Database design
 GIS data

P
 Various operations on data

N
 E L
P T
N
 E L
P
Geographic Information Systems
T
N
Dr. Bharath Haridas Aithal
Ranbir and Chitra Gupta School of Infrastructure Design and Management,
IIT KHARAGPUR

Module 8: Spatial analysis and SQL

Lecture 39 : Spatial analysis Contd..
 E L
P
Advanced Spatial analysis
 Classification
T
N
 Overlay
 Buffer
Classification and Reclassification

L
 The classification process involves grouping of attributes according to the limits set

E
by user.

T
 Reclassification involves changing attributes values without altering geometries.

P
 Reclassification can be compared to changing colors on a map.
 Reclassification can be used to isolate objects types.

N
 In a raster GIS, a “built-up area” characteristic may be isolated by assigning
all other areas a value zero. On plotting such data, built-up will then be
shown
Classification and Reclassification

E L
P T
N
Integrated Processing of Geometry and Attributes

L
 Integrated processing is also based on the condition that each object type (cultivated

E
land, deciduous forests, etc.) is represented both in geometry and in an attribute
table.

P T
N
Integrated Processing of Geometry and Attributes

E L
P T
N
Overlay

L
 Overlay is used in data integration and is a technical process, the results

E
on which can be used in realistic forms of spatial analysis.
 Polygon overlay

T
 Point on polygons

P
 Lines on polygons

N
 Polygon overlay is a spatial operation in which a first thematic layer
containing polygons is superimposed onto another to form a new
thematic layer.
Overlay

L
 Point on polygons: points are superimposed on the polygons.

E
 The points are then assigned the attributes of the polygons upon which they are superimposed

P T
N
Overlay

L
 Lines on polygons

TE
N P
 L
Types of overlay

E
• Union—combines and keeps all features
• Polygon-on-polygon overlay only

T
• Intersect—combines and keeps common features

P
• Points, lines, or polygons

intersect

Adapted from Maribeth H. Price

Nunion
 Intersect: keeps common

L
areas

T E
Polygon-on-polygon
overlay only
Adapted from Maribeth H. Price
NP
Union: keeps all areas
 Union example

L
Geology

T E
P
Slope class

Adapted from Maribeth H. Price

N Find combinations of geology and
slope that are high risk for
landslides
 Intersect example

L
Residential areas

TE
P
Opeche formation

Adapted from Maribeth H. Price

N
Hazards mapping

E L
P T
N
Residential areas Opeche formation Areas of both
Habitat analysis with Intersect

L
1. Use queries to isolate

E
features of interest from
input layers.

T
2. Intersect selection
layers to find common

P
areas.

N
Intersecting different geometries

L
Intersecting polygons:

E
choose polygons, lines, or
points for output

P TOutput dimension must

be less than or same as

N
lowest input dimension.

Intersecting lines:
choose lines or points

Adapted from Maribeth H. Price

Intersecting different geometries

E L
P T
N
Intersecting polygons and
lines: choose lines or points
Intersecting points with
anything else always yields
points.
Adapted from Maribeth H. Price
Dissolving

L
Dissolve lines on street name

E
Choose an attribute to dissolve on…

T
Main St
Dissolve polygons on habitat class

Adapted from Maribeth H. Price

N P
 Dissolving eliminates all of the

L
attributes in the table except the
dissolved one…

E
However, you can choose to summarize
the other attributes…

T
Avg_ crown_cov_percent
Sum_acres

NP
Adapted from Maribeth H. Price
Append

E L
Places features from one feature class into an
existing feature class of the same type.

T
Unlike union, it does not attempt to split or

P
change features. The features are simply
brought in.

N
If they overlap, you’ll have double features.

Adapted from Maribeth H. Price

 Merge

E L
Combines two feature classes of the same

T
type into a new combined feature class.

P
Merge does not attempt to split or change
the features.

N
Overlaps are permitted.

Adapted from Maribeth H. Price

Raster data overlay

L
 Raster data may also be overlaid.

E
 In this the cell-to-cell comparison presupposes

T
that all the cells in each thematic layer are

P
queried, regardless of their values.
 These new cells are registered as a new

N
thematic layer.
Buffer zones

L
 Buffer zones are used to define spatial proximity.

E
 These comprises one or more polygons of a prescribed extent around points, lines, or
areas.

T
 The new polygons have the attributes of the original objects.

N P
 L
Summary

T
 Classification and reclassification

E
P
 Processing of geometry and attributes

N
 Overlay analysis
 Buffer analysis
 E L
P T
N
 E L
P
Geographic Information Systems
T
N
Dr. Bharath Haridas Aithal
Ranbir and Chitra Gupta School of Infrastructure Design and Management,
IIT KHARAGPUR

Module 8: Spatial analysis and SQL

Lecture 40: Basic Editing
 E L
T
 Basic Editing of data acquired (Fifth Module examples)

P
 Procedures in integrated data analysis

N
 Introduction to Editing, creating vector data in any GIS software
 Tools in GIS softwares
 L
Maintaining logical consistency

E
• Logical consistency means how well the data model explains the features in the real

T
world

P
• Data model is measured for Basic editing through various measures
• Most importantly are

N
• common vertex – Line ends and corner have same vertex
• Boundary – adjacent Polygon are not overlapping but share same boundary
 L
Avoiding dangles

E
node

T
A dangle—the two lines fail to
connect

P
Snapping tolerance

N
The snapping tolerance is the minimum distance between two
vertices at which they are considered to be identical.

Correct topology—the horizontal

line intersects the vertical one,
creating three lines.
Adapted from Prof. Maribeth H. Price
 L
Adjacent polygons

T E
P
overlap

N
gap

Adapted from Prof. Maribeth H. Price

The Editor toolbar

Move Feature

E L
Meta Search

Toggle Editing

P T
N
Labels
Sketching Tools CUT and Delete Python
Snapping

L
Enable it via settingoptiondigitisingenable snapping

E
Why do we need snapping

T
In case a part of the line segment has already been created snap ensures the
new digitized line When snapping is turned on,

P
your pointer will snap to, edges, vertices near them

N
 L
Saving the digitized layers

T E
Stops editing and asks to

P
save any unsaved edits

N
Saves and continues
editing
 L
Feature editing

T E
N P • Created automatically or manually
• Can have multiple templates
•can also enter values in attribute
fields
 L
Node Tool

TE
N P
Move a feature

E L
P T
N
1 2
Delete a feature

E L
P T
N
1 2
Attributes

E L
P T
N
 E L
P T
N
Attribute operations

L
Select and Deselect features

E
Edit multiple features

Save Editing
Toggle Editing

P T New Field and Field

Calculator

N
Add and Delete feature

Pan/Copy/Paste
features
QGIS – Processing Toolbox

L
Enabling R Package (Statistical Software)

T E
N P
 L
R scripts and GIS integration

T E
• R-scripts in Processing "Spatial data processing framework
for QGIS" Plug-in (formerly Sextante plug-in)

P
Needs to be enabled in Processing menu / providers:
• After R is enabled (and installed on your operating system)

N
you can run the scripts from the Processing Toolbox
Spatialite – file based Spatial Database

L
Spatialite is a spatial DBMS on SQLite

E
Light Weight and Portable

T
Rater tools include RasterLite

N P
QGIS Workshop
Practical QGIS
PostGIS – Spatial Database

PostGIS is an GIS based extension for PostgreSQL

E L
T
• Adds support for geographic objects to PostgreSQL

P
• enables PostgreSQL server to be used as a backend spatial database
for GIS

N
• Spatial operations and analysis simply mean running a (spatial) SQL
query in the database

QGIS Workshop
Practical QGIS
PostGIS Functions

E L
P T
QGIS Workshop
Practical QGIS
N
 L
pgAdmin – GUI base
Database administration

E
tool

P T
QGIS Workshop
Practical QGIS
N
QGIS - Python Interface

L
Three Options

E
Python console

T
Processing tools

P
Plugins

N
Tools such as
WinPython ( IDE + QT Designer)
Plugin-Builder Plugin

QGIS Workshop
Practical QGIS
Summary

 Logical Consistency

E L
T
 Procedures in integrated data analysis

P
 Basic operations in Q GIS
 Database support through SQLITE

N
 Post GIS
 E L
P T
N