Horton: Online query execution engine for large distributed graphs

Mohamed Elsayed, Sameh Elnikety, Yuxiong He, Gabriel Kliot

Research output: Chapter in Book/Report/Conference proceedingConference contribution

25 Citations (Scopus)

Abstract

Graphs are used in many large-scale applications, such as social networking. The management of these graphs poses new challenges as such graphs are too large for a single server to manage efficiently. Current distributed techniques such as map-reduce and Pregel are not well-suited to processing interactive ad-hoc queries against large graphs. In this paper we demonstrate Horton, a distributed interactive query execution engine for large graphs. Horton defines a query language that allows the expression of regular language reach ability queries and provides a query execution engine with a query optimizer that allows interactive execution of queries on large distributed graphs in parallel. In the demo, we show the functionality of Horton managing a large graph for a social networking application called Codebook, whose graph represents data on software components, developers, development artifacts such as bug reports, and their interactions in large software projects.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Data Engineering
Pages1289-1292
Number of pages4
DOIs
StatePublished - 2012
Externally publishedYes
EventIEEE 28th International Conference on Data Engineering, ICDE 2012 - Arlington, VA, United States
Duration: Apr 1 2012Apr 5 2012

Other

OtherIEEE 28th International Conference on Data Engineering, ICDE 2012
CountryUnited States
CityArlington, VA
Period4/1/124/5/12

Fingerprint

Engines
Formal languages
Query languages
Servers
Processing

ASJC Scopus subject areas

  • Information Systems
  • Signal Processing
  • Software

Cite this

Elsayed, M., Elnikety, S., He, Y., & Kliot, G. (2012). Horton: Online query execution engine for large distributed graphs. In Proceedings - International Conference on Data Engineering (pp. 1289-1292). [6228190] https://doi.org/10.1109/ICDE.2012.129

Horton : Online query execution engine for large distributed graphs. / Elsayed, Mohamed; Elnikety, Sameh; He, Yuxiong; Kliot, Gabriel.

Proceedings - International Conference on Data Engineering. 2012. p. 1289-1292 6228190.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Elsayed, M, Elnikety, S, He, Y & Kliot, G 2012, Horton: Online query execution engine for large distributed graphs. in Proceedings - International Conference on Data Engineering., 6228190, pp. 1289-1292, IEEE 28th International Conference on Data Engineering, ICDE 2012, Arlington, VA, United States, 4/1/12. https://doi.org/10.1109/ICDE.2012.129
Elsayed M, Elnikety S, He Y, Kliot G. Horton: Online query execution engine for large distributed graphs. In Proceedings - International Conference on Data Engineering. 2012. p. 1289-1292. 6228190 https://doi.org/10.1109/ICDE.2012.129
Elsayed, Mohamed ; Elnikety, Sameh ; He, Yuxiong ; Kliot, Gabriel. / Horton : Online query execution engine for large distributed graphs. Proceedings - International Conference on Data Engineering. 2012. pp. 1289-1292
@inproceedings{23400d75ebb8445a93772e3c8d86f1d7,
title = "Horton: Online query execution engine for large distributed graphs",
abstract = "Graphs are used in many large-scale applications, such as social networking. The management of these graphs poses new challenges as such graphs are too large for a single server to manage efficiently. Current distributed techniques such as map-reduce and Pregel are not well-suited to processing interactive ad-hoc queries against large graphs. In this paper we demonstrate Horton, a distributed interactive query execution engine for large graphs. Horton defines a query language that allows the expression of regular language reach ability queries and provides a query execution engine with a query optimizer that allows interactive execution of queries on large distributed graphs in parallel. In the demo, we show the functionality of Horton managing a large graph for a social networking application called Codebook, whose graph represents data on software components, developers, development artifacts such as bug reports, and their interactions in large software projects.",
author = "Mohamed Elsayed and Sameh Elnikety and Yuxiong He and Gabriel Kliot",
year = "2012",
doi = "10.1109/ICDE.2012.129",
language = "English (US)",
pages = "1289--1292",
booktitle = "Proceedings - International Conference on Data Engineering",

}

TY - GEN

T1 - Horton

T2 - Online query execution engine for large distributed graphs

AU - Elsayed, Mohamed

AU - Elnikety, Sameh

AU - He, Yuxiong

AU - Kliot, Gabriel

PY - 2012

Y1 - 2012

N2 - Graphs are used in many large-scale applications, such as social networking. The management of these graphs poses new challenges as such graphs are too large for a single server to manage efficiently. Current distributed techniques such as map-reduce and Pregel are not well-suited to processing interactive ad-hoc queries against large graphs. In this paper we demonstrate Horton, a distributed interactive query execution engine for large graphs. Horton defines a query language that allows the expression of regular language reach ability queries and provides a query execution engine with a query optimizer that allows interactive execution of queries on large distributed graphs in parallel. In the demo, we show the functionality of Horton managing a large graph for a social networking application called Codebook, whose graph represents data on software components, developers, development artifacts such as bug reports, and their interactions in large software projects.

AB - Graphs are used in many large-scale applications, such as social networking. The management of these graphs poses new challenges as such graphs are too large for a single server to manage efficiently. Current distributed techniques such as map-reduce and Pregel are not well-suited to processing interactive ad-hoc queries against large graphs. In this paper we demonstrate Horton, a distributed interactive query execution engine for large graphs. Horton defines a query language that allows the expression of regular language reach ability queries and provides a query execution engine with a query optimizer that allows interactive execution of queries on large distributed graphs in parallel. In the demo, we show the functionality of Horton managing a large graph for a social networking application called Codebook, whose graph represents data on software components, developers, development artifacts such as bug reports, and their interactions in large software projects.

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

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

U2 - 10.1109/ICDE.2012.129

DO - 10.1109/ICDE.2012.129

M3 - Conference contribution

AN - SCOPUS:84864243921

SP - 1289

EP - 1292

BT - Proceedings - International Conference on Data Engineering

ER -