%0 Conference Proceedings
%T Views and Transactional Storage for Large Graphs
%+ University of California [San Diego] (UC San Diego)
%+ Hewlett Packard Research Labs (HP Labs)
%A Lee, Michael, M.
%A Roy, Indrajit
%A Auyoung, Alvin
%A Talwar, Vanish
%A Jayaram, K., R.
%A Zhou, Yuanyuan
%Z Part 3: Storage
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 14th International Middleware Conference (Middleware)
%C Beijing, China
%Y David Hutchison
%Y Takeo Kanade
%Y Madhu Sudan
%Y Demetri Terzopoulos
%Y Doug Tygar
%Y Moshe Y. Vardi
%Y Gerhard Weikum
%Y David Eyers
%Y Karsten Schwan
%Y Josef Kittler
%Y Jon M. Kleinberg
%Y Friedemann Mattern
%Y John C. Mitchell
%Y Moni Naor
%Y Oscar Nierstrasz
%Y C. Pandu Rangan
%Y Bernhard Steffen
%I Springer
%3 Middleware 2013
%V LNCS-8275
%P 287-306
%8 2013-12-09
%D 2013
%R 10.1007/978-3-642-45065-5_15
%K Graphs
%K transactions
%K views
%K event-driven analysis
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X A growing number of applications store and analyze graph-structured data. These applications impose challenging infrastructure demands due to a need for scalable, high-throughput, and low-latency graph processing. Existing state-of-the-art storage systems and data processing systems are limited in at least one of these dimensions, and simply layering these technologies is inadequate.We present Concerto, a graph store based on distributed, in-memory data structures. In addition to enabling efficient graph traversals by co-locating graph nodes and associated edges where possible, Concerto provides transactional updates while scaling to hundreds of nodes. Concerto introduces graph views to denote sub-graphs on which user-defined functions can be invoked. Using graph views, programmers can perform event-driven analysis and dynamically optimize application performance. Our results show that Concerto is significantly faster than in-memory MySQL, in-memory Neo4j, and GemFire for graph insertions as well as graph queries. We demonstrate the utility of Concerto’s features in the design of two real-world applications: real-time incident impact analysis on a road network and targeted advertising in a social network.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01480781/document
%2 https://inria.hal.science/hal-01480781/file/978-3-642-45065-5_15_Chapter.pdf
%L hal-01480781
%U https://inria.hal.science/hal-01480781
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-LNCS-8275
%~ IFIP-MIDDLEWARE