Sciweavers

2514 search results - page 194 / 503
» On the Computation of Approximations of Database Queries
Sort
View
ICDM
2007
IEEE
122views Data Mining» more  ICDM 2007»
16 years 27 days ago
Representing Tuple and Attribute Uncertainty in Probabilistic Databases
There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources — sensor data, experimental data, data from ...
Prithviraj Sen, Amol Deshpande, Lise Getoor
ICDE
2009
IEEE
165views Database» more  ICDE 2009»
16 years 8 months ago
Expressive Location-Based Continuous Query Evaluation with Binary Decision Diagrams
Many location-based services require rich and expressive query language support for filtering large amounts of information. In prominent location-based services thousands of conti...
Zhengdao Xu, Hans-Arno Jacobsen
SSDBM
2009
IEEE
126views Database» more  SSDBM 2009»
16 years 1 months ago
Comprehensive Optimization of Declarative Sensor Network Queries
We present a novel sensor network query processing architecture that (a) covers all the query optimization phases that are required to map a declarative query to executable code; ...
Ixent Galpin, Christian Y. A. Brenninkmeijer, Farh...
CIKM
2005
Springer
16 years 4 days ago
Selectivity-based partitioning: a divide-and-union paradigm for effective query optimization
Modern query optimizers select an efficient join ordering for a physical execution plan based essentially on the average join selectivity factors among the referenced tables. In ...
Neoklis Polyzotis
ALENEX
2004
107views Algorithms» more  ALENEX 2004»
15 years 8 months ago
Approximating the Visible Region of a Point on a Terrain
Given a terrain T and a point p on or above it, we wish to compute the region Rp that is visible from p. We present a generic radar-like algorithm for computing an approximation o...
Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz