Dina Amr and Neamat El-Tazi, Cairo University, Egypt

Skyline queries are mostly used in decision making processes and search space reduction. They received much attention during the past years due to their importance in discarding the unneeded data and providing the users with data that best match their interest. The same attention has been directed to graph databases to handle highly connected data due to the increase in volume and connectedness of today’s data. The proposed work aims to augment graph databases with skyline queries. Two skyline query processing algorithms have been proposed; nested loops and divide-and-conquer. They are used to facilitate retrieving skyline results with multiple dimensions over graph databases. Performance evaluation for both algorithms over different sized graph databases and queries with different complexity levels were presented. The conducted experiments proved that divide-and-conquer outperforms nested loops in different cases.

Skyline Queries, Graph Database, Graph Querying, Neo4j, Cypher