Modern techniques for querying graph-structured databases

DOI10.1561/1900000090MaRDI QIDQ6638536zbMATH OpenFDO

Authors Amine Mhedhbi, Amol Deshpande, Semih Salihoglu

Publication date 14 November 2024

Published in Foundations and Trends in Databases (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1561/1900000090

zbMATH Keywords

data miningOLAPperformancequery optimizationquery processingscalability

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Database theory (68P15)

Recommendations

• Fast processing of graph queries on a large database of small and medium-sized data graphs
• Efficient algorithms for supergraph query processing on graph databases
• Evaluating regular path queries on compressed adjacency matrices
• Investigations on Path Indexing for Graph Databases
• Querying graphs

Cites work

• Communication steps for parallel query processing
• Finding Regular Simple Paths in Graph Databases
• It's all a matter of degree. Using degree information to optimize multiway joins
• Joins via geometric resolutions. Worst case and beyond
• Querying graphs
• Size bounds for factorised representations of query results
• The complexity of regular expressions and property paths in SPARQL
• The even-path problem for graphs and digraphs

This page was built for publication: Modern techniques for querying graph-structured databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6638536)