activity
20122021
most citedA Survey of RDF Stores & SPARQL Engines for Querying Knowledge Graphs

1 citations · 1 across the 8 of their papers we have counts for

collaborators

8 papers

cs.DB2021★ 1 cited

A Survey of RDF Stores & SPARQL Engines for Querying Knowledge Graphs

Waqas Ali, Muhammad Saleem, Bin Yao +2

RDF has seen increased adoption in recent years, prompting the standardization of the SPARQL query language for RDF, and the development of local and distributed engines for proces…

cs.DB2020

Storage, Indexing, Query Processing, and Benchmarking in Centralized and Distributed RDF Engines: A Survey

Waqas Ali, Muhammad Saleem, Bin Yao +2

The recent advancements of the Semantic Web and Linked Data have changed the working of the traditional web. There is significant adoption of the Resource Description Framework (RD…

cs.DC2020

Balancing Efficiency and Flexibility for DNN Acceleration via Temporal GPU-Systolic Array Integration

Cong Guo, Yangjie Zhou, Jingwen Leng +6

The research interest in specialized hardware accelerators for deep neural networks (DNN) spikes recently owing to their superior performance and efficiency. However, today's DNN a…

cs.DS2018

QDR-Tree: An Efficient Index Scheme for Complex Spatial Keyword Query

Xinshi Zang, Peiwen Hao, Xiaofeng Gao +2

With the popularity of mobile devices and the development of geo-positioning technology, location-based services (LBS) attract much attention and top-k spatial keyword queries beco…

cs.DB2013

An Improved Solution for Restricted and Uncertain TRQ

Jack Wang

CSPTRQ is an interesting problem and its has attracted much attention. The CSPTRQ is a variant of the traditional PTRQ. As objects moving in a constrained-space are common, clearly…

cs.DS2012

A Simple Algorithm for Computing BOCP

Jack Wang

In this article, we devise a concise algorithm for computing BOCP. Our method is simple, easy-to-implement but without loss of efficiency. Given two circular-arc polygons with …

cs.DS2012

Finding Efficient Region in The Plane with Line segments

Jack Wang

Let be a set of disjoint obstacles in , be a moving object. Let and denote the starting point and maximum path length of the mov…

cs.DB2012

A PRQ Search Method for Probabilistic Objects

Jack Wang

This article proposes an PQR search method for probabilistic objects. The main idea of our method is to use a strategy called \textit{pre-approximation} that can reduce the initial…