Sciweavers

390 search results - page 56 / 78
» Approximate Query Answering in Locally Closed Databases
Sort
View
160
Voted
EDBT
2004
ACM
122views Database» more  EDBT 2004»
16 years 6 months ago
Sketch-Based Multi-query Processing over Data Streams
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
PODS
2009
ACM
130views Database» more  PODS 2009»
16 years 6 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
15 years 10 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
ICDE
2010
IEEE
434views Database» more  ICDE 2010»
15 years 11 months ago
Route skyline queries: A multi-preference path planning approach
— In recent years, the research community introduced various methods for processing skyline queries in multidimensional databases. The skyline operator retrieves all objects bein...
Hans-Peter Kriegel, Matthias Renz, Matthias Schube...
MDM
2009
Springer
123views Communications» more  MDM 2009»
16 years 13 days ago
Operator Placement for Snapshot Multi-predicate Queries in Wireless Sensor Networks
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
Georgios Chatzimilioudis, Huseyin Hakkoymaz, Nikos...