Sciweavers

5221 search results - page 848 / 1045
» An On-line Problem Database
Sort
View
EDBT
2010
ACM
172views Database» more  EDBT 2010»
15 years 11 months ago
Privacy preserving group nearest neighbor queries
User privacy in location-based services has attracted great interest in the research community. We introduce a novel framework based on a decentralized architecture for privacy pr...
Tanzima Hashem, Lars Kulik, Rui Zhang
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
15 years 11 months ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
SIGMOD
2010
ACM
598views Database» more  SIGMOD 2010»
15 years 11 months ago
Ricardo: integrating R and Hadoop
Many modern enterprises are collecting data at the most detailed level possible, creating data repositories ranging from terabytes to petabytes in size. The ability to apply sophi...
Sudipto Das, Yannis Sismanis, Kevin S. Beyer, Rain...
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
15 years 11 months ago
Interactive privacy via the median mechanism
We define a new interactive differentially private mechanism — the median mechanism — for answering arbitrary predicate queries that arrive online. Given fixed accuracy and...
Aaron Roth, Tim Roughgarden
VLDB
2001
ACM
66views Database» more  VLDB 2001»
15 years 11 months ago
An Evaluation of Generic Bulk Loading Techniques
Bulk loading refers to the process of creating an index from scratch for a given data set. This problem is well understood for B-trees, but so far, non-traditional index structure...
Jochen Van den Bercken, Bernhard Seeger