Data allocation optimization for query processing in graph databases using Lucene

被引：8

作者：

Mathew, Anita Brigit ^{[1
]}

机构：

[1] NIT, Dept Comp Sci & Engn, Calicut, Kerala, India

来源：

COMPUTERS & ELECTRICAL ENGINEERING | 2018年 / 70卷

关键词：

Big Data; Query retrieval; Graph NoSQL databases; Data allocation; Best Fit Decreasing; Ant Colony Optimization; SYSTEMS;

D O I：

10.1016/j.compeleceng.2018.01.022

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Methodological handling of queries is a crucial requirement in social networks connected to a graph NoSQL database that incorporates massive amounts of data. The massive data need to be partitioned across numerous nodes so that the queries when executed can be retrieved from a parallel structure. A novel storage mechanism for effective query processing must to be established in graph databases for minimizing time overhead. This paper proposes a metaheuristic algorithm for partitioning of graph database across nodes by placement of all related information on same or adjacent nodes. The graph database allocation problem is proved to be NP-Hard. A metaheuristic algorithm comprising of Best Fit Decreasing with Ant Colony Optimization is proposed for data allocation in a distributed architecture of graph NoSQL databases. Lucene index is applied on proposed allocation for faster query processing. The proposed algorithm with Lucene is evaluated based on simulation results obtained from different heuristics available in literature. (C) 2018 Elsevier Ltd. All rights reserved.

引用

页码：1019 / 1033

页数：15

共 23 条

[1] Big Data computing and clouds: Trends and future directions [J].

Assuncao, Marcos D. ;

Calheiros, Rodrigo N. ;

Bianchi, Silvia ;

Netto, Marco A. S. ;

Buyya, Rajkumar .

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2015, 79-80 :3-15

[2] A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems [J].

Braun, TD ;

Siegel, HJ ;

Beck, N ;

Bölöni, LL ;

Maheswaran, M ;

Reuther, AI ;

Robertson, JP ;

Theys, MD ;

Yao, B ;

Hensgen, D ;

Freund, RF .

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2001, 61 (06) :810-837

[3]

Coffman Jr EG, 2004, INTRO BIN PACKING BI

[4]

COLORNI A, 1992, FROM ANIM ANIMAT, P134

[5] Tight absolute bound for First Fit Decreasing bin-packing: FFD(L) ≤ 11/9 OPT(L)+6/9 [J].

Dosa, Gyoergy ;

Li, Rongheng ;

Han, Xin ;

Tuza, Zsolt .

THEORETICAL COMPUTER SCIENCE, 2013, 510 :13-61

[6]

FALKENAUER E, 1992, 1992 IEEE INTERNATIONAL CONF ON ROBOTICS AND AUTOMATION : PROCEEDINGS, VOLS 1-3, P1186, DOI 10.1109/ROBOT.1992.220088

[7]

Gil David., 2016, Modeling and management of big data: challenges and opportunities

[8] Local Search based Ant Colony Optimization for Scheduling in Cloud Computing [J].

Gondhi, Naveen Kumar ;

Sharma, Aditya .

2015 SECOND INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING AND COMMUNICATION ENGINEERING ICACCE 2015, 2015, :432-436

[9]

Kavitha N, 2017, COMPUT ELECT ENG

[10] A convergence of key-value storage systems from clouds to supercomputers [J].

Li, Tonglin ;

Zhou, Xiaobing ;

Wang, Ke ;

Zhao, Dongfang ;

Sadooghi, Iman ;

Zhang, Zhao ;

Raicu, Ioan .

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2016, 28 (01) :44-69

← 1 2 3 →