Abstract:-

In this paper, we consider the collaborative data publishing problem for anonymizing
horizontally partitioned data at multiple data providers. We consider a new type of “ insider attack” by
colluding data providers who may use their own data records (a subset of the overall data) in addition to
the external background knowledge to infer the data records contributed by other data providers. The
paper addresses this new threat and makes several contributions. First, we introduce the notion of m-
privacy, which guarantees that the anonymized data satisfies a given privacy constraint against any
group of up to m colluding data providers. Second, we present heuristic algorithms exploiting the
equivalence group monotonicity of privacy constraints and adaptive ordering techniques for efficiently
checking m-privacy given a set of records. Finally, we present a data provider-aware anonymization
algorithm with adaptive m- privacy checking strategies to ensure high utility and m-privacy of
anonymized data with efficiency. Experiments on real-life datasets suggest that our approach achieves
better or comparable utility and efficiency than existing and baseline algorithms while providing m-
privacy guarantee.

EXISTING SYSTEM:

We consider the collaborative data publishing setting with horizontally partitioned data
across multiple data providers, each contributing a subset of records Ti. As a special case, a data
provider could be the data owner itself who is contributing its own records. Distributed data publishing
settings. common scenario in social networking and recommendation systems

DISADVANTAGES:
 1. Attacks by Data Providers Using Intermediate Results and Their Own Data

2. Attacks by External Data Recipient

PROPOSED SYSTEM:

Our goal is to publish an anonym zed view of the integrated data such that a data recipient including the
data providers will not be able to compromise the privacy of the individual records provided by other
parties. To prevent privacy disclosure by any m-adversary we showed that guaranteeing m-privacy is
enough. We presented heuristic algorithms exploiting equivalence group monotonicity of privacy
constraints and adaptive ordering techniques for efficiently checking m-privacy. We introduced also a
provider-aware anonymization algorithm with adaptive m-privacy checking strategies to ensure high utility
and m-privacy of anonym zed data. Our experiments confirmed that our approach achieves better or
comparable utility than existing algorithms while ensuring m-privacy efficiently.

ADVANTAGES:

1. To ensure high utility and m-privacy of anonym zed data

2. Placement optimizer calculates the placement that maximizes the minimum satisfaction across
all applications

OBJECTIVES:
Our goal is to publish an anonym zed view of the integrated data such that a data recipient including the
data providers will not be able to compromise the privacy of the individual records provided by other
parties.

Scope:

Scope of the project is hospital and research department.

HARDWARE AND SOFTWARE REQUIREMENTS:

HARDWARE REQUIREMENTS:

• System : Pentium IV 2.4 GHz.

• Hard Disk : 40 GB.
• Floppy Drive : 1.44 Mb.
• Monitor : 15 VGA Colour.
• Mouse : Logitech.
• Ram : 512 Mb.

SOFTWARE REQUIREMENTS:

• Operating system : Windows XP.

• Coding Language : JDK 1.6 ,jsp

• Scripting language: Javascript
• Back end :sqlserver2012
• Tools : Netbeans7.0

MODULES:

 Secure Multiparty Computation

 Look-Ahead Approach
 K-anonymity
 Generalization
 Pruning technique
 Efficient search
MODULES DESCRIPTION:

 Secure Multiparty Computation:

Secure multi-party computation (also known as secure computation or
multi-party computation (MPC)) is a sub field of cryptography. The goal of methods for
secure multi-party computation is to enable parties to jointly compute a function over
their inputs, while at the same time keeping these inputs private. For example, two
millionaires can compute which one is richer, but without revealing their net worth. The
concept is important in the field of cryptography and is closely related to the idea of zero-
knowledgeness. In general it refers to computational systems in which multiple parties
wish to jointly compute some value based on individually held secret bits of information,
but do not wish to reveal their secrets to one another in the process. The primary
motivation for studying methods of secure computation is to design systems that allow
for maximum utility of information without compromising user privacy.

 Look-Ahead Approach:
We propose a look-ahead approach, specifically for secure
multiparty protocols to achieve distributed k-anonymity, which helps parties to decide if
the utility benefit from the protocol is within an acceptable range before initiating the
protocol. The look-ahead operation is highly localized and its accuracy depends on the
amount of information the parties are willing to share. Experimental results show the
effectiveness of the proposed methods. We introduced a look-ahead approach for SMC
protocols that helps involved parties to decide whether the protocol will meet the
expectations before initiating it. We presented a look-ahead protocol specifically for the
distributed k-anonymity by approximating the probability that the output of the SMC will
be more utilized than their local anonymization. Experiments on real data showed the
effectiveness of the approach.

 K – Anonymity:
