File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: On querying historical evolving graph sequences

TitleOn querying historical evolving graph sequences
Authors
Ren, CLo, EKao, BZhu, XCheng, CK
KeywordsAS graph
Dynamic world
Evolving graphs
Synthetic datasets
Issue Date2011
PublisherVery Large Data Base (VLDB) Endowment Inc.. The Journal's web site is located at http://vldb.org/pvldb/index.html
Citation
The 37th International Conference on Very Large Data Bases (VLDB 2011), Seattle, WA., 29 August-3 September 2011. In Proceedings of the VLDB Endowment, 2011, v. 4 n. 11, p. 726-737 How to Cite?
AbstractIn 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. © 2011 VLDB Endowment.
Persistent Identifierhttp://hdl.handle.net/10722/135696
ISSN
2150-8097
2023 Impact Factor: 2.6
2023 SCImago Journal Rankings: 2.666

 

DC FieldValueLanguage
dc.contributor.authorRen, Cen_US
dc.contributor.authorLo, Een_US
dc.contributor.authorKao, Ben_US
dc.contributor.authorZhu, Xen_US
dc.contributor.authorCheng, CKen_US
dc.date.accessioned2011-07-27T01:39:54Z-
dc.date.available2011-07-27T01:39:54Z-
dc.date.issued2011en_US
dc.identifier.citationThe 37th International Conference on Very Large Data Bases (VLDB 2011), Seattle, WA., 29 August-3 September 2011. In Proceedings of the VLDB Endowment, 2011, v. 4 n. 11, p. 726-737en_US
dc.identifier.issn2150-8097-
dc.identifier.urihttp://hdl.handle.net/10722/135696-
dc.description.abstractIn 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. © 2011 VLDB Endowment.-
dc.languageengen_US
dc.publisherVery Large Data Base (VLDB) Endowment Inc.. The Journal's web site is located at http://vldb.org/pvldb/index.html-
dc.relation.ispartofProceedings of the VLDB Endowmenten_US
dc.subjectAS graph-
dc.subjectDynamic world-
dc.subjectEvolving graphs-
dc.subjectSynthetic datasets-
dc.titleOn querying historical evolving graph sequencesen_US
dc.typeConference_Paperen_US
dc.identifier.emailRen, C: chren@cs.hku.hken_US
dc.identifier.emailLo, E: ericlo@comp.polyu.edu.hken_US
dc.identifier.emailKao, B: kao@cs.hku.hk-
dc.identifier.emailZhu, X: xjzhu@cs.hku.hk-
dc.identifier.emailCheng, CK: ckcheng@cs.hku.hk-
dc.identifier.authorityKao, B=rp00123en_US
dc.identifier.authorityCheng, CK=rp00074en_US
dc.description.naturelink_to_OA_fulltext-
dc.identifier.scopuseid_2-s2.0-84863752883-
dc.identifier.hkuros186895en_US
dc.identifier.volume4-
dc.identifier.issue11-
dc.identifier.spage726-
dc.identifier.epage737-
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 130828-
dc.identifier.issnl2150-8097-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats