Horton+: A distributed system for processing declarative reachability queries over partitioned graphs

Mohamed Elsayed, Sameh Elnikety, Yuxiong He, Mohamed F. Mokbel

Research output: Chapter in Book/Report/Conference proceedingChapter

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 (US)
Title of host publicationProceedings of the VLDB Endowment
Pages1918-1929
Number of pages12
Volume6
Edition14
StatePublished - Sep 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

Elsayed, M., Elnikety, S., He, Y., & Mokbel, M. F. (2013). Horton+: A distributed system for processing declarative reachability queries over partitioned graphs. In Proceedings of the VLDB Endowment (14 ed., Vol. 6, pp. 1918-1929)

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

Proceedings of the VLDB Endowment. Vol. 6 14. ed. 2013. p. 1918-1929.

Research output: Chapter in Book/Report/Conference proceedingChapter

Elsayed, M, Elnikety, S, He, Y & Mokbel, MF 2013, Horton+: A distributed system for processing declarative reachability queries over partitioned graphs. in Proceedings of the VLDB Endowment. 14 edn, vol. 6, pp. 1918-1929.
Elsayed M, Elnikety S, He Y, Mokbel MF. Horton+: A distributed system for processing declarative reachability queries over partitioned graphs. In Proceedings of the VLDB Endowment. 14 ed. Vol. 6. 2013. p. 1918-1929
Elsayed, Mohamed ; Elnikety, Sameh ; He, Yuxiong ; Mokbel, Mohamed F. / Horton+ : A distributed system for processing declarative reachability queries over partitioned graphs. Proceedings of the VLDB Endowment. Vol. 6 14. ed. 2013. pp. 1918-1929
@inbook{14077da85db84bd3bbc1593770616008,
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 Elsayed and Sameh Elnikety and Yuxiong He and Mokbel, {Mohamed F.}",
year = "2013",
month = "9",
language = "English (US)",
volume = "6",
pages = "1918--1929",
booktitle = "Proceedings of the VLDB Endowment",
edition = "14",

}

TY - CHAP

T1 - Horton+

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

AU - Elsayed, Mohamed

AU - Elnikety, Sameh

AU - He, Yuxiong

AU - Mokbel, Mohamed F.

PY - 2013/9

Y1 - 2013/9

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

M3 - Chapter

AN - SCOPUS:84891119285

VL - 6

SP - 1918

EP - 1929

BT - Proceedings of the VLDB Endowment

ER -