One of the emerging concepts in micro data protection is k-anonymity,
which has been recently proposed as a property that captures the protection of a micro
data table with respect to possible re-identication of the respondents to which the data
refer. K-anonymity demands that every tuple in the micro data table released be
indistinguishably related to no fewer than k respondents. One of the interesting aspects of
k-anonymity is its association with protection techniques that preserve the truthfulness of
 the data. In this chapter we discuss the concept of k-anonymity, from its original proposal
illustrating its enforcement via generalization and suppression. We then survey and
discuss research results on k-anonymity in particular with respect to algorithms for its
enforcement. We also discuss deferent ways in which generalization and suppressions
can be applied to satisfy k- anonymity and, based on them, introduce taxonomy of k-
anonymity solutions.

 Generalization:
A generalization of a concept is an extension of the concept to less-
specific criteria. It is a foundational element of logic and human reasoning.
Generalizations posit the existence of a domain or set of elements, as well as one or more
common characteristics shared by those elements. As such, it is the essential basis of all
valid deductive inferences. The process of verification is necessary to determine whether
a generalization holds true for any given situation. The concept of generalization has
broad application in many related disciplines, sometimes having a specialized context-
meaning. Of any two related concepts, such as A and B, A is considered a
"generalization" of concept B if and only if:

o Every instance of concept B is also an instance of concept A; and

o There are instances of concept A which are not instances of concept B.

Pruning technique:
Pruning is a technique in machine learning that reduces the size of decision trees by removing
sections of the tree that provide little power to classify instances. The dual goal of pruning is
reduced complexity of the final classifier as well as better predictive accuracy by the reduction of
overfitting and removal of sections of a classifier that may be based on noisy or erroneous data.

Efficient Search:-
A Efficient search (or conceptual search) is an automated information retrieval method that is
used to search electronically stored unstructured text (for example, digital archives, email,
scientific literature, etc.) for information that is conceptually similar to the information provided
in a search query. In other words, the ideas expressed in the information retrieved in response to
a concept search query are relevant to the ideas contained in the text of the query.

SYSTEM ARCHITECTURE:

Organization Registering Data

DB

View All Data

Viewer Publish Data K-Anonymity Generalizing Data

DATA FLOW DIAGRAM:

Level 0:-
Level 1:-
Level 2:-
Final:-
CLASS DIAGRAM:

Organization Services

Name M 1 K-Anonymity

Phone Number SMC

Email

Registration Generalized Data

M 1

M M
Address Viewer

Street Name
M M
City Phone Number

State Email

Valid Data
HIERARCHICAL DIAGRAM:
Organization

Storing Data

Generalized Data

Published
Data

Viewer Viewer Viewer Viewer

USECASE DIAGRAM:

Registration

Data

K-Anonymity
Organization Viewer

SMC

Publish data

Data base

Other Organization
 ER DIAGRAM:

Phone no
SMC

Email Generalized
Name K- data
Anonymity

M 1
Organization Services

M M

Address Viewer

Name

State Street
Email

Phone no

City
ACTIVITY DIAGRAM:

Organization Register

no

Che
ck
yes

Services

K-Anonymity SMC

yes
Regist
Viewer Published Data
er
Check no
 SEQUENCE DIAGRAM:

Organization Registration K-Anonymity SMC Published data Viewer

Register insert

Sign in check

Details

Hide data

Secret data

Register

View
Deployment Diagram
Collaboration Diagram:-

Pseudo code:-

k-anonymity
  Let RT(A1,...,An) be a table and QIRT be the quasi-identifier associated with it.
 RT is said to satisfy k-anonymity if and only if each sequence of values in
 RT[QIRT] appears with at least k occurrences in RT[QIRT].

Algorithm:-

Data: A set of records T = ∪n

j=1 Tj provided by {P1; P2; : : : ; Pn}, a set of

QI attributes Ai (i = 1; : : : ; q), m, a privacy constraint C

Result: Anonymized T∗ that satisfies m-privacy w.r.t. C

Begin

_ = get_splitting_points_for_attributes(Ai)

_ = _∪ get_splitting_point_for_providers(A0)

_′ = {ai ∈ _; i ∈ {0; 1; : : : ; q} : are_both_split_subpartitions_m-private(T; ai)}

if _′ is ∅ then

T∗ = T∗∪ generalize_all_QIs (T)

return T

∗Aj = choose_splitting_attribute(T, C, _′)

(T′r; T′l ) = split(T, Aj)

