806 search results - page 80 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
154
click to vote
HOTOS
2007
IEEE
15 years 5 months ago
2007
IEEE
Optimistic synchronization allows concurrent execution of critical sections while performing dynamic conflict detection and recovery. Optimistic synchronization will increase perf...
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...
131
click to vote
CCS
2008
ACM
15 years 3 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
120
click to vote
ICDE
2008
IEEE
15 years 7 months ago
2008
IEEE
— Skyline queries are capable of retrieving interesting points from a large data set according to multiple criteria. Most work on skyline queries so far has assumed a centralized...
126
click to vote
MDM
2009
Springer
15 years 8 months ago
2009
Springer
— 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...