DB 系グラフ系論文列挙

演習 3 のネタが尽きつつあるので頑張って探す必要がある

とりあえず列挙してみた

  • SIGMOD
    • 2012
      • Managing Large Dynamic Graphs Efficiently
      • Query Preserving Graph Compression
      • SCARAB: Scaling Reachability Computation on Large Graphs
      • A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs
      • Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach
      • A Model-Based Approach to Attributed Graph Clustering
      • Towards Effective Partition Management for Large Graphs
      • TreeSpan: Efficiently Computing Similarity All-Matching
    • 2011
      • 2. Local Graph Sparsification for Scalable Clustering [#sigmod2011 #R15P2]
      • 1. Neighborhood Based Fast Graph Search in Large Networks [#sigmod2011 #R19P1]
      • 2. A Memory Efficient Reachability Data Structure Through Bit Vector Compression [#sigmod2011 #R19P2]
      • 3. Incremental Graph Pattern Matching [#sigmod2011 #R19P3]
      • 4. Assessing and Ranking Structural Correlations in Graphs
    • 2010
      • TEDI: Efficient Shortest Path Query Answering on Graphs
      • GBLENDER: Towards Blending Visual Query Formulation and Query Processing in Graph Databases
      • Computing Label Constraint Reachability in Graph Databases
      • Pregel: A System for Large-Scale Graph Processing
      • Finding Maximal Cliques in Massive Networks by H*-Graph
      • Towards Proximity Pattern Mining in Large Graphs
      • GAIA: Graph Classification Using Evolutionary Computation
      • Finding Maximum Degrees in Hidden Bipartite Graphs
      • Connected Substructure Similarity Search
    • 2009
      • Monitoring Path Nearest Neighbor in Road Networks
      • 3-HOP: A High-Compression Indexing Scheme for Reachability Query
    • 2008
      • Scalable Network Distance Browsing in Spatial Databases
      • Graphs-at-a-time: Query Language and Access Methods for Graph Databases
      • Graph Summarization with Bounded Error
      • Mining Significant Graph Patterns by Scalable Leap Search
      • CSV: Visualizing and Mining Cohesive Subgraphs
      • Efficient Aggregation for Graph Summarization
      • Efficient Algorithms for Exact Ranked Twig Pattern Matching over Graphs
      • Efficiently Answering Reachability Query on Very Large Directed Graphs
      • Minimization of Tree Pattern Queries with Constraints
    • 2007
      • Fast and Practical Indexing and Querying of Very Large Graphs
    • 2006
      • 無い？分からん
  • ICDE
    • 2012
      • Iterative Graph Feature Mining for Graph Indexing
      • An Efficient Graph Indexing Method
      • PRAGUE: Towards Blending Practical Visual Subgraph Query Formulation and Query Processing
      • Ego-centric Graph Pattern Census
    • 2011
      • Efficient Core Decomposition in Massive Networks
      • Decomposing DAGs into Spanning Trees: A New Way to Compress Transitive Closures
      • Adding Regular Expressions to Graph Reachability and Pattern Queries
      • Mining Large Graphs: Algorithms, Inference, and Discoveries
      • Outlier Detection in Graph Streams
      • On Dimensionality Reduction of Massive Graphs for Indexing and Retrieval
    • 2010
      • 無い？
    • 2009
      • GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases
      • Continuous Subgraph Pattern Search over Graph Streams
      • Context-Aware Object Connection Discovery in Large Graphs
      • STAR: Steiner-Tree Approximation in Relationship Graphs
  • PODS
    • 2012
      • Graph Sketches: Sparsification, Spanners, and Subgraphs