Professional Documents
Culture Documents
ISSN 2278-6856
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.
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.
Page 65
ISSN 2278-6856
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
ISSN 2278-6856
Property
Rate
Score
T1
T2
T3
0.5
T4
2.5
4.5
T5
1.5
T6
3.5
D1
D2
D3
D4
D5
D6
T1
T2
T3
T4
T5
Page 67
Property
Rate
Score
T1
T2
T3
0.5
T4
2.5
4.5
T5
1.5
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.
References
Page 68
ISSN 2278-6856
Page 69