Run recursively for T

Software Environment

1. Java Technology

Java technology is both a programming language and a platform.

1. The Java Programming Language

2. The Java programming language is a high-level language that can be
characterized by all of the following buzzwords:

 Simple
 Architecture neutral
 Object oriented
 Portable
 Distributed
 High performance
 Interpreted
 Multithreaded
 Robust
  Dynamic
 Secure

With most programming languages, you either compile or interpret a program so that you
can run it on your computer. The Java programming language is unusual in that a program is
both compiled and interpreted. With the compiler, first you translate a program into an
intermediate language called Java byte codes —the platform-independent codes interpreted by
the interpreter on the Java platform. The interpreter parses and runs each Java byte code
instruction on the computer. Compilation happens just once; interpretation occurs each time the
program is executed. The following figure illustrates how this works.

You can think of Java byte codes as the machine code instructions for the Java Virtual Machine
(Java VM). Every Java interpreter, whether it’s a development tool or a Web browser that can
run applets, is an implementation of the Java VM. Java byte codes help make “write once, run
anywhere” possible. You can compile your program into byte codes on any platform that has a
Java compiler. The byte codes can then be run on any implementation of the Java VM. That
means that as long as a computer has a Java VM, the same program written in the Java
programming language can run on Windows 2000, a Solaris workstation, or on an iMac.

3.
4. The Java Platform
A platform is the hardware or software environment in which a program runs.
We’ve already mentioned some of the most popular platforms like Windows 2000,
Linux, Solaris, and MacOS. Most platforms can be described as a combination of the
operating system and hardware. The Java platform differs from most other platforms in
that it’s a software-only platform that runs on top of other hardware-based platforms.

The Java platform has two components:

 The Java Virtual Machine (Java VM)
 The Java Application Programming Interface (Java API)
You’ve already been introduced to the Java VM. It’s the base for the Java platform
and is ported onto various hardware-based platforms.

The Java API is a large collection of ready-made software components that provide
many useful capabilities, such as graphical user interface (GUI) widgets. The Java API is
grouped into libraries of related classes and interfaces; these libraries are known as
packages. The next section, What Can Java Technology Do? Highlights what
functionality some of the packages in the Java API provide.

The following figure depicts a program that’s running on the Java platform. As the
figure shows, the Java API and the virtual machine insulate the program from the
hardware.

Native code is code that after you compile it, the compiled code runs on a specific
hardware platform. As a platform-independent environment, the Java platform can be a
bit slower than native code. However, smart compilers, well-tuned interpreters, and just-
in-time byte code compilers can bring performance close to that of native code without
threatening portability.

2. What Can Java Technology Do?

The most common types of programs written in the Java programming language are
applets and applications. If you’ve surfed the Web, you’re probably already familiar with
applets. An applet is a program that adheres to certain conventions that allow it to run
within a Java-enabled browser.

However, the Java programming language is not just for writing cute, entertaining applets
for the Web. The general-purpose, high-level Java programming language is also a
powerful software platform. Using the generous API, you can write many types of
programs.
 An application is a standalone program that runs directly on the Java platform. A special
kind of application known as a server serves and supports clients on a network. Examples
of servers are Web servers, proxy servers, mail servers, and print servers. Another
specialized program is a servlet. A servlet can almost be thought of as an applet that runs
on the server side. Java Servlets are a popular choice for building interactive web
applications, replacing the use of CGI scripts. Servlets are similar to applets in that they
are runtime extensions of applications. Instead of working in browsers, though, servlets
run within Java Web servers, configuring or tailoring the server.

How does the API support all these kinds of programs? It does so with packages of
software components that provides a wide range of functionality. Every full
implementation of the Java platform gives you the following features:

 The essentials: Objects, strings, threads, numbers, input and output, data structures,
system properties, date and time, and so on.
 Applets: The set of conventions used by applets.
 Networking: URLs, TCP (Transmission Control Protocol), UDP (User Data gram
Protocol) sockets, and IP (Internet Protocol) addresses.
 Internationalization: Help for writing programs that can be localized for users
worldwide. Programs can automatically adapt to specific locales and be displayed in the
appropriate language.
 Security: Both low level and high level, including electronic signatures, public and
private key management, access control, and certificates.
 Software components: Known as JavaBeansTM, can plug into existing component
architectures.
 Object serialization: Allows lightweight persistence and communication via Remote
Method Invocation (RMI).
 Java Database Connectivity (JDBCTM): Provides uniform access to a wide range of
