Document Type

Conference Paper

Department/Unit

Department of Computer Science

Title

Predicting the optimal ad-hoc index for reachability queries on graph databases

Language

English

Abstract

Due to the recent advances in graph databases, a large number of ad-hoc indexes for a fundamental query, in particular, reachability query, have been proposed. The performances of these indexes on different graphs have known to be very different. Worst still, deriving an accurate cost model for selecting the optimal index of a graph database appears to be a daunting task. In this paper, we propose a hierarchical prediction framework, based on neural networks and a set of graph features and a knowledge base on past predictions, to determine the optimal index for a graph database. For ease of presentation, we propose our framework with three structurally distinguishable indexes. Our experiments show that our framework is accurate. © 2011 ACM.

Keywords

graph indexing, neural networks, reachability queries

Publication Date

2011

Source Publication Title

Proceedings of the 20th ACM international conference on Information and knowledge management

Start Page

2357

End Page

2360

Conference Location

Glasgow, United Kingdom

Publisher

ACM

DOI

10.1145/2063576.2063966

Link to Publisher's Edition

http://dx.doi.org/10.1145/2063576.2063966

ISBN (print)

9781450307178

This document is currently not available here.

Share

COinS