International Journal of Advanced Engineering Research and Technology (IJAERT) 115

Volume 2 Issue 4, July 2014, ISSN No.: 2348 8190

A NOVEL SKYLINE QUERY FOR TENTATIVE DATABASES

Shaik Abdullah.G1, Syed Ahamed Kabeer.SM2
1
2

PG Student, Department of CSE, A.V.C. College of Engineering, Mayiladuthurai

UG Student, Department of CSE, A.V.C. College of Engineering, Mayiladuthurai

ABSTRACT
The skyline query retrieves the all the datas in the data
set skyline it will remove uncertain datas from the
data set and retrieves the best probability based
matching query result from uncertain datas are also
retrieved. This process will give lot of confusion to the
user. To address this concern will going develop a new
skyline query the data set. It retrieves the fresh datas
from the data set. For uncertain databases, a
probabilistic skyline query, called P-Skyline, has been
developed to return skyline tuples by specifying a
probability threshold. However, the answer obtained
via a P-Skyline query usually includes skyline tuples
undesirably dominating each other when a small
threshold is specified; or it may contain much fewer
skyline tuples if a larger threshold is employed. To
address this concern, we propose a new uncertain
skyline query, called U-Skyline query, in this project.
Instead of setting a probabilistic threshold to qualify
each skyline tuples independently, the U-Skyline query
searches for a set of tuples that has the highest
probability as the skyline answer. In order to answer
U-Skyline queries efficiently, we propose a number of
optimization techniques for query processing,
including computational simplification of USkyline probability, pruning of unqualified candidate
skylines and early termination of query processing,
reduction of the input data set, and partition and
conquest of the reduced data set. Our algorithm
provides the alternative approach for integer
programming.

indicating the probability for this scenario to occur.

For example, the possible world b; dg has its
probability. With the possible worlds semantic, we can
evaluate the skyline query under each possible world
and aggregate the results from different possible
worlds to obtain probabilistic query answers. The first
study on supporting the skyline query over uncertain
databases, called P-Skyline, has been reported in. This
pioneering project inspires a number of follow-up
studies, as well as our research project presented in this
project. In P-Skyline, the authors define a no
dominance probability for each tuples by aggregating
over all the possible worlds within which the tuples is
not dominated. For example, consider the uncertain
used car data set, where each vehicle is associated with
its availability probability. Based on, because d is not
dominated only in those possible worlds in which b
does not appear. Similarly, because no other tuples can
dominates. Accordingly, P-Skyline returns individual
data tuples with no dominance probabilities greater
than or equal to a specified threshold. In this example,
given a threshold 0.5, the P-Skyline answer set .Notice
that after each tuples no dominance probability is
obtained, the interplay/relationship among tuples are
no longer considered in the answer filtering step. Thus,
it is quite common that the P-Skyline answer set does
not form a skyline in any possible world after all the
valid Skyline.

Key words: Skyline query, tuples, U-Skyline query,

query processing

After its introduction in the skyline query has received

significant attention from the database community.
Many variants of the skyline query and challenging
research issues have been studied. A recent
development of this research direction is to support
skyline queries over uncertain databases. This is a vital
research topic with many potential real life
applications of coming future. For example, vehicles in
bidding services (e.g., www.motors.ebay.com) may
not always be available to the users for sure during the
decision making process of a potential buyer.
Similarly, the availability and pricing of air tickets
show a lot of volatility. As a result, travel web services

1. INTRODUCTION
Probabilistic model of data uncertainty widely adopted
in the literature of uncertain databases .A possible
world represents one of the possible scenarios
derivable from the entire uncertain database. Consider
our used car example. Since each vehicle may or may
not be available for the user, there are possible worlds,
each of which consists of a unique combination of
vehicles available in that scenario. Additionally, each
world is associated with a possible world probability,

2. SYSTEM ANALYSIS
2.1 EXISTING SYSTEM

www.ijaert.org

International Journal of Advanced Engineering Research and Technology (IJAERT) 116

Volume 2 Issue 4, July 2014, ISSN No.: 2348 8190

such as Bing; have started to provide the probabilities

of ticket prices going up or down to assist decision
making of their users. Generally, data uncertainty
arises inherently from various causes, such as
incomplete survey results, data measure and collection
methods, statistical and data mining techniques, and so
on. Therefore, in many real-life applications, databases
contain incomplete, outdated, noisy, and uncertain
data.

3. SYSTEM STYLE
3.1 SYSTEM DESIGN

Disadvantages:
Incomplete survey results, statistical and data
mining techniques.
Real time Databases are incomplete, outdated ,
noisy and uncertain data
Data complexity
Not useful to the real world techniques

2.2 PLANNED SYSTEM

We propose a new skyline query (U-Skyline) for
uncertain data. It focuses on meeting the nondominance, incomparability and coverage properties
simultaneously for uncertain skyline query. In this
project we prove that U-Skyline query processing is
NP-hard. In this project we investigate the interplay
among different data tuples during the computation,
and transform U-Skyline query processing into an
integer programming problem. In this project we
design a search algorithm based on dynamic
programming (DP) to find U-Skyline. In this project
we also improve the algorithm with pruning and early
termination (P&ET) techniques. In this project we
propose input data set reduction (SR) and partition
(SP) techniques to reduce the input data set size in
order to further expedite the U-Skyline processing
time. My results demonstrate that the proposed
algorithm is much faster than using a parallel integer
programming solver to obtain U-skyline.
PROPOSED SYSTEM ADVANTAGES:
U-Skyline represents different conceptual
notions, and the two skyline variants are
complement to each other.
User friendly
Easy to use
The U-Skyline provides insights for a set of
tuples that most likely to be the skyline for the
uncertain data set.
Compared with the P-Skyline probability for a
tuple, the U-Skyline
probability of a tuple
set is relatively small.

