메뉴 건너뛰기




Volumn , Issue , 2013, Pages 997-1008

Efficient snapshot retrieval over historical graph data

Author keywords

[No Author keywords available]

Indexed keywords

AUXILIARY INFORMATION; CONSTRUCTION PARAMETER; EXPERIMENTAL EVALUATION; GRAPH INFORMATION; INDEX STRUCTURE; INFORMATION NETWORKS; NETWORK INFORMATION; PARALLEL PROCESSING;

EID: 84881349084     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2013.6544892     Document Type: Conference Paper
Times cited : (138)

References (33)
  • 2
    • 84862630285 scopus 로고    scopus 로고
    • Graph sketches: Sparsification, spanners, and subgraphs
    • K. Ahn, S. Guha, and A. McGregor. Graph sketches: sparsification, spanners, and subgraphs. In PODS, pages 5-14, 2012.
    • (2012) PODS , pp. 5-14
    • Ahn, K.1    Guha, S.2    McGregor, A.3
  • 3
    • 0030386108 scopus 로고    scopus 로고
    • Optimal dynamic interval management in external memory
    • L. Arge and J. Vitter. Optimal dynamic interval management in external memory. In FOCS, 1996.
    • (1996) FOCS
    • Arge, L.1    Vitter, J.2
  • 4
    • 72449133333 scopus 로고    scopus 로고
    • An event-based framework for characterizing the evolutionary behavior of interaction graphs
    • S. Asur, S. Parthasarathy, D. Ucar. An event-based framework for characterizing the evolutionary behavior of interaction graphs. TKDD, 2009.
    • (2009) TKDD
    • Asur, S.1    Parthasarathy, S.2    Ucar, D.3
  • 5
    • 33749574784 scopus 로고    scopus 로고
    • A framework for analysis of dynamic social networks
    • T. Berger-Wolf and J. Saia. A framework for analysis of dynamic social networks. In KDD, 2006.
    • (2006) KDD
    • Berger-Wolf, T.1    Saia, J.2
  • 9
    • 0030246818 scopus 로고    scopus 로고
    • Heraclitus: Elevating deltas to be first-class citizens in a database programming language
    • S. Ghandeharizadeh, R. Hull, D. Jacobs. Heraclitus: elevating deltas to be first-class citizens in a database programming language. ACM TODS, 21(3), 1996.
    • (1996) ACM TODS , vol.21 , Issue.3
    • Ghandeharizadeh, S.1    Hull, R.2    Jacobs, D.3
  • 10
    • 77958194305 scopus 로고    scopus 로고
    • Tracking the evolution of communities in dynamic social networks
    • D. Greene, D. Doyle, and P. Cunningham. Tracking the evolution of communities in dynamic social networks. In ASONAM, 2010.
    • (2010) ASONAM
    • Greene, D.1    Doyle, D.2    Cunningham, P.3
  • 11
    • 57149124877 scopus 로고    scopus 로고
    • Graphs-at-a-time: Query language and access methods for graph databases
    • H. He and A. Singh. Graphs-at-a-time: query language and access methods for graph databases. In SIGMOD, 2008.
    • (2008) SIGMOD
    • He, H.1    Singh, A.2
  • 12
    • 77951152705 scopus 로고    scopus 로고
    • Pegasus: A peta-scale graph mining system implementation and observations
    • U. Kang, C. E. Tsourakakis, and C. Faloutsos. Pegasus: A peta-scale graph mining system implementation and observations. In ICDM, 2009.
    • (2009) ICDM
    • Kang, U.1    Tsourakakis, C.E.2    Faloutsos, C.3
  • 13
    • 84881362506 scopus 로고    scopus 로고
    • Efficient snapshot retrieval over historical graph data
    • abs/1207.5777
    • U. Khurana and A. Deshpande. Efficient snapshot retrieval over historical graph data. CoRR, abs/1207.5777, 2012.
    • (2012) CoRR
    • Khurana, U.1    Deshpande, A.2
  • 14
    • 33749563834 scopus 로고    scopus 로고
    • Structure and evolution of online social networks
    • R. Kumar, J. Novak, and A. Tomkins. Structure and evolution of online social networks. In KDD, 2006.
    • (2006) KDD
    • Kumar, R.1    Novak, J.2    Tomkins, A.3
  • 15
    • 84881343156 scopus 로고    scopus 로고
    • A fast index for XML document version management
    • N. Lam and R. Wong. A fast index for XML document version management. In APWeb, 2003.
    • (2003) APWeb
    • Lam, N.1    Wong, R.2
  • 16
    • 34248205060 scopus 로고    scopus 로고
    • Graph evolution: Densification and shrinking diameters
    • J. Leskovec, J. Kleinberg, and C. Faloutsos. Graph evolution: Densification and shrinking diameters. ACM TKDD, 2007.
    • (2007) ACM TKDD
    • Leskovec, J.1    Kleinberg, J.2    Faloutsos, C.3
  • 17
    • 84859167775 scopus 로고    scopus 로고
    • Transaction time indexing with version compression
    • D. Lomet, M. Hong, R. Nehme, and R. Zhang. Transaction time indexing with version compression. In VLDB, 2008.
    • (2008) VLDB
    • Lomet, D.1    Hong, M.2    Nehme, R.3    Zhang, R.4
  • 18
    • 70350627338 scopus 로고    scopus 로고
    • Pregel: A system for large-scale graph processing
    • G. Malewicz et al. Pregel: a system for large-scale graph processing. In PODC, 2009.
    • (2009) PODC
    • Malewicz, G.1
  • 19
    • 84944317994 scopus 로고    scopus 로고
    • Change-centric management of versions in an XML warehouse
    • A. Marian, S. Abiteboul, G. Cobena, and L. Mignet. Change-centric management of versions in an XML warehouse. In VLDB, 2001.
    • (2001) VLDB
    • Marian, A.1    Abiteboul, S.2    Cobena, G.3    Mignet, L.4
  • 21
    • 79955554976 scopus 로고    scopus 로고
    • Network archaeology: Uncovering ancient networks from present-day interactions
    • S. Navlakha and C. Kingsford. Network archaeology: Uncovering ancient networks from present-day interactions. PLoS Comp Bio, 2011.
    • (2011) PLoS Comp Bio
    • Navlakha, S.1    Kingsford, C.2
  • 22
    • 0029359951 scopus 로고
    • Temporal and real-time databases: A survey
    • aug
    • G. Ozsoyoglu and R. Snodgrass. Temporal and real-time databases: a survey. IEEE TKDE, 7(4):513-532, aug 1995.
    • (1995) IEEE TKDE , vol.7 , Issue.4 , pp. 513-532
    • Ozsoyoglu, G.1    Snodgrass, R.2
  • 24
    • 84863752883 scopus 로고    scopus 로고
    • On querying historial evolving graph sequences
    • C. Ren, E. Lo, B. Kao, X. Zhu, and R. Cheng. On querying historial evolving graph sequences. In VLDB, 2011.
    • (2011) VLDB
    • Ren, C.1    Lo, E.2    Kao, B.3    Zhu, X.4    Cheng, R.5
  • 25
    • 84894104746 scopus 로고    scopus 로고
    • Comparison of access methods for time-evolving data
    • B. Salzberg and V. Tsotras. Comparison of access methods for time-evolving data. ACM Comput. Surv., 31(2), 1999.
    • (1999) ACM Comput. Surv. , vol.31 , Issue.2
    • Salzberg, B.1    Tsotras, V.2
  • 27
    • 84862701736 scopus 로고    scopus 로고
    • Technical Report MSR-TR-2012-30, Microsoft Research
    • B. Shao, H. Wang, and Y. Li. The Trinity graph engine. Technical Report MSR-TR-2012-30, Microsoft Research, 2012.
    • (2012) The Trinity Graph Engine
    • Shao, B.1    Wang, H.2    Li, Y.3
  • 28
    • 0036040082 scopus 로고    scopus 로고
    • Algorithmics and applications of tree and graph searching
    • D. Shasha, J. Wang, and R. Giugno. Algorithmics and applications of tree and graph searching. In PODS, 2002.
    • (2002) PODS
    • Shasha, D.1    Wang, J.2    Giugno, R.3
  • 30
    • 65449147147 scopus 로고    scopus 로고
    • Community evolution in dynamic multi-mode networks
    • L. Tang, H. Liu, J. Zhang, and Z. Nazeri. Community evolution in dynamic multi-mode networks. In KDD, 2008.
    • (2008) KDD
    • Tang, L.1    Liu, H.2    Zhang, J.3    Nazeri, Z.4
  • 32
    • 69849101247 scopus 로고    scopus 로고
    • Applied temporal RDF: Efficient temporal querying of RDF data with SPARQL
    • J. Tappolet and A. Bernstein. Applied temporal RDF: Efficient temporal querying of RDF data with SPARQL. In ESWC, pages 308-322, 2009.
    • (2009) ESWC , pp. 308-322
    • Tappolet, J.1    Bernstein, A.2
  • 33
    • 0002887865 scopus 로고
    • The Snapshot Index: An I/O- optimal access method for timeslice queries
    • V. Tsotras and N. Kangelaris. The Snapshot Index: an I/O- optimal access method for timeslice queries. Inf. Syst., 1995.
    • (1995) Inf. Syst.
    • Tsotras, V.1    Kangelaris, N.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.