Results 1  10
of
10
Brief Announcement: ART: SubLogarithmic Decentralized Range Query Processing with Probabilistic Guarantees
"... We focus on range query processing on largescale, typically distributed infrastructures. In this work we present the ART (Autonomous Range Tree) structure, which outperforms the most popular decentralized structures, including Chord (and some of its successors), BATON (and its successor) and SkipG ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
We focus on range query processing on largescale, typically distributed infrastructures. In this work we present the ART (Autonomous Range Tree) structure, which outperforms the most popular decentralized structures, including Chord (and some of its successors), BATON (and its successor) and SkipGraphs. ART supports the join/leave and range query operations in O(log log N) and O(log 2 b log N + A) expected w.h.p number of hops respectively, where the base b is a doubleexponentially power of two, N is the total number of peers and A  the answer size.
Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors
"... We present the first spatially adaptive data structure that answers approximate nearest neighbor (ANN) queries to points that reside in a geometric space of any constant dimension d. The Ltnorm approximation ratio is O(d 1+1/t), and the running time for a query q is O(d 2 lg δ(p, q)), where p is th ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
We present the first spatially adaptive data structure that answers approximate nearest neighbor (ANN) queries to points that reside in a geometric space of any constant dimension d. The Ltnorm approximation ratio is O(d 1+1/t), and the running time for a query q is O(d 2 lg δ(p, q)), where p is the result of the preceding query and δ(p, q) is the number of input points in a suitablysized box containing p and q. Our data structure has O(dn) size and requires O(d 2 n lg n) preprocessing time, where n is the number of points in the data structure. The size of the bounding box for δ depends on d, and our results rely on the Random Access Machine (RAM) model with word size Θ(lg n). 1
Dynamic 3sided Planar Range Queries with Expected Doubly Logarithmic Time
 Proceedings of ISAAC, 2009
"... Abstract. We consider the problem of maintaining dynamically a set of points in the plane and supporting range queries of the type [a, b] × (−∞, c]. We assume that the inserted points have their xcoordinates drawn from a class of smooth distributions, whereas the ycoordinates are arbitrarily distr ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We consider the problem of maintaining dynamically a set of points in the plane and supporting range queries of the type [a, b] × (−∞, c]. We assume that the inserted points have their xcoordinates drawn from a class of smooth distributions, whereas the ycoordinates are arbitrarily distributed. The points to be deleted are selected uniformly at random among the inserted points. For the RAM model, we present a linear space data structure that supports queries in O(log log n + t) expected time with high probability and updates in O(log log n) expected amortized time, where n is the number of points stored and t is the size of the output of the query. For the I/O model we support queries in O(log log B n + t/B) expected I/Os with high probability and updates in O(log B log n) expected amortized I/Os using linear space, where B is the disk block size. The data structures are deterministic and the expectation is with respect to the input distribution. 1
ART: sublogarithmic decentralized range query processing with probabilistic guarantees
, 2012
"... © Springer Science+Business Media New York 2012 Abstract We focus on range query processing on largescale, typically distributed infrastructures, such as clouds of thousands of nodes of shareddatacenters, of p2p distributed overlays, etc. In such distributed environments, efficient range query pro ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
© Springer Science+Business Media New York 2012 Abstract We focus on range query processing on largescale, typically distributed infrastructures, such as clouds of thousands of nodes of shareddatacenters, of p2p distributed overlays, etc. In such distributed environments, efficient range query processing is the key for managing the distributed data sets per se, and for monitoring
An Experimental Performance Comparison for Indexing Mobile Objects on the Plane ABSTRACT
"... We present a timeefficient approach to index objects moving on the plane to efficiently answer range queries about their future positions. Each object is moving with non small velocity u, meaning that the velocity value distribution is skewed (Zipf) towards umin in some range [umin,umax], where umi ..."
Abstract
 Add to MetaCart
(Show Context)
We present a timeefficient approach to index objects moving on the plane to efficiently answer range queries about their future positions. Each object is moving with non small velocity u, meaning that the velocity value distribution is skewed (Zipf) towards umin in some range [umin,umax], where umin is a positive lower threshold. Our algorithm enhances a previously described solution [18] by accommodating the ISBtree access method as presented in [6]. Experimental evaluation shows the improved performance, scalability and efficiency of the new algorithm. Categories and Subject Descriptors H.2 [Database Management]: [Emergent Systems]
SART: Speeding up Query Processing in Sensor Networks with an Autonomous Range Tree Structure
"... We consider the problem of constructing efficient P2P overlays for sensornets providing “EnergyLevel Application and Services”. In this context, assuming that a sensor is responsible for executing some program task but unfortunately it’s energylevel is lower than a predefined threshold. Then, t ..."
Abstract
 Add to MetaCart
(Show Context)
We consider the problem of constructing efficient P2P overlays for sensornets providing “EnergyLevel Application and Services”. In this context, assuming that a sensor is responsible for executing some program task but unfortunately it’s energylevel is lower than a predefined threshold. Then, this sensor should be able to introduce a query to the whole system in order to discover efficiently another sensor with the desired energy level, in which the task overhead must be eventually forwarded. In this way, the “LifeExpectancy” of the whole network could be increased. Sensor nodes are mapped to peers based on their energy level. As the energy levels change, the sensor nodes would have to move from one peer to another and this operation is very crucial for the efficient scalability of the proposed system. Similarly,
Dynamic Interpolation Search Revisited ⋆
"... Abstract. A new dynamic Interpolation Search (IS) data structure is presented that achieves O(log log n) search time with high probability on unknown continuous or even discrete input distributions with measurable probability of key collisions, including power law and Binomial distributions. No such ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. A new dynamic Interpolation Search (IS) data structure is presented that achieves O(log log n) search time with high probability on unknown continuous or even discrete input distributions with measurable probability of key collisions, including power law and Binomial distributions. No such previous result holds for IS when the probability of key collisions is measurable. Moreover, our data structure exhibits O(1) expected search time with high probability for a wide class of input distributions that contains all those for which o(log log n) expected search time was previously known. 1
SART: Dynamic P2P Query Processing in Sensor Networks
"... with probabilistic guarantees ..."
(Show Context)