Fig -1: System Design

3.2 OVER ALL DATA FLOW DIAGRAM

Fig - 2: Over All Data Flow Diagram

3.3 ALGORITHM
3.3.1 CANDIDATE SKY LINE SEARCH
ALGORITHM
Step 1: To identify the number of queries that had
given by the users.
Step 2: To find the maximum probability among the
queries

www.ijaert.org

International Journal of Advanced Engineering Research and Technology (IJAERT) 117

Volume 2 Issue 4, July 2014, ISSN No.: 2348 8190

Step 3: And to find how many of them dominant each

other.
Step 4: And to find how many of them they dont
dominant each other.
Step 5: And to find the probability among them.

3.3.2
DYNAMIC
ALGORITHM

base for the user. The solution is retrieved from the

large amount of data.

PROGRAMMING

Step 1: To find the probability of the query where it

appears
Step 2: To find the probability of the query where it
disappears
Step 3: To sort the query.

3.3.3
PRUNING
AND
TERMINATION ALGORITHM

EARLY

Step 1: The Sorted queries are stored in a variable.

Step 2: Each query in the variable should compare
with one another and the higher probability query is
deleted.
Step 3: And to find the probability where the minimum
query appears and disappears
Step 4: And to find the best sky line query with
minimum probability.

3.3.4
REDUCED
ALGORITHM

SET

Fig - 3: Candidate Skyline Search

4.3 DYNAMIC COMPUTATION

The maximum probability among the data is found.
The data in the database is sorted and to compare the
data with their probability. And delete the higher
probability data. And the minimum probability is
stored in the data base. The solution to the user must
be most usable for him and it must cheaper compare to
the other real world possibilities.

PRUNING

Step 1: The minimum probability queries are stored in

a variable.
Step 2: To find probability where it appears.
Step 3: To find the probability where it disappears.

3.3.5 REDUCED
PARTITIONS

SET

INDEPENDENT

Step 1: To find dominant queries

Step 2: To find the non-dominant queries.
Step 3: To merge in to single group Step.
Fig - 4: Dynamic computation

4. MODULES DESCRIPTION
4.1 ADMIN REGISTRATION
The admin is registered with username, password and
the address, country, zip code, email address and their
gender and their description and save the details. And
the admin is registered with the name, hotel address,
location, country, zip code, email and about their
description and stored in the data base.

4.2 CANDIDATE SKYLINE SEARCH

The Sender sends the query to the server. The Server
creates the probability to the query with the existing
datas. And find the probability where the query
appears and disappears in the existing datas in the
Data base. And find maximum probability among the
data. The best probability is retrieved from the data

4.4 DATA SET REDUCTION

The Minimum probability of the data is found. And to
find the probability of the query that is visible and to
find the probability of the query that is not visible. And
to collect the information about the data that is nondominant to other queries that is most related to that
query. The u-skyline results the most appropriate
answer to the user that is nearer to the query he queried
to the server.

www.ijaert.org

International Journal of Advanced Engineering Research and Technology (IJAERT) 118

Volume 2 Issue 4, July 2014, ISSN No.: 2348 8190

India. His research interest includes Cloud Computing

and Network Security.

Fig - 5: Data Set Reduction

5. CONCLUSION
In this project, we propose a new uncertain skyline
operator called U-Skyline. We show that processing USkyline is and np hard problem. Thus, we propose a
dynamic programming framework for processing Uskyline and developed a series of optimization
techniques, including probability computational
simplification, candidate skyline pruning and early
termination, data set reducing, and reduced set
partition, to alleviate the computational strain. We
compare our U-Skyline processing algorithms to a
commercial parallel integer programming solver, and
conduct practical experiments to demonstrate the
efficiency of our algorithms.

REFERENCES
[1] The Skyline Operator, Proc. 17th Intl Conf.
Data Eng. (ICDE 01), pp. 421- 430, 2001.
[2] Efficient Query Evaluation on Probabilistic
Databases, Proc. 13th Intl Conf. Very Large Data
Bases (VLDB 04),pp. 864-875, 2004.
[3] Probabilistic skylines on uncertain data, Proc.
33rd Intl Conf. Very Large Data Bases (VLDB 07),
pp. 15-26, 2007.
[4] Indexing Multi-Dimensional Uncertain Data with
Arbitrary Probability Density Functions, Proc. 31st
Intl Conf. Very Large Data Bases (VLDB 05), pp.
922-933, 2005.
[5] Probabilistic Skyline Operator Over Sliding
Windows, Proc. IEEE Intl Conf.Data Eng. (ICDE
09), pp. 1060-1071, 2009.

BIOGRAPHIES
Shaik Abdullah.G1 received the B.Tech Degree
Information Technology. Currently Pursuing the M.E
(Computer Science and Engineering) in A.V.C.
College of Engineering Mayiladuthurai, Tamil Nadu,
India. His research interest includes Cloud Computing
and Network Security.
Syed Ahamed Kabeer.SM2 Currently Pursuing the
B.E (Computer Science and Engineering) in A.V.C.
College of Engineering Mayiladuthurai, Tamil Nadu,

www.ijaert.org