Sciweavers

184 search results - page 21 / 37
» A new range query algorithm for Universal B-trees
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 7 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
PODS
2010
ACM
306views Database» more  PODS 2010»
15 years 7 months ago
Optimizing linear counting queries under differential privacy
Differential privacy is a robust privacy standard that has been successfully applied to a range of data analysis tasks. But despite much recent work, optimal strategies for answe...
Chao Li, Michael Hay, Vibhor Rastogi, Gerome Mikla...

Publication
243views
17 years 1 months ago
Enabling Private Continuous Queries For Revealed User Locations
Existing location-based services provide specialized services to their customers based on the knowledge of their exact locations. With untrustworthy servers, location-based service...
Chi-Yin Chow, Mohamed F. Mokbel
CPM
2006
Springer
182views Combinatorics» more  CPM 2006»
15 years 5 months ago
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
Johannes Fischer, Volker Heun
CIDR
2011
266views Algorithms» more  CIDR 2011»
14 years 5 months ago
Consistency in a Stream Warehouse
A stream warehouse is a Data Stream Management System (DSMS) that stores a very long history, e.g. years or decades; or equivalently a data warehouse that is continuously loaded. ...
Lukasz Golab, Theodore Johnson