2016年3月22日火曜日

Graph @ VLDB



2011

  • On Triangulation-based Dense Neighborhood Graphs Discovery.
  • Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions.
  • Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining.
  • Human-assisted graph search: it's okay to ask questions.
  • High-throughput transaction executions on graphics processors.
  • Efficient Parallel Lists Intersection and Index Compression Algorithms using Graphics Processing Units.
  • gStore: Answering SPARQL Queries via Subgraph Matching.
  • Surrogate Parenthood: Protected and Informative Graphs.
  • Distance-Constraint Reachability Computation in Uncertain Graphs.
  • Keyword Search in Graphs: Finding r-cliques.
  • On Querying Historical Evolving Graph Sequences.
  • Efficient Subgraph Search over Large Uncertain Graphs.
  • Scalable SPARQL Querying of Large RDF Graphs.
  • Private Analysis of Graph Structure.
  • Graph Data Management Systems for New Application Domains.


2012
  • gSketch: On Query Estimation in Graph Streams.
  • Capturing Topology in Graph Pattern Matching.
  • Relational Approach for Shortest Path Discovery over Large Graphs.
  • Densest Subgraph in Streaming and MapReduce.
  • Mining Attribute-structure Correlated Patterns in Large Attributed Graphs.
  • Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification.
  • Distributed GraphLab: A Framework for Machine Learning in the Cloud.
  • Adding Logical Operators to Tree Pattern Queries on Graph-Structured Data.
  • Efficient Subgraph Matching on Billion Node Graphs.
  • Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases.
  • Real Time Discovery of Dense Clusters in Highly Dynamic Graphs: Identifying Real World Events in Highly Dynamic Environments.
  • Injecting Uncertainty in Graphs for Identity Obfuscation.
  • Measuring Two-Event Structural Correlations on Graphs.
  • Understanding and Managing Cascades on Large Graphs.
  • Graph Synopses, Sketches, and Streams: A Survey.


2013
  • Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis.
  • Piggybacking on Social Networks
  • Mobility and Social Networking: A Data Management Perspective
  • Top-K Structural Diversity Search in Large Networks
  • Diversified Top-k Graph Pattern Matching
  • Probabilistic Query Rewriting for Efficient and Effective Keyword Search on Graph Data
  • Summarizing Answer Graphs Induced by Keyword Queries
  • Scaling Queries over Big RDF Graphs with Semantic Hash Partitioning
  • Distributed SociaLite: A Datalog-Based Language for Large-Scale Graph Analysis
  • Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs
  • Fast Iterative Graph Computation with Block Updates


2014

  • Toward a Distance Oracle for Billion-Node Graphs

    • From "Think Like a Vertex" to "Think Like a Graph"
    • GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph
    • Schemaless and Structureless Graph Querying
    • Optimizing Graph Algorithms on Pregel-like Systems
    • A Principled Approach to Bridging the Gap between Graph Data and their Schemas
    • Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs
    • Path Problems in Temporal Graphs
    • Computing Personalized PageRank Quickly by Exploiting Graph Structures
    • An Experimental Comparison of Pregel-like Graph Processing Systems
    • Distributed Graph Simulation: Impossibility and Possibility
    • Real-Time Twitter Recommendation: Online Motif Detection in Large Dynamic Graphs
    • Large-Scale Graph Analytics in Aster 6: Bringing Context to Big Data Discovery
    • Graph-based Data Integration and Business Intelligence with BIIIG
    • VERTEXICA: Your Relational Friend for Graph Analytics
    • NScale: Neighborhood-centric Analytics on Large Graphs
    • Systems for Big-Graphs
    • Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees
    • Auto-Approximation of Graph Computing
    • LogGP: A Log-based Dynamic Graph Partitioning Method
    • Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs
    • GeoScope: Online Detection of Geo-Correlated Information Trends in Social Networks
    • An efficient reconciliation algorithm for social networks
    • Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks
    • Pronto: A Software-Defined Networking based System for Performance Management of Analytical Queries on Distributed Data Stores
    • Getting Your Big Data Priorities Straight: A Demonstration of Priority-based QoS using Social-network-driven Stock Recommendation
    • SPOT: Locating Social Media Users Based on Social Network Context
    • Matching Titles with Cross Title Web-Search Enrichment and Community Detection

    2015

  • Leveraging Graph Dimensions in Online Graph Search

    • Pregelix: Big(ger) Graph Analytics on a Dataflow Engine
    • Large-Scale Distributed Graph Computing Systems: An Experimental Evaluation
    • MOCgraph: Scalable Distributed Graph Processing Using Message Online Computing
    • Event Pattern Matching over Graph Streams
    • Fast Failure Recovery in Distributed Graph Processing Systems
    • The More the Merrier: Efficient Multi-Source Graph Traversal
    • Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs
    • An Efficient Similarity Search Framework for SimRank over Large Dynamic Graphs
    • FrogWild! - Fast PageRank Approximations on Graph Engines
    • Giraph Unchained: Barrierless Asynchronous Parallel Execution in Pregel-like Graph Processing Systems
    • Scalable Subgraph Enumeration in MapReduce
    • Growing a Graph Matching from a Handful of Seeds
    • SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale Graphs
    • GraphMat: High performance graph analytics made productive
    • Taming Subgraph Isomorphism for RDF Query Processing
    • GraphTwist: Fast Iterative Graph Computation with Two-tier Optimizations
    • Bonding Vertex Sets Over Distributed Graph: A Betweenness Aware Approach
    • A Scalable Distributed Graph Partitioner
    • Association Rules with Graph Patterns
    • Performance and Scalability of Indexed Subgraph Query Processing Methods
    • Keys for Graphs
    • One Trillion Edges: Graph Processing at Facebook-Scale
    • Perseus: An Interactive Large-Scale Graph Mining and Visualization Tool
    • VIIQ: Auto-Suggestion Enabled Visual Interface for Interactive Graph Query Formulation
    • Query-Oriented Summarization of RDF Graphs
    • Universal-DB: Towards Representation Independent Graph Analytics
    • GraphGen: Exploring Interesting Graphs in Relational Data
    • On Uncertain Graphs Modeling and Queries
    • Towards Maximum Independent Sets on Massive Graphs
    • Tracking the Conductance of Rapidly Evolving Topic-Subgraphs
    • Influential Community Search in Large Networks
    • Efficient Partial-Pairs SimRank Search for Large Networks
    • Walk, Not Wait: Faster Sampling Over Online Social Networks
    • Community Detection in Social Networks: An In-depth Benchmarking Study with a Procedure-Oriented Framework
    • Leveraging History for Faster Sampling of Online Social Networks







    0 件のコメント:

    コメントを投稿