Sciweavers

297 search results - page 29 / 60
» Polynomial heuristics for query optimization
Sort
View
IPSN
2009
Springer
14 years 2 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
SIGMOD
1999
ACM
101views Database» more  SIGMOD 1999»
14 years 2 days ago
Join Synopses for Approximate Query Answering
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
Swarup Acharya, Phillip B. Gibbons, Viswanath Poos...
VLDB
2005
ACM
109views Database» more  VLDB 2005»
14 years 8 months ago
Model-based approximate querying in sensor networks
Abstract Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" i...
Amol Deshpande, Carlos Guestrin, Samuel Madden, Jo...
ICIP
2003
IEEE
14 years 9 months ago
Performance evaluation of Euclidean/correlation-based relevance feedback algorithms in content-based image retrieval systems
In this paper, we evaluate and investigate two main types of relevance feedback algorithms; the Euclidean and the correlation?based approaches. In the first case, we examine heuri...
Anastasios D. Doulamis, Nikolaos D. Doulamis
DBA
2006
156views Database» more  DBA 2006»
13 years 9 months ago
Simulated Annealing for Materialized View Selection in Data Warehousing Environment
In order to facilitate query processing, the information contained in data warehouses is typically stored as a set of materialized views. Deciding which views to materialize prese...
Roozbeh Derakhshan, Frank K. H. A. Dehne, Othmar K...