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

Research output: ResearchConference Paper

Abstract

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.

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
Pages379-386
Number of pages8
ISBN (Electronic)9781509060290
ISBN (Print)9781509060306
DOIs
StatePublished - 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

Conference

ConferenceInternational Conference on Advanced Information Networking and Applications 2017
Abbreviated titleAINA 2017
CountryTaiwan
CityTaipei
Period27/03/1729/03/17

Keywords

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

Cite this

Li, L., Taniar, D., & Indrawan-Santiago, M. (2017). Parallel search processing of tree-structured data in a big data environment. In L. Barolli, M. Takizawa, T. Enokido, H-H. Hsu, & C-Y. Lin (Eds.), IEEE AINA 2017: IEEE 31st International Conference on Advanced Information Networking and Applications, 27-29 March 2017, Taipei, Taiwan [Proceedings] (pp. 379-386). [7920934] Piscataway NJ : IEEE, Institute of Electrical and Electronics Engineers. DOI: 10.1109/AINA.2017.59
Li, Lingxiao ; Taniar, David ; Indrawan-Santiago, Maria. / Parallel search processing of tree-structured data in a big data environment. IEEE AINA 2017: IEEE 31st International Conference on Advanced Information Networking and Applications, 27-29 March 2017, Taipei, Taiwan [Proceedings]. editor / Leonard Barolli ; Makoto Takizawa ; Tomoya Enokido ; Hui-Huang Hsu ; Chi-Yi Lin. Piscataway NJ : IEEE, Institute of Electrical and Electronics Engineers, 2017. pp. 379-386
@inbook{dc0215fcf6b747cba0c15c9c0507ec53,
title = "Parallel search processing of tree-structured data in a big data environment",
abstract = "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.",
keywords = "Big Data, Parallel Query Processing, Parallel Search, Tree-Structured Data",
author = "Lingxiao Li and David Taniar and Maria Indrawan-Santiago",
year = "2017",
month = "5",
doi = "10.1109/AINA.2017.59",
isbn = "9781509060306",
pages = "379--386",
editor = "Barolli, {Leonard } and Takizawa, {Makoto } and Enokido, {Tomoya } and Hsu, {Hui-Huang } and Lin, {Chi-Yi }",
booktitle = "IEEE AINA 2017",
publisher = "IEEE, Institute of Electrical and Electronics Engineers",
address = "United States",

}

Li, L, Taniar, D & Indrawan-Santiago, M 2017, Parallel search processing of tree-structured data in a big data environment. in L Barolli, M Takizawa, T Enokido, H-H Hsu & C-Y Lin (eds), IEEE AINA 2017: IEEE 31st International Conference on Advanced Information Networking and Applications, 27-29 March 2017, Taipei, Taiwan [Proceedings]., 7920934, IEEE, Institute of Electrical and Electronics Engineers, Piscataway NJ , pp. 379-386, International Conference on Advanced Information Networking and Applications 2017, Taipei, Taiwan, 27/03/17. DOI: 10.1109/AINA.2017.59

Parallel search processing of tree-structured data in a big data environment. / Li, Lingxiao; Taniar, David; Indrawan-Santiago, Maria.

IEEE AINA 2017: IEEE 31st International Conference on Advanced Information Networking and Applications, 27-29 March 2017, Taipei, Taiwan [Proceedings]. ed. / Leonard Barolli; Makoto Takizawa; Tomoya Enokido; Hui-Huang Hsu; Chi-Yi Lin. Piscataway NJ : IEEE, Institute of Electrical and Electronics Engineers, 2017. p. 379-386 7920934.

Research output: ResearchConference Paper

TY - CHAP

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

AU - Li,Lingxiao

AU - Taniar,David

AU - Indrawan-Santiago,Maria

PY - 2017/5/5

Y1 - 2017/5/5

N2 - 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.

AB - 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.

KW - Big Data

KW - Parallel Query Processing

KW - Parallel Search

KW - Tree-Structured Data

UR - http://www.scopus.com/inward/record.url?scp=85019715677&partnerID=8YFLogxK

U2 - 10.1109/AINA.2017.59

DO - 10.1109/AINA.2017.59

M3 - Conference Paper

SN - 9781509060306

SP - 379

EP - 386

BT - IEEE AINA 2017

PB - IEEE, Institute of Electrical and Electronics Engineers

ER -

Li L, Taniar D, Indrawan-Santiago M. Parallel search processing of tree-structured data in a big data environment. In Barolli L, Takizawa M, Enokido T, Hsu H-H, Lin C-Y, editors, IEEE AINA 2017: IEEE 31st International Conference on Advanced Information Networking and Applications, 27-29 March 2017, Taipei, Taiwan [Proceedings]. Piscataway NJ : IEEE, Institute of Electrical and Electronics Engineers. 2017. p. 379-386. 7920934. Available from, DOI: 10.1109/AINA.2017.59