relational databases.
 The Java platform also has APIs for 2D and 3D graphics, accessibility, servers,
collaboration, telephony, speech, animation, and more. The following figure depicts what
is included in the Java 2 SDK.

3.
4. How Will Java Technology Change My Life?

We can’t promise you fame, fortune, or even a job if you learn the Java programming
language. Still, it is likely to make your programs better and requires less effort than
other languages. We believe that Java technology will help you do the following:

 Get started quickly: Although the Java programming language is a powerful object-
oriented language, it’s easy to learn, especially for programmers already familiar with C
or C++.
 Write less code: Comparisons of program metrics (class counts, method counts, and so
on) suggest that a program written in the Java programming language can be four times
smaller than the same program in C++.
 Write better code: The Java programming language encourages good coding practices,
and its garbage collection helps you avoid memory leaks. Its object orientation, its
JavaBeans component architecture, and its wide-ranging, easily extendible API let you
reuse other people’s tested code and introduce fewer bugs.
 Develop programs more quickly: Your development time may be as much as twice as
fast versus writing the same program in C++. Why? You write fewer lines of code and it
is a simpler programming language than C++.
 Avoid platform dependencies with 100% Pure Java: You can keep your program
portable by avoiding the use of libraries written in other languages. The 100% Pure
JavaTM Product Certification Program has a repository of historical process manuals,
white papers, brochures, and similar materials online.
  Write once, run anywhere: Because 100% Pure Java programs are compiled into
machine-independent byte codes, they run consistently on any Java platform.
 Distribute software more easily: You can upgrade applets easily from a central server.
Applets take advantage of the feature of allowing new classes to be loaded “on the fly,”
without recompiling the entire program.
1. ODBC
Microsoft Open Database Connectivity (ODBC) is a standard programming interface for
application developers and database systems providers. Before ODBC became a de facto
standard for Windows programs to interface with database systems, programmers had to use
proprietary languages for each database they wanted to connect to. Now, ODBC has made the
choice of the database system almost irrelevant from a coding perspective, which is as it should
be. Application developers have much more important things to worry about than the syntax that
is needed to port their program from one database to another when business needs suddenly
change.

Through the ODBC Administrator in Control Panel, you can specify the particular
database that is associated with a data source that an ODBC application program is written to
use. Think of an ODBC data source as a door with a name on it. Each door will lead you to a
particular database. For example, the data source named Sales Figures might be a SQL Server
database, whereas the Accounts Payable data source could refer to an Access database. The
physical database referred to by a data source can reside anywhere on the LAN.

The ODBC system files are not installed on your system by Windows 95. Rather, they
are installed when you setup a separate database application, such as SQL Server Client or
Visual Basic 4.0. When the ODBC icon is installed in Control Panel, it uses a file called
ODBCINST.DLL. It is also possible to administer your ODBC data sources through a stand-
alone program called ODBCADM.EXE. There is a 16-bit and a 32-bit version of this program
and each maintains a separate list of ODBC data sources.
 From a programming perspective, the beauty of ODBC is that the application can be
written to use the same set of function calls to interface with any data source, regardless of the
database vendor. The source code of the application doesn’t change whether it talks to Oracle or
SQL Server. We only mention these two as an example. There are ODBC drivers available for
several dozen popular database systems. Even Excel spreadsheets and plain text files can be
turned into data sources. The operating system uses the Registry information written by ODBC
Administrator to determine which low-level ODBC drivers are needed to talk to the data source
(such as the interface to Oracle or SQL Server). The loading of the ODBC drivers is transparent
to the ODBC application program. In a client/server environment, the ODBC API even handles
many of the network issues for the application programmer.

The advantages of this scheme are so numerous that you are probably thinking there must
be some catch. The only disadvantage of ODBC is that it isn’t as efficient as talking directly to
the native database interface. ODBC has had many detractors make the charge that it is too slow.
Microsoft has always claimed that the critical factor in performance is the quality of the driver
software that is used. In our humble opinion, this is true. The availability of good ODBC drivers
has improved a great deal recently. And anyway, the criticism about performance is somewhat
analogous to those who said that compilers would never match the speed of pure assembly
language. Maybe not, but the compiler (or ODBC) gives you the opportunity to write cleaner
programs, which means you finish sooner. Meanwhile, computers get faster every year.

JDBC

In an effort to set an independent database standard API for Java; Sun Microsystems
developed Java Database Connectivity, or JDBC. JDBC offers a generic SQL database access
mechanism that provides a consistent interface to a variety of RDBMSs. This consistent interface
is achieved through the use of “plug-in” database connectivity modules, or drivers. If a database
vendor wishes to have JDBC support, he or she must provide the driver for each platform that the
database and Java run on.

