ASSIGNMENT-3

OF
MOBILE COMPUTING

UNIT -3
(2019-20)

SUBMITTED BY: SUBMITTED TO:

Abhishek Mehta Dr. R.S. CHAUHAN
8517104 DIRECTOR
CSE 3rd year JMIETI
Q-1) what do you mean by mobile database and its characteristics?
A-1) Mobile databases are separate from the main database and can easily be
transported to various places. Even though they are not connected to the main
database, they can still communicate with the database to share and exchange data.

The mobile database includes the following components:

1. The main system database that stores all the data and is linked to the mobile database.

2. The mobile database that allows users to view information even while on the move. It
shares information with the main database.

3. The device that uses the mobile database to access data. This device can be a mobile
phone, laptop etc.

4. A communication link that allows the transfer of data between the mobile database and
the main database.

Advantages of Mobile Databases

Some advantages of mobile databases are:
1. The data in a database can be accessed from anywhere using a mobile database. It
provides wireless database access.

2. The database systems are synchronized using mobile databases and multiple users can
access the data with seamless delivery process.

3. Mobile databases require very little support and maintenance.

4. The mobile database can be synchronized with multiple devices such as mobiles,
computer devices, laptops etc.

Disadvantages of Mobile Databases

Some disadvantages of mobile databases are:
1. The mobile data is less secure than data that is stored in a conventional stationary
database. This presents a security hazard.

2. The mobile unit that houses a mobile database may frequently lose power because of
limited battery. This should not lead to loss of data in database.

Characteristics of mobile databases-:

 Small memory footprint.
 Flash-optimized storage system.
 Data synchronization.
 Security.
 Low power consumption.
 Self-management.
 Embeddable in applications.
Q-2) Define data distribution and replication?
A-2) Data Replication is the process of storing data in more than one site or node.
It is useful in improving the availability of data. It is simply copying data from a
database from one server to another server so that all the users can share the same
data without any inconsistency. The result is a distributed database in which users
can access data relevant to their tasks without interfering with the work of others.
Data replication encompasses duplication of transactions on an ongoing basis, so
that the replicate is in a consistently updated state and synchronized with the
source.However in data replication data is available at different locations, but a
particular relation has to reside at only one location.
There can be full replication, in which the whole database is stored at every site.
There can also be partial replication, in which some frequently used fragment of the
database are replicated and others are not replicated.

Types of Data Replication –

1. Transactional Replication – In Transactional replication users receive full
initial copies of the database and then receive updates as data changes. Data
is copied in real time from the publisher to the receiving database(subscriber) in
the same order as they occur with the publisher therefore in this type of
replication, transactional consistency is guaranteed. Transactional
replication is typically used in server-to-server environments. It does not simply
copy the data changes, but rather consistently and accurately replicates each
change.
2. Snapshot Replication – Snapshot replication distributes data exactly as it
appears at a specific moment in time does not monitor for updates to the data.
The entire snapshot is generated and sent to Users. Snapshot replication is
generally used when data changes are infrequent. It is bit slower than
transactional because on each attempt it moves multiple records from one end
to the other end. Snapshot replication is a good way to perform initial
synchronization between the publisher and the subscriber.
3. Merge Replication – Data from two or more databases is combined into a
single database. Merge replication is the most complex type of replication
because it allows both publisher and subscriber to independently make
changes to the database. Merge replication is typically used in server-to-client
environments. It allows changes to be sent from one publisher to multiple
subscribers.
Replication Schemes –
1. Full Replication – The most extreme case is replication of the whole database at
every site in the distributed system. This will improve the availability of the system
because the system can continue to operate as long as atleast one site is up.

Advantages of full replication –

 High Availability of Data.
 Improves the performance for retrieval of global queries as the result can be
obtained locally from any of the local site.
 Faster execution of Queries.
Disadvantages of full replication –
 Concurrency is difficult to achieve in full replication.
 Slow update process as a single update must be performed at different
databases to keep the copies consistent.
2. No Replication – The other case of replication involves having No replication –
that is, each fragment is stored at only one site.

Advantages of No replication –
 The data can be easily recovered.
 Concurrency can be achieved in no replication.
Disadvantages of No replication –
  Since multiple users are accessing the same server, it may slow
down the execution of queries.
 The data is not easily available as there is no replication.
3. Partial Replication – In this type of replication some fragments of the database
may be replicated whereas others may not. The number of copies of the fragment
may range from one to the total number of sites in the distributed system. The
description of replication of fragments is sometimes called the replication schema.

Advantages of Partial replication –

 The number of copies of the fragment depends upon the
importance of data.
ADVANTAGES OF DATA REPLICATION – Data Replication is generally performed
to:
 To provide a consistent copy of data across all the database
