Abstract
In comparison to query processing in spatial road networks, indoor query processing is not well studied due to limited number of available indoor datasets. In this paper, we present a system to represent floor plans of indoor spaces which enables users to find the shortest path between two indoor locations. Indoor spaces, such as shopping malls and office buildings, contain a large number of rooms and doors, which cause some difficulties to people to find their ways inside the building such as a large shopping centre. We have developed a system that is used to index floor plans and allow users to specify any two given locations and calculate the shortest path.
| Language | English |
|---|---|
| Title of host publication | Databases Theory and Applications |
| Subtitle of host publication | 27th Australasian Database Conference, ADC 2016, Sydney, NSW, September 28–29, 2016,Proceedings |
| Editors | Muhammad Aamir Cheema, Lijun Chang, Wenjie Zhang |
| Place of Publication | Cham, Switzerland |
| Publisher | Springer |
| Pages | 440-443 |
| Number of pages | 4 |
| ISBN (Electronic) | 9783319469225 |
| ISBN (Print) | 9783319469218 |
| DOIs | |
| State | Published - 2016 |
| Event | Australasian Database Conference 2016 - The University of New South Wales, Sydney, Australia Duration: 28 Sep 2016 → 29 Sep 2016 Conference number: 27th https://adc2016.cse.unsw.edu.au/ |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer |
| Volume | 9877 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | Australasian Database Conference 2016 |
|---|---|
| Abbreviated title | ADC 2016 |
| Country | Australia |
| City | Sydney |
| Period | 28/09/16 → 29/09/16 |
| Other | The Australasian Database Conference series is an annual forum for sharing the latest research progresses and novel applications of database systems, data driven applications and data analytics for researchers and practitioners in these areas from Australia, New Zealand and in the world. |
| Internet address |
Cite this
}
A real time system for indoor shortest path query with indexed indoor datasets. / Shao, Zhou; Lee, Joon Bum; Taniar, David; Bo, Yang.
Databases Theory and Applications: 27th Australasian Database Conference, ADC 2016, Sydney, NSW, September 28–29, 2016,Proceedings. ed. / Muhammad Aamir Cheema; Lijun Chang; Wenjie Zhang. Cham, Switzerland : Springer, 2016. p. 440-443 (Lecture Notes in Computer Science ; Vol. 9877 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference Paper
TY - GEN
T1 - A real time system for indoor shortest path query with indexed indoor datasets
AU - Shao,Zhou
AU - Lee,Joon Bum
AU - Taniar,David
AU - Bo,Yang
PY - 2016
Y1 - 2016
N2 - In comparison to query processing in spatial road networks, indoor query processing is not well studied due to limited number of available indoor datasets. In this paper, we present a system to represent floor plans of indoor spaces which enables users to find the shortest path between two indoor locations. Indoor spaces, such as shopping malls and office buildings, contain a large number of rooms and doors, which cause some difficulties to people to find their ways inside the building such as a large shopping centre. We have developed a system that is used to index floor plans and allow users to specify any two given locations and calculate the shortest path.
AB - In comparison to query processing in spatial road networks, indoor query processing is not well studied due to limited number of available indoor datasets. In this paper, we present a system to represent floor plans of indoor spaces which enables users to find the shortest path between two indoor locations. Indoor spaces, such as shopping malls and office buildings, contain a large number of rooms and doors, which cause some difficulties to people to find their ways inside the building such as a large shopping centre. We have developed a system that is used to index floor plans and allow users to specify any two given locations and calculate the shortest path.
UR - http://www.scopus.com/inward/record.url?scp=84990041200&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-46922-5_35
DO - 10.1007/978-3-319-46922-5_35
M3 - Conference Paper
SN - 9783319469218
T3 - Lecture Notes in Computer Science
SP - 440
EP - 443
BT - Databases Theory and Applications
PB - Springer
CY - Cham, Switzerland
ER -