To gain a wider acceptance of JDBC, Sun based JDBC’s framework on ODBC. As you
discovered earlier in this chapter, ODBC has widespread support on a variety of platforms.
Basing JDBC on ODBC will allow vendors to bring JDBC drivers to market much faster than
developing a completely new connectivity solution.

JDBC was announced in March of 1996. It was released for a 90 day public review that
ended June 8, 1996. Because of user input, the final JDBC v1.0 specification was released soon
after.

The remainder of this section will cover enough information about JDBC for you to know what it
is about and how to use it effectively. This is by no means a complete overview of JDBC. That
would fill an entire book.

2.
3. JDBC Goals
Few software packages are designed without goals in mind. JDBC is one that, because of its
many goals, drove the development of the API. These goals, in conjunction with early reviewer
feedback, have finalized the JDBC class library into a solid framework for building database
applications in Java.

The goals that were set for JDBC are important. They will give you some insight as to why
certain classes and functionalities behave the way they do. The eight design goals for JDBC are
as follows:

1. SQL Level API

The designers felt that their main goal was to define a SQL interface for Java. Although not the
lowest database interface level possible, it is at a low enough level for higher-level tools and
APIs to be created. Conversely, it is at a high enough level for application programmers to use it
confidently. Attaining this goal allows for future tool vendors to “generate” JDBC code and to
hide many of JDBC’s complexities from the end user.

2. SQL Conformance
SQL syntax varies as you move from database vendor to database vendor. In an effort to support
a wide variety of vendors, JDBC will allow any query statement to be passed through it to the
underlying database driver. This allows the connectivity module to handle non-standard
functionality in a manner that is suitable for its users.

3. JDBC must be implemental on top of common database interfaces

The JDBC SQL API must “sit” on top of other common SQL level APIs. This goal
allows JDBC to use existing ODBC level drivers by the use of a software interface. This
interface would translate JDBC calls to ODBC and vice versa.
4. Provide a Java interface that is consistent with the rest of the Java system
Because of Java’s acceptance in the user community thus far, the designers feel that they should
not stray from the current design of the core Java system.

5. Keep it simple
This goal probably appears in all software design goal listings. JDBC is no exception. Sun felt
that the design of JDBC should be very simple, allowing for only one method of completing a
task per mechanism. Allowing duplicate functionality only serves to confuse the users of the
API.

6. Use strong, static typing wherever possible

Strong typing allows for more error checking to be done at compile time; also, less error appear
at runtime.

7. Keep the common cases simple

Because more often than not, the usual SQL calls used by the programmer are simple
SELECT’s, INSERT’s, DELETE’s and UPDATE’s, these queries should be simple to perform
with JDBC. However, more complex SQL statements should also be possible.

5.

Finally we decided to proceed the implementation using Java Networking.

And for dynamically updating the cache table we go for MS Access database.

Java ha two things: a programming language and a platform.

Java is a high-level programming language that is all of the following

Simple Architecture-neutral

Object-oriented Portable

Distributed High-performance

Interpreted multithreaded

Robust Dynamic

Secure

Java is also unusual in that each Java program is both compiled and interpreted. With a
compile you translate a Java program into an intermediate language called Java byte
codes the platform-independent code instruction is passed and run on the computer.
Compilation happens just once; interpretation occurs each time the program is executed.
The figure illustrates how this works.

You can think of Java byte codes as the machine code instructions for the Java Virtual
Machine (Java VM). Every Java interpreter, whether it’s a Java development tool or a
Web browser that can run Java applets, is an implementation of the Java VM. The Java
VM can also be implemented in hardware.

Java byte codes help make “write once, run anywhere” possible. You can compile your
Java program into byte codes on my platform that has a Java compiler. The byte codes
can then be run any implementation of the Java VM. For example, the same Java
program can run Windows NT, Solaris, and Macintosh.

6. Networking:-

7. TCP/IP stack

1. The TCP/IP stack is shorter than the OSI one:

TCP is a connection-oriented protocol; UDP (User Datagram Protocol) is a connectionless

protocol.

2.

3. IP datagram’s

The IP layer provides a connectionless and unreliable delivery system. It considers each
datagram independently of the others. Any association between datagram must be supplied by
the higher layers. The IP layer supplies a checksum that includes its own header. The header
includes the source and destination addresses. The IP layer handles routing through an Internet. It
is also responsible for breaking up large datagram into smaller ones for transmission and
reassembling them at the other end.

