Scribd
Upload
10 views7 pages

Efficiently Processing Spatial and Keyword Queries in Indoor Venues

The document presents two novel indexing structures, Indoor Partitioning Tree (IP-Tree) and Vivid IP-Tree (VIP-Tree), designed to enhance the efficiency of processing spatial and keyword queries in indoor venues. These indexes leverage the unique properties of indoor spaces to achieve near-optimal performance and low construction costs compared to existing methods. Additionally, the paper introduces a new data structure, Keyword Partitioning Tree (KP-Tree), for handling spatial keyword queries, demonstrating significant improvements in query performance through extensive experimental studies.

Uploaded by

bhavanihani2004
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
10 views7 pages

Efficiently Processing Spatial and Keyword Queries in Indoor Venues

The document presents two novel indexing structures, Indoor Partitioning Tree (IP-Tree) and Vivid IP-Tree (VIP-Tree), designed to enhance the efficiency of processing spatial and keyword queries in indoor venues. These indexes leverage the unique properties of indoor spaces to achieve near-optimal performance and low construction costs compared to existing methods. Additionally, the paper introduces a new data structure, Keyword Partitioning Tree (KP-Tree), for handling spatial keyword queries, demonstrating significant improvements in query performance through extensive experimental studies.

Uploaded by

bhavanihani2004
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Efficiently Processing Spatial and Keyword Queries

in Indoor Venues

ABSTRACT

Due to the growing popularity of indoor location-based services, indoor data


management has received significant research attention in the past few years.
However, we observe that the existing indexing and query processing techniques
for the indoor space do not fully exploit the properties of the indoor space.
Consequently, they provide below par performance which makes them unsuitable
for large indoor venues with high query workloads. In this paper, we first propose
two novel indexes called Indoor Partitioning Tree (IP-Tree) and Vivid IP-Tree
(VIP-Tree) that are carefully designed by utilizing the properties of indoor venues.
The proposed indexes are lightweight, have small pre-processing cost and provide
near-optimal performance for shortest distance and shortest path queries. We are
also the first to study spatial keyword queries in indoor venues. We propose a novel
data structure called Keyword Partitioning Tree (KP-Tree) that indexes objects in
an indoor partition. We propose an efficient algorithm based on VIP-Tree and KP-
Trees to efficiently answer spatial keyword queries. Our extensive experimental
study on real and synthetic data sets demonstrates that our proposed indexes
outperform the existing solutions by several orders of magnitude.
EXISTING SYSTEM

Indoor Data Modelling Data modelling for indoor space is fundamental for
querying indoor space. In [15], a 3D model is proposed for indoor space but it fails to
support indoor distance computations. CityGML [1] and IndoorGML [2] are XML
based methods to model and exchange the indoor space data. As stated in Section 1,
the distance-aware model [19] introduces an extended graph based on an
accessibility base graph and D2D graph that enables indoor distance computations
between two indoor positions.

Spatial Queries in Indoor Space. Several indoor spatial queries such as shortest
distance queries, shortest path queries, kNN queries and range queries have been
studied under various settings [20], [31], [32], [35]. The most notable techniques
[19], [33] have already been discussed in Section 1. Existing research also studies
various other indoor queries such as trip planning queries and multi-criteria route
planning queries [23], [24]. Indexing and querying moving indoor objects have also
been studied in the past [11], [30].

Spatial Queries in Outdoor Space. Query processing in Euclidean space and road
networks [6], [10], [26], [34] is very well studied. Since an indoor space can be
converted into a D2D graph, various techniques [27], [36], [37] in spatial road
networks can also be applied. G-tree [36], [37] is the state-of-the art technique for
processing a variety of spatial queries on road networks. Although our proposed
indexes, IP-Tree and VIP-Tree, are inspired by G-tree, there are some fundamental
differences.

Specifically, G-tree uses an existing multilevel graph partitioning algorithm [14]


