Sciweavers

958 search results - page 116 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
SSDBM
1998
IEEE
101views Database» more  SSDBM 1998»
15 years 2 months ago
Specifications for Efficient Indexing in Spatiotemporal Databases
: A new issue that arises in modern applications involves the efficient manipulation of (static or moving) spatial objects, and the relationships among them. As a result, modern da...
Yannis Theodoridis, Timos K. Sellis, Apostolos Pap...
DAWAK
2005
Springer
15 years 3 months ago
Nearest Neighbor Search on Vertically Partitioned High-Dimensional Data
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
Evangelos Dellis, Bernhard Seeger, Akrivi Vlachou
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
14 years 11 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
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
15 years 10 months ago
3-HOP: a high-compression indexing scheme for reachability query
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry
MOBISYS
2004
ACM
15 years 9 months ago
Exponential Index: A Parameterized Distributed Indexing Scheme for Data on Air
Wireless data broadcast has received a lot of attention from industries and academia in recent years. Access efficiency and energy conservation are two critical performance concer...
Jianliang Xu, Wang-Chien Lee, Xueyan Tang