Sciweavers

750 search results - page 76 / 150
» Aggregates in Possibilistic Databases
Sort
View
VLDB
2005
ACM
121views Database» more  VLDB 2005»
14 years 3 months ago
Online Estimation For Subset-Based SQL Queries
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...
Chris Jermaine, Alin Dobra, Abhijit Pol, Shantanu ...
SSDBM
2000
IEEE
87views Database» more  SSDBM 2000»
14 years 2 months ago
A Tool for Nesting and Clustering Large Objects
In implementations of non-standard database systems, large objects are often embedded within an aggregate of different types, i.e. a tuple. For a given size and access probabilit...
Stefan Dieker, Ralf Hartmut Güting, Miguel Ro...
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
14 years 2 months ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
Shimin Chen, Phillip B. Gibbons, Suman Nath
DASFAA
2011
IEEE
221views Database» more  DASFAA 2011»
13 years 2 hour ago
A Unified Algorithm for Continuous Monitoring of Spatial Queries
Continuous monitoring of spatial queries has gained significant research attention in the past few years. Although numerous algorithms have been proposed to solve specific queries...
Mahady Hasan, Muhammad Aamir Cheema, Xuemin Lin, W...
CVPR
2012
IEEE
12 years 12 days ago
Segmentation using superpixels: A bipartite graph partitioning approach
Grouping cues can affect the performance of segmentation greatly. In this paper, we show that superpixels (image segments) can provide powerful grouping cues to guide segmentation...
Zhenguo Li, Xiao-Ming Wu, Shih-Fu Chang