Fast and practical indexing and querying of very large graphs

Authors:
Silke Trißl;Ulf Leser
Affiliations:
Humboldt-Universität zu Berlin, Berlin, Germany;Humboldt-Universität zu Berlin, Berlin, Germany
Venue:
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Year:
2007

Citing 16
Cited 60

Two algorithms for maintaining order in a list

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Efficient management of transitive relationships in large data and knowledge bases

SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
A query language for a Web-site management system

ACM SIGMOD Record
Introduction to algorithms

Introduction to algorithms
RQL: a declarative query language for RDF

Proceedings of the 11th international conference on World Wide Web
Direct Algorithms for Computing the Transitive Closure of Database Relations

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
GraphDB: Modeling and Querying Graphs in Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
New Strategies for Computing the Transitive Closure of a Database Relation

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Reachability and Distance Queries via 2-Hop Labels

SIAM Journal on Computing
Accelerating XPath evaluation in any RDBMS

ACM Transactions on Database Systems (TODS)
Efficient Creation and Incremental Maintenance of the HOPI Index for Complex XML Document Collections

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Stack-based algorithms for pattern matching on DAGs

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Compact reachability labeling for graph-structured data

Proceedings of the 14th ACM international conference on Information and knowledge management
Dual Labeling: Answering Graph Reachability Queries in Constant Time

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Fast computation of reachability labeling for large graphs

EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Querying ontologies in relational database systems

DILS'05 Proceedings of the Second international conference on Data Integration in the Life Sciences

Top-k subgraph matching query in a large graph

Proceedings of the ACM first Ph.D. workshop in CIKM
Fast computing reachability labelings for large graphs with high compression rate

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Scaling RDF with Time

Proceedings of the 17th international conference on World Wide Web
On incremental maintenance of 2-hop labeling of graphs

Proceedings of the 17th international conference on World Wide Web
Graphs-at-a-time: query language and access methods for graph databases

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Efficiently answering reachability queries on very large directed graphs

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Coding-based Join Algorithms for Structural Queries on Graph-Structured XML Document

World Wide Web
Indexing Method for Transitive Relationships of Product Information

WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
On-line exact shortest distance query processing

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Efficiently indexing shortest paths by exploiting symmetry in graphs

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs

DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs

DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Hybrid storage for enabling fully-featured text search and fine-grained structural search over source code

SUITE '09 Proceedings of the 2009 ICSE Workshop on Search-Driven Development-Users, Infrastructure, Tools and Evaluation
3-HOP: a high-compression indexing scheme for reachability query

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Evaluating Reachability Queries over Path Collections

SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Efficient Map Portrayal Using a General-Purpose Query Language

DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Comparing stars: on approximating graph edit distance

Proceedings of the VLDB Endowment
Distance-join: pattern match query in a large graph database

Proceedings of the VLDB Endowment
TEDI: efficient shortest path query answering on graphs

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
GBLENDER: towards blending visual query formulation and query processing in graph databases

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
An optimal labeling scheme for workflow provenance using skeleton labels

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Four lessons in versatility or how query languages adapt to the web

Semantic techniques for the web
Path-hop: efficiently indexing large graphs for reachability queries

CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Fast and accurate estimation of shortest paths in large graphs

CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Fast top-k simple shortest paths discovery in graphs

CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
A hierarchical approach to reachability query answering in very large graph databases

CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
On-line preferential nearest neighbor browsing in large attributed graphs

DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
Efficient graph reachability query answering using tree decomposition

RP'10 Proceedings of the 4th international conference on Reachability problems
GRAIL: scalable reachability index for large graphs

Proceedings of the VLDB Endowment
On graph query optimization in large networks

Proceedings of the VLDB Endowment
Graph partitioning strategies for efficient BFS in shared-nothing parallel systems

WAIM'10 Proceedings of the 2010 international conference on Web-age information management
Path-tree: An efficient reachability indexing scheme for large directed graphs

ACM Transactions on Database Systems (TODS)
Accelerating computationally intensive queries on massive earth science data: (system demonstration)

Proceedings of the EDBT/ICDT 2011 Workshop on Array Databases
BMC: an efficient method to evaluate probabilistic reachability queries

DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Efficient storage and fast querying of source code

Information Systems Frontiers
GBASE: a scalable and general graph management system

Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Subgraph search over massive disk resident graphs

SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Answering label-constraint reachability in large graphs

Proceedings of the 20th ACM international conference on Information and knowledge management
ParallelGDB: a parallel graph database based on cache specialization

Proceedings of the 15th Symposium on International Database Engineering & Applications
Relational approach for shortest path discovery over large graphs

Proceedings of the VLDB Endowment
Answering pattern match queries in large graph databases via graph embedding

The VLDB Journal — The International Journal on Very Large Data Bases
Pani: a novel algorithm for fast discovery of putative target nodes in signaling networks

Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine
k-Neighborhood decentralization: A comprehensive solution to index the UMLS for large scale knowledge discovery

Journal of Biomedical Informatics
SCARAB: scaling reachability computation on large graphs

SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Adaptive optimizations of recursive queries in teradata

SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
I/O cost minimization: reachability queries processing over massive graphs

Proceedings of the 15th International Conference on Extending Database Technology
K-reach: who is in your small world

Proceedings of the VLDB Endowment
Regular path queries on large graphs

SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
gbase: an efficient analysis platform for large graphs

The VLDB Journal — The International Journal on Very Large Data Bases
Pay-as-you-go maintenance of precomputed nearest neighbors in large graphs

Proceedings of the 21st ACM international conference on Information and knowledge management
Dynamic multi-version ontology-based personalization

Proceedings of the Joint EDBT/ICDT 2013 Workshops
TF-Label: a topological-folding labeling scheme for reachability querying in a large graph

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Computing weight constraint reachability in large networks

The VLDB Journal — The International Journal on Very Large Data Bases
SCISSOR: scalable and efficient reachability query processing in time-evolving hierarchies

Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Efficient simrank-based similarity join over large graphs

Proceedings of the VLDB Endowment
Simple, fast, and scalable reachability oracle

Proceedings of the VLDB Endowment
Efficient processing of label-constraint reachability queries in large graphs

Information Systems
Hybrid query execution engine for large attributed graphs

Information Systems
WOOster: a map-reduce based platform for graph mining

Proceedings of the 17th International Conference on Management of Data
Generalized Hybrid Encoding of Polyhierarchical Structures

Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many applications work with graph-structured data. As graphs grow in size, indexing becomes essential to ensure sufficient query performance. We present the GRIPP index structure (GRaph Indexing based on Pre- and Postorder numbering) for answering reachability queries in graphs. GRIPP requires only linear time and space. Using GRIPP, we can answer reachability queries on graphs with 5 million nodes on average in less than 5 milliseconds, which is unrivaled by previous methods. We evaluate the performance and scalability of our approach on real and synthetic random and scale-free graphs and compare our approach to existing indexing schemes. GRIPP is implemented as stored procedure inside a relational database management system and can therefore very easily be integrated into existing graph-oriented applications.