nodes.
 To increase the availability of data.
 The reliability of data is increased through data replication.
 Data Replication supports multiple users and gives high
performance.
 To remove any data redundancy,the databases are merged and
slave databases are updated with outdated or incomplete data.
 Since replicas are created there are chances that the data is
found itself where the transaction is executing which reduces the data
movement.
 To perform faster execution of queries.
DISADVANTAGES OF DATA REPLICATION –
 More storage space is needed as storing the replicas of same
data at different sites consumes more space.
  Data Replication becomes expensive when the replicas at all
different sites need to be updated.
 Maintaining Data consistency at all different sites involves
complex measures.

Q-3) Define quering process and caching?

A-3) A query is a language expression that describes data

to be retrieved from database. Generally the query may be defined as either (i)

direct request for data by the user or (ii) a transaction that changes the stored
data . In Query optimization context, it is often assumed that queries are
expressed in a content-based manner. The total cost of any query
optimization is the sum of communication cost,secondary access storage
cost, computational cost & query latency.

 Distributed Environment
The hardest problem in the distributed database area is query optimization.
A distributed database is a collection of independent cooperating centralized
systems . There is a need of communication network to transfer data for
the query processing in distributed database. Any query from a given site
might require data from remote sites . There is particular cost of each
query execution plan, here query execution plan means a
query optimization method and cost is the summation of local cost and data
transfer data for the query processing in distributed database. Any query
from a given site might require data from remote sites.There is particular
cost of each query execution plan, herequery execution plan means a
query optimization method and cost is the summation of local cost and data
transfercost between sites. As the number of relations in query is
increased, it increases the complexity and  cost. Moreover,less amount of
data transmission is also an important factor to minimize the query
processing cost and also a sin-gle query can be executed in several
different ways. The key problem of query optimization in distributed envi-
ronment is – how to select the most cost effective plan to execute a query.
There are number of optimization strate-gies like static, dynamic,
randomized have been
proposed by researchers, but all these strategies require theknowledge of the
entire system and that is the reason that they are not suitable for distributed
database system.Query optimization in distributed database system is
animportant research issue. The main challenging task is to determine a
sequence of operations, which are used  in the process of minimizing the cost
by selected function.The work in focuses a novel approach to reduce the
volume of data transfer in the network by  introducing reduction filters.
Here number of relations located at dif ferent sites in the network, all the results
must be joined and the final result is available at some distinct place. In this process,
the reduction filters plays an important role to minimize the total communication
cost .In distributed database system, the key factors that affect the
performance, service efficiency and reliability of system are: query
processing and optimization. The working proposes one new query
optimizationalgorithm based on multirelation semi joins, which reduces thevolum
e of intermediate result and effectively decreases the overall cost
of network communication. In distributed environment the users have to
pose their queries in a de-clarative manner using the SQL or OQL and the
optimizer determines the good execution plan to  execute the queries. This
plan includes the execution plan and operation method (i.e. join, select or
project), which is used to exe-cute the query .Mariposa is an experimental
distributed data management system, which provides high performance in
an environment of high data mobility and heterogeneous host capabilities.
It combines approaches of distributed file system and  distributed
databases. Moreover, Mariposa provides general platform to develop new
algorithm.
Mobile Environment
Recently mobile database technology is widely  used in various fields
including information sharing, near filed communication, weather forecasting,
healthcare, mobile office, M-learning, stock activities and public services. For the
mobile database system, the emergence of Mobile Adhoc NETwork
(MANET) brings innovative organiza-tion. It is a really complex task to choose
an effective exe-cution plan for query in a distributed environment. Selec-
tion of an execution plan close to optimal is the main roleof query
optimization. The fundamental requirements of effective query optimization are:
availability of sufficientinformation, effective data access technique and
executionsite. The model based on mobile agents provides an exe- cution
strategy over the network for each query is pro-posed in. The main modules of
this system are: querydecomposition, optimization plan, execution plan.
Theexecution of the query is done thorough the optimizedplan using the
mobile nodes. The real challenges in dis- tributed environment are:
communication, confidentialityof access, indexing, caching and replication
mechanism distributed query optimization, storage management and
scalable data storage structures [18].Caching methods can be useful for both
single query optimization and multi-query optimization. Use of inter-
mediate data structure and common sub expressions playan important role
in minimizing the cost of evaluation.The work in presents how integration
of single query optimization, multi-query optimization and cache in-
vestment is helpful in query execution in distributed da tabase systems. Here
intermediate data structure is gen-erated by queries, the inputted data will be
cached inmemory and provides support for multithreaded execu-tion and
all these things reduce the evaluation cost andcommunication cost
and response time.The
autonomyandxheterogeneitycomponentdata- bases give rise to a number of iss
ues, which make MQO(Multidatabase Query Optimization) a distinct
problemfrom DQO (Distributed Query Optimization) . Theenvironment of
multidatabase management system be-longs to heterogeneous world in
which the componentdatabases are at the computer systems having
variousarchitectures. The concept of multidatabase managementsystem (MDBMS)
facilitates data sharing among compo-nent databases (local databases)
and in this way providesinteroperability to the assorted applications. In
MDBMS,user generates the nonprocedural queries to get data
frommultiple databases. This type of query involving morethan one
database and for that to achieve good overallsystem performance, a
global optimization should be per-formed . An important indicator for the
heterogene-ous database, which locates in the different network isuser’s
response time. The work in describes the dis-tributed heterogeneous
database system structure of que-ry optimization system based on the
Hibernate technicalfor the B/S structure and analysis the calculation of
theresponse time.Nowadays, data collection is common in wide variety of
fields, including business transactions, medical investi-gations and scientific
research; such type of data need toanalyzed and for that the demand of
data analysis areever growing. Moreover, challenges related to  data
analy-sis are higher than the challenges related to data storageand
information retrieval on global scale in heterogeneous.

