You are on page 1of 5

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org


Volume 3, Issue 6, November-December 2014

ISSN 2278-6856

Top-K Dominating Queries Using


Multidimensional Data
Ms.M.Sivakani 1, Ms.M.Pabitha 2 and Ms.K.Sumithra Devi 3
1

Department of CSE, Apollo Engineering College,


Chennai, Tamilnadu

Department of CSE, Apollo Engineering College,


Chennai, Tamilnadu

Department of CSE, Apollo Engineering College,


Chennai, Tamilnadu

Abstract
The most important limitation of top-k queries is that a
ranking function is required. This function is usually user
defined, whereas different functions generally result in
different results. Moreover, in several cases the selection of an
appropriate ranking function is not intuitive. Skyline queries,
on the other hand, do not require a ranking function and they
have the scaling invariance property, meaning that if scaling
is applied to dimension values the result remains unchanged.
The result of a skyline query is composed of the points that
are not dominated by any other point. We develop our
proposal an interesting alternative has been proposed which
combines the concept of dominance with the notion of
ranking functions. This new query is termed top-k dominating
query which provides toward efficient processing of
continuous top-k dominating queries over multidimensional
data streams, by studying both exact and approximate
solutions.

Keywords:- top-k, skyline queries, dominating queries,


spatial data.

1. INTRODUCTION
Data mining, the extraction of hidden predictive
information from large databases, is a powerful new
technology with great potential to help companies focus
on the most important information in their data
warehouses. Data mining tools predict future trends and
behaviors, allowing businesses to make proactive,
knowledge-driven decisions. The automated, prospective
analyses offered by data mining move beyond the analyses
of past events provided by retrospective tools typical of
decision support systems. Data mining tools can answer
business questions that traditionally were too time
consuming to resolve. They scour databases for hidden
patterns, finding predictive information that experts may
miss because it lies outside their expectations.

Volume 3, Issue 6, November-December 2014

Figure 1 Data Mining Process


Data process is shown in the figure 1 the input is given by
the user and stored in the spatial data, based on the query
the result is given. Based on the user query the processing
will be done using the top-k and skyline queries using the
spatial data and the dominated result will be displayed. In
this paper we proposed a new query is termed top-k
dominating query and in a sense it is a combination of
top-k and skyline queries: it uses a ranking function to
rank points (as in top-k queries) and it uses the dominance
relationship (as in skyline queries). We will show how it
can be achieved by the spatial objects dominating based on
ranking. In this we combined the concept of dominance
with the notion of ranking functions. This new query is
termed top-k dominating query and in a sense it is a
combination of top-k and skyline queries: it uses a ranking
function to rank points (as in top-k queries) and it uses the
dominance relationship (as in skyline queries). The score
associated with a point pi, denoted as score, equals the
number of points that pi dominates. The motivation
behind this idea is to define a preference query that
maintains the advantages and eliminates the limitations of
both top-k and skyline queries.

Page 65

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)


Web Site: www.ijettcs.org Email: editor@ijettcs.org
Volume 3, Issue 6, November-December 2014

ISSN 2278-6856

directly giving from the system admin or manager to the


users who are authorized. The users want to follow some
rules and conditions while using the system, and any
misbehave will lead to block of particular user-id/name.
2.2 Matching Buyer
The seller demands will be matching for the buyer
demand. Matching buyer demands will show in the seller
side. At the time seller demand matched demand list will
be show in the particular content. It is useful to the seller
side because they can select for the particular buyer from
the list.
2.3 Buyer
Buyer post their requirements which area they have to
select and required Sq feet, also post their minimum to
max budget, not only these information they have to select
For which purpose (commercial, residential) and add also
his personal details like contact details. So here consumer
select or post their requirements based on this
requirements peddler show their lists of place where they
having property. So one can easily choose their own
property based on these processing.

Figure 2 System Architecture

2. SYSTEM ARCHITECTURE
Seller having many properties in city, so they have to sold
the property for that reason they have to post their
features, like how many flats they having currently, what
are the Land size and sq feet rate, which are the landmark
is nearest to flat. The seller first enters the authentication
then they continue the process. If the seller demands
matches the buyer demand. Matching buyer demands will
show in the seller side. Buyer post their requirements
which area they have to select and required Sq feet, also
post their minimum to max budget, not only these
information they have to select For which purpose
(commercial, residential) and add also his personal details
like contact details. The spatial information they will be
stored in the database. The admin will be calculating the
Score of the spatial information in Hospitals, markets,
Restaurants, Transports first calculate the each spatial
datas temporary score and finally give the Rank for the
Land. The score can be calculated and the result can be
found out using the top-k queries. The overview of the
processing is shown in figure 2
2.1 Login
User verification is needed for every system to keep
security and for any other misuses. Each authorized user
will have a user-id/name and a password for login. This is

