Linking entities across relations and graphs

DOI10.1145/3639363MaRDI QIDQ6536402zbMATH OpenFDO

Authors Wenfei Fan, Ping Lu, Kehan Pang, Ruochun Jin, Wenyuan Yu

Publication date 30 April 2024

Published in ACM Transactions on Database Systems (Search for Journal in Brave)

zbMATH Keywords

parallelizationincremental algorithmentity resolutionrelative boundednessrelational databaseknowledge graph

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Database theory (68P15) Parallel algorithms in computer science (68W10)

Recommendations

• Incremental graph pattern matching
• A declarative framework for linking entities
• A declarative framework for linking entities
• scientific article
• Distributed graph pattern matching via bounded dual simulation

Cites work

• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 6276119 (Why is no real title available?)
• Dependencies for Graphs
• Parallelizing sequential graph computations
• Strong simulation: capturing topology in graph pattern matching
• The complexity of acyclic conjunctive queries

This page was built for publication: Linking entities across relations and graphs

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