Journal ArticleDOI
Range search on multidimensional uncertain data
Reads0
Chats0
TLDR
The core of the methodology is a novel concept of “probabilistically constrained rectangle”, which permits effective pruning/validation of nonqualifying/qualifying data and a new index structure called the U-tree for minimizing the query overhead.Abstract:
In an uncertain database, every object o is associated with a probability density function, which describes the likelihood that o appears at each position in a multidimensional workspace. This article studies two types of range retrieval fundamental to many analytical tasks. Specifically, a nonfuzzy query returns all the objects that appear in a search region rq with at least a certain probability tq. On the other hand, given an uncertain object q, fuzzy search retrieves the set of objects that are within distance eq from q with no less than probability tq. The core of our methodology is a novel concept of “probabilistically constrained rectangle”, which permits effective pruning/validation of nonqualifying/qualifying data. We develop a new index structure called the U-tree for minimizing the query overhead. Our algorithmic findings are accompanied with a thorough theoretical analysis, which reveals valuable insight into the problem characteristics, and mathematically confirms the efficiency of our solutions. We verify the effectiveness of the proposed techniques with extensive experiments.read more
Citations
More filters
Journal Article
ACM Transactions on Database Systems
Dan Suciu,Gerhard Weikum +1 more
TL;DR: BLOCKIN BLOCKINÒ BLOCKin× ½¸ÔÔº ¾ßß¿º ¿ ¾ ¾ à ¼ à à 0
Journal ArticleDOI
Location-dependent query processing: Where we are and where we are heading
TL;DR: The technological context (mobile computing) and support middleware (such as moving object databases and data stream technology) are described, location-based services and location-dependent queries are defined and classified, and different query processing approaches are reviewed and compared.
Journal ArticleDOI
A survey of queries over uncertain data
TL;DR: This paper presents and analyzes several typical uncertain queries, such as skyline queries, top-$$k$$ queries, nearest-neighbor queries, aggregate queries, join queries, range queries, and threshold queries over uncertain data, and summarizes the main features of uncertain queries.
Proceedings ArticleDOI
Indexing uncertain data
TL;DR: This paper presents various indexing schemes with linear or near-linear space and logarithmic query time, and extends to the external memory model in which the goal is to minimize the number of disk accesses when querying the index.
Proceedings ArticleDOI
Continuous probabilistic nearest-neighbor queries for uncertain trajectories
TL;DR: This work formalizes the impact of uncertainty on the answers to the continuous probabilistic NN-queries, provides a compact structure for their representation and efficient algorithms for constructing that structure.
References
More filters
Numerical recipes in C
TL;DR: The Diskette v 2.06, 3.5''[1.44M] for IBM PC, PS/2 and compatibles [DOS] Reference Record created on 2004-09-07, modified on 2016-08-08.
Journal ArticleDOI
k -anonymity: a model for protecting privacy
TL;DR: The solution provided in this paper includes a formal protection model named k-anonymity and a set of accompanying policies for deployment and examines re-identification attacks that can be realized on releases that adhere to k- anonymity unless accompanying policies are respected.
Book
Computational Geometry: Algorithms and Applications
TL;DR: In this article, an introduction to computational geometry focusing on algorithms is presented, which is related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems.
Proceedings ArticleDOI
The R*-tree: an efficient and robust access method for points and rectangles
TL;DR: The R*-tree is designed which incorporates a combined optimization of area, margin and overlap of each enclosing rectangle in the directory which clearly outperforms the existing R-tree variants.
Journal ArticleDOI
Multidimensional access methods
Volker Gaede,Oliver Günther +1 more
TL;DR: The class of point access methods, which are used to search sets of points in two or more dimensions, are presented and a discussion of theoretical and experimental results concerning the relative performance of various approaches are discussed.