for graph decomposition whereas we design a new algorithm that carefully exploits
the properties of the indoor space to minimize the total number of access doors. Also,
the smaller number of access doors in our nodes allows us to use materialization in
the VIP-tree which proves to be a much more efficient strategy but is not feasible for
G-tree. Furthermore, our algorithms to process shortest path queries, range queries,
kNN queries and spatial keyword queries are also entirely different.

Spatial Keyword Queries in Outdoor Space. Spatial keyword queries have been
extensively studied in Euclidean space [18], [22], [29]. For example, the Inverted R-
tree [38] is proposed that creates, for each keyword t, an R-tree based on the objects
that contains the keyword t. Inverted R-trees are efficient when the number of query
keywords is small because the query needs to process only a few R-trees.
Information retrieval R-tree (IR2-tree) [9] aims to address this problem by utilizing
signatures that summarize the keywords contained in the descendent entries of a
node. Information R-tree (IR-tree) [8], [28] utilizes inverted files for each node that
maintains the keywords information in the node. WIR-tree [29] is similar to IR-tree,
but it partitions the objects according to keyword frequencies instead of spatial
locations. A detailed experimental evaluation comparing different spatial keyword
approaches is presented in [7].

Disadvantages
o In the existing work, the system is very less effective due to lack of
Construction of Spatial Query processing tress.
o The system is not minimizing the total amount of misinformation
between users and spatial queries.
PROPOSED SYSTEM

To handle fundamental spatial queries, we propose two novel indoor indexes called
Indoor Partitioning tree (IP-Tree) and Vivid IP-Tree (VIP-Tree) that optimize the
indexing by exploiting the properties of indoor spaces. The basic observation is that
the shortest path from a point in one indoor region to a point in another region passes
through a small subset of doors (called access doors). For example, the shortest path
between two points located on different floors of a building must pass one of the
stairs/lifts connecting the two floors. The proposed indexes take into account this
observation in their design and have the following attractive features. Near-optimal
efficiency. Our experimental study on real and synthetic data sets demonstrates that
IP-Tree and VIP-Tree outperform the state-of-the-art techniques for indoor space
[19] and road networks [16], [37] by several orders of magnitude. In comparison
with the distance matrix, that allows constant time retrieval of distance between any
two doors at the cost of expensive pre computing and quadratic storage, our VIP-
Tree also achieves comparable (and near-optimal) performance for shortest distance
and path queries.

Low indexing cost. VIP-Tree and IP-Tree have small construction cost and low
storage requirement. For example, for the largest data set used in our experiments
that consists of around 83, 000 rooms (around 13.4 million edges), VIP-Tree and IP-
Tree consume around 600 MB and can be constructed in less than 2 minutes. In
contrast, it took almost 14 hours to construct the distance matrix for a much smaller
building consisting of around 2, 700 rooms (around 110, 000 edges).

Low theoretical complexities. Our proposed indexes do not only provide practical
efficiency but also have low storage and computational complexities. Table 1
compares the storage complexity and shortest distance/path computation cost of our
proposed approach with the distance matrix which has near-optimal computational
complexity. For the data sets used in our experiments, the average values of _ and f
are less than 4. For our proposed trees, M is the number of leaf nodes which is
bounded by the number of doors D. Note that VIP-Tree has a significantly low
storage cost compared to the distance matrix but has the same computational
complexity. A detailed theoretical analysis is provided in the conference version [25]
of this paper.

Advantages
 The system is more effective in Spatial Query Processing by Keyword-
Partitioning Tree (KP-Tree).
 The system is more effective due to presence of Shortest Distance Queries and k
Nearest Neighbor (kNN) techniques.

SYSTEM REQUIREMENTS

➢ H/W System Configuration:-

➢ Processor - Pentium –IV


➢ RAM - 4 GB (min)
➢ Hard Disk - 20 GB
➢ Key Board - Standard Windows Keyboard
➢ Mouse - Two or Three Button Mouse
➢ Monitor - SVGA

Software Requirements:
 Operating System - Windows XP
 Coding Language - Java/J2EE(JSP,Servlet)
 Front End - J2EE
 Back End - MySQL

You might also like