QUERY OPTIMIZATION TECHNIQUES IN GRAPH DATABASES

 


QUERY OPTIMIZATION TECHNIQUES IN GRAPH DATABASES

Ali Ben Ammar1 1Higher Institute of Computer Science and Management Kairouan University, Tunisia

ABSTRACT : Graph databases (GDB) have recently been arisen to overcome the limits of traditional databases for storing and managing data with graph-like structure. Today, they represent a requirementfor many applications that manage graph-like data,like social networks.Most of the techniques, applied to optimize queries in graph databases, have been used in traditional databases, distribution systems,… or they are inspired from graph theory. However, their reuse in graph databases should take care of the main characteristics of graph databases, such as dynamic structure, highly interconnected data, and ability to efficiently access data relationships. In this paper, we survey the query optimization techniques in graph databases. In particular,we focus on the features they have introduced to improve querying graph-like data.

KEYWORDS

Query optimization, Graph database, Distribution, Query decomposition, Sketching


Full Text: https://aircconline.com/ijdms/V8N4/8416ijdms01.pdf

Volume Link: https://airccse.org/journal/ijdms/current2016.html

 

Comments

Popular posts from this blog

3rd International Conference on Computer Science, Engineering and Artificial Intelligence (CSEAI 2025)

A REVIEW OF THE USE OF R PPROGRAMMING FOR DATA SCIENCE RESEARCH IN BOTSWANA

HYBRID ENCRYPTION ALGORITHMS FOR MEDICAL DATA STORAGE SECURITY IN CLOUD DATABASE