4. UDP

UDP is also connectionless and unreliable. What it adds to IP is a checksum for the contents of
the datagram and port numbers. These are used to give a client/server model - see later.

5. TCP

TCP supplies logic to give a reliable connection-oriented protocol above IP. It provides a virtual
circuit that two processes can use to communicate.

6. Internet addresses

In order to use a service, you must be able to find it. The Internet uses an address scheme for
machines so that they can be located. The address is a 32 bit integer which gives the IP address.
This encodes a network ID and more addressing. The network ID falls into various classes
according to the size of the network address.

7. Network address

Class A uses 8 bits for the network address with 24 bits left over for other addressing. Class B
uses 16 bit network addressing. Class C uses 24 bit network addressing and class D uses all 32.

8. Subnet address

Internally, the UNIX network is divided into sub networks. Building 11 is currently on one sub
network and uses 10-bit addressing, allowing 1024 different hosts.
 9. Host address

8 bits are finally used for host addresses within our subnet. This places a limit of 256 machines
that can be on the subnet.

10.
11.

12. Total address

The 32 bit address is usually written as 4 integers separated by dots.

13. Port addresses

A service exists on a host, and is identified by its port. This is a 16 bit number. To send a
message to a server, you send it to the port for that service of the host that it is running on. This
is not location transparency! Certain of these ports are "well known".

Sockets:-

A socket is a data structure maintained by the system to handle network connections. A socket is
created using the call socket. It returns an integer that is like a file descriptor. In fact, under
Windows, this handle can be used with Read File and Write File functions.

#include <sys/types.h>

#include <sys/socket.h>

int socket(int family, int type, int protocol);

Here "family" will be AF_INET for IP communications, protocol will be zero, and type will
depend on whether TCP or UDP is used. Two processes wishing to communicate over a network
create a socket each. These are similar to two ends of a pipe - but the actual pipe does not yet
exist.

JFree Chart

JFreeChart is a free 100% Java chart library that makes it easy for developers to display
professional quality charts in their applications. JFreeChart's extensive feature set includes:A
consistent and well-documented API, supporting a wide range of chart types; A flexible design
that is easy to extend, and targets both server-side and client-side applications; Support for many
output types, including Swing components, image files (including PNG and JPEG), and vector
graphics file formats (including PDF, EPS and SVG); JFreeChart is "open source" or, more
specifically, free software. It is distributed under the terms of the GNU Lesser General Public
Licence (LGPL), which permits use in proprietary applications.

8. 1. Map Visualizations
Charts showing values that relate to geographical areas. Some examples include: (a) population
density in each state of the United States, (b) income per capita for each country in Europe, (c)
life expectancy in each country of the world. The tasks in this project include:Sourcing freely
redistributable vector outlines for the countries of the world, states/provinces in particular
countries (USA in particular, but also other areas); Creating an appropriate dataset interface (plus
default implementation), a rendered, and integrating this with the existing XYPlot class in
JFreeChart; Testing, documenting, testing some more, documenting some more.

9. 2. Time Series Chart Interactivity

Implement a new (to JFreeChart) feature for interactive time series charts --- to display a
separate control that shows a small version of ALL the time seriesdata, with a sliding "view"
rectangle that allows you to select the subset of the time series data to display in the main chart.
 10. 3. Dashboards

There is currently a lot of interest in dashboard displays. Create a flexible dashboard mechanism
that supports a subset of JFreeChart chart types (dials, pies, thermometers, bars, and lines/time
series) that can be delivered easily via both Java Web Start and an applet.

11. 4. Property Editors

The property editor mechanism in JFreeChart only handles a small subsetof the properties that
can be set for charts. Extend (or reimplement) this mechanism to provide greater end-user
control over the appearance of the charts.

What is Database?
A database is a separate application that stores a collection of data. Each database has one or
more distinct APIs for creating, accessing, managing, searching, and replicating the data it holds.

Other kinds of data stores can be used, such as files on the file system or large hash tables in
memory but data fetching and writing would not be so fast and easy with those type of systems.

So now a days we use relational database management systems (RDBMS) to store and manager
huge volume of data. This is called relational database because all the data is stored into different
tables and relations are established using primary keys or other keys known as foreign keys.

A Relational DataBase Management System (RDBMS) is a software that:

 Enables you to implement a database with tables, columns, and indexes.

 Guarantees the Referential Integrity between rows of various tables.
 Updates the indexes automatically.
 Interprets an SQL query and combines information from various tables.

