Sciweavers

464 search results - page 13 / 93
» On Support of Ordering in Multidimensional Data Structures
Sort
View
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 1 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
ICDE
2007
IEEE
185views Database» more  ICDE 2007»
16 years 1 months ago
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik
SSDBM
2000
IEEE
168views Database» more  SSDBM 2000»
15 years 3 months ago
pCube: Update-Efficient Online Aggregation with Progressive Feedback and Error Bounds
Multidimensional data cubes are used in large data warehouses as a tool for online aggregation of information. As the number of dimensions increases, supporting efficient queries ...
Mirek Riedewald, Divyakant Agrawal, Amr El Abbadi
DEXA
2005
Springer
80views Database» more  DEXA 2005»
15 years 5 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
VLDB
1997
ACM
93views Database» more  VLDB 1997»
15 years 3 months ago
A Language for Manipulating Arrays
This paper describes the Array Manipulation Language (AML), an algebra for multidimensional array data. AML is generic, in the sense that it can be customized to support a wide va...
Arunprasad P. Marathe, Kenneth Salem