• Publications
  • Influence
Preventing Location-Based Identity Inference in Anonymous Spatial Queries
TLDR
In this paper, we present a framework for preventing location- based identity inference of users who issue spatial queries to location-based services. Expand
  • 677
  • 51
  • PDF
Private queries in location based services: anonymizers are not necessary
TLDR
We propose a novel framework to support private location-dependent queries, based on the theoretical work on Private Information Retrieval (PIR). Expand
  • 805
  • 50
  • PDF
Privacy-preserving anonymization of set-valued data
TLDR
We define a new version of the k-anonymity guarantee, the km- anonymity, to limit the effects of the data dimensionality and we propose efficient algorithms to transform the database. Expand
  • 295
  • 41
  • PDF
GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph
TLDR
We present GraMi, a novel framework for frequent subgraph mining in a single large graph that only finds the minimal set of instances to satisfy the frequency threshold. Expand
  • 176
  • 39
  • PDF
Statistical Database
TLDR
A statistical database is a database used for statistical analysis purposes. Expand
  • 368
  • 37
Mizan: a system for dynamic load balancing in large-scale graph processing
TLDR
We show that graph partitioning alone is insufficient for minimizing end-to-end computation. Expand
  • 279
  • 31
  • PDF
Quality and efficiency in high dimensional nearest neighbor search
TLDR
We propose a new access method called the locality sensitive B-tree (LSB-tree) that enables fast high-dimensional NN search with excellent quality. Expand
  • 195
  • 31
  • PDF
PRIVE: anonymous location-based queries in distributed mobile systems
TLDR
We show thatexisting approaches may fail to provide spatial anonymityfor some distributions of user locations and describe a noveltechnique which solves this problem. Expand
  • 437
  • 30
  • PDF
On Discovering Moving Clusters in Spatio-temporal Data
TLDR
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Expand
  • 424
  • 27
  • PDF
Efficient OLAP Operations in Spatial Data Warehouses
TLDR
We construct an ad-hoc grouping hierarchy based on the spatial index at the finest spatial granularity. Expand
  • 359
  • 27
  • PDF