RDBMS Terminology:
Before we proceed to explain MySQL database system, lets revise few definitions related to
database.

 Database: A database is a collection of tables, with related data.

  Table: A table is a matrix with data. A table in a database looks like a simple
spreadsheet.
 Column: One column (data element) contains data of one and the same kind, for
example the column postcode.
 Row: A row (= tuple, entry or record) is a group of related data, for example the data of
one subscription.
 Redundancy: Storing data twice, redundantly to make the system faster.
 Primary Key: A primary key is unique. A key value can not occur twice in one table.
With a key you can find at most one row.
 Foreign Key: A foreign key is the linking pin between two tables.
 Compound Key: A compound key (composite key) is a key that consists of multiple
columns, because one column is not sufficiently unique.
 Index: An index in a database resembles an index at the back of a book.
 Referential Integrity: Referential Integrity makes sure that a foreign key value always
points to an existing row.

MySQL Database:

MySQL is a fast, easy-to-use RDBMS used being used for many small and big businesses.
MySQL is developed, marketed, and supported by MySQL AB, which is a Swedish company.
MySQL is becoming so popular because of many good reasons.

 MySQL is released under an open-source license. So you have nothing to pay to use it.
 MySQL is a very powerful program in its own right. It handles a large subset of the
functionality of the most expensive and powerful database packages.
 MySQL uses a standard form of the well-known SQL data language.
 MySQL works on many operating systems and with many languages including PHP,
PERL, C, C++, JAVA etc.
 MySQL works very quickly and works well even with large data sets.
 MySQL is very friendly to PHP, the most appreciated language for web development.
 MySQL supports large databases, up to 50 million rows or more in a table. The default
file size limit for a table is 4GB, but you can increase this (if your operating system can
handle it) to a theoretical limit of 8 million terabytes (TB).
 MySQL is customizable. The open source GPL license allows programmers to modify
the MySQL software to fit their own specific environments
2. SYSTEM STUDY

2.1 FEASIBILITY STUDY

The feasibility of the project is analyzed in this phase and business proposal is put forth

with a very general plan for the project and some cost estimates. During system analysis the

feasibility study of the proposed system is to be carried out. This is to ensure that the proposed

system is not a burden to the company. For feasibility analysis, some understanding of the major

requirements for the system is essential.

Three key considerations involved in the feasibility analysis are

 ECONOMICAL FEASIBILITY

 TECHNICAL FEASIBILITY

 SOCIAL FEASIBILITY

ECONOMICAL FEASIBILITY

This study is carried out to check the economic impact that the system will have on the

organization. The amount of fund that the company can pour into the research and development

of the system is limited. The expenditures must be justified. Thus the developed system as well

within the budget and this was achieved because most of the technologies used are freely

available. Only the customized products had to be purchased.

TECHNICAL FEASIBILITY

This study is carried out to check the technical feasibility, that is, the technical

requirements of the system. Any system developed must not have a high demand on the available

technical resources. This will lead to high demands on the available technical resources. This

will lead to high demands being placed on the client. The developed system must have a modest

requirement, as only minimal or null changes are required for implementing this system.

SOCIAL FEASIBILITY

The aspect of study is to check the level of acceptance of the system by the user. This includes

the process of training the user to use the system efficiently. The user must not feel threatened by

the system, instead must accept it as a necessity. The level of acceptance by the users solely

depends on the methods that are employed to educate the user about the system and to make him

familiar with it. His level of confidence must be raised so that he is also able to make some

constructive criticism, which is welcomed, as he is the final user of the system.

6. SYSTEM TESTING
The purpose of testing is to discover errors. Testing is the process of trying to discover every
conceivable fault or weakness in a work product. It provides a way to check the functionality of
components, sub assemblies, assemblies and/or a finished product It is the process of exercising
software with the intent of ensuring that the

Software system meets its requirements and user expectations and does not fail in an
unacceptable manner. There are various types of test. Each test type addresses a specific testing
requirement.
TYPES OF TESTS

Unit testing

Unit testing involves the design of test cases that validate that the internal program logic is
functioning properly, and that program inputs produce valid outputs. All decision branches and
internal code flow should be validated. It is the testing of individual software units of the
application .it is done after the completion of an individual unit before integration. This is a
structural testing, that relies on knowledge of its construction and is invasive. Unit tests perform
basic tests at component level and test a specific business process, application, and/or system
configuration. Unit tests ensure that each unique path of a business process performs accurately
to the documented specifications and contains clearly defined inputs and expected results.

Integration testing

