Efficient implementation of lattice operations
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Introduction to algorithms
Finding regular simple paths in graph databases
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Efficient handling of multiple inheritance hierarchies
OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Incremental encoding of multiple inheritance hierarchies
Proceedings of the eighth international conference on Information and knowledge management
On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Efficient subtyping tests with PQ-encoding
OOPSLA '01 Proceedings of the 16th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A comparison of labeling schemes for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Covering indexes for branching path queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Counting Twig Matches in a Tree
Proceedings of the 17th International Conference on Data Engineering
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Indexing and Querying XML Data for Regular Path Expressions
Proceedings of the 27th International Conference on Very Large Data Bases
UnQL: a query language and algebra for semistructured data based on structural recursion
The VLDB Journal — The International Journal on Very Large Data Bases
On labeling schemes for the semantic web
WWW '03 Proceedings of the 12th international conference on World Wide Web
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Twig query processing over graph-structured XML data
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Twig2Stack: bottom-up processing of generalized-tree-pattern queries over XML documents
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
OntoQuest: exploring ontological data made easy
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Fast and practical indexing and querying of very large graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Evaluation of partial path queries on xml data
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
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
Efficient evaluation of generalized path pattern queries on XML data
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
Hash-base subgraph query processing method for graph-structured XML documents
Proceedings of the VLDB Endowment
Querying and monitoring distributed business processes
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
Updating recursive XML views of relations
Journal of Computer Science and Technology
3-HOP: a high-compression indexing scheme for reachability query
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
MEDIALIFE: from images to a life chronicle
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Efficient Evaluation of Generalized Tree-Pattern Queries with Same-Path Constraints
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Answering XML queries using materialized views revisited
Proceedings of the 18th ACM conference on Information and knowledge management
Cost-based query optimization for multi reachability joins
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
A new algorithm for pattern matching and unification
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 7
TEDI: efficient shortest path query answering on graphs
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
Editorial: BioDB: An ontology-enhanced information system for heterogeneous biological information
Data & Knowledge Engineering
Path-hop: efficiently indexing large graphs for reachability queries
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
Reducing graph matching to tree matching for XML queries with ID references
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Graph pattern matching: from intractable to polynomial time
Proceedings of the VLDB Endowment
Graph homomorphism revisited for graph matching
Proceedings of the VLDB Endowment
Path-tree: An efficient reachability indexing scheme for large directed graphs
ACM Transactions on Database Systems (TODS)
Nearest keyword search in XML documents
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
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
Knowledge hiding from tree and graph databases
Data & Knowledge Engineering
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
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
Comments on "Stack-based Algorithms for Pattern Matching on DAGs"
Proceedings of the VLDB Endowment
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
I/O cost minimization: reachability queries processing over massive graphs
Proceedings of the 15th International Conference on Extending Database Technology
Efficient evaluation of partial path queries over a XML compact storage structure
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
K-reach: who is in your small world
Proceedings of the VLDB Endowment
QSEA for fuzzy subgraph querying of KEGG pathways
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
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
Optimizing XML queries: Bitmapped materialized views vs. indexes
Information Systems
G-path: flexible path pattern query on large graphs
Proceedings of the 22nd international conference on World Wide Web companion
Incremental graph pattern matching
ACM Transactions on Database Systems (TODS)
Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Simple, fast, and scalable reachability oracle
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based algorithms to handle path, twig, and dag pattern queries for directed acyclic graphs (DAGs) in particular. Our algorithms do not precompute the transitive closure nor path indexes for a given graph, however they achieve an optimal runtime complexity quadratic in the average size of the query variable bindings. We prove the soundness and completeness of our algorithms and present the experimental results.