Sciweavers

2514 search results - page 332 / 503
» On the Computation of Approximations of Database Queries
Sort
View
PVLDB
2011
14 years 9 months ago
Merging What's Cracked, Cracking What's Merged: Adaptive Indexing in Main-Memory Column-Stores
Adaptive indexing is characterized by the partial creation and refinement of the index as side effects of query execution. Dynamic or shifting workloads may benefit from prelimi...
Stratos Idreos, Stefan Manegold, Harumi A. Kuno, G...
DMSN
2004
ACM
16 years 7 days ago
Optimization of in-network data reduction
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...
Joseph M. Hellerstein, Wei Wang
ICDE
2006
IEEE
168views Database» more  ICDE 2006»
16 years 8 months ago
Robust Cardinality and Cost Estimation for Skyline Operator
Incorporating the skyline operator inside the relational engine requires solving the cardinality estimation and the cost estimation problem, hitherto unaddressed. We propose robus...
Surajit Chaudhuri, Nilesh N. Dalvi, Raghav Kaushik
DEXAW
2002
IEEE
102views Database» more  DEXAW 2002»
15 years 11 months ago
Indexing Mobile Objects on the Plane
We present a method to index objects moving on the plane in order to efficiently answer range queries about their position in the future. This problem is motivated by real-life a...
Dimitris Papadopoulos, George Kollios, Dimitrios G...
WISE
2009
Springer
16 years 4 months ago
Focused Search in Digital Archives
We present a system description for an archival information system with three different approaches to gain online access to digital archives created in the metadata standard Encod...
Junte Zhang, Jaap Kamps