9 citations · 19 across the 5 of their papers we have counts for
5 papers
TreeTracker Join: Simple, Optimal, Fast
Zeyuan Hu, Yisu Remy Wang, Daniel P. Miranker
We present a novel linear-time acyclic join algorithm, TreeTracker Join (TTJ). The algorithm can be understood as the pipelined binary hash join with a simple twist: upon a hash lo…
Self-contained NoSQL Resources for Cross-Domain RDF
Mayank Kejriwal, Daniel P. Miranker
Cross-domain knowledge bases such as DBpedia, Freebase and YAGO have emerged as encyclopedic hubs in the Web of Linked Data. Despite enabling several practical applications in the…
On the Complexity of Sorted Neighborhood
Mayank Kejriwal, Daniel P. Miranker
Record linkage concerns identifying semantically equivalent records in databases. Blocking methods are employed to avoid the cost of full pairwise similarity comparisons on rec…
A DNF Blocking Scheme Learner for Heterogeneous Datasets
Mayank Kejriwal, Daniel P. Miranker
Entity Resolution concerns identifying co-referent entity pairs across datasets. A typical workflow comprises two steps. In the first step, a blocking method uses a one-many functi…
On Directly Mapping Relational Databases to RDF and OWL (Extended Version)
Juan F. Sequeda, Marcelo Arenas, Daniel P. Miranker
Mapping relational databases to RDF is a fundamental problem for the development of the Semantic Web. We present a solution, inspired by draft methods defined by the W3C where rela…