Sciweavers

792 search results - page 89 / 159
» Computing Iceberg Queries Efficiently
Sort
View
VLDB
2005
ACM
109views Database» more  VLDB 2005»
14 years 10 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...
AIPS
2008
14 years 16 days ago
A Compact and Efficient SAT Encoding for Planning
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 10 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
14 years 10 months ago
Fast range-summable random variables for efficient aggregate estimation
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
Florin Rusu, Alin Dobra
DSN
2009
IEEE
14 years 2 months ago
Efficient resource management on template-based web servers
The most commonly used request processing model in multithreaded web servers is thread-per-request, in which an individual thread is bound to serve each web request. However, with...
Eli Courtwright, Chuan Yue, Haining Wang