Sciweavers

6 search results - page 1 / 2
» Range Queries over a Compact Representation of Minimum Bound...
Sort
View
ER
2010
Springer
111views Database» more  ER 2010»
13 years 3 months ago
Range Queries over a Compact Representation of Minimum Bounding Rectangles
Nieves R. Brisaboa, Miguel Rodríguez Luaces...
FUN
2010
Springer
247views Algorithms» more  FUN 2010»
13 years 9 months ago
A Fun Application of Compact Data Structures to Indexing Geographic Data
The way memory hierarchy has evolved in recent decades has opened new challenges in the development of indexing structures in general and spatial access methods in particular. In t...
Nieves R. Brisaboa, Miguel Rodríguez Luaces...
VLDB
2000
ACM
163views Database» more  VLDB 2000»
13 years 8 months ago
Hierarchical Compact Cube for Range-Max Queries
A range-max query finds the maximum value over all selected cells of an on-line analytical processing (OLAP) data cube where the selection is specified by ranges of contiguous val...
Sin Yeung Lee, Tok Wang Ling, Hua-Gang Li
TKDE
2011
332views more  TKDE 2011»
12 years 11 months ago
Adaptive Cluster Distance Bounding for High-Dimensional Indexing
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
Sharadh Ramaswamy, Kenneth Rose
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
14 years 5 months ago
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
Hans-Peter Kriegel, Jörn Kohlhammer, Martin E...