Paper Info
Title
Towards an Algebraic Cost Model for Graph Operators.
Abstract
Graph Analytics has been gaining an increasing amount of attention in recent years. This has given rise to the development of numerous graph processing and storage engines, each featuring different models in computation, storage and execution as well as performance. Multi-Engine Analytics present a solution towards adaptive, cost-based complex workflow scheduling to the best available underlying technology. To achieve this in the Graph Analytics case, detailed and accurate cost models for the various runtimes and operators must be defined and exported, such that intelligent planning can take place. In this work, we take a first step towards defining a cost model for graph-based operators based on an algebra and its primitives. We evaluate its accuracy over a state of the art graph database and discuss its advantages and shortcomings.
Year
Venue
Field
2017
ALGOCLOUD
Graph,Graph database,Algebraic number,Computer science,Graph analytics,Intelligent planning,Operator (computer programming),Analytics,Computation,Distributed computing
DocType
Citations 
PageRank 
Conference
0
0.34
References 
Authors
10
2
Name
Order
Citations
PageRank
Alexander Singh100.68
Dimitrios Tsoumakos258144.06