Sciweavers

EDBT
2009
ACM
98views Database» more  EDBT 2009»
14 years 2 months ago
A runtime approach to model-independent schema and data translation
A runtime approach to model-generic translation of schema and data is proposed. It is based on our previous work on MIDST, a platform conceived to perform translations in an off-...
Paolo Atzeni, Luigi Bellomarini, Francesca Bugiott...
EDBT
2009
ACM
195views Database» more  EDBT 2009»
14 years 2 months ago
Anonymizing moving objects: how to hide a MOB in a crowd?
Moving object databases (MOD) have gained much interest in recent years due to the advances in mobile communications and positioning technologies. Study of MOD can reveal useful i...
Roman Yarovoy, Francesco Bonchi, Laks V. S. Lakshm...
EDBT
2009
ACM
184views Database» more  EDBT 2009»
14 years 2 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer
EDBT
2009
ACM
98views Database» more  EDBT 2009»
14 years 2 months ago
Time-completeness trade-offs in record linkage using adaptive query processing
Roald Lengu, Paolo Missier, Alvaro A. A. Fernandes...
EDBT
2009
ACM
169views Database» more  EDBT 2009»
14 years 2 months ago
Xoom: a tool for zooming in and out of XML documents
Suppose there is a large corpus of XML documents, each of which describes a movie released in the last 30 years (for example, extracted from IMDB). A movie enthusiast wants to mak...
Maya Ramanath, Kondreddi Sarath Kumar
EDBT
2009
ACM
109views Database» more  EDBT 2009»
14 years 2 months ago
Managing long-running queries
Stefan Krompass, Harumi A. Kuno, Janet L. Wiener, ...
EDBT
2009
ACM
127views Database» more  EDBT 2009»
14 years 2 months ago
Approximate substring selectivity estimation
We study the problem of estimating selectivity of approximate substring queries. Its importance in databases is ever increasing as more and more data are input by users and are in...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
EDBT
2009
ACM
174views Database» more  EDBT 2009»
14 years 2 months ago
Continuous probabilistic nearest-neighbor queries for uncertain trajectories
This work addresses the problem of processing continuous nearest neighbor (NN ) queries for moving objects trajectories when the exact position of a given object at a particular t...
Goce Trajcevski, Roberto Tamassia, Hui Ding, Peter...
EDBT
2009
ACM
136views Database» more  EDBT 2009»
14 years 2 months ago
On the comparison of microdata disclosure control algorithms
Privacy models such as k-anonymity and -diversity typically offer an aggregate or scalar notion of the privacy property that holds collectively on the entire anonymized data set....
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...
EDBT
2009
ACM
120views Database» more  EDBT 2009»
14 years 2 months ago
Retrieving meaningful relaxed tightest fragments for XML keyword search
Adapting keyword search to XML data has been attractive recently, generalized as XML keyword search (XKS). One of its key tasks is to return the meaningful fragments as the result...
Lingbo Kong, Rémi Gilleron, Aurélien...