Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Linking entities across relations and graphs

From MaRDI portal
Publication:6536402
Jump to:navigation, search

DOI10.1145/3639363MaRDI QIDQ6536402FDOQ6536402


Authors: Wenfei Fan, Ping Lu, Kehan Pang, Ruochun Jin, Wenyuan Yu Edit this on Wikidata


Publication date: 30 April 2024

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





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


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)


Cites Work

  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • The complexity of acyclic conjunctive queries
  • Strong simulation
  • Dependencies for Graphs
  • Parallelizing sequential graph computations






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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6536402&oldid=40061506"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 13 February 2025, at 16:17. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki