RailwayDB: adaptive storage of interaction graphs

Simple item page
dc.citation.epage169en_US
dc.citation.issueNumber2en_US
dc.citation.spage151en_US
dc.citation.volumeNumber25en_US
dc.contributor.authorSoulé R.en_US
dc.contributor.authorGedik, B.en_US
dc.date.accessioned2018-04-12T10:57:43Z
dc.date.available2018-04-12T10:57:43Z
dc.date.issued2016en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.description.abstractWe are living in an ever more connected world, where data recording the interactions between people, software systems, and the physical world is becoming increasingly prevalent. These data often take the form of a temporally evolving graph, where entities are the vertices and the interactions between them are the edges. We call such graphs interaction graphs. Various domains, including telecommunications, transportation, and social media, depend on analytics performed on interaction graphs. The ability to efficiently support historical analysis over interaction graphs requires effective solutions for the problem of data layout on disk. This paper presents an adaptive disk layout called the railway layout for optimizing disk block storage for interaction graphs. The key idea is to divide blocks into one or more sub-blocks. Each sub-block contains the entire graph structure, but only a subset of the attributes. This improves query I/O, at the cost of increased storage overhead. We introduce optimal integer linear program (ILP) formulations for partitioning disk blocks into sub-blocks with overlapping and nonoverlapping attributes. Additionally, we present greedy heuristics that can scale better compared to the ILP alternatives, yet achieve close to optimal query I/O. We provide an implementation of the railway layout as part of RailwayDB—an open-source graph database we have developed. To demonstrate the benefits of the railway layout, we provide an extensive experimental evaluation, including model-based as well as empirical results comparing our approach to baseline alternatives.en_US
dc.identifier.doi10.1007/s00778-015-0407-0en_US
dc.identifier.issn1066-8888
dc.identifier.urihttp://hdl.handle.net/11693/36933
dc.language.isoEnglishen_US
dc.publisherAssociation for Computing Machineryen_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/s00778-015-0407-0en_US
dc.source.titleThe VLDB Journalen_US
dc.subjectAdaptive storageen_US
dc.subjectI/O optimizationen_US
dc.subjectInteraction graphsen_US
dc.subjectGraphic methodsen_US
dc.subjectInteger programmingen_US
dc.subjectOpen source softwareen_US
dc.subjectOptimizationen_US
dc.subjectQuery processingen_US
dc.subjectRailroadsen_US
dc.subjectTransportationen_US
dc.subjectEffective solutionen_US
dc.subjectExperimental evaluationen_US
dc.subjectGreedy heuristicsen_US
dc.subjectHistorical analysisen_US
dc.subjectInteger linear programsen_US
dc.subjectStorage overheaden_US
dc.subjectDigital storageen_US
dc.titleRailwayDB: adaptive storage of interaction graphsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
RailwayDB adaptive storage of interaction graphs.pdf
Size:
1.45 MB
Format:
Adobe Portable Document Format
Description:
Full Printable Version
Download

Collections

Department of Computer Engineering