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 language | English (US) |
|---|---|
| Title of host publication | Proceedings - International Conference on Data Engineering |
| Pages | 1289-1292 |
| Number of pages | 4 |
| DOIs | |
| State | Published - 2012 |
| Externally published | Yes |
| Event | IEEE 28th International Conference on Data Engineering, ICDE 2012 - Arlington, VA, United States Duration: Apr 1 2012 → Apr 5 2012 |
Other
| Other | IEEE 28th International Conference on Data Engineering, ICDE 2012 |
|---|---|
| Country/Territory | United States |
| City | Arlington, VA |
| Period | 4/1/12 → 4/5/12 |
ASJC Scopus subject areas
- Information Systems
- Signal Processing
- Software