Sciweavers

511 search results - page 30 / 103
» Approximate Selection Queries over Imprecise Data
Sort
View
DASFAA
2007
IEEE
178views Database» more  DASFAA 2007»
16 years 10 days ago
ClusterSheddy : Load Shedding Using Moving Clusters over Spatio-temporal Data Streams
Abstract. Moving object environments are characterized by large numbers of objects continuously sending location updates. At times, data arrival rates may spike up, causing the loa...
Rimma V. Nehme, Elke A. Rundensteiner
BTW
2005
Springer
104views Database» more  BTW 2005»
15 years 11 months ago
Maintaining Nonparametric Estimators over Data Streams
Abstract: An effective processing and analysis of data streams is of utmost importance for a plethora of emerging applications like network monitoring, traffic management, and fi...
Björn Blohsfeld, Christoph Heinz, Bernhard Se...
GIS
1999
ACM
15 years 10 months ago
A Provably Efficient Computational Model for Approximate Spatiotemporal Retrieval
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
Vasilis Delis, Christos Makris, Spyros Sioutas
CIKM
1999
Springer
15 years 10 months ago
Requirement-Based Data Cube Schema Design
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
David Wai-Lok Cheung, Bo Zhou, Ben Kao, Hongjun Lu...
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
16 years 6 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes