11213 search results - page 263 / 2243 » Low-contention data structures |
139
click to vote
PVLDB
2010
15 years 4 months ago
2010
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
195
click to vote
SPIRE
2010
Springer
15 years 4 months ago
2010
Springer
The rank and select operations over a string of length n from an alphabet of size σ have been used widely in the design of succinct data structures. In many applications, the stri...
205
click to vote
CORR
2010
Springer
15 years 17 days ago
2010
Springer
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
254
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
179
click to vote
INFOCOM
2011
IEEE
14 years 9 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...