Sciweavers

483 search results - page 53 / 97
» Evaluating Top-k Selection Queries
Sort
View
ICDE
2007
IEEE
206views Database» more  ICDE 2007»
14 years 9 months ago
Efficiently Processing Continuous k-NN Queries on Data Streams
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
Beng Chin Ooi, Christian Böhm, Claudia Plant,...
ICDE
2005
IEEE
128views Database» more  ICDE 2005»
14 years 9 months ago
Exploiting Correlated Attributes in Acquisitional Query Processing
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...
Amol Deshpande, Carlos Guestrin, Wei Hong, Samuel ...
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
13 years 11 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
DMSN
2010
ACM
13 years 5 months ago
Processing nested complex sequence pattern queries over event streams
Complex event processing (CEP) has become increasingly important for tracking and monitoring applications ranging from health care, supply chain management to surveillance. These ...
Mo Liu, Medhabi Ray, Elke A. Rundensteiner, Daniel...
ICDE
2005
IEEE
183views Database» more  ICDE 2005»
14 years 9 months ago
Adaptive Caching for Continuous Queries
We address the problem of executing continuous multiway join queries in unpredictable and volatile environments. Our query class captures windowed join queries in data stream syst...
Shivnath Babu, Kamesh Munagala, Jennifer Widom, Ra...