Sciweavers

22 search results - page 2 / 5
» The S-Tree: An Efficient Index for Multidimensional Objects
Sort
View
EDBT
2006
ACM
129views Database» more  EDBT 2006»
15 years 10 months ago
Efficient Quantile Retrieval on Multi-dimensional Data
Given a set of N multi-dimensional points, we study the computation of -quantiles according to a ranking function F, which is provided by the user at runtime. Specifically, F compu...
Man Lung Yiu, Nikos Mamoulis, Yufei Tao
103
Voted
CCGRID
2003
IEEE
15 years 1 months ago
Improving Access to Multi-dimensional Self-describing Scientific Dataset
Applications that query into very large multidimensional datasets are becoming more common. Many self-describing scientific data file formats have also emerged, which have structu...
Beomseok Nam, Alan Sussman
ICMCS
1996
IEEE
135views Multimedia» more  ICMCS 1996»
15 years 2 months ago
Spatio-Temporal Indexing for Large Multimedia Applications
Multimedia applications usually involve a large number of multimedia objects (texts, images, sounds etc.). Spatial and temporal relationships among these objects should be efficie...
Yannis Theodoridis, Michalis Vazirgiannis, Timos K...
SSD
2001
Springer
162views Database» more  SSD 2001»
15 years 2 months ago
Interval Sequences: An Object-Relational Approach to Manage Spatial Data
The design of external index structures for one- and multidimensional extended objects is a long and well studied subject in basic database research. Today, more and more commercia...
Hans-Peter Kriegel, Marco Pötke, Thomas Seidl
VLDB
2008
ACM
178views Database» more  VLDB 2008»
15 years 10 months ago
The Bdual-Tree: indexing moving objects by space filling curves in the dual space
Abstract Existing spatiotemporal indexes suffer from either large update cost or poor query performance, except for the Bx -tree (the state-of-the-art), which consists of multiple ...
Man Lung Yiu, Yufei Tao, Nikos Mamoulis