Integration tests are designed to test integrated software components to determine if they actually
run as one program. Testing is event driven and is more concerned with the basic outcome of
screens or fields. Integration tests demonstrate that although the components were individually
satisfaction, as shown by successfully unit testing, the combination of components is correct and
consistent. Integration testing is specifically aimed at exposing the problems that arise from the
combination of components.

Functional test

Functional tests provide systematic demonstrations that functions tested are available as
specified by the business and technical requirements, system documentation, and user manuals.

Functional testing is centered on the following items:

Valid Input : identified classes of valid input must be accepted.

Invalid Input : identified classes of invalid input must be rejected.

Functions : identified functions must be exercised.

Output : identified classes of application outputs must be exercised.

Systems/Procedures: interfacing systems or procedures must be invoked.

Organization and preparation of functional tests is focused on requirements, key functions, or

special test cases. In addition, systematic coverage pertaining to identify Business process flows;
data fields, predefined processes, and successive processes must be considered for testing.
Before functional testing is complete, additional tests are identified and the effective value of
current tests is determined.

System Test

System testing ensures that the entire integrated software system meets requirements. It tests a
configuration to ensure known and predictable results. An example of system testing is the
configuration oriented system integration test. System testing is based on process descriptions
and flows, emphasizing pre-driven process links and integration points.

White Box Testing

White Box Testing is a testing in which in which the software tester has knowledge of the inner
workings, structure and language of the software, or at least its purpose. It is purpose. It is used
to test areas that cannot be reached from a black box level.

Black Box Testing

Black Box Testing is testing the software without any knowledge of the inner workings, structure
or language of the module being tested. Black box tests, as most other kinds of tests, must be
written from a definitive source document, such as specification or requirements document, such
as specification or requirements document. It is a testing in which the software under test is
treated, as a black box .you cannot “see” into it. The test provides inputs and responds to outputs
without considering how the software works.

6.1 Unit Testing:

Unit testing is usually conducted as part of a combined code and unit test phase of the software
lifecycle, although it is not uncommon for coding and unit testing to be conducted as two distinct
phases.

Test strategy and approach

Field testing will be performed manually and functional tests will be written in detail.

Test objectives

 All field entries must work properly.

 Pages must be activated from the identified link.
 The entry screen, messages and responses must not be delayed.
Features to be tested

 Verify that the entries are of the correct format

 No duplicate entries should be allowed
 All links should take the user to the correct page.

6.2 Integration Testing

Software integration testing is the incremental integration testing of two or more integrated
software components on a single platform to produce failures caused by interface defects.

The task of the integration test is to check that components or software applications, e.g.
components in a software system or – one step up – software applications at the company level –
interact without error.

Test Results: All the test cases mentioned above passed successfully. No defects encountered.

6.3 Acceptance Testing

User Acceptance Testing is a critical phase of any project and requires significant participation
by the end user. It also ensures that the system meets the functional requirements.

Test Results: All the test cases mentioned above passed successfully. No defects encountered.

Conclusion:-

In this paper, we considered a new type of potential attackers in collaborative data publishing –
a coalition of data providers, called m-adversary. To prevent privacy disclosure by any m-
adversary we showed that guaranteeing m-privacy is enough. We presented heuristic algorithms
exploiting equivalence group monotonicity of privacy constraints and adaptive ordering
techniques for efficiently checking m-privacy. We introduced also a provider-aware
anonymization algorithm with adaptive m-privacy checking strategies to ensure high utility and
m-privacy of anonymized data. Our experiments confirmed that our approach achieves better or
comparable utility than existing algorithms while ensuring m-privacy efficiently. There are many
remaining research questions. Defining a proper privacy fitness score for different privacy
constraints is one of them. It also remains a question to address and model the data knowledge of
data providers when data are distributed in a vertical or ad-hoc fashion. It would be also
interesting to verify if our methods can be adapted to other kinds of data such as set-valued data
FUTURE ENHANCEMENT:

Designing look ahead’s for other SMC protocols stands as a future work. A
wide variety of SMC protocols have been proposed especially for privacy preserving data mining
applications, each requiring a unique look ahead approach. As for the look-ahead process on
distributed anonymization protocols, definitions of k-anonymity definitions can be revisited,
more efficient techniques can be developed and experimentally evaluated.

Refferences:-

1. Differential privacy: a survey of results

2. Privacy-Preserving Data Publishing: A Survey of Recent Developments

3. Centralized and Distributed Anonymization for High-Dimensional Healthcare Data

4. Privacy-preserving distributed k-anonymity,” in Data and Applications

Security

5. Protecting respondents’ identities in microdata release