A parallel query processing system based on graph-based database partitioning

DOI10.1016/J.INS.2018.12.031MaRDI QIDQ2004734zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 7 October 2020

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2018.12.031

zbMATH Keywords

parallel query processinggraph-based partitioninghorizontal database partitioning

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Parallel processing of graph reachability in databases
• scientific article; zbMATH DE number 5033869
• scientific article; zbMATH DE number 1487621
• Parallel query processing on the grid
• Parallel Processing and Applied Mathematics
• scientific article; zbMATH DE number 2088796
• A graph based cluster approach for vertical partitioning in database design

Cites work

• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

Cited in

(6)

• scientific article; zbMATH DE number 140112 (Why is no real title available?)
• An RDBMS-based graph computing platform
• scientific article; zbMATH DE number 822167 (Why is no real title available?)
• A graph transformation algorithm for concurrency control in a partitioned database
• Performance analysis of ``groupby-after-join query processing in parallel database systems
• scientific article; zbMATH DE number 5033869 (Why is no real title available?)

This page was built for publication: A parallel query processing system based on graph-based database partitioning

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