10 search results - page 2 / 2 » Range Mode and Range Median Queries on Lists and Trees |
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
ALGORITHMICA
2004
13 years 5 months ago
2004
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
CIKM
2006
Springer
13 years 9 months ago
2006
Springer
We propose an In-Network Data-Centric Storage (INDCS) scheme for answering ad-hoc queries in sensor networks. Previously proposed In-Network Storage (INS) schemes suffered from St...