A real time system for indoor shortest path query with indexed indoor datasets

Zhou Shao, Joon Bum Lee, David Taniar, Yang Bo

    Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

    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.

    LanguageEnglish
    Title of host publicationDatabases Theory and Applications
    Subtitle of host publication27th Australasian Database Conference, ADC 2016, Sydney, NSW, September 28–29, 2016,Proceedings
    EditorsMuhammad Aamir Cheema, Lijun Chang, Wenjie Zhang
    Place of PublicationCham, Switzerland
    PublisherSpringer
    Pages440-443
    Number of pages4
    ISBN (Electronic)9783319469225
    ISBN (Print)9783319469218
    DOIs
    Publication statusPublished - 2016
    EventAustralasian Database Conference 2016 - The University of New South Wales, Sydney, Australia
    Duration: 28 Sep 201629 Sep 2016
    Conference number: 27th
    https://adc2016.cse.unsw.edu.au/

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer
    Volume9877 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    ConferenceAustralasian Database Conference 2016
    Abbreviated titleADC 2016
    CountryAustralia
    CitySydney
    Period28/09/1629/09/16
    OtherThe 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

    Shao, Z., Lee, J. B., Taniar, D., & Bo, Y. (2016). A real time system for indoor shortest path query with indexed indoor datasets. In M. A. Cheema, L. Chang, & W. Zhang (Eds.), Databases Theory and Applications: 27th Australasian Database Conference, ADC 2016, Sydney, NSW, September 28–29, 2016,Proceedings (pp. 440-443). (Lecture Notes in Computer Science ; Vol. 9877 LNCS). Cham, Switzerland: Springer. https://doi.org/10.1007/978-3-319-46922-5_35
    Shao, Zhou ; Lee, Joon Bum ; Taniar, David ; Bo, Yang. / A real time system for indoor shortest path query with indexed indoor datasets. Databases Theory and Applications: 27th Australasian Database Conference, ADC 2016, Sydney, NSW, September 28–29, 2016,Proceedings. editor / Muhammad Aamir Cheema ; Lijun Chang ; Wenjie Zhang. Cham, Switzerland : Springer, 2016. pp. 440-443 (Lecture Notes in Computer Science ).
    @inproceedings{0013e801f2d94aa79ce190530abf7077,
    title = "A real time system for indoor shortest path query with indexed indoor datasets",
    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.",
    author = "Zhou Shao and Lee, {Joon Bum} and David Taniar and Yang Bo",
    year = "2016",
    doi = "10.1007/978-3-319-46922-5_35",
    language = "English",
    isbn = "9783319469218",
    series = "Lecture Notes in Computer Science",
    publisher = "Springer",
    pages = "440--443",
    editor = "Cheema, {Muhammad Aamir } and Chang, {Lijun } and Zhang, {Wenjie }",
    booktitle = "Databases Theory and Applications",

    }

    Shao, Z, Lee, JB, Taniar, D & Bo, Y 2016, A real time system for indoor shortest path query with indexed indoor datasets. in MA Cheema, L Chang & W Zhang (eds), Databases Theory and Applications: 27th Australasian Database Conference, ADC 2016, Sydney, NSW, September 28–29, 2016,Proceedings. Lecture Notes in Computer Science , vol. 9877 LNCS, Springer, Cham, Switzerland, pp. 440-443, Australasian Database Conference 2016, Sydney, Australia, 28/09/16. https://doi.org/10.1007/978-3-319-46922-5_35

    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 proceedingConference PaperResearch

    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

    A2 - Cheema, Muhammad Aamir

    A2 - Chang, Lijun

    A2 - Zhang, Wenjie

    PB - Springer

    CY - Cham, Switzerland

    ER -

    Shao Z, Lee JB, Taniar D, Bo Y. A real time system for indoor shortest path query with indexed indoor datasets. In Cheema MA, Chang L, Zhang W, editors, Databases Theory and Applications: 27th Australasian Database Conference, ADC 2016, Sydney, NSW, September 28–29, 2016,Proceedings. Cham, Switzerland: Springer. 2016. p. 440-443. (Lecture Notes in Computer Science ). https://doi.org/10.1007/978-3-319-46922-5_35