Horton+

A distributed system for processing declarative reachability queries over partitioned graphs

Mohamed Sarwat, Sameh Elnikety, Yuxiong He, Mohamed Mokbel

Research output: Contribution to journalArticle

25 Citations (Scopus)

Abstract

Horton+ is a graph query processing system that executes declarative reachability queries on a partitioned attributed multi-graph. It employs a query language, query optimizer, and a distributed execution engine. The query language expresses declarative reachability queries, and supports closures and predicates on node and edge attributes to match graph paths. We introduce three algebraic operators, select, traverse, and join, and a query is compiled into an execution plan containing these operators. As reachability queries access the graph elements in a random access pattern, the graph is therefore maintained in the main memory of a cluster of servers to reduce query execution time. We develop a distributed execution engine that processes a query plan in parallel on the graph servers. Since the query language is declarative, we build a query optimizer that uses graph statistics to estimate predicate selectivity. We experimentally evaluate the system performance on a cluster of 16 graph servers using synthetic graphs as well as a real graph from an application that uses reachability queries. The evaluation shows (1) the efficiency of the optimizer in reducing query execution time, (2) system scalability with the size of the graph and with the number of servers, and (3) the convenience of using declarative queries.

Original languageEnglish
Pages (from-to)1918-1929
Number of pages12
JournalProceedings of the VLDB Endowment
Volume6
Issue number14
DOIs
Publication statusPublished - 1 Jan 2013
Externally publishedYes

Fingerprint

Query languages
Servers
Processing
Engines
Query processing
Scalability
Statistics
Data storage equipment

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Computer Science(all)

Cite this

Horton+ : A distributed system for processing declarative reachability queries over partitioned graphs. / Sarwat, Mohamed; Elnikety, Sameh; He, Yuxiong; Mokbel, Mohamed.

In: Proceedings of the VLDB Endowment, Vol. 6, No. 14, 01.01.2013, p. 1918-1929.

Research output: Contribution to journalArticle

@article{2a08c92ad72d46be911d4b942702f022,
title = "Horton+: A distributed system for processing declarative reachability queries over partitioned graphs",
abstract = "Horton+ is a graph query processing system that executes declarative reachability queries on a partitioned attributed multi-graph. It employs a query language, query optimizer, and a distributed execution engine. The query language expresses declarative reachability queries, and supports closures and predicates on node and edge attributes to match graph paths. We introduce three algebraic operators, select, traverse, and join, and a query is compiled into an execution plan containing these operators. As reachability queries access the graph elements in a random access pattern, the graph is therefore maintained in the main memory of a cluster of servers to reduce query execution time. We develop a distributed execution engine that processes a query plan in parallel on the graph servers. Since the query language is declarative, we build a query optimizer that uses graph statistics to estimate predicate selectivity. We experimentally evaluate the system performance on a cluster of 16 graph servers using synthetic graphs as well as a real graph from an application that uses reachability queries. The evaluation shows (1) the efficiency of the optimizer in reducing query execution time, (2) system scalability with the size of the graph and with the number of servers, and (3) the convenience of using declarative queries.",
author = "Mohamed Sarwat and Sameh Elnikety and Yuxiong He and Mohamed Mokbel",
year = "2013",
month = "1",
day = "1",
doi = "10.14778/2556549.2556573",
language = "English",
volume = "6",
pages = "1918--1929",
journal = "Proceedings of the VLDB Endowment",
issn = "2150-8097",
publisher = "Very Large Data Base Endowment Inc.",
number = "14",

}

TY - JOUR

T1 - Horton+

T2 - A distributed system for processing declarative reachability queries over partitioned graphs

AU - Sarwat, Mohamed

AU - Elnikety, Sameh

AU - He, Yuxiong

AU - Mokbel, Mohamed

PY - 2013/1/1

Y1 - 2013/1/1

N2 - Horton+ is a graph query processing system that executes declarative reachability queries on a partitioned attributed multi-graph. It employs a query language, query optimizer, and a distributed execution engine. The query language expresses declarative reachability queries, and supports closures and predicates on node and edge attributes to match graph paths. We introduce three algebraic operators, select, traverse, and join, and a query is compiled into an execution plan containing these operators. As reachability queries access the graph elements in a random access pattern, the graph is therefore maintained in the main memory of a cluster of servers to reduce query execution time. We develop a distributed execution engine that processes a query plan in parallel on the graph servers. Since the query language is declarative, we build a query optimizer that uses graph statistics to estimate predicate selectivity. We experimentally evaluate the system performance on a cluster of 16 graph servers using synthetic graphs as well as a real graph from an application that uses reachability queries. The evaluation shows (1) the efficiency of the optimizer in reducing query execution time, (2) system scalability with the size of the graph and with the number of servers, and (3) the convenience of using declarative queries.

AB - Horton+ is a graph query processing system that executes declarative reachability queries on a partitioned attributed multi-graph. It employs a query language, query optimizer, and a distributed execution engine. The query language expresses declarative reachability queries, and supports closures and predicates on node and edge attributes to match graph paths. We introduce three algebraic operators, select, traverse, and join, and a query is compiled into an execution plan containing these operators. As reachability queries access the graph elements in a random access pattern, the graph is therefore maintained in the main memory of a cluster of servers to reduce query execution time. We develop a distributed execution engine that processes a query plan in parallel on the graph servers. Since the query language is declarative, we build a query optimizer that uses graph statistics to estimate predicate selectivity. We experimentally evaluate the system performance on a cluster of 16 graph servers using synthetic graphs as well as a real graph from an application that uses reachability queries. The evaluation shows (1) the efficiency of the optimizer in reducing query execution time, (2) system scalability with the size of the graph and with the number of servers, and (3) the convenience of using declarative queries.

UR - http://www.scopus.com/inward/record.url?scp=84891119285&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84891119285&partnerID=8YFLogxK

U2 - 10.14778/2556549.2556573

DO - 10.14778/2556549.2556573

M3 - Article

VL - 6

SP - 1918

EP - 1929

JO - Proceedings of the VLDB Endowment

JF - Proceedings of the VLDB Endowment

SN - 2150-8097

IS - 14

ER -