Linking Entities across Relations and Graphs
Abstract
References
Index Terms
- Linking Entities across Relations and Graphs
Recommendations
Incremental Graph Computations: Doable and Undoable
The incremental problem for a class \( {\mathcal {Q}} \) of graph queries aims to compute, given a query \( Q \in {\mathcal {Q}} \) , graph G, answers Q(G) to Q in G and updates ΔG to G as input, changes ΔO to output Q(G) such that Q(G⊕ΔG) = Q(G)⊕ΔO. ...
An incremental graph-partitioning algorithm for entity resolution
Highlights- A novel incremental data association algorithm is proposed for entity resolution.
AbstractEntity resolution is an important data association task when fusing information from multiple sources. Oftentimes the information arrives continuously and the entity resolution algorithm needs to efficiently update its solution upon ...
Query-based Performance Comparison of Graph Database and Relational Database
SoICT '22: Proceedings of the 11th International Symposium on Information and Communication TechnologyA graph database is a type of NoSQL database that uses graph structure for semantic queries with nodes, edges, and properties to represent and store data. It has been applied in many fields, such as education, health, business, and social network, with ...
Comments
Information & Contributors
Information
Published In
- Editor:
- Christopher Jermaine
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Royal Society Wolfson Research Merit Award
- NSFC
- NUDT Youth Independent Innovation Science Fund Project
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 319Total Downloads
- Downloads (Last 12 months)319
- Downloads (Last 6 weeks)76
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in