arrow
返回

Disk-Based Management of Interaction Graphs

delete2014-11-01
delete5
delete
OA
AI
B
Buğra Gedik *
R
Rajesh Bordawekar
DOI:10.1109/TKDE.2013.2297930delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
In our increasingly connected and instrumented world, live data recording the interactions between people, systems, and the environment is available in various domains, such as telecommunciations and social media. This data often takes the form of a temporally evolving graph, where entities are the vertices and the interactions between them are the edges. An important feature of this graph is that the number of edges it has grows continuously, as new interactions take place. We call such graphs interaction graphs. In this paper we study the problem of storing interaction graphs such that temporal queries on them can be answered efficiently. Since interaction graphs are append-only and edges are added continuously, traditional graph layout and storage algorithms that are batch based cannot be applied directly. We present the design and implementation of a system that caches recent interactions in memory, while quickly placing the expired interactions to disk blocks such that those edges that are likely to be accessed together are placed together. We develop live block formation algorithms that are fast, yet can take advantage of temporal and spatial locality among the edges to optimize the storage layout with the goal of improving query performance. We evaluate the system on synthetic as well as real-world interaction graphs, and show that our block formation algorithms are effective for answering temporal neighborhood queries on the graph. Such queries form a foundation for building more complex online and offline temporal analytics on interaction graphs.
Keyword:
Interaction graphs
storage and querying
disk layout
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Knowledge and Data Engineering 封面图
IEEE Transactions on Knowledge and Data Engineering
IF:
10.4
论文数:
6.8K
被引数:
3.2W

机构

I
ihsan dogramaci bilkent university
学者数:
3.6K
论文数: 3.6K
被引数: 8
I
international business machines (ibm)
学者数:
5.7K
论文数: 4.5K
被引数: 4
引用论文

引用论文

The hapticity of η-indenyl complexes: molecular structures of [(η5-C9R7)Rh(η4-cod)](R = H, Me)(cod = cyclo-octa-5-diene)
err1989-01-01
err0
PREAI
errAshok K. Kakkar; Simon F. Jones; Nicholas J. Taylor; Scott Collins; Todd B. Marder
err分享
err收藏
Anatomy of Nodal Roots in Tropical Upland and Lowland Rice Varieties
err2015-12-03
err0
PREAI
errMotohiko Kondo; Albert Aguilar; Jun Abe; Shigenori Morita
err分享
err收藏
BOLD Decoding of Individual Pain Anticipation Biases During Uncertainty
err
IF0
err2019-06-20
err0
errOAAI
errMolly Kadlec; Duygu Tosun; Irina Strigo
err分享
err收藏
Facile Splitting of Hydrogen and Ammonia by Nucleophilic Activation at a Single Carbon Center
err2007-04-20
err0
PREAI
errGuido D. Frey; Vincent Lavallo; Bruno Donnadieu; Wolfgang W. Schoeller; Guy Bertrand
err分享
err收藏
Non-surgical management of Boerhaave’s syndrome: a case series study and review of the literature
err2018-01-16
err0
errOAAI
errKhalil Aloreidi; Bhavesh Patel; Tim Ridgway; Terry Yeager; Muslim Atiq
err分享
err收藏
Diagnostic and Prognostic Value of Plasma Tumor M2 Pyruvate Kinase in Periampullary Cancer
err2007-04-01
err0
errOAAI
errKolitha S. Goonetilleke; James M. Mason; Priyantha Siriwardana; Nicholas K. King; Michael W. France; Ajith K. Siriwardena
err分享
err收藏
Synthesis and characterization of as- and s-indacene bridging ligands and their trimethyltin and manganese tricarbonyl derivatives
err2002-05-01
err0
PREAI
errWilliam L. Bell; Calvin J. Curtis; Charles W. Eigenbrot; Cortlandt G. Pierpont; John L. Robbins; James C. Smart
err分享
err收藏
Thoracoscopic primary repair with mediastinal drainage is a viable option for patients with Boerhaave’s syndrome
err2018-02-01
err0
errOAAI
errToru Nakano; Ko Onodera; Hirofumi Ichikawa; Takashi Kamei; Yusuke Taniyama; Tadashi Sakurai; Go Miyata
err分享
err收藏
学者 查看更多内容