Parallel search processing of tree-structured data in a big data environment

Lingxiao Li, David Taniar, Maria Indrawan-Santiago

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

    5 Citations (Scopus)


    Every database systems needs to employ searching algorithms to locate and retrieve data. With the proliferation of NoSQL databases, there is a need to design search algorithms that are optimised for the non-relational files and record structures. We propose several search algorithms for document-based databases. The algorithms were designed with parallelism in mind, considering many of the NoSQL databases have very large volume of data. The algorithms were implemented and extensively tested on MongoDB and Apache Spark environment. The test results shows a promising performance of our proposed algorithms.

    Original languageEnglish
    Title of host publicationIEEE AINA 2017
    Subtitle of host publicationIEEE 31st International Conference on Advanced Information Networking and Applications, 27-29 March 2017, Taipei, Taiwan [Proceedings]
    EditorsLeonard Barolli, Makoto Takizawa, Tomoya Enokido, Hui-Huang Hsu, Chi-Yi Lin
    Place of PublicationPiscataway NJ
    PublisherIEEE, Institute of Electrical and Electronics Engineers
    Number of pages8
    ISBN (Electronic)9781509060290
    ISBN (Print)9781509060306
    Publication statusPublished - 5 May 2017
    EventInternational Conference on Advanced Information Networking and Applications 2017 - Tamkang University, Taipei, Taiwan
    Duration: 27 Mar 201729 Mar 2017
    Conference number: 31st (Proceedings)


    ConferenceInternational Conference on Advanced Information Networking and Applications 2017
    Abbreviated titleAINA 2017
    Internet address


    • Big Data
    • Parallel Query Processing
    • Parallel Search
    • Tree-Structured Data

    Cite this