PVLDB
2016
8 years 11 months ago
2016
The problem of maximizing bichromatic reverse k nearest neighbor queries (BRkNN) has been extensively studied in spatial databases. In this work, we present a related query for sp...
PVLDB
2016
8 years 11 months ago
2016
This paper introduces a dynamic graph partitioning algorithm, designed for large, constantly changing graphs. We propose a partitioning framework that adjusts on the fly as the g...
PVLDB
2016
8 years 11 months ago
2016
Since regular expressions are often used to detect errors in sequences such as strings or date, it is natural to use them for data repair. Motivated by this, we propose a data rep...
PVLDB
2016
8 years 11 months ago
2016
Set queries are fundamental operations in computer systems and applications. This paper addresses the fundamental problem of designing a probabilistic data structure that can quic...
PVLDB
2016
8 years 11 months ago
2016
The advent of semantic data on the Web requires efficient reasoning systems to infer RDF and OWL data. The linked nature and the huge volume of data entail efficiency and scalabil...
PVLDB
2016
8 years 11 months ago
2016
Increasingly large Knowledge Bases are being created, by crawling the Web or other corpora of documents, and by extracting facts and relations using machine learning techniques. T...
PVLDB
2016
8 years 11 months ago
2016
The Optimistic Concurrency Control (OCC) method has been commonly used for in-memory databases to ensure transaction serializability — a transaction will be aborted if its read ...
PVLDB
2016
8 years 11 months ago
2016
The chase is a well-known algorithm with a wide range of applications in data exchange, data cleaning, data integration, query optimization, and ontological reasoning. Since the c...
PVLDB
2016
8 years 11 months ago
2016
Pioneered by Google’s Pregel, many distributed systems have been developed for large-scale graph analytics. These systems employ a user-friendly “think like a vertex” progra...
PVLDB
2016
8 years 11 months ago
2016
Traditional database queries follow a simple model: they define constraints that each tuple in the result must satisfy. This model is computationally efficient, as the database ...