Sciweavers

237 search results - page 21 / 48
» Just enough tabling
Sort
View
CVPR
1997
IEEE
14 years 9 months ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe
SIGMOD
2002
ACM
120views Database» more  SIGMOD 2002»
14 years 7 months ago
Exploiting statistics on query expressions for optimization
Statistics play an important role in influencing the plans produced by a query optimizer. Traditionally, optimizers use statistics built over base tables and assume independence b...
Nicolas Bruno, Surajit Chaudhuri
PODS
2004
ACM
137views Database» more  PODS 2004»
14 years 7 months ago
On the Memory Requirements of XPath Evaluation over XML Streams
The important challenge of evaluating XPath queries over XML streams has sparked much interest in the past few years. A number of algorithms have been proposed, supporting wider f...
Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski
GLVLSI
2008
IEEE
140views VLSI» more  GLVLSI 2008»
14 years 2 months ago
A table-based method for single-pass cache optimization
Due to the large contribution of the memory subsystem to total system power, the memory subsystem is highly amenable to customization for reduced power/energy and/or improved perf...
Pablo Viana, Ann Gordon-Ross, Edna Barros, Frank V...
IDEAS
2008
IEEE
105views Database» more  IDEAS 2008»
14 years 2 months ago
Pruning attribute values from data cubes with diamond dicing
Data stored in a data warehouse are inherently multidimensional, but most data-pruning techniques (such as iceberg and top-k queries) are unidimensional. However, analysts need to...
Hazel Webb, Owen Kaser, Daniel Lemire