Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/29944
Title: On querying historical evolving graph sequences
Authors: Ren, C
Lo, E 
Kao, B
Zhu, X
Cheng, R
Issue Date: 2011
Publisher: Association for Computing Machinery
Source: Proceedings of the VLDB Endowment, 2011, v. 4, no. 11, p. 726-737 How to cite?
Journal: Proceedings of the VLDB Endowment 
Abstract: In many applications, information is best represented as graphs. In a dynamic world, information changes and so the graphs representing the information evolve with time. We propose that historical graph-structured data be maintained for analytical processing. We call a historical evolving graph sequence an EGS. We observe that in many applications, graphs of an EGS are large and numerous, and they often exhibit much redundancy among them. We study the problem of efficient query processing on an EGS and put forward a solution framework called FVF. Through extensive experiments on both real and synthetic datasets, we show that our FVF framework is highly efficient in EGS query processing.
URI: http://hdl.handle.net/10397/29944
ISSN: 2150-8097
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

45
Last Week
3
Last month
Citations as of Nov 17, 2017

Page view(s)

44
Last Week
2
Last month
Checked on Nov 13, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.