-
Article
Open AccessEntity alignment via graph neural networks: a component-level study
Entity alignment plays an essential role in the integration of knowledge graphs (KGs) as it seeks to identify entities that refer to the same real-world objects across different KGs. Recent research has primar...
-
Chapter and Conference Paper
A Novel Video Emotion Recognition System in the Wild Using a Random Forest Classifier
Emotions are expressed by humans to demonstrate their feelings in daily life. Video emotion recognition can be employed to detect various human emotions captured in videos. Recently, many researchers have been...
-
Chapter and Conference Paper
Canopy-Based Private Blocking
Integrating data from different sources often involves using personal information for linking records that correspond to the same real-world entities. This raises privacy concerns, leading to development of pr...
-
Chapter and Conference Paper
Effective Biosecurity Knowledge Management: A Provenance Perspective
Biosecurity covers a full range of issues, from identifying and combating threats internationally, to border and post-border protection, right down to identifying and controlling pests at the farm, food-chain ...
-
Chapter and Conference Paper
Towards Content-Aware SPARQL Query Caching for Semantic Web Applications
Applications are increasingly using triple stores as persistence backends, and accessing large amounts of data through SPARQL endpoints. To improve query performance, this paper presents an approach that reuse...
-
Chapter and Conference Paper
DISTRO: A System for Detecting Global Outliers from Distributed Data Streams with Privacy Protection
In this demo proposal, we present a new system, called DISTRO (a.k.a DIstributed STReam Outlier Detector), for detecting outliers from distributed data streams. DISTRO is able to effectively identify outliers fro...
-
Chapter and Conference Paper
On Memory and I/O Efficient Duplication Detection for Multiple Self-clean Data Sources
In this paper, we propose efficient algorithms for duplicate detection from multiple data sources that are themselves duplicate-free. When develo** these algorithms, we take the full consideration of various...
-
Chapter and Conference Paper
Energy Adaptive Sensor Scheduling for Noisy Sensor Measurements
In wireless sensor network applications, sensor measurements are corrupted by noises resulting from harsh environmental conditions, hardware and transmission errors. Minimising the impact of noise in an energy...
-
Article
Dynamic buffer management with extensible replacement policies
The objective of extensible DBMSs is to ease the construction of specialized DBMSs for nontraditional applications. Although much work has been done in providing various levels of extensibility (e.g., extensib...
-
Chapter and Conference Paper
Clustering Peers Based on Contents for Efficient Similarity Search
Similarity search is becoming a norm in most real-life applications such as digital asset management systems. In such systems, users typically want to retrieve documents or objects similar to terms specified i...
-
Chapter and Conference Paper
Fuzzy Cost Modeling for Peer-to-Peer Systems
Exiting cost estimation models suffer from several limitations. First, static cost model is not capable of reflecting real-time situations. Second, dynamic cost model is not scalable due to its extensive probe...
-
Chapter and Conference Paper
Efficient Range Queries and Fast Lookup Services for Scalable P2P Networks
In this paper we propose a Peer-To-Peer (P2P) architecture using a tree based indexing scheme which allows for efficient lookup and range query services on documents in the network. We also present a basic loa...
-
Chapter and Conference Paper
Adapting the Content Native Space for Load Balanced Indexing
Today, there is an increasing demand to share data with complex data types (e.g., multi-dimensional) over large numbers of data sources. One of the key challenges is sharing these data in a scalable and effici...
-
Chapter and Conference Paper
Efficient Top-k Query Processing in P2P Network
In this paper, we examine how to efficiently process top-k queries in pure P2P network. First, we propose a distributed algorithm to evaluate a top-k query in a hierarchical way. Each peer does its local top-k qu...
-
Chapter and Conference Paper
DB-Enabled Peers for Managing Distributed Data
Peer-to-peer (P2P) computing is the sharing of computer resources, services and information by direct negotiation and exchange between autonomous and heterogeneous systems. An alternative approach to distribut...
-
Chapter and Conference Paper
Efficient Semantic Search in Peer-to-Peer Systems
While many P2P-based data sharing applications have been deployed, most of them just support semantics-free and coarse granularity (file level) sharing. Moreover, they are not efficient, either from user’s vie...