Sciweavers

73 search results - page 6 / 15
» Data Structures for Range Minimum Queries in Multidimensiona...
Sort
View
SIGMOD
2011
ACM
442views Database» more  SIGMOD 2011»
12 years 10 months ago
ArrayStore: a storage manager for complex parallel array processing
We present the design, implementation, and evaluation of ArrayStore, a new storage manager for complex, parallel array processing. ArrayStore builds on prior work in the area of m...
Emad Soroush, Magdalena Balazinska, Daniel L. Wang
SSDBM
1999
IEEE
140views Database» more  SSDBM 1999»
13 years 12 months ago
An Infrastructure for Scalable Parallel Multidimensional Analysis
Multidimensional Analysis in On-Line Analytical Processing (OLAP), and Scientific and statistical databases (SSDB) use operations requiring summary information on multi-dimensiona...
Sanjay Goil, Alok N. Choudhary
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Untangled Monotonic Chains and Adaptive Range Search
Abstract. We present the first adaptive data structure for two-dimensional orthogonal range search. Our data structure is adaptive in the sense that it gives improved search perfo...
Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, ...
DEXA
2005
Springer
80views Database» more  DEXA 2005»
14 years 1 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
FUN
2010
Springer
247views Algorithms» more  FUN 2010»
14 years 12 days 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...