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

26 Scopus citations

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

ASJC Scopus subject areas

  • Information Systems
  • Signal Processing
  • Software

Fingerprint Dive into the research topics of 'Horton: Online query execution engine for large distributed graphs'. Together they form a unique fingerprint.

  • 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