Q-4) Discuss two approaches used for adaptive clustering?

A-4) A Mobile ad-hoc network is a multihop wireless network, where nodes
communicate with each other without any pre-deployed infrastructure. The most

important problem on such dynamic networks is to find routing algorithms well

performing in most cases. Cluster based algorithms are among the most effective

and scaleable approaches. Up till now creation and maintenance clusters were

mostly based on basic heuristic methods. Deploying mobile agents has several

advantages in the ad-hoc environment due to their flexible, robust and autonomous

nature, and their use seems promising for the clustering problem as well. In our

proposed architecture every cluster has a clustering agent that is capable of making
membership modification decisions, transferring nodes and splitting or merging

clusters. Communication is used only between neighbouring agents to reduce the

signalling overhead. Clustering decisions can be based on several network

parameters modified by an adaptation mechanism to provide adequate performance

even under dynamic conditions.

Q-5)What are applications of Concordia architecture?

A-5) (1) Concordia employs existing TCP/IP communications services. Concordia
does not impose a protocol or distributed computing service of its own.
(2) Advanced management function This feature allows thousands of mobile agents
to run on a single workstation. Concordia administration can start, stop, suspend,
and resume Concordia Servers; view, stop, suspend, and resume agents at a
Concordia Server; create, modify, delete users and/or permissions; upgrade and
install Concordia Servers, monitor Concordia Server performance, and manage the
components.
(3) Collaboration It means that your agents can cooperate with each other to perform
specific tasks. An application can be composed of several agents with specific sub-
tasks. it can provide a number of benefits, such as enabling parallel operation over
multiple servers or multiple networks. Using collaboration, an application can divide a
task into subtask, the subtask can be carried out in the most appropriate places. The
results of these sub-tasks are then assembled by the collaboration framework. A
decision is made based upon the results, which can be used to determine
destination, action, or other appropriate behavior.
(4) Service Bridge It allows a developer to add services to a Concordia Server.
Service Bridges may be managed remotely via the Concordia Administration
Manager. For example, you can provide access to an application-specific service so
the service does not need to travel with the mobile agent . The Service Bridge also
provides a way out of the Virtual Machine to the outside world.
(5) Persistence and Queuing Persistence and Queuing can provide for automatic
retries of agent transmission and queue storage recovery in case of server and/or
network failures. These 2 features also provides for load balancing when machines
in a network provide different response time and the order of execution is important.
(6) Itinerary It specifies where a mobile agent travels. It provides a method to allow
destinations to be added or removed either by the application, mobile agent or the
Concordia Administration.
 (7) Service Naming It is a name service for applications and agents. In an
environment where information is dynamic (i.e. the internet), this provides an easy
way to establish a list of locations where services reside.
(8) The Concordia Security Structure Unlike most agent systems, it provides security
based on the rights of the user of the applications - not the permissions given by the
developer of the application. This provides for more control of which files, databases,
resources, etc., are available to a specific end user. In addition , the security system
protects resources from access by unauthorized mobile agents and protects mobile
agents from being tampered with by unauthorized users.
(9) The Lightweight Agent Transporter API It allows the developer to embed within a
client application the ability to receive, execute, and launch Concordia Agents. The
application can receive notifications from the mobile agent and can directly interact
with mobile agent.
(10) Encryption Concordia can provide users with the following two options: (i)
Concordia provides Encryption as a security measure; (ii) the developers can plug in
their own encryption scheme.