Three partition refinement algorithms
SIAM Journal on Computing
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
XTRACT: a system for extracting document type descriptors from XML documents
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Minimization of tree pattern queries
SIGMOD '01 Proceedings of the 2001 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
APEX: an adaptive path index for XML data
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
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
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
VLDB '97 Proceedings of the 23rd 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
ViST: a dynamic index method for querying XML data by tree structures
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
D(k)-index: an adaptive structural summary for graph-structured data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Path sharing and predicate evaluation for high-performance XML filtering
ACM Transactions on Database Systems (TODS)
PRIX: Indexing And Querying XML Using Prüfer Sequences
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Incremental maintenance of XML structural indexes
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient structural joins on indexed XML documents
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Mixed mode XML query processing
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Holistic twig joins on indexed XML documents
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
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
Efficiently Querying Large XML Data Repositories: A Survey
IEEE Transactions on Knowledge and Data Engineering
Hash-base subgraph query processing method for graph-structured XML documents
Proceedings of the VLDB Endowment
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
Labeling scheme and structural joins for graph-structured XML data
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Combining incompleteness and ranking in tree queries
ICDT'07 Proceedings of the 11th international conference on Database Theory
Subgraph join: efficient processing subgraph queries on graph-structured XML document
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
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
Querying ontologies in relational database systems
DILS'05 Proceedings of the Second international conference on Data Integration in the Life Sciences
Organizational search in email systems
Proceedings of the 50th Annual Southeast Regional Conference
Hi-index | 0.00 |
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. The existent approaches for evaluating queries over tree structured data (i.e. data whose underlying structure is a tree) are not directly applicable when the data is modeled as a random graph. Moreover, they cannot be applied when structural summaries are employed and, to the best of our knowledge, no analogous techniques have been reported for this case either. As a result, the potential of structural summaries is not fully exploited.In this paper, we investigate query evaluation techniques applicable to graph-structured data. We propose efficient algorithms for the case of directed acyclic graphs, which appear in many real world situations. We then tailor our approaches to handle other directed graphs as well. Our experimental evaluation reveals the advantages of our solutions over existing methods for graph-structured data.