Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling with Application to Network Structure Prediction
|
|
- Samson Bruce
- 5 years ago
- Views:
Transcription
1 Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling with Application to Network Structure Prediction Takuya Akiba U Tokyo Takanori Hayashi U Tokyo Nozomi Nori Kyoto U Yoichi Iwata U Tokyo Yuichi Yoshida NII & PFI January 29, 2015 The Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI-15) 1
2 Proximity Measures on Networks Strength of relevance between vertex pairs B A C (A, B) > (A, C) 2
3 Distance as a proximity measure Applications of distance as the proximity measure Context-Aware Search [CIKM 08][CIKM 09] Socially-Sensitive Search [CIKM 07][VLDB 08][CIKM 13] Efficient indexing methods Landmark [CIKM 09] [WSDM 10] [CIKM 10] [ICDE 12] TD [SIGMOD 10] [EDBT 12] 2-Hop [SIGMOD 12] [ESA 12] [SIGMOD 13] 3
4 Graph Indexing Methods Given a graph G = V, E 1. construct a data structure (an index) to 2. answer queries quickly Graph queries s 1, t 1, s 2, t 2, Index answer Reachable! 4
5 Distance as a proximity measure Advantage: Scalable and fast Drawback: Poor expressiveness Unweighted graphs Small-world phenomenon Distances are small integers 5
6 Graph Distance (a) 4 (b) 4 (c) 4 6
7 Top-k Distances As a proximity measure, we propose to use Top-k distances defined as Lengths of k shortest paths k = 1 standard distance Loops are allowed 7
8 Graph Distance Top-k Distances (a) 4 [ ] (b) 4 [ ] (c) 4 [ ] 8
9 Graph Distance Top-k Distances (a) 4 [ ] (b) 4 [ ] (c) 4 [ ] 9
10 Top-k Distances as a proximity measure? Top-k distances are vectors of dimension k Not scalar direct substitution impossible 10
11 Top-k Distances as a proximity measure? Top-k distances are vectors of dimension k as feature vectors, nice with Machine Learning [ ] [ ] [ ] SVM Yes No Yes 11
12 Previous Algorithms for Top-k Distances BFS-based naïve algorithm [folklore] O n + m k time Eppstein s algorithm [Eppstein, 1998] O n + m + k time, but slow in practice for moderate k In contrast to many indexing methods for standard distance no indexing methods have been proposed We are to evaluate many pairs of vertices Proportional to graph size not scalable 12
13 Contributions at a glance Contribution 1 An indexing method for top-k distance queries Based on pruned labeling [Akiba+,SIGMOD 13] Simple, fast and scalable Enables Contribution 2 Top-k distances as a proximity measure Suited to machine learning Empirical study on link prediction 13
14 Indexing Method for Top-k Distance Queries Part 2: Algorithm 14
15 Trivial extension? No! from standard distance queries? Main new challenge Carefully avoiding double-counts The same path may come differently Naïve approach may count a path twice or more s t 15
16 2-Hop Cover for distance queries [Cohen+, 2002] Data Structure: a label for each vertex v Label L v L v = u 1, δ 1, u 2, δ 2, δ i = d v, u i L v v δ 3 u 3 δ u2 2 u 1 δ 1 16
17 2-Hop Cover for distance queries [Cohen+, 2002] Data Structure: a label for each vertex v Label L v L v = u 1, δ 1, u 2, δ 2, δ i = d v, u i L v v δ 3 u 3 δ u2 2 u 1 δ 1 Query: 2-hop paths using labels L s min d s, u + d G u, t u L s L(t) s t L t 17
18 Top-k 2-Hop Cover (this work) Data structure Distance Label L v L v = u 1, δ 1, u 2, δ 2, >v δ i = d j th v, u i L v v δ 3 u 3 δ u2 2 u 1 δ 1 Loop Label C v C v = δ 1, δ 2, δ 3, v δ i = d i th v, v C v δ 1 δ 2 v >v d j th v, u i is restricted distance 18
19 Top-k 2-Hop Cover (this work) Data structure Distance Label L v + Loop Label C v Query: 3-hop paths L s C u L t s t 19
20 Indexing Algorithm Challenge on computing labels Correctness (Exactness) Sizes of labels (Index Size & Query Time) Efficiency (Scalability) Algorithm based on pruned labeling [Akiba-Iwata-Yoshida, SIGMOD 13] + Performance improving techniques 20
21 Experimental Evaluation Part 3: Experiments 21
22 Indexing time [s] Indexing Time Experimental Results Social networks Web graphs 1, ,000 10,000,000 Graph size E < 1 hour on graphs with ten million edges k = 8, Intel Xeon X5670 (2.93 GHz), 48 GB Memory, C++ 22
23 Index size [MB] Index Size Experimental Results 10,000 1, Social networks Web graphs 0 1, ,000 10,000,000 Graph size E < 10 GB on graphs with ten million edges k = 8, Intel Xeon X5670 (2.93 GHz), 48 GB Memory, C++ 23
24 Query time [ms] Query Time Experimental Results Proposed Naive Eppstein X faster , ,000 10,000,000 Graph size E Consistently <0.1ms k = 8, Intel Xeon X5670 (2.93 GHz), 48 GB Memory, C++ 24
25 Application to Link Prediction Part 3: Experiments 25
26 Application to Link Prediction Link Prediction Problem [Liben-Nowell+, 2003]? Online Social Network Protein Interaction Methods 7 Baseline Methods Top-k Distances + SVM 26
27 Application to Link Prediction This work Dataset CN Jaccard Adamic Pref. Comb. SVD RWR Top-k Top-1 Facebook Facebook Last.fm GrQc HepTh CondMat Precision: AUC (Area under the ROC curve) Highlighted: statistically significant winners (by paired t-test with p < 0:05) Setting: training (60% edges) evaluation (40% edges), 10 times 27
28 Conclusions Contribution 1 An indexing method for top-k distance queries Contribution 2 Top-k distances as a proximity measure Software available! Hope to see further exploration of top-k distances in various applications! 28
Dynamic and Historical Shortest-Path Distance Queries on Large Evolving Networks by Pruned Landmark Labeling
2014/04/09 @ WWW 14 Dynamic and Historical Shortest-Path Distance Queries on Large Evolving Networks by Pruned Landmark Labeling Takuya Akiba (U Tokyo) Yoichi Iwata (U Tokyo) Yuichi Yoshida (NII & PFI)
More informationEfficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling Takuya Akiba, Takanori Hayashi, Nozomi
More informationI/O Efficient Algorithms for Exact Distance Queries on Disk- Resident Dynamic Graphs
I/O Efficient Algorithms for Exact Distance Queries on Disk- Resident Dynamic Graphs Yishi Lin, Xiaowei Chen, John C.S. Lui The Chinese University of Hong Kong 9/4/15 EXACT DISTANCE QUERIES ON DYNAMIC
More informationPlanar: Parallel Lightweight Architecture-Aware Adaptive Graph Repartitioning
Planar: Parallel Lightweight Architecture-Aware Adaptive Graph Repartitioning Angen Zheng, Alexandros Labrinidis, and Panos K. Chrysanthis University of Pittsburgh 1 Graph Partitioning Applications of
More informationOn Smart Query Routing: For Distributed Graph Querying with Decoupled Storage
On Smart Query Routing: For Distributed Graph Querying with Decoupled Storage Arijit Khan Nanyang Technological University (NTU), Singapore Gustavo Segovia ETH Zurich, Switzerland Donald Kossmann Microsoft
More informationarxiv: v5 [cs.db] 29 Mar 2016
Effective Keyword Search in Graphs arxiv:52.6395v5 [cs.db] 29 Mar 26 n 5 n n 3 n 4 n 6 n 2 (a) n : n 2 : Laurence Fishburne n 3 : Birth Date (info_type) n 4 : The Matrix ABSTRACT n 7 n 8 Mehdi Kargar n,
More informationPath-Hop: efficiently indexing large graphs for reachability queries. Tylor Cai and C.K. Poon CityU of Hong Kong
Path-Hop: efficiently indexing large graphs for reachability queries Tylor Cai and C.K. Poon CityU of Hong Kong Reachability Query Query(u,v): Is there a directed path from vertex u to vertex v in graph
More informationFast Personalized PageRank On MapReduce Authors: Bahman Bahmani, Kaushik Chakrabart, Dong Xin In SIGMOD 2011 Presenter: Adams Wei Yu
Fast Personalized PageRank On MapReduce Authors: Bahman Bahmani, Kaushik Chakrabart, Dong Xin In SIGMOD 2011 Presenter: Adams Wei Yu March 2015, CMU Graph data is Ubiquitous Basic Problem in Graphs: How
More informationApproximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme Miao Qiao, Hong Cheng, Lijun Chang and Jeffrey Xu Yu The Chinese University of Hong Kong {mqiao, hcheng, ljchang, yu}@secuhkeduhk
More informationSupervised Link Prediction with Path Scores
Supervised Link Prediction with Path Scores Wanzi Zhou Stanford University wanziz@stanford.edu Yangxin Zhong Stanford University yangxin@stanford.edu Yang Yuan Stanford University yyuan16@stanford.edu
More informationSociaLite: A Datalog-based Language for
SociaLite: A Datalog-based Language for Large-Scale Graph Analysis Jiwon Seo M OBIS OCIAL RESEARCH GROUP Overview Overview! SociaLite: language for large-scale graph analysis! Extensions to Datalog! Compiler
More informationEfficient Aggregation for Graph Summarization
Efficient Aggregation for Graph Summarization Yuanyuan Tian (University of Michigan) Richard A. Hankins (Nokia Research Center) Jignesh M. Patel (University of Michigan) Motivation Graphs are everywhere
More informationAdaptive Landmark Selection Strategies for Fast Shortest Path Computation in Large Real-World Graphs
Adaptive Landmark Selection Strategies for Fast Shortest Path Computation in Large Real-World Graphs Frank W. Takes and Walter A. Kosters Leiden Institute of Advanced Computer Science (LIACS), Leiden University,
More informationQuerying Shortest Distance on Large Graphs
.. Miao Qiao, Hong Cheng, Lijun Chang and Jeffrey Xu Yu Department of Systems Engineering & Engineering Management The Chinese University of Hong Kong October 19, 2011 Roadmap Preliminary Related Work
More informationComputing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling
Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling Computer Science and Engineering Lijun Chang University of New South Wales, Australia Lijun.Chang@unsw.edu.au Joint work with
More informationExtending In-Memory Relational Database Engines with Native Graph Support
Extending In-Memory Relational Database Engines with Native Graph Support EDBT 18 Mohamed S. Hassan 1 Tatiana Kuznetsova 1 Hyun Chai Jeong 1 Walid G. Aref 1 Mohammad Sadoghi 2 1 Purdue University West
More informationGraphGAN: Graph Representation Learning with Generative Adversarial Nets
The 32 nd AAAI Conference on Artificial Intelligence (AAAI 2018) New Orleans, Louisiana, USA GraphGAN: Graph Representation Learning with Generative Adversarial Nets Hongwei Wang 1,2, Jia Wang 3, Jialin
More informationLink Prediction for Social Network
Link Prediction for Social Network Ning Lin Computer Science and Engineering University of California, San Diego Email: nil016@eng.ucsd.edu Abstract Friendship recommendation has become an important issue
More informationGraph Data Management
Graph Data Management Analysis and Optimization of Graph Data Frameworks presented by Fynn Leitow Overview 1) Introduction a) Motivation b) Application for big data 2) Choice of algorithms 3) Choice of
More informationGenerating Useful Network-based Features for Analyzing Social Networks
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (2008) Generating Useful Network-based Features for Analyzing Social Networks Jun Karamon and Yutaka Matsuo and Mitsuru Ishizuka
More informationarxiv: v1 [cs.si] 18 Oct 2017
Supervised and Extended Restart in Random Walks for Ranking and Link Prediction in Networks Woojeong Jin Jinhong Jung U Kang arxiv:1710.06609v1 [cs.si] 18 Oct 2017 Abstract Given a real-world graph, how
More informationScalable Diversified Ranking on Large Graphs
211 11th IEEE International Conference on Data Mining Scalable Diversified Ranking on Large Graphs Rong-Hua Li Jeffrey Xu Yu The Chinese University of Hong ong, Hong ong {rhli,yu}@se.cuhk.edu.hk Abstract
More informationG(B)enchmark GraphBench: Towards a Universal Graph Benchmark. Khaled Ammar M. Tamer Özsu
G(B)enchmark GraphBench: Towards a Universal Graph Benchmark Khaled Ammar M. Tamer Özsu Bioinformatics Software Engineering Social Network Gene Co-expression Protein Structure Program Flow Big Graphs o
More informationCS224W: Social and Information Network Analysis Project Report: Edge Detection in Review Networks
CS224W: Social and Information Network Analysis Project Report: Edge Detection in Review Networks Archana Sulebele, Usha Prabhu, William Yang (Group 29) Keywords: Link Prediction, Review Networks, Adamic/Adar,
More informationSummary of Research. Arijit Khan
Graphs are widely used in many application domains, including social networks, knowledge graphs, biological networks, software collaboration, geo-spatial road networks, interactive gaming, among many others.
More informationEvaluating Classifiers
Evaluating Classifiers Charles Elkan elkan@cs.ucsd.edu January 18, 2011 In a real-world application of supervised learning, we have a training set of examples with labels, and a test set of examples with
More informationCS 224W Final Report Group 37
1 Introduction CS 224W Final Report Group 37 Aaron B. Adcock Milinda Lakkam Justin Meyer Much of the current research is being done on social networks, where the cost of an edge is almost nothing; the
More informationLarge Scale Complex Network Analysis using the Hybrid Combination of a MapReduce Cluster and a Highly Multithreaded System
Large Scale Complex Network Analysis using the Hybrid Combination of a MapReduce Cluster and a Highly Multithreaded System Seunghwa Kang David A. Bader 1 A Challenge Problem Extracting a subgraph from
More informationSocial & Information Network Analysis CS 224W
Social & Information Network Analysis CS 224W Final Report Alexandre Becker Jordane Giuly Sébastien Robaszkiewicz Stanford University December 2011 1 Introduction The microblogging service Twitter today
More informationOn Fast Parallel Detection of Strongly Connected Components (SCC) in Small-World Graphs
On Fast Parallel Detection of Strongly Connected Components (SCC) in Small-World Graphs Sungpack Hong 2, Nicole C. Rodia 1, and Kunle Olukotun 1 1 Pervasive Parallelism Laboratory, Stanford University
More informationApplications of Machine Learning on Keyword Extraction of Large Datasets
Applications of Machine Learning on Keyword Extraction of Large Datasets 1 2 Meng Yan my259@stanford.edu 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37
More informationGraph Analytics and Machine Learning A Great Combination Mark Hornick
Graph Analytics and Machine Learning A Great Combination Mark Hornick Oracle Advanced Analytics and Machine Learning November 3, 2017 Safe Harbor Statement The following is intended to outline our research
More informationScalable Enterprise Networks with Inexpensive Switches
Scalable Enterprise Networks with Inexpensive Switches Minlan Yu minlanyu@cs.princeton.edu Princeton University Joint work with Alex Fabrikant, Mike Freedman, Jennifer Rexford and Jia Wang 1 Enterprises
More informationComputational Methods in IS Research Fall Graph Algorithms Network Flow Problems
Computational Methods in IS Research Fall 2017 Graph Algorithms Network Flow Problems Nirmalya Roy Department of Information Systems University of Maryland Baltimore County www.umbc.edu Network Flow Problems
More informationA CSP Search Algorithm with Reduced Branching Factor
A CSP Search Algorithm with Reduced Branching Factor Igor Razgon and Amnon Meisels Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, 84-105, Israel {irazgon,am}@cs.bgu.ac.il
More informationShortest paths on large graphs: Systems, Algorithms, Applications
Shortest paths on large graphs: Systems, Algorithms, Applications Andrey Gubichev TU München January 2012 Andrey Gubichev Shortest paths on large graphs 1 / 53 Outline Introduction Systems Algorithms Applications
More informationFast and Scalable Analysis of Massive Social Graphs
Fast and Scalable Analysis of Massive Social Graphs Xiaohan Zhao, Alessandra Sala, Haitao Zheng and Ben Y. Zhao Department of Computer Science, U. C. Santa Barbara, Santa Barbara, CA USA {xiaohanzhao,
More informationarxiv: v1 [cs.si] 8 Jun 2012
Multi-Scale Link Prediction Donghyuk Shin Si Si Inderjit S. Dhillon arxiv:1206.1891v1 [cs.si] 8 Jun 2012 Abstract The automated analysis of social networks has become an important problem due to the proliferation
More informationCascade Mapping: Optimizing Memory Efficiency for Flash-based Key-value Caching
Cascade Mapping: Optimizing Memory Efficiency for Flash-based Key-value Caching Kefei Wang and Feng Chen Louisiana State University SoCC '18 Carlsbad, CA Key-value Systems in Internet Services Key-value
More informationCapturing Missing Links in Social Networks Using Vertex Similarity
Capturing Missing Links in Social Networks Using Vertex Similarity Hung-Hsuan Chen, Liang Gou, Xiaolong (Luke) Zhang, C. Lee Giles Computer Science and Engineering Information Sciences and Technology The
More informationEnterprise. Breadth-First Graph Traversal on GPUs. November 19th, 2015
Enterprise Breadth-First Graph Traversal on GPUs Hang Liu H. Howie Huang November 9th, 5 Graph is Ubiquitous Breadth-First Search (BFS) is Important Wide Range of Applications Single Source Shortest Path
More informationCoordinating More Than 3 Million CUDA Threads for Social Network Analysis. Adam McLaughlin
Coordinating More Than 3 Million CUDA Threads for Social Network Analysis Adam McLaughlin Applications of interest Computational biology Social network analysis Urban planning Epidemiology Hardware verification
More informationA Schema Extraction Algorithm for External Memory Graphs Based on Novel Utility Function
DEIM Forum 2018 I5-5 Abstract A Schema Extraction Algorithm for External Memory Graphs Based on Novel Utility Function Yoshiki SEKINE and Nobutaka SUZUKI Graduate School of Library, Information and Media
More informationFPGP: Graph Processing Framework on FPGA
FPGP: Graph Processing Framework on FPGA Guohao DAI, Yuze CHI, Yu WANG, Huazhong YANG E.E. Dept., TNLIST, Tsinghua University dgh14@mails.tsinghua.edu.cn 1 Big graph is widely used Big graph is widely
More informationFast Parallel Detection of Strongly Connected Components (SCC) in Small-World Graphs
Fast Parallel Detection of Strongly Connected Components (SCC) in Small-World Graphs Sungpack Hong 2, Nicole C. Rodia 1, and Kunle Olukotun 1 1 Pervasive Parallelism Laboratory, Stanford University 2 Oracle
More informationImproving the vector auto regression technique for time-series link prediction by using support vector machine
Improving vector auto regression technique for time-series link prediction by using support vector machine Jan Miles Co and Proceso Fernandez Ateneo de Manila University, Department of Information Systems
More informationNeural Networks and Deep Learning
Neural Networks and Deep Learning Example Learning Problem Example Learning Problem Celebrity Faces in the Wild Machine Learning Pipeline Raw data Feature extract. Feature computation Inference: prediction,
More informationAn Experimental Study on Hub Labeling based Shortest Path Algorithms
An Experimental Study on Hub Labeling based Shortest Path Algorithms Ye Li #1 Leong Hou U #2 Man Lung Yiu 3 Ngai Meng Kou #4 # Department of Computer and Information Science, University of Macau 1 yb47438@umac.mo
More informationPoint-to-Point Shortest Path Algorithms with Preprocessing
Point-to-Point Shortest Path Algorithms with Preprocessing Andrew V. Goldberg Microsoft Research Silicon Valley www.research.microsoft.com/ goldberg/ Joint work with Chris Harrelson, Haim Kaplan, and Retato
More informationOnline Social Networks and Media
Online Social Networks and Media Absorbing Random Walks Link Prediction Why does the Power Method work? If a matrix R is real and symmetric, it has real eigenvalues and eigenvectors: λ, w, λ 2, w 2,, (λ
More informationThe link prediction problem for social networks
The link prediction problem for social networks Alexandra Chouldechova STATS 319, February 1, 2011 Motivation Recommending new friends in in online social networks. Suggesting interactions between the
More informationAutomatic Domain Partitioning for Multi-Domain Learning
Automatic Domain Partitioning for Multi-Domain Learning Di Wang diwang@cs.cmu.edu Chenyan Xiong cx@cs.cmu.edu William Yang Wang ww@cmu.edu Abstract Multi-Domain learning (MDL) assumes that the domain labels
More informationQUINT: On Query-Specific Optimal Networks
QUINT: On Query-Specific Optimal Networks Presenter: Liangyue Li Joint work with Yuan Yao (NJU) -1- Jie Tang (Tsinghua) Wei Fan (Baidu) Hanghang Tong (ASU) Node Proximity: What? Node proximity: the closeness
More informationApproximately Uniform Random Sampling in Sensor Networks
Approximately Uniform Random Sampling in Sensor Networks Boulat A. Bash, John W. Byers and Jeffrey Considine Motivation Data aggregation Approximations to COUNT, SUM, AVG, MEDIAN Existing work does not
More informationParallelizing String Similarity Join Algorithms
Parallelizing String Similarity Join Algorithms Ling-Chih Yao and Lipyeow Lim University of Hawai i at Mānoa, Honolulu, HI 96822, USA {lingchih,lipyeow}@hawaii.edu Abstract. A key operation in data cleaning
More informationThis Talk. Map nodes to low-dimensional embeddings. 2) Graph neural networks. Deep learning architectures for graphstructured
Representation Learning on Networks, snap.stanford.edu/proj/embeddings-www, WWW 2018 1 This Talk 1) Node embeddings Map nodes to low-dimensional embeddings. 2) Graph neural networks Deep learning architectures
More informationOrder or Shuffle: Empirically Evaluating Vertex Order Impact on Parallel Graph Computations
Order or Shuffle: Empirically Evaluating Vertex Order Impact on Parallel Graph Computations George M. Slota 1 Sivasankaran Rajamanickam 2 Kamesh Madduri 3 1 Rensselaer Polytechnic Institute, 2 Sandia National
More informationA Graph-based Database Partitioning Method for Parallel OLAP Query Processing
ICDE 18 A Graph-based Database Partitioning Method for Parallel OLAP Query Processing Yoon-Min Nam, Min-Soo Kim*, Donghyoung Han Department of Information and Communication Engineering DGIST, Republic
More informationTatsuhiro Chiba, Takeshi Yoshimura, Michihiro Horie and Hiroshi Horii IBM Research
Tatsuhiro Chiba, Takeshi Yoshimura, Michihiro Horie and Hiroshi Horii IBM Research IBM Research 2 IEEE CLOUD 2018 / Towards Selecting Best Combination of SQL-on-Hadoop Systems and JVMs à à Application
More informationAn Exploratory Journey Into Network Analysis A Gentle Introduction to Network Science and Graph Visualization
An Exploratory Journey Into Network Analysis A Gentle Introduction to Network Science and Graph Visualization Pedro Ribeiro (DCC/FCUP & CRACS/INESC-TEC) Part 1 Motivation and emergence of Network Science
More informationLink Prediction in Graph Streams
Peixiang Zhao, Charu C. Aggarwal, and Gewen He Florida State University IBM T J Watson Research Center Link Prediction in Graph Streams ICDE Conference, 2016 Graph Streams Graph Streams arise in a wide
More informationMining Significant Graph Patterns by Leap Search
Mining Significant Graph Patterns by Leap Search Xifeng Yan (IBM T. J. Watson) Hong Cheng, Jiawei Han (UIUC) Philip S. Yu (UIC) Graphs Are Everywhere Magwene et al. Genome Biology 2004 5:R100 Co-expression
More informationIngo Brenckmann Jochen Kirsten Storage Technology Strategists SAS EMEA Copyright 2003, SAS Institute Inc. All rights reserved.
Intelligent Storage Results from real life testing Ingo Brenckmann Jochen Kirsten Storage Technology Strategists SAS EMEA SAS Intelligent Storage components! OLAP Server! Scalable Performance Data Server!
More informationMulti-threaded Queries. Intra-Query Parallelism in LLVM
Multi-threaded Queries Intra-Query Parallelism in LLVM Multithreaded Queries Intra-Query Parallelism in LLVM Yang Liu Tianqi Wu Hao Li Interpreted vs Compiled (LLVM) Interpreted vs Compiled (LLVM) Interpreted
More informationOn Graph Query Optimization in Large Networks
On Graph Query Optimization in Large Networks Peixiang Zhao, Jiawei Han Department of omputer Science University of Illinois at Urbana-hampaign pzhao4@illinois.edu, hanj@cs.uiuc.edu September 14th, 2010
More informationLink prediction in multiplex bibliographical networks
Int. J. Complex Systems in Science vol. 3(1) (2013), pp. 77 82 Link prediction in multiplex bibliographical networks Manisha Pujari 1, and Rushed Kanawati 1 1 Laboratoire d Informatique de Paris Nord (LIPN),
More informationAutomatic Scaling Iterative Computations. Aug. 7 th, 2012
Automatic Scaling Iterative Computations Guozhang Wang Cornell University Aug. 7 th, 2012 1 What are Non-Iterative Computations? Non-iterative computation flow Directed Acyclic Examples Batch style analytics
More informationDynamic Graph Query Primitives for SDN-based Cloud Network Management
Dynamic Graph Query Primitives for SDN-based Cloud Network Management Ramya Raghavendra, Jorge Lobo, Kang-Won Lee IBM T. J. Watson Research Center Network as a Service Model High-level VM and network description
More informationCuckoo Linear Algebra
Cuckoo Linear Algebra Li Zhou, CMU Dave Andersen, CMU and Mu Li, CMU and Alexander Smola, CMU and select advertisement p(click user, query) = logist (hw, (user, query)i) select advertisement find weight
More informationAdvanced Data Management
Advanced Data Management Medha Atre Office: KD-219 atrem@cse.iitk.ac.in Sept 26, 2016 defined Given a graph G(V, E) with V as the set of nodes and E as the set of edges, a reachability query asks does
More informationA New Parallel Algorithm for Connected Components in Dynamic Graphs. Robert McColl Oded Green David Bader
A New Parallel Algorithm for Connected Components in Dynamic Graphs Robert McColl Oded Green David Bader Overview The Problem Target Datasets Prior Work Parent-Neighbor Subgraph Results Conclusions Problem
More informationLink Prediction and Anomoly Detection
Graphs and Networks Lecture 23 Link Prediction and Anomoly Detection Daniel A. Spielman November 19, 2013 23.1 Disclaimer These notes are not necessarily an accurate representation of what happened in
More informationScalable Mining of Massive Networks: Distance-based Centrality, Similarity, and Influence. Edith Cohen Tel Aviv University
Scalable Mining of Massive Networks: Distance-based Centrality, Similarity, and Influence Edith Cohen Tel Aviv University Graph Datasets: Represent relations between things Bowtie structure of the Web
More informationA Structured Overlay for Non-uniform Node Identifier Distribution Based on Flexible Routing Tables
A Structured Overlay for Non-uniform Node Identifier Distribution Based on Flexible Routing Tables Takehiro Miyao, Hiroya Nagao, Kazuyuki Shudo Tokyo Institute of Technology 2-12-1 Ookayama, Meguro-ku,
More informationAI Technology for Quickly Solving Urban Security Positioning Problems
AI Technology for Quickly Solving Urban Security Positioning Problems Hiroaki Iwashita Kotaro Ohori Hirokazu Anai Security games are used for mathematically optimizing security measures aimed at minimizing
More informationMath 443/543 Graph Theory Notes 10: Small world phenomenon and decentralized search
Math 443/543 Graph Theory Notes 0: Small world phenomenon and decentralized search David Glickenstein November 0, 008 Small world phenomenon The small world phenomenon is the principle that all people
More informationEfficient Subgraph Matching by Postponing Cartesian Products
Efficient Subgraph Matching by Postponing Cartesian Products Computer Science and Engineering Lijun Chang Lijun.Chang@unsw.edu.au The University of New South Wales, Australia Joint work with Fei Bi, Xuemin
More informationChallenges in large-scale graph processing on HPC platforms and the Graph500 benchmark. by Nkemdirim Dockery
Challenges in large-scale graph processing on HPC platforms and the Graph500 benchmark by Nkemdirim Dockery High Performance Computing Workloads Core-memory sized Floating point intensive Well-structured
More informationSampling Large Graphs for Anticipatory Analysis
Sampling Large Graphs for Anticipatory Analysis Lauren Edwards*, Luke Johnson, Maja Milosavljevic, Vijay Gadepally, Benjamin A. Miller IEEE High Performance Extreme Computing Conference September 16, 2015
More informationGraph Algorithms using Map-Reduce. Graphs are ubiquitous in modern society. Some examples: The hyperlink structure of the web
Graph Algorithms using Map-Reduce Graphs are ubiquitous in modern society. Some examples: The hyperlink structure of the web Graph Algorithms using Map-Reduce Graphs are ubiquitous in modern society. Some
More informationBoosting the Performance of FPGA-based Graph Processor using Hybrid Memory Cube: A Case for Breadth First Search
Boosting the Performance of FPGA-based Graph Processor using Hybrid Memory Cube: A Case for Breadth First Search Jialiang Zhang, Soroosh Khoram and Jing Li 1 Outline Background Big graph analytics Hybrid
More informationCompressing Social Networks
Compressing Social Networks The Minimum Logarithmic Arrangement Problem Chad Waters School of Computing Clemson University cgwater@clemson.edu March 4, 2013 Motivation Determine the extent to which social
More informationFast Reliability Search in Uncertain Graphs Arijit Khan, Francesco Bonchi, Aristides Gionis, Francesco Gullo
Fast Reliability earch in ncertain Graphs Arijit Khan, Francesco Bonchi, Aristides Gionis, Francesco Gullo ystems Group, ETH Zurich Yahoo Labs, pain Aalto niversity, Finland ncertain Graphs 0.2 0.1 T ocial
More informationHistogram-Aware Sorting for Enhanced Word-Aligned Compress
Histogram-Aware Sorting for Enhanced Word-Aligned Compression in Bitmap Indexes 1- University of New Brunswick, Saint John 2- Université du Québec at Montréal (UQAM) October 23, 2008 Bitmap indexes SELECT
More informationCS6220: DATA MINING TECHNIQUES
CS6220: DATA MINING TECHNIQUES Image Data: Classification via Neural Networks Instructor: Yizhou Sun yzsun@ccs.neu.edu November 19, 2015 Methods to Learn Classification Clustering Frequent Pattern Mining
More informationThree-Hop Distance Estimation in Social Graphs
Three-Hop Distance Estimation in Social Graphs Pascal Welke University of Bonn 1 Bonn, Germany welke@uni-bonn.de Alexander Markowetz Markowetz.de Bonn, Germany alexander@markowetz.de Torsten Suel New York
More informationRack-scale Data Processing System
Rack-scale Data Processing System Jana Giceva, Darko Makreshanski, Claude Barthels, Alessandro Dovis, Gustavo Alonso Systems Group, Department of Computer Science, ETH Zurich Rack-scale Data Processing
More informationCyberAgent s Ameba Miniaturizes Pigg Gaming Infrastructure
CyberAgent s Ameba Miniaturizes Pigg Gaming Infrastructure CyberAgent s Ameba Miniaturizes Pigg Gaming Infrastructure Japanese Internet giant adds Fusion-io to MySQL gaming platform, more than doubling
More informationContinuous Data Cleaning
Continuous Data Cleaning M. Volkovs, F. Chiang, J. Szlichta and R. J. Miller ICDE 2014 Presenter: Nabiha Asghar Outline Introduction and motivation Main contributions of the paper Description of architecture
More informationAUTOMATICALLY GENERATING DATA LINKAGES USING A DOMAIN-INDEPENDENT CANDIDATE SELECTION APPROACH
AUTOMATICALLY GENERATING DATA LINKAGES USING A DOMAIN-INDEPENDENT CANDIDATE SELECTION APPROACH Dezhao Song and Jeff Heflin SWAT Lab Department of Computer Science and Engineering Lehigh University 11/10/2011
More informationScalable Selective Traffic Congestion Notification
Scalable Selective Traffic Congestion Notification Győző Gidófalvi Division of Geoinformatics Deptartment of Urban Planning and Environment KTH Royal Institution of Technology, Sweden gyozo@kth.se Outline
More informationNetwork Lasso: Clustering and Optimization in Large Graphs
Network Lasso: Clustering and Optimization in Large Graphs David Hallac, Jure Leskovec, Stephen Boyd Stanford University September 28, 2015 Convex optimization Convex optimization is everywhere Introduction
More informationQuery Processing in Highly-Loaded Search Engines
Query Processing in Highly-Loaded Search Engines Daniele Broccolo 1,2, Craig Macdonald 3, Salvatore Orlando 1,2, Iadh Ounis 3, Raffaele Perego 2, Fabrizio Silvestri 2, and Nicola Tonellotto 2 1 Università
More informationA NOVEL APPROACH ON SPATIAL OBJECTS FOR OPTIMAL ROUTE SEARCH USING BEST KEYWORD COVER QUERY
A NOVEL APPROACH ON SPATIAL OBJECTS FOR OPTIMAL ROUTE SEARCH USING BEST KEYWORD COVER QUERY S.Shiva Reddy *1 P.Ajay Kumar *2 *12 Lecterur,Dept of CSE JNTUH-CEH Abstract Optimal route search using spatial
More informationDNA Interaction Network
Social Network Web Network Social Network DNA Interaction Network Follow Network User-Product Network Nonuniform network comm costs Contentiousness of the memory subsystems Nonuniform comp requirement
More informationEfficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach
Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach Lucas Jacques May 2014 Abstract This is a report for the Seminar Algorithms for Database Systems, organized by the University
More informationEffective Keyword Search over (Semi)-Structured Big Data Mehdi Kargar
Effective Keyword Search over (Semi)-Structured Big Data Mehdi Kargar School of Computer Science Faculty of Science University of Windsor How Big is this Big Data? 40 Billion Instagram Photos 300 Hours
More informationBig Data Analytics CSCI 4030
High dim. data Graph data Infinite data Machine learning Apps Locality sensitive hashing PageRank, SimRank Filtering data streams SVM Recommen der systems Clustering Community Detection Queries on streams
More informationMemory-Efficient Fast Shortest Path Estimation in Large Social Networks
Proceedings of the Eighth International AAAI Conference on Weblogs and Social Media Memory-Efficient Fast Shortest Path Estimation in Large Social Networks Volodymyr Floreskul and Konstantin Tretyakov
More information4/8/11. Single-Source Shortest Path. Shortest Paths. Shortest Paths. Chapter 24
/8/11 Single-Source Shortest Path Chapter 1 Shortest Paths Finding the shortest path between two nodes comes up in many applications o Transportation problems o Motion planning o Communication problems
More information