Fast and practical indexing and querying of very large graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Efficiently Querying Large XML Data Repositories: A Survey
IEEE Transactions on Knowledge and Data Engineering
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
A new method for generating compressed representation of transitive closure
Proceedings of the 2008 C3S2E conference
Graphs-at-a-time: query language and access methods for graph databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Efficient algorithms for exact ranked twig-pattern matching over graphs
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
On the Evaluation of Large and Sparse Graph Reachability Queries
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Hash-base subgraph query processing method for graph-structured XML documents
Proceedings of the VLDB Endowment
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
General spanning trees and reachability query evaluation
C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
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
Optimizing updates of recursive XML views of relations
The VLDB Journal — The International Journal on Very Large Data Bases
GConnect: a connectivity index for massive disk-resident graphs
Proceedings of the VLDB Endowment
Distance-join: pattern match query in a large graph database
Proceedings of the VLDB Endowment
Techniques for efficiently querying scientific workflow provenance graphs
Proceedings of the 13th International Conference on Extending Database Technology
TEDI: efficient shortest path query answering on graphs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Computing label-constraint reachability 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
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
Efficient graph reachability query answering using tree decomposition
RP'10 Proceedings of the 4th international conference on Reachability problems
Graph pattern matching: from intractable to polynomial time
Proceedings of the VLDB Endowment
GRAIL: scalable reachability index for large graphs
Proceedings of the VLDB Endowment
Path-tree: An efficient reachability indexing scheme for large directed graphs
ACM Transactions on Database Systems (TODS)
Classifying graphs using theoretical metrics: a study of feasibility
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
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
Journal of Network and Systems Management
Join-reachability problems in directed graphs
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Subgraph search over massive disk resident graphs
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
An efficient static trace simplification technique for debugging concurrent programs
SAS'11 Proceedings of the 18th international conference on Static analysis
Answering label-constraint reachability in large graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
Fast computation of reachability labeling for large graphs
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
On querying OBO ontologies using a DAG pattern query language
DILS'06 Proceedings of the Third international conference on Data Integration in the Life Sciences
Answering pattern match queries in large graph databases via graph embedding
The VLDB Journal — The International Journal on Very Large Data Bases
Searching web data: An entity retrieval and high-performance indexing model
Web Semantics: Science, Services and Agents on the World Wide Web
A node indexing scheme for web entity retrieval
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part II
Journal of Biomedical Informatics
Towards a scalable, pragmatic knowledge representation language for the web
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
Adding logical operators to tree pattern queries on graph-structured data
Proceedings of the VLDB Endowment
SCARAB: scaling reachability computation on large graphs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Transitive closure and recursive Datalog implemented on clusters
Proceedings of the 15th International Conference on Extending Database Technology
I/O cost minimization: reachability queries processing over massive graphs
Proceedings of the 15th International Conference on Extending Database Technology
Graph pattern matching revised for social network analysis
Proceedings of the 15th International Conference on Database Theory
K-reach: who is in your small world
Proceedings of the VLDB Endowment
A general framework to encode heterogeneous information sources for contextual pattern mining
Proceedings of the 21st ACM international conference on Information and knowledge management
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
Fast cone-of-influence computation and estimation in problems with multiple properties
Proceedings of the Conference on Design, Automation and Test in Europe
A distributed graph engine for web scale RDF data
Proceedings of the VLDB Endowment
Incremental graph pattern matching
ACM Transactions on Database Systems (TODS)
Computing weight constraint reachability in large networks
The VLDB Journal — The International Journal on Very Large Data Bases
Efficiently anonymizing social networks with reachability preservation
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
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
A scalable approach to computing representative lowest common ancestor in directed acyclic graphs
Theoretical Computer Science
Efficient processing of label-constraint reachability queries in large graphs
Information Systems
Generalized Hybrid Encoding of Polyhierarchical Structures
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
Hi-index | 0.00 |
Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many applications involve huge graphs and require fast answering of reachability queries. Several reachability labeling methods have been proposed for this purpose. They assign labels to the vertices, such that the reachability between any two vertices may be decided using their labels only. For sparse graphs, 2-hop based reachability labeling schemes answer reachability queries efficiently using relatively small label space. However, the labeling process itself is often too time consuming to be practical for large graphs. In this paper, we propose a novel labeling scheme for sparse graphs. Our scheme ensures that graph reachability queries can be answered in constant time. Furthermore, for sparse graphs, the complexity of the labeling process is almost linear, which makes our algorithm applicable to massive datasets. Analytical and experimental results show that our approach is much more efficient than stateof- the-art approaches. Furthermore, our labeling method also provides an alternative scheme to tradeoff query time for label space, which further benefits applications that use tree-like graphs.