Open AccessJournal Article
ACM Transactions on Database Systems
Dan Suciu,Gerhard Weikum +1 more
Reads0
Chats0
TLDR
BLOCKIN BLOCKINÒ BLOCKin× ½¸ÔÔº ¾ßß¿º ¿ ¾ ¾ à ¼ à à 0Abstract:
BLOCKIN BLOCKINÒ BLOCKIN× ½¸ÔÔº ¿ßß¿º ¿read more
Citations
More filters
Journal ArticleDOI
TinyDB: an acquisitional query processing system for sensor networks
TL;DR: This work evaluates issues in the context of TinyDB, a distributed query processor for smart sensor devices, and shows how acquisitional techniques can provide significant reductions in power consumption on the authors' sensor devices.
Proceedings ArticleDOI
The new Casper: query processing for location services without compromising privacy
TL;DR: Zhang et al. as mentioned in this paper presented Casper1, a new framework in which mobile and stationary users can entertain location-based services without revealing their location information, which consists of two main components, the location anonymizer and the privacy-aware query processor.
Journal ArticleDOI
Progressive skyline computation in database systems
TL;DR: In this paper, a branch-and-bound skyline (BBS) algorithm based on nearest-neighbor search is proposed, which is I/O optimal and performs a single access only to those nodes that may contain skyline points.
Posted Content
Semantics and Complexity of SPARQL
TL;DR: This article identifies a large class of SPARQL patterns, defined by imposing a simple and natural syntactic restriction, where the query evaluation problem can be solved more efficiently and shows that the evaluation problem is coNP-complete for well-designed patterns.
Journal ArticleDOI
iDistance: An adaptive B+-tree based indexing method for nearest neighbor search
TL;DR: An efficient B+-tree based indexing method for K-nearest neighbor (KNN) search in a high-dimensional metric space, called iDistance, which partitions the data based on a space- or data-partitioning strategy, and selects a reference point for each partition.
References
More filters
Journal ArticleDOI
TinyDB: an acquisitional query processing system for sensor networks
TL;DR: This work evaluates issues in the context of TinyDB, a distributed query processor for smart sensor devices, and shows how acquisitional techniques can provide significant reductions in power consumption on the authors' sensor devices.
Journal ArticleDOI
Progressive skyline computation in database systems
TL;DR: In this paper, a branch-and-bound skyline (BBS) algorithm based on nearest-neighbor search is proposed, which is I/O optimal and performs a single access only to those nodes that may contain skyline points.
Posted Content
Semantics and Complexity of SPARQL
TL;DR: This article identifies a large class of SPARQL patterns, defined by imposing a simple and natural syntactic restriction, where the query evaluation problem can be solved more efficiently and shows that the evaluation problem is coNP-complete for well-designed patterns.
Journal ArticleDOI
iDistance: An adaptive B+-tree based indexing method for nearest neighbor search
TL;DR: An efficient B+-tree based indexing method for K-nearest neighbor (KNN) search in a high-dimensional metric space, called iDistance, which partitions the data based on a space- or data-partitioning strategy, and selects a reference point for each partition.
Journal ArticleDOI
Efficient similarity joins for near-duplicate detection
TL;DR: This article proposes new filtering techniques by exploiting the token ordering information and drastically reduce the candidate sizes and hence improve the efficiency of existing algorithms to find a pair of records such that their similarities are no less than a given threshold.