Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Recent advancements in computer, communication and computational sciences
Guest editors: K.K. Mishra
Article type: Research Article
Authors: Siddiqa, Aishaa; * | Karim, Ahmadb | Saba, Tanzilac | Chang, Victord
Affiliations: [a] Department of Computer System and Technology, University of Malaya, Kuala Lumpur, Malaysia | [b] Department of Information Technology, Bahauddin Zakariya University, Multan, Pakistan | [c] College of Computer and Information Sciences, Prince Sultan University, Riyadh, Kingdom of Saudi Arabia | [d] IBSS, Xi’an Jiaotong Liverpool University, Suzhou, China
Correspondence: [*] Corresponding author. Aisha Siddiqa, Department of Computer System and Technology, University of Malaya, 50603 Kuala Lumpur, Malaysia. Tel.: +601 114391908; Fax: +603 79579249; E-mail: aasiddiqa@gmail.com.
Abstract: Efficient response to search queries is very crucial for data analysts to obtain timely results from big data spanned over heterogeneous machines. Currently, a number of big-data processing frameworks are available in which search operations are performed in distributed and parallel manner. However, implementation of indexing mechanism results in noticeable reduction of overall query processing time. There is an urge to assess the feasibility and impact of indexing towards query execution performance. This paper investigates the performance of state-of-the-art clustered indexing approaches over Hadoop framework which is de facto standard for big data processing. Moreover, this study leverages a comparative analysis of non-clustered indexing overhead in terms of time and space taken by indexing process for varying volume data sets with increasing Index Hit Ratio. Furthermore, the experiments evaluate performance of search operations in terms of data access and retrieval time for queries that use indexes. We then validated the obtained results using Petri net mathematical modeling. We used multiple data sets in our experiments to manifest the impact of growing volume of data on indexing and data search and retrieval performance. The results and highlighted challenges favorably lead researchers towards improved implication of indexing mechanism in perspective of data retrieval from big data. Additionally, this study advocates selection of a non-clustered indexing solution so that optimized search performance over big data is obtained.
Keywords: Big data, indexing, big data processing, data retrieval
DOI: 10.3233/JIFS-169269
Journal: Journal of Intelligent & Fuzzy Systems, vol. 32, no. 5, pp. 3259-3271, 2017
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl