Sciweavers

303 search results - page 20 / 61
» Update Algorithms for the Sketch Data Model
Sort
View
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 6 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
ICDE
2003
IEEE
143views Database» more  ICDE 2003»
16 years 5 months ago
Querying Imprecise Data in Moving Object Environments
In moving object environments, it is infeasible for the database tracking the movement of objects to store the exact locations of objects at all times. Typically, the location of a...
Reynold Cheng, Sunil Prabhakar, Dmitri V. Kalashni...
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
15 years 5 months ago
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
Guy E. Blelloch
CL
2007
Springer
15 years 4 months ago
A bulk-synchronous parallel process algebra
The CCS (Calculus of Communicating Systems) process algebra is a well-known formal model of synchronization and communication. It is used for the analysis of safety and liveness i...
Armelle Merlin, Gaétan Hains
PVLDB
2010
135views more  PVLDB 2010»
15 years 2 months ago
Similarity Search and Mining in Uncertain Databases
Managing, searching and mining uncertain data has achieved much attention in the database community recently due to new sensor technologies and new ways of collecting data. There ...
Matthias Renz, Reynold Cheng, Hans-Peter Kriegel, ...