Sciweavers

49 search results - page 8 / 10
» Two-Dimensional Range Minimum Queries
Sort
View
CCCG
2010
13 years 9 months ago
Connected dominating sets on dynamic geometric graphs
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
Leonidas J. Guibas, Nikola Milosavljevic, Arik Mot...
CIKM
2011
Springer
12 years 7 months ago
MTopS: scalable processing of continuous top-k multi-query workloads
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
Avani Shastri, Di Yang, Elke A. Rundensteiner, Mat...
PODS
2009
ACM
130views Database» more  PODS 2009»
14 years 8 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
AINA
2006
IEEE
14 years 1 months ago
SENS: A Scalable and Expressive Naming System using CAN Routing Algorithm
Abstract— We design a scalable and expressive naming system called SENS, which can retrieve information of computing and content resources distributed widely on the Internet by e...
Hoaison Nguyen, Toshio Oka, Hiroyuki Morikawa, Tom...
PODS
2000
ACM
120views Database» more  PODS 2000»
13 years 11 months ago
Indexing the Edges - A Simple and Yet Efficient Approach to High-Dimensional Indexing
In this paper, we propose a new tunable index scheme, called iMinMax , that maps points in high dimensional spaces to single dimension values determined by their maximum or minimu...
Beng Chin Ooi, Kian-Lee Tan, Cui Yu, Stépha...