Sciweavers

610 search results - page 24 / 122
» Efficient Query Evaluation on Probabilistic Databases
Sort
View
124
Voted
CIKM
2006
Springer
15 years 4 months ago
Efficient join processing over uncertain data
In an uncertain database, each data item is modeled as a range associated with a probability density function. Previous works for this kind of data have focussed on simple queries...
Reynold Cheng, Sarvjeet Singh, Sunil Prabhakar, Ra...
90
Voted
VLDB
2001
ACM
102views Database» more  VLDB 2001»
15 years 4 months ago
Form-Based Proxy Caching for Database-Backed Web Sites
We explore a new proxy-caching framework that exploits the query semantics of HTML forms. We identify a common class of form-based queries, and study two representative caching sc...
Qiong Luo, Jeffrey F. Naughton
EDBT
2010
ACM
185views Database» more  EDBT 2010»
15 years 2 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen
144
Voted
EDBT
2009
ACM
165views Database» more  EDBT 2009»
14 years 10 months ago
Exploiting the power of relational databases for efficient stream processing
Stream applications gained significant popularity over the last years that lead to the development of specialized stream engines. These systems are designed from scratch with a di...
Erietta Liarou, Romulo Goncalves, Stratos Idreos
DASFAA
2004
IEEE
95views Database» more  DASFAA 2004»
15 years 4 months ago
On Incorporating Iceberg Queries in Query Processors
Iceberg queries are a special case of SQL queries involving GROUP BY and HAVING clauses, wherein the answer set is small relative to the database size. We present here a performanc...
Krishna P. Leela, Pankaj M. Tolani, Jayant R. Hari...