Evaluating Reachability Queries over Path Collections

Authors:
Panagiotis Bouros;Spiros Skiadopoulos;Theodore Dalamagas;Dimitris Sacharidis;Timos Sellis
Affiliations:
National Technical University of Athens, Athens, Greece 157 80;University of Peloponnese, Tripoli, Greece 221 00;Institute for the Management of Information Systems -- "Athena" R.C., Athens, Greece 115 24;National Technical University of Athens, Athens, Greece 157 80;National Technical University of Athens, Athens, Greece 157 80 and Institute for the Management of Information Systems -- "Athena" R.C., Athens, Greece 115 24
Venue:
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Year:
2009

Citing 9
Cited 6

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
Reachability and distance queries via 2-hop labels

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Direct Algorithms for Computing the Transitive Closure of Database Relations

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Materialization and Incremental Update of Path Information

Proceedings of the Fifth International Conference on Data Engineering
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
Dual Labeling: Answering Graph Reachability Queries in Constant Time

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Fast and practical indexing and querying of very large graphs

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
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
Efficiently answering reachability queries on very large directed graphs

Proceedings of the 2008 ACM SIGMOD international conference on Management of data

Relational operators for prioritizing candidate biomarkers in high-throughput differential expression data

Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology
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)
Institute for the management of information systems Athena research center

ACM SIGMOD Record
Transitive closure and recursive Datalog implemented on clusters

Proceedings of the 15th International Conference on Extending Database Technology
Pay-as-you-go maintenance of precomputed nearest neighbors in large graphs

Proceedings of the 21st ACM international conference on Information and knowledge management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several applications in areas such as biochemistry, GIS, involve storing and querying large volumes of sequential data stored as path collections . There is a number of interesting queries that can be posed on such data. This work focuses on reachability queries: given a path collection and two nodes v s , v t , determine whether a path from v s to v t exists and identify it. To answer these queries, the path-first search paradigm, which treats paths as first-class citizens, is proposed. To improve the performance of our techniques, two indexing structures that capture the reachability information of paths are introduced. Further, methods for updating a path collection and its indices are discussed. Finally, an extensive experimental evaluation verifies the advantages of our approach.