Volume 3, Issue 6, November-December 2014

2.4 Buyer Details


The buyer chooses the properties to register. This
application is useful to buyer side. They will not register
land at the time of the demand for land. So that problem is
finding to use the process. If the buyer matched seller
properties and they want to buy the same property they
can send mail in the particular process to benefit to the
user side. The user can register the particular properties in
the online process.
2.5 Matching Seller
The seller demands will be matching for the buyer
demand. Matching buyer demands will show in the seller
side. At the time seller demand matched demand list will
be show in the particular content. It is useful to the seller
side because they can select for the particular buyer from
the list.
2.6 Seller
Seller post their requirements which area they have to
select and required Sq feet, also post their minimum to
max budget, not only these information they have to select
For which purpose (commercial, residential) and add also
his personal details like contact details. So here consumer
select or post their requirements based on this
requirements peddler show their lists of place where they
having property. So one can easily choose their own
property based on these processing.
2.7 Seller Details
The seller chooses the properties to register. This
application is useful to buyer side. They will not register
land at the time of the demand for land. So that problem is
finding to use the process. If the buyer matched seller
properties and they want to buy the same property they
Page 66

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)


Web Site: www.ijettcs.org Email: editor@ijettcs.org
Volume 3, Issue 6, November-December 2014
can send mail in the particular process to benefit to the
user side. The user can register the particular properties in
the online process.
2.8 Property Details
Seller having many properties in city, so they have to sold
that property for that reason they have to post their
features, like how many flats they having currently, what
are the Land size and sq feet rate, which are the landmark
is nearest to flat. Whether it is junction placed or not,
terms and condition of Land, seller provide any of
banking help to the consumer and also they post seller
contact information. So one can who having to buy the
flat, they can easily get clear information from this site.
2.9 Spatial Data
The Admin insert the spatial data in for the lands. The
seller first enters the authentication then they continue the
process. Next they register the spatial datas of hospitals,
markets, transport, and restaurants. They enter the details
of each properties and which location to near in land. Last
they enter the distance between seller lands to properties.
The admin checks the value to give the temporary Score
in the land with spatial datas. Spatial data shows the
ranking of the property. Using the Event based and
advanced based algorithm the spatial data is given by the
admin.

ISSN 2278-6856

In figure 3 the score evaluation using the spatial data tuple


k is shown. The score for the tuple tk can be calculated
using the top-k queries and the rank is provided using the
dominating query. The score is calculated and the
influence region is shown. Thus the score is evaluated
using the top-k dominating query. Event based and
advanced algorithm is analyzed for finding the expected
property.
Table 1: Evaluation of score for the property

Property
Rate

Score

T1

T2

T3

0.5

T4

2.5

4.5

T5

1.5

T6

3.5

Table 1 shows the evaluation score of the property using


the rate and the landmark of the property.

3. EXPERIMENTAL RESULTS AND DISCUSSIONS


To evaluate the performance of the system using top-k
queries the following is used, to find the scoring of the
property[1] Function F and a retrieval size k, a top-k
query returns an ordered set of k tuples {t1, . . . , tk}, i.e.,
F(t1) . . . F(tk) F(tl) such that tl R{ti, . . . tk}.
To evaluate the dominance the following is used and
consider t and t,t dominates t on A, denoted as t t if
and only if i [1, d] : ti t i and j [1, d] : tj <
tj. To evaluate the property using the skyline queries,
consider the following. A tuple t is a skyline tuple if and
only if any other tuple t ( t) does not dominate t on A.
The skyline is a set of skyline tuples such that SKY(R) =
{t R|t R : t t}.

Figure 4 Score calculation using Skyline


In figure 4 using the skyline query the tuple are calculated
and the score is generated.
Table 2: Dominating the property

D1

D2

D3

D4

D5

D6

T1

T2

T3

T4

T5

In table 2 the dominated property is shown using the score


value of the tuple.
Figure 3 Score Evaluation

