Beruflich Dokumente
Kultur Dokumente
ABSTRACT
@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 1 | Nov-Dec 2017 Page: 1619
International Journal of Trend in Scientific Research and Development (IJTSRD) ISSN: 2456-6470
EXISTING SYSTEM Disadvantages Of Existing System:
3.1 Related Works and Disadvantages When the number of query keywords increases, the
performance drops dramatically as a result of
Existing system focus on baseline algorithm and massive candidate keyword covers generated.
Indexing Keyword Ratings, The baseline algorithm is The inverted index at each node refers to a pseudo
inspired by the mCK query processing methods [5], [4]. document that represents the keywords under the
For mCK query processing, the method in [4] browses node. Therefore, in order to verify if a node is
index in top-down manner while the method in [5] does relevant to a set of query keywords, the inverted
bottom-up. Given the same hierarchical index structure, index is accessed at each node to evaluate the
the top-down browsing manner typically performs better matching between the query keywords and the
than the bottom-up since the search in lower hierarchical pseudo-document associated with the node.
levels is always guided by the search result in the higher
hierarchical levels. However, the significant advantage 3.2 Analysis Of Problem.
of the method in [5] over the method in [4] has been
This test shows the impact of the performance. Is an
reported. This is because of the different index structures
application specific parameter to balance the weight of
applied. Both of them use a single tree structure to index
keyword rating and the diameter in the score function.
data objects of different keywords. But the number of
Compared to m, the impact of the performance is
nodes of the index in [5] has been greatly reduced to
limited. When _ = 1, BKC query is degraded to mKC
save I/O cost by keeping keyword information with
query where the distance between objects is the sole
inverted index separately. Since only leaf nodes and
factor and keyword rating is ignored. When _ changes
their keyword information are maintained in the inverted
from 1 to 0, more weight is assigned to keyword rating.
index, the bottom-up index browsing manner is used.
An interesting observation is that with the decrease of _
When designing the baseline algorithm for BKC query
the number of keyword covers generated in both the
processing, we take the advantages of both methods [5],
baseline algorithm and keyword-NNE algorithm shows
[4].
a constant trend of slight decrease. The reason behind is
that KRR*-tree has a keyword rating dimension. Objects
Indexing Keyword Ratings : To process BKC query, we close to each other geographically may have very
augment R*-tree with one additional dimension to index different ratings and thus they are in different nodes of
keyword ratings. Keyword rating dimension and spatial KRR*tree. If more weight is assigned to keyword
dimension are inherently different measures with ratings, KRR*-tree tends to have more pruning power by
different ranges. It is necessary to make adjustment. In distinguishing the objects close to each other but with
this work, a three-dimensional R*-tree called keyword different keyword ratings. As a result, less candidate
rating R*-tree (KRR*-tree) is used. The ranges of both keyword covers are generated.
spatial and keyword rating dimensions are normalized
SYSTEM ARCHITECTURE
into [0, 1].
The figure gives idea about system architecture. A query
Some existing works focus on retrieving individual
including a query region and a course of action of query
objects by specifying a query consisting of a query
catchphrases. Each recovered thing is connected with
location and a set of query keywords (or known as
watchwords basic to the query catchphrases and is close
document in some context). Each retrieved object is
to the query region. The identicalness between reports is
associated with keywords relevant to the query
connected with assess the criticalness between two
keywords and is close to the query location. The
arrangements of watchwords. Since it is likely no
approaches proposed by Cong et al. and Li etal. employ
individual article is related with all query watchwords,
a hybrid index that augments nodes in non-leaf nodes of
some particular works mean to recover diverse things
an R/R*-tree with inverted indexes. In virtual bR*-tree
which together cover all query catchphrases. Framework
based method, an R*-tree issued to index locations of
finds main problems like: 1)cover all query watchwords,
objects and an inverted index is used to label the leaf
2) have slightest between things partition and 3) are
nodes in the R*-tree associated with each keyword.
close to a query territory. The objective of the interface
Since only leaf nodes have keyword information the
is to give purpose of interest data (static and segment
mCK query is processed by browsing index bottom-up.
ones) with, no not precisely, a domain, a few necessaries
qualities and open slight segments (depiction). In
@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 1 | Nov-Dec 2017 Page: 1620
International Journal of Trend in Scientific Research and Development (IJTSRD) ISSN: 2456-6470
requesting to give those data, the segment that executes distance from user’s current location to the query point,
the interface utilizes the associate database data to find travelling distance and time is calculated. Because
and exhibit purpose of interest (POI) or to pick a POI as euclidean distance may not always give an accurate
course way point and top pick. This part not just gives result as user expected.
seek usefulness to the area database also a way to deal
with partner outside web record to this section and Let Ok be the set of principal objects under principal
overhaul the chase criteria and the once-over of results. query keyword k. ok ∈ Ok be the principal object in
GBKCk. Distance of ok to the user’s current location L
is not specified in this method. Shortest travelling
distance of the path taken by user from location L to the
principal object in Global Best Keyword Cover can be
obtained using Google API [14]. Adding this feature can
make the searching more user friendly and give more
support for a traveller in good decision making.
@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 1 | Nov-Dec 2017 Page: 1623