Sciweavers

141 search results - page 20 / 29
» Supporting Continuous Range Queries in Indoor Space
Sort
View
CIKM
2009
Springer
13 years 11 months ago
Probabilistic skyline queries
The ability to deal with uncertain information is becoming increasingly important for modern database applications. Whereas a conventional (certain) object is usually represented ...
Christian Böhm, Frank Fiedler, Annahita Oswal...
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
13 years 8 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
STOC
2006
ACM
92views Algorithms» more  STOC 2006»
14 years 7 months ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount
PVLDB
2008
100views more  PVLDB 2008»
13 years 6 months ago
Efficiently approximating query optimizer plan diagrams
Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the o...
Atreyee Dey, Sourjya Bhaumik, Harish D., Jayant R....
ICALP
2009
Springer
14 years 7 months ago
B-Treaps: A Uniquely Represented Alternative to B-Trees
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
Daniel Golovin