Volume 3, Issue 6, November-December 2014

Page 67

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)


Web Site: www.ijettcs.org Email: editor@ijettcs.org
Volume 3, Issue 6, November-December 2014
Table 3: Top-k dominating Score

Property
Rate

Score

T1

T2

T3

0.5

T4

2.5

4.5

T5

1.5

In table 3 the score value using the top-k dominating


query is shown for the tuple. Using the rate the score is
provided using the top-k queries.

ISSN 2278-6856

Dominating
QueriesIEEE
Transactions
on
Knowledge and Data Engineering, 2012
[2] Jongwuk Lee, Hyunsouk Cho, Seung-won Hwang,
Efficient Dual-Resolution Layer Indexing forTop-k
Queries,IEEE 28th International Conference on Data
Engineering,June 2012.
[3] W. Kiessling, Foundations of Preferences in
Database Systems, 2002.
[4] A.N. Papadopoulos, A. Lyritsis, Domination Mining
and Querying,2007.
[5] M.L. Yiu and N. Mamoulis,Efficient Processing of
Top-K Dominating Queries on Multi-Dimensional
Data,IEEE International Conference, 2007.
[6] C.-Y. Chan, H.V. Jagadish, K.-L Tan, Finding K
Dominant Skylines in High Dimensional Space,
2006.
[7] N. Mamoulis, M.L. Yiu, K.H. Cheng, Efficient
Aggregation of Ranked Inputs, 2007.
[8] Kyriakos Mouratidis, Dimitris Papadias, Spiridon A
Threshold-Based
Algorithm
for
Continuous
Monitoring of K Nearest Neighbors, 2005.
[9] X. Xiong, M.F. Mokbel, and W.G. Aref, SEA-CNN:
Scalable Processing of Continuous K-Nearest
Neighbor Queries In Spatio-Temporal Databases,
2005.
[10] B. Babcock, S. Babu, M. Datar, R. Motwani, Models
and Issues in Data Stream Systems,2002.
[11] L. U, K. Mouratidis, and N. Mamoulis, Continuous
Spatial Assignment of Moving Users, 2010.
[12] X. Lin, Y. Yuan, Q. Zhang, Selecting Stars: The K
Most Representative Skyline Operator, 2007

AUTHOR
Figure 4 Top-k query Score
In figure 5 the score points are shown for the tuples using
the top-k query.

4. CONCLUSION AND FUTURE WORK


Thus we have developed the system using the concept of
top-k dominating queries for finding the top rank property
in the city using the spatial data and score for the
property. The analysis is shown using the top-k query,
skyline query and the top-k dominating query. Top-k
dominating query combined the both functionality of the
top-k and the skyline query. The event based and
advanced based algorithms is used for providing rank and
dominates the property by comparing the rank of each
property registered. As a future work, an analysis
operation will be performed for the proposed techniques to
derive an upper bound for the expected number of exact
score.

References

Mrs. R.Sivakani is currently working as


an Assistant professor in CSE department
at Apollo Engineering College, Chennai,
India. She has received the Post-graduate
qualification in Computer Science and
Engineering in the year 2013 from
Sathyabama University, Chennai. She has more than 7
years of teaching experience. Her current research interest
includes Data Mining and Cloud Computing
Mrs. M.Pabitha is currently working as
an
Assistant professor in CSE
department at Apollo
Engineering
College, Chennai, India. She
has
received the Post-graduate qualification
in Computer Science and Engineering
in the year 2010 from KCT, Coimbatore. She has more
than 4 years of teaching experience. Her current research
interest includes Template Security in computing and
Digital image processing. Moreover She is a member of
ISTE.

[1] A. Maria Kontaki, Apostolos N. Papadopoulos, and


Yannis
Manolopoulos,
Continuous
Top-k

Volume 3, Issue 6, November-December 2014

Page 68

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)


Web Site: www.ijettcs.org Email: editor@ijettcs.org
Volume 3, Issue 6, November-December 2014

ISSN 2278-6856

Mrs. K.Sumithra Devi


is currently
working as an Assistant professor in CSE
department at Apollo Engineering
College, Chennai, India. She has received
the
Post-graduate
qualification
in
Computer Science and Engineering in the
year 2010 from Anna University, Coimbatore. She has
more than 6 years of teaching experience. Her current
research interest includes Big data security issues.

Volume 3, Issue 6, November-December 2014

Page 69

You might also like